Sabih H. Gerez

Learn More
An important step in an automatic fingerprint recognition system is the segmentation of fingerprint images. The task of a fingerprint segmentation algorithm is to decide which part of the image belongs to the foreground, originating from the contact of a fingertip with the sensor, and which part to the background, which is the noisy area at the borders of(More)
This paper presents a novel minutiae matching method that describes elastic distortions in 4ngerprints by means of a thin-plate spline model, which is estimated using a local and a global matching stage. After registration of the 4ngerprints according to the estimated model, the number of matching minutiae can be counted using very tight matching(More)
In a fingerprint identification system, a person is identified only by his fingerprint. To accomplish this, a database is searched by matching all entries to the given fingerprint. However, the maximum size of the database is limited, since each match takes some amount of time and has a small probability of error. A solution to this problem is to reduce the(More)
In this paper, a correlation-based fingerprint verification system is presented. Unlike the traditional minutiae-based systems, this system directly uses the richer gray-scale information of the fingerprints. The correlation-based fingerprint verification system first selects appropriate templates in the primary fingerprint, uses template matching to locate(More)
This paper discusses a new method, based on the principal component analysis, to estimate the directional field of fingerprints. The method not only computes the direction in any pixel location, but its coherence as well. It will be proven that this method provides exactly the same results as the method that is known from literature. Undoubtedly, the(More)
This paper considers the scheduling of homogeneous synchronous data-flow graphs also called iterative data-flow graphs (IDFGs) on a multiprocessor system. Algorithms described by such graphs consist of a core computation that is iterated “infinitely often”. The computation does not contain data-dependent decisions. All scheduling decisions for such(More)
Sequential read-write memories (SRWMs) are RAMs without an address decoder. A shift register is used instead to point at subsequent memory locations. SRWMs consume less power than RAMs of the same size. Algorithms are presented to check whether a set of storage values fits in a single SRWM and to automatically map storage values in as few SRWMs as possible.(More)