Many image processing problems are ill-posed and must be regularized. Usually, a roughness penalty is imposed on the solution. The difficulty is to avoid the smoothing of edges, which are very important attributes of the image. In this paper, we first give conditions for the design of such an edge-preserving regularization. Under these conditions, we show that it is possible to introduce an auxiliary variable whose role is twofold. First, it marks the discontinuities and ensures their preservation from smoothing. Second, it makes the criterion half-quadratic. The optimization is then easier. We propose a deterministic strategy, based on alternate minimizations on the image and the auxiliary variable. This leads to the definition of an original reconstruction algorithm, called ARTUR. Some theoretical properties of ARTUR are discussed. Experimental results illustrate the behavior of the algorithm. These results are shown in the field of 2D single photon emission tomography, but this method can be applied in a large number of applications in image processing.
This paper proposes a systematic approach to evaluate algorithms for extracting road marking features from images. This specific topic is seldom addressed in the literature while many road marking detection algorithms have been proposed. Most of them can be decomposed into three steps: extracting road marking features, estimating a geometrical marking model, tracking the parameters of the geometrical model along an image sequence. The present work focuses on the first step, i.e. feature extraction. A reference database containing over 100 images of natural road scenes was built with corresponding manually labeled ground truth images (available at http://www.lcpc.fr/en/produits/ride/). This database enables to evaluate and compare extractors in a systematic way. Different road marking feature extraction algorithm representing different classes of techniques are evaluated: thresholding, gradient analysis, and convolution. As a result of this analysis, recommendations are given on which extractor to choose according to a specific application.
8 January 2015 in IEEE Transactions on Image Processing
The bilateral filter and its variants, such as the joint/cross bilateral filter, are well-known edge-preserving image smoothing tools used in many applications. The reason of this success is its simple definition and the possibility of many adaptations. The bilateral filter is known to be related to robust estimation. This link is lost by the ad hoc introduction of the guide image in the joint/cross bilateral filter. We here propose a new way to derive the joint/cross bilateral filter as a particular case of a more generic filter, which we name the guided bilateral filter. This new filter is iterative, generic, inherits the robustness properties of the robust bilateral filter, and uses a guide image. The link with robust estimation allows us to relate the filter parameters with the statistics of input images. A scheme based on graduated nonconvexity is proposed, which allows converging to an interesting local minimum even when the cost function is nonconvex. With this scheme, the guided bilateral filter can handle non-Gaussian noise on the image to be filtered. A complementary scheme is also proposed to handle non-Gaussian noise on the guide image even if both are strongly correlated. This allows the guided bilateral filter to handle situations with more noise than the joint/cross bilateral filter can work with and leads to high peak signal-to-noise ratio values as shown experimentally.
While road lane markings detection was extensively studied, in particular for intelligent vehicle applications, the detection and recognition of all kind of marking such as arrows, crosswalks, zebras, words, pictograms, continuous and discontinuous lane markings was drastically less studied. However, it has many potential applications in the design of advanced driver assistance systems, as well as for asset management along itineraries. An algorithm is proposed which is based on the following processing steps: marking pixel extraction, detection using connected components before Inverse Perspective Mapping and recognition based on the comparison with a single pattern or with repetitive rectangular patterns. The proposed algorithm is able to detect and recognize repetitive markings (such as crosswalks) as well as single patterns (such as arrows). We believe that the proposed algorithm can be extended easily to solve the problem of the identification of all types of markings.
19 June 2006 in IEEE Transactions on Pattern Analysis and Machine Intelligence
We present a new way of constraining the evolution of a region-based active contour with respect to a reference shape. Minimizing a shape prior, defined as a distance between shape descriptors based on the Legendre moments of the characteristic function, leads to a geometric flow that can be used with benefits in a two-class segmentation application. The shape model includes intrinsic invariance with regard to pose and affine deformations
17 September 2008 in International Journal of Computer Vision