Tschirsich, Martin ; Kuijper, Arjan (2012)
A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction.
Structural, Syntactic, and Statistical Pattern Recognition.
doi: 10.1007/978-3-642-34166-3_14
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2012 |
| Autor(en): | Tschirsich, Martin ; Kuijper, Arjan |
| Art des Eintrags: | Bibliographie |
| Titel: | A Discrete Scale Space Neighborhood for Robust Deep Structure Extraction |
| Sprache: | Englisch |
| Publikationsjahr: | 2012 |
| Verlag: | Springer, Berlin, Heidelberg, New York |
| Reihe: | Lecture Notes in Computer Science (LNCS); 7626 |
| Veranstaltungstitel: | Structural, Syntactic, and Statistical Pattern Recognition |
| DOI: | 10.1007/978-3-642-34166-3_14 |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Business Field: Digital society, Research Area: Generalized digital documents, Scale spaces, Discrete images, Digital image processing |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme |
| Hinterlegungsdatum: | 12 Nov 2018 11:16 |
| Letzte Änderung: | 12 Nov 2018 11:16 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum