• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,295,718
Next 10 →

Fingerprint-Based Recognition

by Sarat C. Dass, Anil K. Jain - Technometrics. August 2007
"... Biometric recognition, or biometrics, refers to the authentication of an individual based on her or his biometric traits. Among the various biometric traits (e.g., face, iris, fingerprint, voice), fingerprint-based authentication has the longest history, and it has been successfully adopted in both ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Biometric recognition, or biometrics, refers to the authentication of an individual based on her or his biometric traits. Among the various biometric traits (e.g., face, iris, fingerprint, voice), fingerprint-based authentication has the longest history, and it has been successfully adopted in both

Fingerprint-Based Gender Classification

by Ahmed Badawi, Mohamed Mahfouz, Rimon Tadross, Richard Jantz
"... Abstract- Gender classification from fingerprints is an important step in forensic anthropology in order to identify the gender of a criminal and minimize the list of suspects search. A dataset of 10-fingerprint images for 2200 persons of different ages and gender (1100 males and 1100 females) was a ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract- Gender classification from fingerprints is an important step in forensic anthropology in order to identify the gender of a criminal and minimize the list of suspects search. A dataset of 10-fingerprint images for 2200 persons of different ages and gender (1100 males and 1100 females

Locally weighted learning

by Christopher G. Atkeson, Andrew W. Moore , Stefan Schaal - ARTIFICIAL INTELLIGENCE REVIEW , 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract - Cited by 594 (53 self) - Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias

A PERFORMANCE EVALUATION OF LOCAL DESCRIPTORS

by Krystian Mikolajczyk, Cordelia Schmid , 2005
"... In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the Harris-Affine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how their perfo ..."
Abstract - Cited by 1752 (53 self) - Add to MetaCart
In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the Harris-Affine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how

Solving multiclass learning problems via error-correcting output codes

by Thomas G. Dietterich, Ghulum Bakiri - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract - Cited by 730 (8 self) - Add to MetaCart
output representations. This paper compares these three approaches to a new technique in which error-correcting codes are employed as a distributed output representation. We show that these output representations improve the generalization performance of both C4.5 and backpropagation on a wide range

Good Error-Correcting Codes based on Very Sparse Matrices

by David J.C. MacKay , 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract - Cited by 741 (23 self) - Add to MetaCart
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties

Robust Monte Carlo Localization for Mobile Robots

by Sebastian Thrun, Dieter Fox, Wolfram Burgard, Frank Dellaert , 2001
"... Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples), whi ..."
Abstract - Cited by 826 (88 self) - Add to MetaCart
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples

Sequential data assimilation with a nonlinear quasi-geostrophic model using Monte Carlo methods to forecast error statistics

by Geir Evensen - J. Geophys. Res , 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract - Cited by 782 (22 self) - Add to MetaCart
. A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter

PCA-SIFT: A more distinctive representation for local image descriptors

by Yan Ke, Rahul Sukthankar , 2004
"... Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image deforma ..."
Abstract - Cited by 572 (6 self) - Add to MetaCart
Analysis (PCA) to the normalized gradient patch. Our experiments demonstrate that the PCAbased local descriptors are more distinctive, more robust to image deformations, and more compact than the standard SIFT representation. We also present results showing that using these descriptors in an image

Convex Analysis

by R. Tyrrell Rockafellar , 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract - Cited by 5350 (67 self) - Add to MetaCart
In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a
Next 10 →
Results 1 - 10 of 1,295,718
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University