Search results for " Pattern Recognition"
showing 10 items of 1050 documents
Generalization of Canny–Deriche filter for detection of noisy exponential edge
2002
This paper presents a generalization of the Canny-Deriche filter for ramp edge detection with optimization criteria used by Canny (signal-to-noise ratio, localization, and suppression of false responses). Using techniques similar to those developed by Deriche, we derive a filter which maximizes the product of the first two criteria under the constraint of the last one. The result is an infinite length impulse response filter which leads to a stable third-order recursive implementation. Its performance shows an increase of the signal-to-noise ratio in the case of blurred and noisy images, compared to the results obtained from Deriche's filter.
A Multiresolution Approach Based on MRF and Bak–Sneppen Models for Image Segmentation
2006
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the SA, the ICM provides reasonable segmentation and shows robust behavior in most of the cases. However, the ICM strongly depends on the initialization phase. In this paper, we combine Bak-Sneppen model and Markov Random Fields to define a new image segmentation approach. We introduce a multiresolution technique in order to speed up the segmentation process and to improve the restoration process. Image pixels are viewed as lattice species of Bak-Sneppen model. The a-posteriori probability corresponds to a local fitn…
The Rank of Trifocal Grassmann Tensors
2019
Grassmann tensors arise from classical problems of scene reconstruction in computer vision. Trifocal Grassmann tensors, related to three projections from a projective space of dimension k onto view-spaces of varying dimensions are studied in this work. A canonical form for the combined projection matrices is obtained. When the centers of projections satisfy a natural generality assumption, such canonical form gives a closed formula for the rank of the trifocal Grassmann tensors. The same approach is also applied to the case of two projections, confirming a previous result obtained with different methods in [6]. The rank of sequences of tensors converging to tensors associated with degenerat…
Chromatic compensation of broadband light diffraction: ABCD-matrix approach
2004
Compensation of chromatic dispersion for the optical implementation of mathematical transformations has proved to be an important tool in the design of new optical methods for full-color signal processing. A novel approach for designing dispersion-compensated, broadband optical transformers, both Fourier and Fresnel, based on the collimated Fresnel number is introduced. In a second stage, the above framework is fully exploited to achieve the optical implementation of the fractional Fourier transform (FRT) of any diffracting screen with broadband illumination. Moreover, we demonstrate that the amount of shift variance of the dispersion-compensated FRT can be tuned continuously from the spati…
Shape matching, shape retrieval
2016
This thesis concerns shape matching and shape retrieval. It describes four contributions to thisdomain. The first is an improvement of the k-means method, in order to find the best partition ofvoxels inside a given shape ; these best partitions permit to match shapes using an optimal matchingin a bipartite graph. The second contribution is the fusion of two descriptors, one local, the otherglobal, with the product rule. The third contribution considers the complete graph, the vertices ofwhich are the shapes in the database and the query. Edges are labelled with several distances,one per descriptor. Then the method computes, with linear programming, the convex combinationof distances which m…
3D shape recognition and matching for intelligent computer vision systems
2018
This thesis concerns recognition and matching of 3D shapes for intelligent computer vision systems. It describes two main contributions to this domain. The first contribution is an implementation of a new shape descriptor built on the basis of the spectral geometry of the Laplace-Beltrami operator; we propose an Advanced Global Point Signature (AGPS). This descriptor exploits the intrinsic structure of the object and organizes its information in an efficient way. In addition, AGPS is extremely compact since only a few eigenpairs were necessary to obtain an accurate shape description. The second contribution is an improvement of the wave kernel signature; we propose an optimized wave kernel …
Automatic recognition of tree species from 3D point clouds of forest plots
2014
The objective of the thesis is the automatic recognition of tree species from Terrestrial LiDAR data. This information is essential for forest inventory. As an answer, we propose different recognition methods based on the 3D geometric texture of the bark.These methods use the following processing steps: a preprocessing step, a segmentation step, a feature extraction step and a final classification step. They are based on the 3D data or on depth images built from 3D point clouds of tree trunks using a reference surface.We have investigated and tested several segmentation approaches on depth images representing the geometric texture of the bark. These approaches have the disadvantages of over…
Spectral interest points and texture extraction and fusion for identification, control and security
2018
Biometrics is an emerging technology that proposes new methods of control, identification and security. Biometric systems are often subject to risks. Face recognition is popular and several existing approaches use images in the visible spectrum. These traditional systems operating in the visible spectrum suffer from several limitations due to changes in lighting, poses and facial expressions. The methodology presented in this thesis is based on multispectral facial recognition using infrared and visible imaging, to improve the performance of facial recognition and to overcome the deficiencies of the visible spectrum. The multispectral images used in this study are obtained by fusion of visi…
Non-linear RLS-based algorithm for pattern classification
2006
A new non-linear recursive least squares (RLS) algorithm is presented in the context of pattern classification problems. The algorithm incorporates the non-linearity of the filter's output in the updating rules of the classical RLS algorithm. The proposed method yields lower stationary error levels when compared to the standard LMS and RLS algorithms in a classical application of pattern classification, such as the channel equalization problem.
3D Reconstruction of Dynamic Vehicles using Sparse 3D-Laser-Scanner and 2D Image Fusion
2016
International audience; Map building becomes one of the most interesting research topic in computer vision field nowadays. To acquire accurate large 3D scene reconstructions, 3D laser scanners are recently developed and widely used. They produce accurate but sparse 3D point clouds of the environments. However, 3D reconstruction of rigidly moving objects along side with the large-scale 3D scene reconstruction is still lack of interest in many researches. To achieve a detailed object-level 3D reconstruction, a single scan of point cloud is insufficient due to their sparsity. For example, traditional Iterative Closest Point (ICP) registration technique or its variances are not accurate and rob…