×

Method for determining the length of a queue

  • US 9,424,474 B2
  • Filed: 06/13/2013
  • Issued: 08/23/2016
  • Est. Priority Date: 06/20/2012
  • Status: Active Grant
First Claim
Patent Images

1. Method for determining the length of a queue of objects in a predefined region having at least one entrance and at least one exit, comprising the steps of:

  • a) determining with the aid of at least one first image sensor a specific entry signature E of each object entering the predefined region through the at least one entrance;

    b) storing the specific entry signature E in an entry list of a calculation unit, each entry signature E being provided with an index value i reflecting the temporal sequence of the entries, and a value L reflecting the length of the queue of the objects being increased by one;

    c) determining with the aid of at least one second image sensor a specific exit signature A of an object exiting the predefined region through the at least one exit;

    d) storing the specific exit signature A in an exit list of a calculation unit as exit signature A0 with index value j=0, the index value of exit signatures Aj already present in the exit list respectively being increased by one, and the exit signatures Aj which have an index value j that is greater than a predetermined value M being deleted from the exit list;

    e) calculating similarity values Cn for −

    N≦

    n≦

    +N with the aid of the calculation unit, N being a predetermined value which defines a specific number N of entry signatures of objects which, before or after the object with the entry signature EL whose exit is next expected on the basis of the length of the queue L, will exit or have already exited the predefined region, similarity metrics Umn respectively being calculated between an exit signature Am and an entry signature EL+m+n, m running from 0 to M, and added to Cn;

    f) decrementing the value L by the value one;

    g) correcting the value L by comparing the similarity values Cn with the similarity value C0, and correcting the value L by adding the index value x given the presence of a value Cx with index value n=x that indicates a higher similarity than the similarity value C0.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×