Results 1  10
of
1,586
Kerdock codes and extremal Euclidean linesets
, 802
"... Association schemes related to universally optimal configurations, ..."
Codes, Quadratic Forms and Finite Geometries
 SYMPOSIA IN APPLIED MATHEMATICS
, 1995
"... We study nonlinear binary errorcorrecting codes closely related to finite geometries and quadratic forms, and having links with extremal Euclidean linesets and with recently introducedcodes over Z 4 . Our emphasis is on geometric and combinatorial properties of highly structured families of code ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study nonlinear binary errorcorrecting codes closely related to finite geometries and quadratic forms, and having links with extremal Euclidean linesets and with recently introducedcodes over Z 4 . Our emphasis is on geometric and combinatorial properties of highly structured families
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1016 (35 self)
 Add to MetaCart
The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly de
From Few to many: Illumination cone models for face recognition under variable lighting and pose
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a generative appearancebased method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a smal ..."
Abstract

Cited by 754 (12 self)
 Add to MetaCart
We present a generative appearancebased method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a
Real Mutually Unbiased Bases
, 2008
"... We tabulate bounds on the optimal number of mutually unbiased bases in R d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal number is at most either 2 or 3. We discuss the limitations of t ..."
Abstract
 Add to MetaCart
in dimension d instead of invoking the known results on extremal Euclidean line sets by Cameron and Seidel, Delsarte, and Calderbank et al.
On the Maximal Number of Real Mutually Unbiased Bases
, 2005
"... In this note I point out that (1) pairs of real mutually unbiased bases (i.e., orthonormal bases of R d) can only exist in dimensions 2 or d where d is a multiple of 4 and that (2) triples of real mutually unbiased bases can only exist in dimensions d that are also squares. For the case d = 2 2m the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the maximal number of real MUBs is given by (d + 2)/2 (this follows from known results on extremal euclidean linesets). In the case d = s 2 where s is an even number that is not a power of 2, we have the lower bound NMOLS(s) + 2, where NMOLS(s) denotes the maximal number of mutually orthogonal Latin square
Monte Carlo Localization: Efficient Position Estimation for Mobile Robots
 IN PROC. OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI
, 1999
"... This paper presents a new algorithm for mobile robot localization, called Monte Carlo Localization (MCL). MCL is a version of Markov localization, a family of probabilistic approaches that have recently been applied with great practical success. However, previous approaches were either computational ..."
Abstract

Cited by 343 (46 self)
 Add to MetaCart
based methods for approximating probability distributions, in a way that places computation " where needed." The number of samples is adapted online, thereby invoking large sample sets only when necessary. Empirical results illustrate that MCL yields improved accuracy while requiring an order
Region Covariance: A Fast Descriptor for Detection And Classification
 In Proc. 9th European Conf. on Computer Vision
, 2006
"... We describe a new region descriptor and apply it to two problems, object detection and texture classification. The covariance of dfeatures, e.g., the threedimensional color vector, the norm of first and second derivatives of intensity with respect to x and y, etc., characterizes a region of in ..."
Abstract

Cited by 278 (14 self)
 Add to MetaCart
. Covariance matrices do not lie on Euclidean space, therefore we use a distance metric involving generalized eigenvalues which also follows from the Lie group structure of positive definite matrices. Feature matching is a simple nearest neighbor search under the distance metric and performed extremely
Filterbankbased fingerprint matching
 IEEE TRANSACTIONS ON IMAGE PROCESSING
, 2000
"... With identity fraud in our society reaching unprecedented proportions and with an increasing emphasis on the emerging automatic personal identification applications, biometricsbased verification, especially fingerprintbased identification, is receiving a lot of attention. There are two major shor ..."
Abstract

Cited by 219 (26 self)
 Add to MetaCart
of unregistered minutiae points. The proposed filterbased algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence
Results 1  10
of
1,586