2009 | OriginalPaper | Buchkapitel
An Improved Shock Graph-Based Edit Distance Approach Using an Adaptive Weighting Scheme
verfasst von : Solima Khanam, Seok Woo Jang, Woojin Paik
Erschienen in: Communication and Networking
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Matching and recognition of shape is one of the important issues in the field of image processing. In this paper, we focus on one of the skeleton based representations of shapes, called
shock based
representation. For the matching part, to find the best correspondence between two shapes, we will apply
edit cost
measure with taking into consideration the weights of the shock points of the skeleton. This reduces the number of sample points as well as the computational complexity and gives the correct match in the presence of some visual transformations. Here we consider the binary shape as a simple closed curve for unrooted graph. We will investigate the previous results of different skeleton based approaches to realize why the improvement on shock graph based approach is necessary to recognize and classify shapes efficiently.