DYNAMIC SCENE ANALYSIS METHOD, AND ASSOCIATED ANALYSIS MODULE AND COMPUTER PROGRAMME

• US 20170256071A1
• Filed: 06/02/2015
• Published: 09/07/2017
• Est. Priority Date: 06/06/2014
• Status: Active Grant

• Current Assignee: Commissariat a L'Energie Atomique (AES Corporation), Centre National De La Recherche Scientifique, Inria Institut National de Recherche EN Informatique et EN Automatique
• Original Assignee: Commissariat a L'Energie Atomique (AES Corporation), Centre National De La Recherche Scientifique, Inria Institut National de Recherche EN Informatique et EN Automatique
• Inventors: LAUGIER, CHRISTIAN, NEGRE, AMAURY, PERROLLAZ, MATHIAS, RUMMELHARD, LUKAS
• Granted Patent: US 10,290,116 B2
• Time in Patent Office: Days
• CPC Class Codes: B60T 2201/022 Collision avoidance systems
• CPC Class Codes: B60T 7/22 initiated by contact of vehicle, e.g. bumper, with an external object, e.g. another vehicle , or by means of contactless obstacle detectors mounted on the vehicle
• CPC Class Codes: B60W 2420/403 Image sensing, e.g. optical camera
• CPC Class Codes: B60W 40/04 Traffic conditions
• CPC Class Codes: B60W 40/12 related to parameters of the vehicle itself , e.g. tyre models
• CPC Class Codes: G01C 21/3807 characterised by the type of data
• CPC Class Codes: G01C 21/3833 characterised by the source of data
• CPC Class Codes: G01C 21/387 Organisation of map data, e.g. version management or database structures
• CPC Class Codes: G01S 17/87 Combinations of systems using electromagnetic waves other than radio waves
• CPC Class Codes: G01S 17/931 of land vehicles
• CPC Class Codes: G06F 17/18 for evaluating statistical data , e.g. average values, frequency distributions, probability functions, regression analysis forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04
• CPC Class Codes: G06N 7/01 Probabilistic graphical models, e.g. probabilistic networks
• CPC Class Codes: G06T 2207/10016 Video; Image sequence
• CPC Class Codes: G06T 2207/20076 Probabilistic image processing
• CPC Class Codes: G06T 7/20 Analysis of motion motion estimation for coding, decoding, compressing or decompressing digital video signals H04N19/43, H04N19/51
• CPC Class Codes: G06T 7/277 involving stochastic approaches, e.g. using Kalman filters
• CPC Class Codes: G06T 7/70 Determining position or orientation of objects or cameras camera calibration G06T7/80
• CPC Class Codes: G06V 20/58 Recognition of moving objects or obstacles, e.g. vehicles or pedestrians; Recognition of traffic objects, e.g. traffic signs, traffic lights or roads
• CPC Class Codes: G08G 1/04 using optical or ultrasonic detectors
• CPC Class Codes: G08G 1/166 for active traffic, e.g. moving vehicles, pedestrians, bikes

Abstract

A method for analysing a dynamic scene partitioned into cells which involves determining a probability of occupancy of a cell and a probability or probabilities of movement of the cell by solving the equation P(OV|ZC)=ΣAO^{−1 V-1}P(CAOO⁻¹VV⁻¹Z)/ΣAOO⁻¹VV⁻¹P(CAOO⁻VV⁻¹Z) comprising the determination of the speeds and positions of dummy particles in the grid depending on those determined at the (k−1)^th iteration and the probability P(VFV-1); the determination of the particles located in each cell depending on the determined positions, and the solving of the equation, for a cell, is split into the solving of a static part corresponding to P(O=empty, V=O|ZC) and P(O=occupied, V=O|ZC) and the solving of a dynamic part corresponding to P(O=occ, V=v^k_l,|ZC), i=32 1 to n^k, in which n^k is the number of particles determined in cell C for the k^th iteration.

Claims

1. A method for analyzing a dynamic scene observed with the aid of one or more sensors, the method comprising:

defining a grid that is partitioned into cells and corresponding to the observed scene;

collecting at least one new observation of the one or more sensors at the k^th iterations;

determining, as a function of the new collected observation, a first probability of occupancy of each cell of the grid modeling the operation of the one or more sensors ;

determining, for each cell, at the k^th iteration, a second probability of occupancy of the cell and a set of probabilities of motion of the content of the cell as a function of the first probability of occupancy of the cell determined at the k^th iteration, wherein the second probability of occupancy of the cell and of the set of probabilities of motion of the content of the cell as a function of the first probability of occupancy of the cell determined at the k^th iteration is determined based on;

2. The method of claim 1, wherein on completion of the k^th iteration, one or more pairs (p_i, (v_i^k, x_i^k)), where x_i^k is the position of the particle p_i at the k^th iteration, are duplicated within a cell or deleted so that the number of pairs per cell is dependent on the dynamic part determined for the cell.

3. The method of claim 2, further comprising selecting the pair to be duplicated or deleted, wherein the selection of said pair being carried out as a function of the probability P(O=occupied, V=v_i^k|ZC) is determined at the k^th iteration, and where v_i^k is a velocity component of the pair.

4. The method of claim 2, wherein the total number of particles in the grid is constant during the iterations.

5. The method of claim 1, wherein P(O=empty, V=0|ZC) is determined at the k^th iteration is denoted as P^k(O=empty, V=0|ZC), and is determined as a function of the product of a first term dependent on the first probability of occupancy and of a second term, said second term being dependent on:

P<sup>k−

1</sup>(O=occ, V=0|ZC).(1-ε

)+P<sup>k−

1</sup>(O=empty, V=0|ZC).ε

, and/or

coeff (^kv_i).p<sup>k−

1</sup>)O=occupied, V=v_i<sup>k−

1</sup>, |ZA).(1-ε

), where coeff (v_i^k) is a decreasing function of ∥

v_i^k∥

, and/or

a probability of appearance p_a of a new object in the observed scene.

12. A non-transitory computer accessible medium that includes computer-executable instructions stored thereon that are executable by a computing device to perform the method of claim 1.

6. (canceled)

7. A device effective to analyze a dynamic scene observed with the aid of one or more sensors, the device is configured to:

define a grid partitioned into cells and corresponding to the observed scene;

collect at least one new observation of the one or more sensors at a k^th iteration and determining, as a function of the new collected observation, a first probability of occupancy of each cell of the grid and that models the operation of the one or more sensors;

determine, for each cell, at the k^th iteration, a second probability of occupancy of the cell and a set of probabilities of motion of the content of the cell as a function of the first probability of occupancy of the cell determined at the k^th iteration, wherein the device is adapted to determine said second probability of occupancy of the cell and the set of probabilities of motion of the content of the cell as a function of the first probability of occupancy of the cell determined at the k^th iteration based on;

8. The device of claim 7, adapted to, on completion of the k^th iteration, duplicate or delete one or more pairs (p_i, (^kv_i, ^kx_i)), where x_i^k is the position of the particle pi at the k^th iteration, within a cell so that the number of pairs per cell is dependent on the dynamic part determined for the cell.

9. The device of claim 8, adapted to select said pair to be duplicated/deleted, as a function of the probability P(O=occupied, V=v_i^k|ZC) is determined at the k^th iteration, and where v_i^k is a velocity component of the pair.

10. The device of claim 8, wherein the total number of particles in the grid is constant during the iterations.

11. The device of claim 7, adapted to determine P(O=empty, V=0|ZC) at the k^th iteration, denoted P^k(O=empty, V=0|ZC), as a function of the product of a first term dependent on the first probability of occupancy and of a second term, said second term being dependent on:

P<sup>k−

1</sup>(O=occ,V=0|ZC).(1-ε

)+P<sup>k−

1</sup>(O=empty, V=0|ZC).ε

; and

/or

coeff (^kv_i).P<sup>k−

1</sup>(O=occupied, V=v_i<sup>k−

1</sup>,|ZA).(1-ε

), where coeff (v_i^k) is a decreasing function of ∥

v_i^k∥

, and/or

a probability of appearance pa of a new object in the observed scene.