Automatic fog detection and estimation of visibility distance through use of an onboard camera

In this paper, we will present a technique for measuring visibility distances under foggy weather conditions using a camera mounted onboard a moving vehicle. Our research has focused in particular on the problem of detecting daytime fog and estimating visibility distances; thanks to these efforts, an original method has been developed, tested and patented. The approach consists of dynamically implementing Koschmieder's law. Our method enables computing the meteorological visibility distance, a measure defined by the International Commission on Illumination (CIE) as the distance beyond which a black object of an appropriate dimension is perceived with a contrast of less than 5%. Our proposed solution is an original one, featuring the advantage of utilizing a single camera and necessitating the presence of just the road and sky in the scene. As opposed to other methods that require the explicit extraction of the road, this method offers fewer constraints by virtue of being applicable with no more than the extraction of a homogeneous surface containing a portion of the road and sky within the image. This image preprocessing also serves to identify the level of compatibility of the processed image with the set of Koschmieder's model hypotheses. Nicolas Hautiére graduated from the École Nationale des Travaux Publics de l'État, France (2002). He received his M.S. and Ph.D. degree in computer vision, respectively, in 2002 and 2005 from Saint-Étienne University (France). From 2002, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France. His research interests include trafic engineering, computer vision, and pattern recognition. Jean-Philippe Tarel graduated from the École Nationale des Ponts et Chaussées, Paris, France (1991). He received his Ph.D. degree in Applied Mathematics from Paris IX-Dauphine University in 1996 and he was with the Institut National de Recherche en Informatique et Automatique (INRIA) from 1991 to 1996. From 1997 to 1998, he was a research associate at Brown University, USA. From 1999, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France, and from 2001 to 2003 in the INRIA. His research interests include computer vision, pattern recognition, and shape modeling. Jean Lavenant graduated from the École Nationale des Travaux Publics de l'État, Lyon, France (2001). He received the M.S. degree in Computer Vision from Jean Monnet university of Saint-Étienne in 2001. In 2001, he was a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC). In 2002, he was a system engineer in Chicago (USA). He is currently an engineer for the french ministry of transports. Didier Aubert received the M.S. and Ph.D. degree, respectively, in 1985 and 1989 from the National Polytechnical Institut of Grenoble (INPG). From 1989--1990, he worked as a research scientist on the development of an automatic road following system for the NAVLAB at Carnegie Mellon University. From 1990–1994, he worked in the research department of a private company (ITMI). During this period he was the project leader of several projects dealing with computer vision. He is currently a researcher at INRETS since 1995 and works on Road traffic measurements, crowd monitoring, automated highway systems, and driving assistance systems for vehicles. He is an image processing expert for several companies, teaches at Universities (Paris VI, Paris XI, ENPC, ENST) and is at the editorial board of RTS (Research - Transport - Safety).     

Contributing authors

Contributing authors     

Free-form object reconstruction from silhouettes, occluding edges and texture edges: a unified and robust operator based on duality

In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, i.e., each tangent plane of the primal surface is represented as a four-dimensional vector which constitutes a point on the dual manifold. The iterated dual theorem shows that each tangent plane of the dual manifold corresponds to a point on the original 3D surface, i.e., the dual of the dual goes back to the primal. This theorem can be directly used to reconstruct 3D surface from image edges by estimating the dual manifold from these edges. In this paper we further develop the work in our original conference papers resulting in the robust differential dual operator. We argue that the operator makes good use of the information available in the image data, by using both points of intensity discontinuity and their edge directions; we provide a simple physical interpretation of what the abstract algorithm is actually estimating and why it makes sense in terms of estimation accuracy; our algorithm operates on all edges in the images, including silhouette edges, self occlusion edges, and texture edges, without distinguishing their types (thus resulting in improved accuracy and handling locally concave surface estimation if texture edges are present); the algorithm automatically handles various degeneracies; and the algorithm incorporates new methodologies for implementing the required operations such as appropriately relating edges in pairs of images, evaluating and using the algorithm's sensitivity to noise to determine the accuracy of an estimated 3D point. Experiments with both synthetic and real images demonstrate that the operator is accurate, robust to degeneracies and noise, and general for reconstructing free-form objects from occluding edges and texture edges detected in calibrated images or video sequences.     

The complex representation of algebraic curves and its simpleexploitation for pose estimation and invariant recognition

Representations are introduced for handling 2D algebraic curves (implicit polynomial curves) of arbitrary degree in the scope of computer vision applications. These representations permit fast, accurate pose-independent shape recognition under Euclidean transformations with a complete set of invariants, and fast accurate pose-estimation based on all the polynomial coefficients. The latter is accomplished by a centering of a polynomial based on its coefficients, followed by rotation estimation by decomposing polynomial coefficient space into a union of orthogonal subspaces for which rotations within two-dimensional subspaces or identity transformations within one-dimensional subspaces result from rotations in x, y measured-data space. Angles of these rotations in the two-dimensional coefficient subspaces are proportional to each other and are integer multiples of the rotation angle in the x, y data space. By recasting this approach in terms of a complex variable, i.e., x+iy=z, and complex polynomial-coefficients, further conceptual and computational simplification results. Application to shape-based indexing into databases is presented to illustrate the usefulness and the robustness of the complex representation of algebraic curves     

Covariant-Conics Decomposition of Quartics for 2D Shape Recognition and Alignment

This paper outlines a new geometric parameterization of 2D curves where parameterization is in terms of geometric invariants and parameters that determine intrinsic coordinate systems. This new approach handles two fundamental problems: single-computation alignment, and recognition of 2D shapes under Euclidean or affine transformations. The approach is model-based: every shape is first fitted by a quartic represented by a fourth degree 2D polynomial. Based on the decomposition of this equation into three covariant conics, we are able, in both the Euclidean and the affine cases, to define a unique intrinsic coordinate system for non-singular bounded quartics that incorporates usable alignment information contained in the polynomial representation, a complete set of geometric invariants, and thus an associated canonical form for a quartic. This representation permits shape recognition based on 11 Euclidean invariants, or 8 affine invariants. This is illustrated in experiments with real data sets.     

Electrospark Graphite Alloying of Steel Surfaces: Technology,Properties, and Application

Regularities in the influence of processing time and discharge energy on the thickness, microhardness and roughness of carburized cases during electrospark graphite alloying of steel surfaces are studied and quantitative data on them are obtained. The thickness of the strengthened layer increases with gains in discharge energy and alloying time. Specimens of 40Kh, 38KhMYuA, 40KhN2MYuA, 30Kh13, Armco iron, 12Kh18N10T steels and 20 steel, as well as EGe-4 graphite are studied. The tests were carried out using the following devices: EILV-8А, EILV-9, Elitron-22А, and Elitron-52А, which provide discharge energy in the range from 0.1 to 6.8 J. Experiments show that case depth and microhardness under the same process conditions are differ significantly for various steel grades. Case depth increases with higher initial carbon contents in steel. The greater the discharge energy, the greater this difference is. Wear tests show that the method of nonabrasive ultrasonic finish processing after graphite electrospark alloying is effective, and it allows increases in the wear resistance of specimens by a factor of 7.8 for 40Kh steel and by a factor of 11.5 for 12Kh18N10T steel. Research confirms that the stage electrospark alloying of the surface of a specimen after carbonization with a graphite electrode effectively decreases roughness. Discharge energy is lowered at each stage. The stage graphite electrospark alloying of the 38KhMYuA steel case allowed decreases in the surface roughness from R _а = 11.9–14.0 μm to 0.8–0.9 μm. Industrial tests show that graphite electrospark alloying offers can accomplish a number of practical tasks.     

Rain or Snow Detection in Image Sequences Through Use of a Histogram of Orientation of Streaks

The detection of bad weather conditions is crucial for meteorological centers, specially with demand for air, sea and ground traffic management. In this article, a system based on computer vision is presented which detects the presence of rain or snow. To separate the foreground from the background in image sequences, a classical Gaussian Mixture Model is used. The foreground model serves to detect rain and snow, since these are dynamic weather phenomena. Selection rules based on photometry and size are proposed in order to select the potential rain streaks. Then a Histogram of Orientations of rain or snow Streaks (HOS), estimated with the method of geometric moments, is computed, which is assumed to follow a model of Gaussian-uniform mixture. The Gaussian distribution represents the orientation of the rain or the snow whereas the uniform distribution represents the orientation of the noise. An algorithm of expectation maximization is used to separate these two distributions. Following a goodness-of-fit test, the Gaussian distribution is temporally smoothed and its amplitude allows deciding the presence of rain or snow. When the presence of rain or of snow is detected, the HOS makes it possible to detect the pixels of rain or of snow in the foreground images, and to estimate the intensity of the precipitation of rain or of snow. The applications of the method are numerous and include the detection of critical weather conditions, the observation of weather, the reliability improvement of video-surveillance systems and rain rendering.     

Improving the stability of algebraic curves for applications

An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or superquadrics. The main drawback in representing shapes by algebraic curves has been the lack of repeatability in fitting algebraic curves to data. Usually, arguments against using algebraic curves involve references to mathematicians Wilkinson (and Runge). The first goal of this article is to understand the stability issue of algebraic curve fitting. Then a fitting method based on ridge regression and restricting the representation to well behaved subsets of polynomials is proposed, and its properties are investigated. The fitting algorithm is of sufficient stability for very fast position-invariant shape recognition, position estimation, and shape tracking, based on invariants and new representations. Among appropriate applications are shape-based indexing into image databases.