#### Filter Results:

#### Publication Year

1999

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—Fingerprint indexing is a key technique in automatic fingerprint identification systems (AFIS). However, handling fingerprint distortion is still a problem. This paper concentrates on a more accurate fingerprint indexing algorithm that efficiently retrieves the top possible matching candidates from a huge database. To this end, we design a novel feature… (More)

This paper is concentrated on an accurate and efficient fingerprint indexing algorithm, which efficiently retrieves the top N possibly matched candidates from a huge database. In order to have ability of coping with distorted fingerprints, the proposed algorithm uses novel features, which are insensitive to distortion, formed by the Delau-nay triangulation… (More)

A new combinatorial characterization of a gray-tone image called Euler Vector is proposed. The Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformation of the image. The Euler vector comprises a 4-tuple, where each element is an integer representing the… (More)

Euler number of a binary image is a fundamental topological feature that remains invariant under translation, rotation , scaling, and rubber-sheet transformation of the image. In this work, a run-based method for computing Euler number is formulated and a new hardware implementation is described. Analysis of time complexity and performance measure is… (More)

A new combinatorial characterization of a gray-tone image called Euler Vector is proposed. Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformation of the image. Euler vector comprises of a 4-tuple, where each element is an integer representing the Euler… (More)

- Mridul Aanjaneya, Arijit Bishnu, Sudebkumar Prasant Pal
- 2008

We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈ n 2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal polygon from an arbitrary point inside it. Further, we derive… (More)