Abstract
Linear or Gaussian scale space is a well known multi-scale representation for continuous signals. The exploration of its so-called deep structure by tracing critical points over scale has various theoretical applications and allows for the construction of a scale space hierarchy tree. 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 investigated suitable neighborhoods, boundary conditions and sampling methods. We show that 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. We discuss promising properties of topological graphs under the influence of smoothing, setting the stage for more robust deep structure extraction algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
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
Kanters, F., Florack, L., Duits, R., Platel, B., ter Haar Romeny, B.: Scalespaceviz: a-scale spaces in practice. Pattern Recognition and Image Analysis 17, 106–116 (2007)
Lindeberg, T.: Discrete Scale-Space Theory and the Scale-Space Primal Sketch. PhD thesis, Royal Institute of Technology (1991)
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)
Scott, P.J.: An algorithm to extract critical points from lattice height data. International Journal of Machine Tools and Manufacture 41(13-14), 1889–1897 (2001)
Takahashi, S., Ikeda, T., Shinagawa, Y., Kunii, T.L., Ueda, M.: Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data. Computer Graphics Forum 14(3), 181–192 (1995)
Perez, A.: Determining the genus of a graph. HC Mathematics Review 1(2), 4–13 (2007)
Kovalevsky, V.A.: Discrete topology and contour definition. Pattern Recognition Letters 2(5), 281–288 (1984)
Kuijper, A.: On detecting all saddle points in 2d images. Pattern Recognition Letters 25(15), 1665–1672 (2004)
Koenderink, J.J.: The structure of images. Biological Cybernetics 50, 363–370 (1984)
Weickert, J., Ishikawa, S., Imiya, A.: Scale-space has been discovered in japan. Technical report, Department of Computer Science, University of Copenhagen (August 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tschirsich, M., Kuijper, A. (2012). A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction. In: Gimel’farb, G., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2012. Lecture Notes in Computer Science, vol 7626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34166-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-34166-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34165-6
Online ISBN: 978-3-642-34166-3
eBook Packages: Computer ScienceComputer Science (R0)