20.01.2013 Views

Master Thesis - Department of Computer Science

Master Thesis - Department of Computer Science

Master Thesis - Department of Computer Science

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

features (gradient coherence, intensity mean, and intensity variance) are computed<br />

for each pixel, and a linear classifier associates the pixel with the background or<br />

the foreground. A supervised technique is used to learn the optimal parameters<br />

for the linear classifier for each specific acquisition sensor. A final morphological<br />

post-processing step [43] is performed to eliminate holes in both the foreground and<br />

background and to regularize the external silhouette <strong>of</strong> the fingerprint area. Their<br />

experimental results showed that this method provides accurate results; however, it’s<br />

computational complexity is markedly higher that most <strong>of</strong> the previously described<br />

block-wise approaches.<br />

2.2.1.2 Image Enhancement<br />

The goal <strong>of</strong> an enhancement algorithm is to improve the clarity <strong>of</strong> the ridge structures<br />

in the recoverable regions and mark the unrecoverable regions as too noisy for further<br />

processing.<br />

The most widely used technique technique for fingerprint image enhancement is<br />

based on contextual filters. In contextual filtering, the filter characteristics change<br />

according to the local context. In fingerprint enhancement, the context is <strong>of</strong>ten<br />

defined by the local ridge orientation and local ridge frequency. The methods proposed<br />

by O’ Gorman and Nickerson [90, 91] was one <strong>of</strong> the first to use contextual filtering.<br />

They defined a mother filter based on four main parameters <strong>of</strong> fingerprint images at a<br />

given resolution; minimum and maximum ridge width, and minimum and maximum<br />

valley width. The local ridge frequency is assumed constant and therefore, the context<br />

is defined only by the local ridge orientation.<br />

Sherlock, Monro, and Millard [110, 111] performed contextual filtering in the<br />

Fourier domain. The filter defined in the frequency domain is the function:<br />

H(ρ, θ) = Hradial(ρ).Hangle(θ), (2.19)<br />

where Hradial depends only on the local ridge spacing ρ = 1/f and Hangle depends<br />

only on the local ridge orientation θ. Both Hradial and Hangle are defined by bandpass<br />

filters.<br />

Hong, Wan, and Jain [49] proposed an effective method based on Gabor filters.<br />

Gabor filters have both frequency-selective and orientation-selective properties and<br />

27

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!