A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction
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.
KeywordsDeep Structure Scale Space Euler Number Topological Graph Discrete Signal
- 2.Lindeberg, T.: Discrete Scale-Space Theory and the Scale-Space Primal Sketch. PhD thesis, Royal Institute of Technology (1991)Google Scholar
- 3.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
- 6.Perez, A.: Determining the genus of a graph. HC Mathematics Review 1(2), 4–13 (2007)Google Scholar
- 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