Results 1 - 10
of
37
Face Recognition: A Convolutional Neural Network Approach
- IEEE Transactions on Neural Networks
, 1997
"... Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult [43]. We present a hybrid neural network solution which compares favorably with other methods. The system combines local image sampling, a self-organizing map n ..."
Abstract
-
Cited by 234 (0 self)
- Add to MetaCart
(Show Context)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult [43]. We present a hybrid neural network solution which compares favorably with other methods. The system combines local image sampling, a self-organizing map neural network, and a convolutional neural network. The self-organizing map provides a quantization of the image samples into a topological space where inputs that are nearby in the original space are also nearby in the output space, thereby providing dimensionality reduction and invariance to minor changes in the image sample, and the convolutional neural network provides for partial invariance to translation, rotation, scale, and deformation. The convolutional network extracts successively larger features in a hierarchical set of layers. We present results using the Karhunen-Loeve transform in place of the self-organizing map, and a multi-layer perceptron in place of the convolutional netwo...
A real-time matching system for large fingerprint databases
- IEEE Trans. Pattern Anal. Mach. Intell
, 1996
"... Abstract-With the current rapid growth in multimedia technology, there is an imminent need for efficient techniclues to search and query large image databases. Because of their unique and peculiar needs, image databases cannot be treated iri a similar fashion to other types of digital libraries. The ..."
Abstract
-
Cited by 105 (14 self)
- Add to MetaCart
Abstract-With the current rapid growth in multimedia technology, there is an imminent need for efficient techniclues to search and query large image databases. Because of their unique and peculiar needs, image databases cannot be treated iri a similar fashion to other types of digital libraries. The contextual dependencies present in images, and the complex nature of two-dimensional image data make the representation issues more difficult for image databases. An invariant representation of an image is still an open research issue. For these reasons, it is difficult to find a universal content-based retrieval technique. Current approaches based on shape, texture, and color for indexing image databases have met with limited success. Further, these techniques have not been adequately tested in the presence of noise and distortions. A given application domain offers stronger constraints for improving the retrieval performance. Fingerprint databases are characterized by their large size as well as noisy and distorted query images. Distortions are very common in fingerprint images due to elasticity of the skin. In this paper, a method of indexincl large fingerprint image databases is presented. The approach integrates a number of domain-specific high-level features such as pattern class and ridge density at higher levels of the search. At the lowest level, it incorporates elastic structural feature-based matching for indexing the database. With a multilevel indexing approach, we have been able to reduce the search space. The search engine has also been implemented on Splash 2-a field programmable gate array (FPGA)-based array processor to obtain near-,4SIC level speed of matching. Our approach has been tested on a locally collected test data and on NIST-9, a large fingerprint database available in the public domain. index Terms-Image database, fingerprint matching, minutiae points, image registration, indexing, field programmable gate array.
Fingerprint Classification
- Pattern Recognition
, 1996
"... Abstract A fingerprint classification algorithm is presented in this paper. Fingerprints are classified into five categories: arch, tented arch, left loop, right loop and whorl. The algorithm extracts singular points (cores and deltas) in a fingerprint image and performs classification based on the ..."
Abstract
-
Cited by 100 (10 self)
- Add to MetaCart
Abstract A fingerprint classification algorithm is presented in this paper. Fingerprints are classified into five categories: arch, tented arch, left loop, right loop and whorl. The algorithm extracts singular points (cores and deltas) in a fingerprint image and performs classification based on the number and locations of the detected singular points. The classifier is invariant to rotation, translation and small amounts of scale changes. The classifier is rule-based, where the rules are generated independent of a given data set. The
Face recognition: A hybrid neural network approach
, 1996
"... Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult (Turk and Pentland, 1991). We present a hybrid neural network solution which compares favorably with other methods. The system combines local image sampling, a ..."
Abstract
-
Cited by 21 (0 self)
- Add to MetaCart
(Show Context)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult (Turk and Pentland, 1991). We present a hybrid neural network solution which compares favorably with other methods. The system combines local image sampling, a self-organizing map neural network, and a convolutional neural network. The self-organizing map provides a quantization of the image samples into a topological space where inputs that are nearby in the original space are also nearby in the output space, thereby providing dimensionality reduction and invariance to minor changes in the image sample, and the convolutional neural network provides for partial invariance to translation, rotation, scale, and deformation. The convolutional network extracts successively larger features in a hierarchical set of layers. We present results using the Karhunen-Loève transform in place of the self-organizing map, and a multilayer perceptron in place of the convolutional network. The Karhunen-Loève transform performs almost as well (5.3 % error versus 3.8%). The multilayer perceptron performs very poorly (40 % error versus 3.8%). The method is capable of rapid classification, requires only fast, approximate normalization and preprocessing, and consistently exhibits better classification performance than the eigenfaces approach (Turk and Pentland, 1991) on the database
NIST Form-Based Handprint Recognition System
- Technical Report NISTIR 5469 and CD-ROM, National Institute of Standards and Technology
, 1994
"... 1 1. INTRODUCTION 1 2. INSTALLATION INSTRUCTIONS 4 2.1 INTALLATING FROM CD-ROM 4 2.2 HIERARCHICAL DIRECTORY STRUCTURE 5 2.2.1 SOURCE CODE SUBDIRECTORY 6 2.3 AUTOMATED COMPILATION UTILITY 7 2.4 SYSTEM INVOCATION 10 3. SOFTWARE DOCUMENTATION 12 3.1 DO HSF FORM; src/lib/hsf/form.c; do_hsf_form() 12 3.1 ..."
Abstract
-
Cited by 18 (6 self)
- Add to MetaCart
1 1. INTRODUCTION 1 2. INSTALLATION INSTRUCTIONS 4 2.1 INTALLATING FROM CD-ROM 4 2.2 HIERARCHICAL DIRECTORY STRUCTURE 5 2.2.1 SOURCE CODE SUBDIRECTORY 6 2.3 AUTOMATED COMPILATION UTILITY 7 2.4 SYSTEM INVOCATION 10 3. SOFTWARE DOCUMENTATION 12 3.1 DO HSF FORM; src/lib/hsf/form.c; do_hsf_form() 12 3.1.1 INITIALIZE FOR HSF FORM; src/lib/hsf/form.c; init_form() 12 3.1.1.1 READ FORM IMAGE; src/lib/image/readrast.c; ReadBinaryRaster() 12 3.1.1.2 READ FIELD TEMPLATE; src/lib/hsf/hsftmplt.c; read_hsftmplt() 18 3.1.2 PROCESS HSF FORM; src/lib/hsf/form.c; process_form2() 18 3.1.2.1 REGISTER FORM IMAGE; src/lib/hsf/reghsf.c; register_hsf2() 18 3.1.2.1.1 Read Reference Points; src/lib/mdg/readmfs.c;p readmfsint2() 19 3.1.2.1.2 Locate Hypothesized Points; src/lib/hsf/hsfpoint.c; hsfpoints() 20 3.1.2.1.3 Compute Distortion Parameters; src/lib/stats/lsq3.c; chknfindparam3() 22 3.1.2.1.4 Transform Form Image; src/lib/image/fitimage.c; f_fit_param3_image2() 24 3.1.2.2 REMOVE FORM; src/lib/hsf/rmform.c;...
Feitosa, “A new covariance estimate for Bayesian classifiers in biometric recognition
- IEEE Trans. Circuits Syst. Video Technol
, 2004
"... Abstract—In many biometric pattern-recognition problems, the number of training examples per class is limited, and consequently the sample group covariance matrices often used in parametric and nonparametric Bayesian classifiers are poorly estimated or singular. Thus, a considerable amount of effort ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
Abstract—In many biometric pattern-recognition problems, the number of training examples per class is limited, and consequently the sample group covariance matrices often used in parametric and nonparametric Bayesian classifiers are poorly estimated or singular. Thus, a considerable amount of effort has been devoted to the design of other covariance estimators, for use in limited-sample and high-dimensional classification problems. In this paper, a new covariance estimate, called the maximum entropy covariance selection (MECS) method, is proposed. It is based on combining covariance matrices under the principle of maximum uncertainty. In order to evaluate the MECS effectiveness in biometric problems, experiments on face, facial expression, and fingerprint classification were carried out and compared with popular covariance estimates, including the reguralized discriminant analysis and leave-one-out covariance for the parametric classifier, and the Van Ness and Toeplitz covariance estimates for the nonparametric classifier. The results show that, in image recognition applications whenever the sample group covariance matrices are poorly estimated or ill posed, the MECS method is faster and usually more accurate than the aforementioned approaches in both parametric and nonparametric Bayesian classifiers. Index Terms—Bayesian classifiers, biometric recognition, covariance estimate, limited sample sizes, maximum entropy. I.
Pictorial Query Specification for Browsing Through Spatially-Referenced Image Databases
- In Proceedings of the Second International Conference on Visual Information Systems
, 1998
"... A pictorial query specification technique that enables the formulation of complex pictorial queries for browsing through a collection of spatially-referenced images is presented. It is distinguished from most other methods by the fact that in these methods the query image specifies a target database ..."
Abstract
-
Cited by 12 (7 self)
- Add to MetaCart
A pictorial query specification technique that enables the formulation of complex pictorial queries for browsing through a collection of spatially-referenced images is presented. It is distinguished from most other methods by the fact that in these methods the query image specifies a target database image in its entirety whereas in our approach the query image specifies the combination of objects that the target database image should contain rather than being treated as a whole image. The query objects are represented by shape features although other features such as color, texture, or wavelets could also be used. Using our technique, it is possible to specify which particular objects should appear in the target images as well as how many occurrences of each object are required. Moreover, it is possible to specify the minimum required certainty of matching between query-image objects and database-image objects, as well as to impose spatial constraints that specify bounds on the distanc...
Retrieval By Content in Symbolic-Image Databases
, 1996
"... Two approaches for integrating images into the framework of a database management system are presented. The classification approach preprocesses all images and attaches a semantic classification and an associated certainty factor to each object found in the image. The abstraction approach describes ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
Two approaches for integrating images into the framework of a database management system are presented. The classification approach preprocesses all images and attaches a semantic classification and an associated certainty factor to each object found in the image. The abstraction approach describes each object in the image by using a vector consisting of the values of some of its features (e.g., shape, genus, etc.). The approaches differ in the way in which responses to queries that are based on image content are computed. In the classification approach, images are retrieved on the basis of whether or not they contain objects that have the same classification as query objects. In the abstraction approach, retrieval is on the basis of similarity of feature vector values of these objects. Both the pattern recognition and indexing aspects of the method are addressed for each approach. The emphasis is on extracting both contextual and spatial information from the raw images. Methods for st...
Form Design for High Accuracy Optical Character Recognition
, 1996
"... Financial institutions, insurance companies, and government agencies are all aggressively pursuing the integration of automated forms processing into their everyday work flows. To use existing optical character recognition (OCR) technology, the forms that are currently hand-keyed will probably need ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
Financial institutions, insurance companies, and government agencies are all aggressively pursuing the integration of automated forms processing into their everyday work flows. To use existing optical character recognition (OCR) technology, the forms that are currently hand-keyed will probably need to be redesigned. This paper presents some of the quantitative results generated by a comprehensive study of three versions of a redesigned tax form. Analyses show that using separately spaced bounding character boxes to represent fields provides superior machine readability over fields without character boxes, fields containing vertical ticks (combs), and fields with adjoining character boxes. It is also shown that character boxes containing two vertically stacked ovals cause writers much more difficulty to complete than do empty character boxes. The analyses also provide quantitative proof that writer idiosyncratic responses on forms are the major source of errors within the recognition sy...