An obstacle detection procedure within the area surrounding a motor vehicle comprising the following stages: carrying out a first obstacle detection by image processing resulting in a definition of at least one region of interest, classifying the detected obstacle with an index of confidence applied to the region of interest in relation to given characteristics, carrying out a second obstacle detection by sensor/s with detection range below a first threshold resulting in a determined position, projecting the determined position into a reference marker, projecting the region of interest into this reference marker and aligning the two projections obtained and attributing a determined position to the obstacle classified in accordance with the alignment.
|
1. An obstacle detection procedure (O) within an environment (E) of a motor vehicle, featuring the fact that it involves the following stages:
carrying out a first obstacle detection (O) by image processing resulting in a definition of at least one region of interest (ROI);
classifying the detected obstacle (O) with an index of confidence (IC) applied to the region of interest (ROI) in relation to a given characteristics (C);
carrying out a second obstacle detection (O) by sensor(s) (ULS; RAD) with detection range below a first threshold (S1) resulting in a determined position (POS);
projecting the determined position (POS) in a reference marker (COORef);
projecting the region of interest (ROI) in this reference marker (COORef); and
aligning the two projections obtained (PJ1, PJ2) and attributing a determined position (POS) to the classified obstacle (O) in accordance with the alignment.
28. An obstacle detection system (O) within an environment (E) of a motor vehicle comprising:
an image system for carrying out a first obstacle detection (O) by image processing resulting in a definition of at least one region of interest (ROI) so that the detected obstacle (O) can be classified with an index of confidence (IC) applied to the region of interest (ROI) in relation to a given characteristics (C); and
for sensing a second obstacle detection (O) by at least one sensor (ULS; RAD) with detection range below a first threshold (S1) resulting in a determined position (POS);
a processor adapted to:
project the determined position (POS) in a reference marker (COORef);
project the region of interest (ROI) in this reference marker (COORef); and
align the two projections obtained (PJ1, PJ2) and attributes a determined position (POS) to the classified obstacle (O) in accordance with the alignment.
18. An obstacle detection system (O) within an environment (E) of a motor vehicle comprising:
an image system for carrying out a first obstacle detection (O) by image processing resulting in a definition of at least one region of interest (ROI) so that the detected obstacle (O) can be classified with an index of confidence (IC) applied to the region of interest (ROI) in relation to a given characteristics (C); and
for sensing a second obstacle detection (O) by at least one sensor (ULS; RAD) with detection range below a first threshold (S1) resulting in a determined position (POS);
means for projecting the determined position (POS) in a reference marker (COORef);
means for projecting the region of interest (ROI) in this reference marker (COORef); and
means for aligning the two projections obtained (P J1, P J2) and attributing a determined position (POS) to the classified obstacle (O) in accordance with the alignment.
2. The obstacle detection procedure according to
3. The obstacle detection procedure according to
4. The obstacle detection procedure according to
constructing a pyramid of images (Isr) by recursive sub-sampling of an acquired image (I);
for each sub-sampled image (Isr):
scanning this image (Isr) with a label (VIGN) representing a certain obstacle (O);
at each successive position of a label (VIGN) in this image (Isr), analysing its content by means of a set of classifiers (Cls, Clw), these classifiers being determined during a phase of prior apprenticeship.
5. The obstacle detection procedure according to
6. The obstacle detection procedure according to
7. The obstacle detection procedure according to
constructing a background image (Iref) recalculated for each image (I) of a sequence of images (SQ);
taking out the background image (Iref) to the current image (Ic) in the sequence of images (SQ) resulting in a resulting image (Tres);
discriminating certain movements in the resulting image (Tres) according to a threshold (Smax); and
extracting second regions of interest (ROI2) from the discrimination.
8. The obstacle detection procedure according to
creating a vector of characteristics (C) from the regions of interest (ROI);
classifying this vector of characteristics (C) by comparison with a border of decision (DG) determined previously during an apprenticeship stage; and
determining an associated index of confidence (IC) according to the distance of the vector of characteristics in relation to this border of decision (DG).
9. The obstacle detection procedure according to
10. The obstacle detection procedure according to
11. The obstacle detection procedure according to
constructing a probability card (P_MAP) corresponding to an image (I) in which each classified region of interest (ROI1, ROI2) is represented by a distribution of probability;
accumulating these distributions of probability which tally in the probability card (P_MAP) in order to obtain at least one local maximum; and
validating the region of interest (ROI1, ROI2) which is closer to each local maximum of the probability card (P_MAP).
12. The obstacle detection procedure according to
13. The obstacle detection procedure according to
14. The obstacle detection procedure according to
15. The obstacle detection procedure according to
16. A detection device of an obstacle (O) within an environment (E) of a motor vehicle, arranged to commission a procedure according to
17. A non-transitory computer readable medium comprising a computer program product (PG) including one or more sequences of instructions executable from an information processing unit, the execution of these sequences of instructions allowing the procedure to be commissioned according to
19. The obstacle detection system according to
20. The obstacle detection system according to
21. The obstacle detection system according to
22. The obstacle detection system according to
23. The obstacle detection system according to
24. The obstacle detection system according to
25. The obstacle detection system according to
26. The obstacle detection system according to
27. The obstacle detection procedure according to
29. The obstacle detection system according to
30. The obstacle detection system according to
31. The obstacle detection system according to
32. The obstacle detection system according to
33. The obstacle detection system according to
34. The obstacle detection system according to
35. The obstacle detection system according to
36. The obstacle detection system according to
37. The obstacle detection procedure according to
|
This application claims priority to French Application No. 0954632 filed Jul. 6, 2009, which application is incorporated herein by reference and made a part hereof.
1. Field of the Invention
The present invention concerns an obstacle detection procedure within the area surrounding a motor vehicle.
It also concerns a commissioning device of the procedure.
2. Description of the Related Art
This invention particularly applies in the field of motor vehicles.
In the field of motor vehicles, a known state of the technique of an obstacle detection procedure within the area surrounding a motor vehicle, involves the following stages:
One disadvantage of this state of the technique is that the position determined by the camera is not accurate.
There is, therefore, a need to provide an improved obstacle detection procedure system.
The present invention aims to provide an obstacle detection procedure within the area surrounding a motor vehicle, which makes it possible to precisely detect the position of a pedestrian.
According to a first object of the invention, this aim is achieved by an obstacle detection procedure within the area surrounding a motor vehicle, featuring the fact that it involves the following stages:
As one will see in detail hereinafter, the fact of combining detection by image processing and detection by sensor(s) will make it possible to classify an obstacle, and the alignment of these two detections will make it possible to position this classified obstacle (as a pedestrian) more accurately.
According to modes of completion without limitations, the detection procedure may involve, moreover, one or more further characteristics among the following:
This makes it possible to detect obstacles according to the detection distances at which they are situated in an image. The result of the application classifiers makes it possible to determine if an obstacle is situated in a label and thus detect it. The term label signifies, in the present application, a detection zone in the image. This detection zone is of a certain size and of shape. Of course, it is possible to give it different shapes. The system according to the present invention arranges obstacle detection within the limits of this label. According to one variant of completion, the label represents the obstacle to be detected in that it corresponds approximately to the surface that this type of obstacle will occupy in the image. For example, in order to detect a pedestrian, one may take a rectangular shape the large side of which is vertical. Thus, any pedestrian whose image is within this rectangle will be detected.
Detection by shape recognition also involves a further sub-stage to determine a scanning zone in a sub-sampled image. This reduces the number of processing operations.
The first detection by image processing involves movement detection in relation to the vehicle on a sequence of acquired images of this environment.
Movement detection involves the following sub-stages:
This makes it possible to obtain the obstacles in movements that do not belong to the background.
The classification stage involves the following sub-stages:
This makes it possible to associate with the classified region of interest an index of confidence representing the certainty of belonging to a class.
The vector of characteristics is a histogram of the orientated gradients of a region of interest.
The use of histograms is simple and quick to commission.
The detection procedure also involves a further stage of validating the classification of the object detected in relation to regions of interest and in relation to indices of confidence determined during the first detection and/or during the classification.
The validation stage involves the following sub-stages:
The use of a probability card is simple and quick to commission.
This makes it possible to accumulate the probabilities on regions likely to represent a pedestrian.
Detection by sensor(s) is carried out by means of ultrasound sensors. This gives a cover of detection close to the vehicle.
Detection by sensor(s) is carried out by means of radar sensors. This gives a cover of detection further from the vehicle.
The detection procedure also involves a further stage of applying a change of perspective to an acquired image. This makes it possible to reduce distortions in the acquired image, particularly on obstacles situated at the border of an image.
The detection procedure also involves a further stage of follow-up of the regions of interest classified on a sequence of acquired images. This makes it possible to confirm the presence of a so-called validated region of interest and smooth its position over a whole sequence of images.
According to a second object of the invention, this concerns a detection device of an obstacle within the area surrounding a motor vehicle, featuring the fact that it is fit to:
According to a third object of the invention, this concerns a computer program product including one or more sequences of instructions executable from an information processing unit, the execution of these sequences of instructions allowing the procedure to be commissioned according to any one of the previous characteristics.
The invention and its different applications will be better understood by reading the following description and examining the figures which accompany it.
These are only presented by way of indication and in no way limit the invention.
These and other objects and advantages of the invention will be apparent from the following description, the accompanying drawings and the appended claims.
a stage of detection by image processing combining detection by shape recognition according to the first mode of completion of
a sensor-operated detection stage combining detection by ultrasound sensors according to the first mode of completion of
a stage of detection by image processing combining detection by shape recognition according to the first mode of completion of
a sensor-operated detection stage combining detection by ultrasound sensors according to the first mode of completion of
In all the figures, the common elements bear the same reference numbers.
The obstacle detection procedure within the area surrounding a motor vehicle according to the invention is described in a first mode of completion without limitation in
One will note that the term motor vehicle signifies any type of motorized vehicle.
A. First Mode of Completion
According to this first mode of completion, the detection procedure involves the following stages as illustrated in
In one mode of completion without limitation, the detection procedure also involves a further stage of applying a change of perspective to an acquired image (stage CORR(I)).
In one mode of completion without limitation, the detection procedure also involves a stage of acquisition of a sequence SQ of images I (stage ACQ(I)). One will note that this stage may be carried out upstream by another procedure.
In one mode of completion without limitation, the detection procedure also involves a further stage of follow-up of validated regions of interest on a sequence of acquired images. (stage TRACK(POS)). This makes it possible to confirm the presence of a so-called classified region of interest and smooth its position over a whole sequence SQ of images I.
For the rest of the description, in the mode of completion without limitation of the procedure described, the procedure includes these further stages of image acquisitions, change of perspective and follow-up of detection.
The stages of the procedure are described in detail hereafter.
In a first stage 1), one acquires a sequence SQ of images I of the environment E of a vehicle V (stage ACQ(I)).
The acquisition takes place by means of a CAM camera.
As the image acquisition methods are known by the professional, they are not described here.
In a second stage 2), one applies a change of perspective to an acquired image I (stage CORR(I)). This makes it possible to counterbalance the distortions due to the CAM camera. One thus restores the obstacles O which are situated at the edge of image I. As illustrated in a diagrammatic example in
In a third stage 3), one carries out a first obstacle detection O by image processing resulting in a definition of at least one region of interest ROI (stage DET_CAM(ROI,I)).
1. First Mode of Completion
In a first mode of completion without limitation, the first detection by image processing involves detection by shape recognition in an acquired image of this environment E (stage DET_FORM(ROI1, I) illustrated in
In one mode of completion, the first detection by shape recognition uses a method well known by the professional called “AdaBoost”, described in the document “An Introduction to Boosting and Leveraging by Ron Meir and Gunnar Rätsch—Department of Electrical Engineering, Technion, Haifa 32000 Israel/Research School of Information Science & Engineering—the Australian National University, Can berra, ACT 0200, Australia”.
This method is based on:
A weight is associated with each strong classifier CLs which represents a rate of good detections of an obstacle in relation to the given VIGN label series for several weak classifiers.
A weak classifier CLw consists of a unitary test related to a comparison of a pixel in relation to another pixel in the same label. A weight is likewise associated with it.
The genetic algorithm makes it possible to calculate combinations of weak classifiers CLw applied to the VIGN label series of reference which make it possible to achieve the rate of good detections associated with strong classifiers CLs.
One will note that this apprenticeship stage may be carried out upstream of the described detection procedure.
A use of the “Adaboost” method involves the following stages, as illustrated in
a) Constructing a pyramid of images Isr by recursive sub-sampling of an acquired image I.
In practice, one applies a scale of reduction SR resulting in a sub-sampled image Isr, as illustrated in
In one mode of completion without limitation, at each iteration a), a different scale of reduction SR is used, as illustrated on the
Thus, in examples without limitations illustrated in
One will note that a scale of reduction SR is taken in accordance with the distance at which one wishes to detect an obstacle O in an acquired image I or reduced image Isr.
The examples without limitations given above make it possible to carry out a detection of an obstacle O between 0 and 9 meters from the vehicle V considered.
b) For each sub-sampled image Isr:
Thus, during the scanning, for each POS position of the label in an image Isr, one carries out the following sub-stages illustrated in
i) One applies the combination of weak classifiers CLw of a first strong classifier CLs0 on this VIGN label at the current POS position;
One accumulates the weight of the weak classifiers CLw of which the associated unitary tests are validated, i.e., positive;
One compares the accumulation with the weight of the strong classifier CLs0.
ii) If the result is negative (that is, the accumulation is below the weight of the strong classifier CLs0), one rejects the POS position of the VIGN label (stage REJ_POS). This means that the VIGN label at the current position involves no obstacle O which in this case is a pedestrian. One goes on to the next POS position of the label.
iii) If the result is positive (that is, the accumulation is above the weight of the strong classifier CLs0), one applies the next strong Classifier CLs1 and one repeats stage i). In so far as the result is positive, one goes on to the next strong Classifier CLsn.
Once all the strong classifiers CLs have given a positive result, this means that the VIGN label at the current position involves an obstacle O which in this case is a pedestrian. In this case, one memorizes the POS position of the VIGN label (stage MEM_POS illustrated) and one proceeds to the next position of the VIGN label.
One repeats stages i) to iii) for each POS position of a VIGN label in the image Isr.
One thus obtains a set of memorized POS positions, if applicable, for the sub-sampled image Isr.
Thus, one obtains a set of memorized POS positions of a VIGN label in each acquired or sub-sampled image. Each memorized POS position of a VIGN label thus represents a first region of interest ROI1.
On
One will note that the more one increases the value of a scale of reduction SR, the more one detects obstacles, in this case pedestrians, who are close to vehicle V.
Thus, for the first sub-sampled image Isr1, it is the distant obstacles (which enter the VIGN label) that will be detected, whilst in image Isr5 and image Isr6, it is the nearby obstacles (which enter the VIGN label) that will be detected. On the example without limitation of
One will note that in another mode of completion, one can alternate the sub-stage of sub-sampling with the sub-stage of scanning and analysis.
c) This set of first regions of interest ROI1 is repositioned in the initial acquired image I, as illustrated in
In one mode of completion without limitation, the first detection by shape recognition involves a sub-stage to determine a scanning zone Zb in a sub-sampled image generated from an acquired image I in which an obstacle O may be detected by means of a VIGN label. This sub-stage is applied equally for each sub-sampled image Isr2 to Isr6. This makes it possible to reduce the processing time. In fact, one thus avoids scanning places in an image I where one knows that one cannot detect an obstacle O in a VIGN label because:
Thus, in one mode of completion without limitation, the scanning zone Zb involves:
As one can see in
In examples without limitations:
In a second mode of completion without limitation, the first detection by image processing involves a movement detection in relation to vehicle V on a sequence SQ of acquired images I of this environment E.
In one variant of completion without limitation, the first movement detection (stage DET_MVT1 (Iref, Tres, Smax, H) illustrated in
a) Constructing a background Image Iref recalculated for each image I of an image sequence SQ.
In one mode of completion without limitation, this stage uses a method well known by the professional called the “Running Average Method”, described in the document G. Christogiannopoulos, P. B. Birch, R. C. D. Young, C. R. Young, “Segmentation of moving objects from cluttered background scenes using a running average model”. SPIE Journal, vol 5822, pp. 13-20. 2005. This method is also known as “Background Removal”.
Thus, as illustrated on the example without limitation of
Iref=α*Ic+(1−α)*Iref.
With α a percentage of apprenticeship.
In one example without limitation, α=0.05
This percentage of apprenticeship means that one retains 5% of the new Image Ic and 95% of the previous Image Iref.
In other words, the background evolves according to the movement of the objects (including obstacles) in the image.
One will note that the first image of reference Iref is the first acquired image I in the acquired sequence SQ.
b) Taking out the background Image Iref to the current Image Ic in the sequence of image SQ, resulting in a resulting Image Ires.
After obtaining background Image Iref, one thus takes out the first acquired Image Ic to this background Image Iref and one obtains a resulting Image Ires.
One thus has Ires=Absolute value (Ic−Iref).
One carries out this stage on the set of acquired images I of the sequence of images SQ.
c) Discriminating certain movements in the resulting Image Tres according to an Smax threshold.
In one variant of completion without limitation, one compares the intensity of each pixel of the resulting Image Tres with this Smax threshold. If the intensity is above the Smax threshold, this means that there is movement in the resulting Image Ires.
d) Extracting second regions of interest ROI2 from the discrimination.
To this effect, in one variant of completion without limitation, one binarizes the resulting image as follows:
One compares all the Px pixels of a resulting Image Ires to a threshold of maximum intensity Sbr representing noise BR.
In one example without limitation, in order to define the intensity threshold Sbr:
In one example without limitation, the percentage is 20%.
Thus, by carrying out a binarization of the resulting Image Tres, one removes noise BR and one shows second regions of interest ROI2 representative of a moving obstacle O.
One thus distinguishes a moving obstacle O from noise.
One will note that noise BR may be for example the shadow on the ground of a tree which moves due to the wind, or even a change of light intensity on the image due to moving clouds, for example.
In one mode of completion without limitation, the second detection DET_MVT1 also involves the following stages.
a) Regrouping the regions of interest ROI2 of each resulting Image Tres which tally between them. The regions of interest ROI2 which tally between them actually represent the same obstacle O.
b) Defining rectangles around these second regions of interest ROI2 obtained, as these rectangles now define these second regions of interest ROI2.
In one mode of completion without limitation, to determine the rectangle, one takes the minimum and maximum extremities of a region of interest ROI2.
In one mode of completion without limitation, the regions of interest ROI2 which are situated above a line characteristic of the horizon HZ (illustrated in
3. Third Mode of Completion
In a third mode of completion without limitation as illustrated in
One thus obtains the first regions of interest ROI1 and the second regions of interest ROI2.
In a fourth stage 4), one classifies the obstacle O detected with, respectively, an index of confidence IC applied to the region of interest in relation to given characteristics C (stage CLASS(IC, C)).
One recalls that the regions of interest ROI1, ROI2 are the regions determined during stage 3.
One will remark that prior to this classification stage, one determines two types of populations, one of which represents a pedestrian as follows. One will note that this determination is in general carried out upstream of the described detection procedure.
From several M labels of reference VIGNref some of which include an obstacle such as a pedestrian and one part does not include any obstacle, one constructs histograms of reference HISTREF from the orientation contours detected in these labels (sub-stage CONST_HISTREF(VIGNref)).
Thus, in one mode of completion without limitation, the characteristics given are of histograms of orientated gradients. In one example without limitation, nine orientations are used (corresponding to nine directions over 360°). This makes it possible to obtain a good compromise between the calculation time and the quality of the classification.
At each pixel of a contour of a VIGN labelref, one calculates an orientation and one looks at to which of the nine orientations OR it belongs.
One accumulates the NORM standards of the orientations on the set of the pixels of the contours of a VIGN labelref. One thus obtains a histogram of reference as illustrated in
One thus obtains Histograms M of reference which may be divided into two types of populations (a population with a pedestrian or a population without) as illustrated as a diagram in 2D (DI1, DI2) in
In one mode of completion without limitation, one constructs this border by a separator with a vast margin, a method known by the professional as the SVM (“Support-Vector Machine”) method—published by Kluwer Academic Publishers, Boston and written by Corinna Cortes and Vladimir Vapnik.
The edge DG may, without limitation, be a polynomial function (for example
The classification stage involves the following sub-stages.
a) Creation of a vector of characteristics (C) from the regions of interest ROI1 and ROI2 determined during previous stages (by shape recognition and movement detection respectively according to the first mode of completion DET_MVT1), one constructs histograms HIST of orientated gradients C (sub-stage CONST_HIST(ROI1, ROI2) illustrated in
b) One classifies this vector of characteristics C by comparison with a border of decision DG determined previously during an apprenticeship stage (as described above) (sub-stage COMP(HIST, DG) illustrated in
To this effect, one then compares the “histogram” vectors obtained with the border of decision DG. The more one retreats from the border, the greater the likelihood of belonging to a population. Furthermore, the more one approaches the border, the more ambiguous is the fact of belonging to a population.
c) One determines an associated index of confidence IC according to the distance of the vector of characteristics in relation to this border of decision DG (sub-stage DET(IC1, IC2) illustrated in
One thus defines the first and second indices of confidence IC1, IC2 applied to the first regions of interest ROI1 and to the second regions of interest ROI2 respectively, and thus to the constructed “histogram” vectors HIST respectively.
Thus, the closer a “histogram” vector HIST is to the border DG, the closer is the associated index of confidence IC to 0.5 for example (in the case where the value of an index of confidence is situated between 0 and 1).
On the contrary, the further away a “histogram” vector HIST is from the border DG in the region POP1, the higher the index of confidence IC1 of belonging to the population POP1, and the weaker the index of confidence of belonging IC2 to the population POP2.
In the example without limitation taken in
One thus classifies an obstacle O with the indices of confidence IC1, IC2 applied to the first and second regions of interest ROI1, ROI2 respectively, in relation to the histogram vectors HIST, the classification making it possible to determine the category of the obstacle to which it belongs, which in this case may or may not be a pedestrian.
In a fifth stage 5), one carries out a second obstacle detection O by sensor(s) with detection range below a first threshold S1 resulting in a determined POS position (stage DET_CAPT(POS, S1)).
First Mode of Completion
In a first mode of completion without limitation illustrated in
One will note that the fact of carrying out detection by means of a camera (whether by shape recognition or movement detection) combined with detection by ultrasound sensors (as illustrated in
Second Mode of Completion
In a second mode of completion without limitation illustrated in
One will note that the fact of carrying out detection by means of a camera (whether by shape recognition or movement detection) combined with detection by radar sensors (as illustrated in
Third Mode of Completion
In a third mode of completion without limitation illustrated in
In one mode of completion without limitation, the regrouping is carried out by means of a comparison between the sensor distances Duls and Drad obtained. One compares each distance Duls with each distance Drad. If the difference of distances Diff1 obtained from the comparison is below a determined threshold S4, then one considers that it is the same obstacle O which was detected by both types of sensors ULS and RAD. In one example without limitation, the threshold S4 is 50 cm.
In this case (Diff1<=S4), in one mode of completion without limitation, one only retains the POS position detected by the radar sensor RAD (detection by the latter being more accurate in general than detection by an ultrasound sensor ULS).
Otherwise (Diff1>S4), one estimates that the detections do not correspond to the same obstacle O and they are retained in so far as one could not regroup them with other detections.
One thus obtains a list of detected obstacles O in which one has deleted the double detections.
One will note that the fact of detecting obstacles by sensors by using both ultrasound sensors ULS and radar sensors RAD gives a very wide cover of detection. In fact, as one can see in
The fact of carrying out detections by means of both types of sensors ULS and RAD makes it possible to cover the dead zone Zm as illustrated in
Furthermore, one will note that the fact of carrying out detection by means of a camera (whether by shape recognition or movement detection) combined with detection by sensors makes it possible to locate more precisely the detected obstacles in the vehicle marker, whether a combination with detection by ultrasound sensors ULS alone (as illustrated in
One will note that once the third mode of completion of the detection by image processing and the second movement detection are used, one obtains as illustrated in
In a sixth stage 6), one projects the POS position defined in a reference marker COORef (stage PROJ_P1 (POS, COORef)).
In one mode of completion without limitation, the reference marker COORef is the image marker XI; YI. This makes it possible to minimize the impact of detection errors when calculating the distance in the image of an obstacle O, as opposed to a solution in which a vehicle marker would be taken in account.
In one example without limitation, one will note that in order to carry out the projection of the POS position in the image marker XI; YI, it is sufficient to know the correspondence between the position in the image marker and the position in the vehicle marker Xv, Yv.
The projection is carried out according to a matrix of projection MP as follows.
One obtains certain first projections PJ1, as illustrated in diagram form in
One will note that the projection PJ1 of a POS position of an obstacle O determined by an ultrasound sensor ULS gives a rectangle. In the example illustrated in
Furthermore, the projection PJ1 of a POS position of an obstacle O determined by a radar sensor RAD gives a point. In the example illustrated in
The same applies in the case where both types of sensors (radar and ultrasound) were used.
In both cases (ultrasound sensors or radar sensors), this projection stage of the POS position also involves a sub-stage of defining, from a projection PJ1, an associated projection zone PJ1p.
In one mode of completion without limitation, the width of the projection zone PJ1p is centered on the projection PJ1 and the base of the projection zone is at a tangent to the projection point PJ1 (in the case of a point), as illustrated in
In one example without limitation, one takes the dimensions of a projection zone equal to 1.7 m in height by 0.7 m in width. The dimensions of this projection zone PJ1p are thus determined so that they correspond to those of a pedestrian.
Thus, in the example illustrated in
Thus, in the example illustrated in
In a seventh stage 7), one projects the regions of interest ROI in this reference marker COORef and one attributes a determined POS position to the classified obstacle O in accordance with the alignment (stage PROJ_P2(ROI)).
One obtains certain second projections PJ2, as illustrated in diagram form in
One recalls that the regions of interest ROI are the regions of interest ROI1, ROI2 (defined in stage 3).
In an eighth stage 8), one aligns the two projections obtained PJ1, PJ2 (stage CORREL(PJ1, PJ2)).
In one mode of completion without limitation, the alignment is a comparison between two projections PJ1, PJ2 which is carried out according to the following criteria:
One will note that the distance of a projection PJ1 is the distance Duls or Drad given by the CAPT sensor.
Furthermore, the distance of a projection PJ2 is the distance detected in an image I of a region of interest ROI and recalculated in the vehicle marker V by the matrix of projection MP.
In examples without limitations:
One recalls that the projection PJ1 of detection by sensors is represented by the projection zone PJ1p described previously. Thus, in practice, the comparison is carried out between a projection zone PJ1p and a projection PJ2.
Thus, in the case where all these criteria are fulfilled, one estimates that the alignment between two projections PJ1, PJ2 is positive. Otherwise, one retains the projection PJ1, PJ2 until an alignment is found with another projection PJ2, PJ1 respectively.
If no alignment is found, then it is considered negative.
In the diagrammatic example of
the projections PJ21, PJ11p
In the diagrammatic example of
One attributes a determined POS position to the classified obstacle O in accordance with the alignment.
Thus, once the alignment is positive, one deduces from this that the corresponding obstacle O is a pedestrian and in one mode of completion without limitation, one attributes to it:
Furthermore, in one mode of completion without limitation, one increases its associated index of confidence IC. In one example without limitation, the new index of confidence IC=IC+(1−IC)/2.
In another mode of completion, one can associate with it:
One will note however that the POS position detected by the sensors is more accurate than the estimated position, and that the region of interest ROI is likewise more accurate than the defined projection zone.
If no alignment is found for a projection PJ1 or PJ2 then:
In one example without limitation, the threshold of confidence Sc=0.7.
In a ninth stage 9), one carries out a follow-up of the regions of interest ROI classified on a sequence SQ of acquired images (stage TRACK(POS)).
In one example without limitation, one uses a method well known by the professional called ESM (“Efficient Second Order Method”) developed by the INRIA and described in the document “Benhimane, E. Malis, Real-time image-based tracking of planes using efficient second-order minimisation IEEE/RSJ International Conference on Intelligent Robots Systems, Sendai, Japan, 2004”.
This method is based on a research of the same pattern in a sequence SQ of acquired images I, particularly between a current image and an image of reference, and on the repetition of this pattern in a certain number of images I of the sequence SQ. This avoids losing a detection of obstacle O in the case where an obstacle O would not be detected on an image I of a sequence SQ, while it was detected on the other images I.
B) Second Mode of Completion
The obstacle detection procedure within the area surrounding a motor vehicle according to the invention is described in a second mode of completion without limitation in
In addition to the set of the stages described in the first mode of completion of
In one mode of completion without limitation, the validation involves the following sub-stages as illustrated in
10a) Constructing a probability card P_MAP corresponding to an image I in which each classified region of interest ROI1, ROI2 is represented by a distribution of probability (sub-stage CONST_P_MAP(IC, Dim) illustrated in
One thus establishes a probability card P_MAP based on a set of accumulated Gauss functions G, in which the Gauss functions G are constructed from:
Thus, if one represents a Gauss function G in mathematical terms, one has:
With e as the Euler number.
The Gauss function G is represented in graphic order as a bell-shaped symmetrical curve.
One thus has:
The probability card P_MAP thus involves several Gauss functions G, some of which may or may not tally, as illustrated in one example without limitation in
One will note that in the case where detection by shape recognition DET_FORM(ROI1, I) and movement detection (DET_MVT1 (Iref, Tres, Smax, H) are used, the probability card P_MAP is constructed from the first regions of interest ROI1 and the second regions of interest ROI2 found previously, as illustrated in
b) Accumulate these distributions of probability which tally in the probability card (P_MAP) in order to obtain at least one local maximum (sub-stage ADD_G(P_MAP, ICF) illustrated in
One thus obtains several local maximums resulting in several resulting indices of confidence ICF. A local maximum makes it possible to obtain the most likely localization of having an obstacle O which is a pedestrian.
As illustrated in the diagrammatic example of
One will note that in one mode of completion without limitation, a resulting index of confidence ICF has a ceiling of 1.
c) Validate the region of interest ROI1, ROI2 which is closer to each local maximum of the probability card P_MAP ((sub-stage VALID_CLASS (ROI, ICF) illustrated in
In one variant of completion without limitation, for each local maximum, one chooses the region of interest ROI (of which the index of confidence was used for the local maximum) the summit of which is situated closer to this local maximum, and one attributes to its associated index of confidence IC, the resulting index of confidence ICF. This variant makes it possible to refer to a region of interest ROI already existing as determined beforehand in the previous stages, and makes it possible to remain accurate at the level of the localization of an obstacle O (a region of interest already existing being centered on an obstacle O).
Thus, in the explanatory example of the diagram of
In another variant of completion without limitation, one could uphold the index of confidence ICF resulting from the accumulation of the Gauss functions. At this moment, the choice of the region of interest ROI would be a region of interest ROI centered on this index of confidence.
One recalls that the regions of interest ROI are the regions ROI1, ROI2 determined during stage 3 and the indices of confidence IC are the indices of confidence IC1, IC2 determined during stage 4 (arising from the classification).
d) compare the local maximums of the Gauss functions which tally in relation to a threshold of detection SG (sub-stage COMP(G, SG) illustrated in
If each local maximum (in height) is below this threshold, one estimates that the resulting index of confidence ICF is nil. One thus estimates that no pedestrian is detected, but that the Gauss functions correspond to noise or a false detection. In this case, one retains no region of interest ROI which served the purposes of the accumulation.
Thus, the validation classification makes it possible to select regions of interest ROI classified taken among the regions of interest ROI arising from the classification stage and which each represents a pedestrian.
At this moment, during the seventh stage 7), the regions of interest ROI which are planned in the reference marker COORef are the validated regions of interest.
Furthermore, during the ninth stage 9), one attributes a determined POS position to the classified obstacle O in accordance with the alignment and the validation. Thus, when an alignment is positive, one associates with the detected obstacle O the validated region of interest.
One will note that once the third mode of completion of the detection by image processing and the second movement detection are used, one obtains as illustrated in
Thus, the procedure described makes it possible to reliably detect obstacles O, whether or not they are pedestrians, based not only on detection by image processing, but also on detection by sensors and with a minimum of dead zone.
The procedure of the invention is commissioned by a DISP device of detection of an obstacle O within an environment E of a motor vehicle, this device being represented in diagram form in
This DISP device is integrated in the motor vehicle V.
This DISP device is fit to:
In modes of completion without limitations, the DISP device of detection is also fit to:
In one mode of completion without limitation, the DISP device involves a set of control units UC including at least one control unit fit to carry out the stages described above. In one variant of completion without limitation, the set involves several control units UC1, UC2, UC3. Thus, in variants of completion without limitation, the control units UC may be divided into the CAM camera, the projectors PJ, the sensors ULS, RAD, or even a calculator vehicle ECU.
In the example without limitation of
In one mode of completion without limitation, the CAM camera is of type VGA or WGA and makes it possible to acquire images of respective size of 640*480 pixels or 752*480 pixels. In one example without limitation, the angle of opening φ is 40°. Of course, other types of cameras with other characteristics may be used.
One will note that the above-mentioned detection procedure may be commissioned by means of a micro-programmed “software” device, a hard-wired logic and/or electronic “hardware” components.
Thus, the DISP adjustment device may involve one or more computer program products PG including one or more sequences of instructions executable from an information processing unit such as a microprocessor, or a processing unit of a microcontroller, ASIC, computer etc., the execution of these sequences of instructions allowing the described procedure to be commissioned.
Such a computer program PG may be recorded in ROM type non-volatile recordable memory or in EPPROM or FLASH type non-volatile re-recordable memory. This computer program PG may be recorded in memory in the factory or again loaded in memory or remotely loaded in memory. The sequences of instructions may be sequences of machine instructions, or again sequences of a command language interpreted by the processing unit at the time of their execution.
In the example without limitation of
Of course, the invention is not limited to the modes of completion and examples described above.
Thus, once the detection of a pedestrian has been validated, one can arrange an alert system which makes it possible to alert the driver of vehicle V that a pedestrian is situated close to the vehicle and enables him to brake, for example. One can also provide an automatic braking system following such a detection.
Thus, the detection procedure may be used for detection behind and/or in front of the motor vehicle V.
Thus, the invention particularly presents the following advantages:
While the procedure herein described, and the forms of apparatus for carrying this procedure into effect, constitute preferred embodiments of this invention, it is to be understood that the invention is not limited to this precise procedure and forms of apparatus, and that changes may be made in either without departing from the scope of the invention, which is defined in the appended claims.
Dubois, Eric, Kuoch, Siav Kuong, Reilhac, Patrice, Chanussot, Lowik, Rebut, Julien, Charpentier, Adrien, Benoist, Fleury
Patent | Priority | Assignee | Title |
10629072, | Oct 20 2016 | Ford Global Technologies, LLC | LIDAR and vision vehicle sensing |
Patent | Priority | Assignee | Title |
20090268946, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Jul 02 2010 | Valeo Vision | (assignment on the face of the patent) | / | |||
Sep 15 2010 | KUOCH, SIAV KUONG | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | CHANUSSOT, LOWIK | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | REBUT, JULIEN | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | CHARPENTIER, ADRIEN | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | DUBOIS, ERIC | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | FLEURY, BENOIST | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 | |
Sep 15 2010 | REILHAC, PATRICE | Valeo Vision | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 026699 | /0118 |
Date | Maintenance Fee Events |
Oct 21 2016 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Nov 16 2020 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Nov 25 2024 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
Date | Maintenance Schedule |
May 28 2016 | 4 years fee payment window open |
Nov 28 2016 | 6 months grace period start (w surcharge) |
May 28 2017 | patent expiry (for year 4) |
May 28 2019 | 2 years to revive unintentionally abandoned end. (for year 4) |
May 28 2020 | 8 years fee payment window open |
Nov 28 2020 | 6 months grace period start (w surcharge) |
May 28 2021 | patent expiry (for year 8) |
May 28 2023 | 2 years to revive unintentionally abandoned end. (for year 8) |
May 28 2024 | 12 years fee payment window open |
Nov 28 2024 | 6 months grace period start (w surcharge) |
May 28 2025 | patent expiry (for year 12) |
May 28 2027 | 2 years to revive unintentionally abandoned end. (for year 12) |