Abstract

Linear or Gaussian scale space is a well known multi-scale representation for continuous signals. However, implementational issues arise, caused by discretization and quantization errors. In order to develop more robust scale space based algorithms, the discrete nature of computer processed signals has to be taken into account. Aiming at a computationally practicable implementation of the discrete scale space framework we used suitable neighborhoods, boundary conditions and sampling methods. In analogy to prevalent approaches, a discretized diffusion equation is derived from the continuous scale space axioms adapted to discrete two-dimensional images or signals, including requirements imposed by the chosen neighborhood and boundary condition. The resulting discrete scale space respects important topological invariants such as the Euler number, a key criterion for the successful implementation of algorithms operating on its deep structure. In this paper, relevant and promising properties of the discrete diffusion equation and the eigenvalue decomposition of its Laplacian kernel are discussed and a fast and robust sampling method is proposed. One of the properties leads to Laplacian eigenimages in scale space: Taking a reduced set of images can be considered as a way of applying a discrete Gaussian scale space.

Keywords

Diffusion Equation Heat Kernel Scale Space Laplacian Matrix Euler Number 
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.

References

  1. 1.
    Viola, P., Jones, M.: Robust real-time object detection. IJCV (2001)Google Scholar
  2. 2.
    Kuijper, A.: Exploring and exploiting the structure of saddle points in gaussian scale space. Computer Vision and Image Understanding 112(3), 337–349 (2008)CrossRefGoogle Scholar
  3. 3.
    Lindeberg, T.: Discrete Scale-Space Theory and the Scale-Space Primal Sketch. PhD thesis, Royal Institute of Technology (1991)Google Scholar
  4. 4.
    Kuijper, A.: On detecting all saddle points in 2D images. Pattern Recognition Letters 25(15), 1665–1672 (2004)CrossRefGoogle Scholar
  5. 5.
    Kuijper, A., Florack, L.M.J.: Understanding and Modeling the Evolution of Critical Points under Gaussian Blurring. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol. 2350, pp. 143–157. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Kuijper, A., Florack, L.M.J.: The Relevance of Non-generic Events in Scale Space Models. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol. 2350, pp. 190–204. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Tschirsich, M., Kuijper, A.: A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction. In: S+SSPR 2012, vol. 7626, pp. 124–132. Springer, Heidelberg (2012)Google Scholar
  8. 8.
    Witkin, A.P.: Scale-space filtering. In: Proc. 8th Int. Joint Conf. Art. Intell., pp. 1019–1022. Karlsruhe, Germany (August 1983)Google Scholar
  9. 9.
    Koenderink, J.J.: The structure of images. Biological Cybernetics 50, 363–370 (1984)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Weickert, J., Ishikawa, S., Imiya, A.: Scale-space has been discovered in Japan. Technical report, Department of Computer Science, University of Copenhagen (August 1997)Google Scholar
  11. 11.
    Iijima, T.: Basic theory on normalization of a pattern (in case of typical one-dimensional pattern). Bulletin of Electrical Laboratory, 368–388 (1962)Google Scholar
  12. 12.
    Tschirsich, M.: The discrete scale space as a base for robust scale space algorithms. Technical report, Department of Computer Science, Technical University of Darmstadt (June 2012)Google Scholar
  13. 13.
    Hancock, E.R., Wilson, R.C.: Pattern analysis with graphs: Parallel work at Bern and York. Pattern Recognition Letters 33(7), 833–841 (2012)CrossRefGoogle Scholar
  14. 14.
    Xiao, B., Hancock, E.R., Wilson, R.C.: Geometric characterization and clustering of graphs using heat kernel embeddings. Image Vision Comput. 28(6), 1003–1021 (2010)MATHCrossRefGoogle Scholar
  15. 15.
    Xiao, B., Hancock, E.R., Wilson, R.C.: Graph characteristics from the heat kernel trace. Pattern Recognition 42(11), 2589–2606 (2009)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Martin Tschirsich
    • 1
  • Arjan Kuijper
    • 1
    • 2
  1. 1.Technische Universität DarmstadtGermany
  2. 2.Fraunhofer IGDDarmstadtGermany

Personalised recommendations