Advertisement

Orientation Scanning to Improve Lossless Compression of Fingerprint Images

  • Johan Thärnå
  • Kenneth Nilsson
  • Josef Bigun
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2688)

Abstract

While standard compression methods available include complex source encoding schemes, the scanning of the image is often performed by a horizontal (row-by-row) or vertical scanning. In this work a new scanning method, called ridge scanning, for lossless compression of fingerprint images is presented. By using ridge scanning our goal is to increase the redundancy in data and thereby increase the compression rate.

By using orientations, estimated from the linear symmetry property of local neighbourhoods in the fingerprint, a scanning algorithm which follows the ridges and valleys is developed. The properties of linear symmetry are also used for a segmentation of the fingerprint into two parts, one part which lacks orientation and one that has it.

We demonstrate that ridge scanning increases the compression ratio for Lempel-Ziv coding as well as recursive Huffman coding with approximately 3% in average. Compared to JPEG-LS, using ridge scanning and recursive Huffman the gain is 10% in average.

Keywords

Local Orientation Compression Rate Fingerprint Image Lossless Compression Linear Symmetry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Bigun. Recognition of local symmetries in gray value images by harmonic functions. Ninth International Conference on Pattern Recognition, Rome, pages 345–347, 1988.Google Scholar
  2. [2]
    J. Bigun and G.H. Granlund. Optimal orientation detection of linear symmetry. In First International Conference on Computer Vision, ICCV (London), pages 433–438, Washington, DC., June 8–11 1987. IEEE Computer Society Press.Google Scholar
  3. [3]
    G. Randers-Pehrson et. al. PNG (Portable Network Graphics) Specification, Version 1.2. PNG Development Group, July 1999.Google Scholar
  4. [4]
    Fred Halsall. Data Communications, Computer Networks and Open Systems. Addison-Wesley, 1996.Google Scholar
  5. [5]
    D.A. Huffman. A method for the construction of minimum redundancy codes. Proc. IRE, 40:1098–1101, 1952.Google Scholar
  6. [6]
    John Håkon Husøy Karl Skretting and Sven Ole Aase. Improved huffman coding using recursive splitting. In NORSIG-99 conference 9–11 sep., 1999.Google Scholar
  7. [7]
    D. Maio, D. Maltoni, R. Cappelli, J. L. Wayman, and A.K. Jain. Fvc2000: Fingerprint verification competition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(3):402–412, March 2002.CrossRefGoogle Scholar
  8. [8]
    M Weinberger and G Seroussi. The LOCO-I Lossless Image Compression Algorithm: Principles and Standardization into JPEG-LS.Google Scholar
  9. [9]
    Jacob Ziv and Abraham Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3), may 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Johan Thärnå
    • 1
  • Kenneth Nilsson
    • 1
  • Josef Bigun
    • 1
  1. 1.School of Information Science, Computer and Electrical Engineering (IDE)Halmstad UniversityHalmstadSweden

Personalised recommendations