Verifying an identity claim by fingerprint recognition is a commonplace experience for millions of people in their daily life, for example, for unlocking a tablet computer or smartphone. The first processing step after fingerprint image acquisition is segmentation, that is, dividing a fingerprint image into a foreground region which contains the relevant features for the comparison algorithm, and a background region. The authors propose a novel segmentation method by global three-part decomposition (G3PD). On the basis of global variational analysis, the G3PD method decomposes a fingerprint image into cartoon, texture and noise parts. After decomposition, the foreground region is obtained from the non-zero coefficients in the texture image using morphological processing. The segmentation performance of the G3PD method is compared with five state-of-the-art methods on a benchmark which comprises manually marked ground truth segmentation for 10,560 images. Performance evaluations show that the G3PD method consistently outperforms existing methods in terms of segmentation accuracy.
With more than hundred methods, we refer the reader to @cite_28 for an overview over the literature of fingerprint segmentation methods. For image segmentation in general, there is a plethora of approaches to solve this problem. These are based e.g. on the intensity of pixels @cite_61 , @cite_53 , @cite_13 , or the evolution of curves for piecewise smooth regions in images @cite_14 , @cite_59 , @cite_40 , @cite_46 . Texture segmentation, however, is still an open problem, because intensity values are inadequate, e.g. for segmenting fingerprint patterns. Methods based on texture descriptors @cite_63 , @cite_15 or finding other meaningful features in an observed image for classification have been suggested.
@cite_61 @cite_14 @cite_15 @cite_28 @cite_53 @cite_40 @cite_59 @cite_63 @cite_46 @cite_13
1853627316 1969840923 2067912884 2101789519
Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: ‘true’ foreground can be labeled as background and features like minutiae can be lost, or conversely ‘true’ background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB) segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB) filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available. Abstract This paper pertains to the detection of objects located in complex backgrounds. A feature-based segmentation approach to the object detection problem is pursued, where the features are computed over multiple spatial orientations and frequencies. The method proceeds as follows: a given image is passed through a bank of even-symmetric Gabor filters. A selection of these filtered images is made and each (selected) filtered image is subjected to a nonlinear (sigmoidal like) transformation. Then, a measure of texture energy is computed in a window around each transformed image pixel. The texture energy (“Gabor features”) and their spatial locations are inputted to a squared-error clustering algorithm. This clustering algorithm yields a segmentation of the original image—it assigns to each pixel in the image a cluster label that identifies the amount of mean local energy the pixel possesses across different spatial orientations and frequencies. The method is applied to a number of visual and infrared images, each one of which contains one or more objects. The region corresponding to the object is usually segmented correctly, and a unique signature of “Gabor features” is typically associated with the segment containing the object(s) of interest. Experimental results are provided to illustrate the usefulness of this object detection method in a number of problem domains. These problems arise in IVHS, military reconnaissance, fingerprint analysis, and image database query. We address the problems of contour detection, bottom-up grouping and semantic segmentation using RGB-D data. We focus on the challenging setting of cluttered indoor scenes, and evaluate our approach on the recently introduced NYU-Depth V2 (NYUD2) dataset [27]. We propose algorithms for object boundary detection and hierarchical segmentation that generalize the gPb-ucm approach of [2] by making effective use of depth information. We show that our system can label each contour with its type (depth, normal or albedo). We also propose a generic method for long-range amodal completion of surfaces and show its effectiveness in grouping. We then turn to the problem of semantic segmentation and propose a simple approach that classifies super pixels into the 40 dominant object categories in NYUD2. We use both generic and class-specific features to encode the appearance and geometry of objects. We also show how our approach can be used for scene classification, and how this contextual information in turn improves object recognition. In all of these tasks, we report significant improvements over the state-of-the-art. In this paper, we present an efficient approach for unsupervised segmenta- tion of natural and textural images based on the extraction o fi mage features and a fast active contour segmentation model. We address the problem of textures where neither the gray-level information nor the boundary information is adequate for object extraction. This is often the case of natural images compose do f both homogeneous and textured regions. Because these images cannot be in generaldirectly processed by the gray-level information, we propose a new texture descripto rw hich intrinsically def ines the geometry of textures using semi-local image informatio na nd tools from differen- tial geometry. Then, we use the popular Kullback-Leibler distance to design an active contour model which distinguishes the background and textures of interest. The exis- tence of a minimizing solution to the proposed segmentationmodel is proven. Finally, at exture segmentation algorithm based on the Split-Bregma nm ethod is introduced to extract meaningful objects in a fast way. Promising synthetic and real-world results for gray-scale and color images are presented.