The Eccentricity Transform (of a Digital Shape)
Eccentricity measures the shortest length of the paths from a given vertex v to reach any other vertex w of a connected graph. Computed for every vertex v it transforms the connectivity structure of the graph into a set of values. For a connected region of a digital image it is defined through its neighbourhood graph and the given metric. This transform assigns to each element of a region a value that depends on it’s location inside the region and the region’s shape. The definition and several properties are given. Presented experimental results verify its robustness against noise, and its increased stability compared to the distance transform. Future work will include using it for shape decomposition, representation, and matching.
KeywordsRoot Mean Square Error Short Path Noisy Image Connected Region Pepper Noise
Unable to display preview. Download preview PDF.
- 2.Siddiqi, K., Shokoufandeh, A., Dickinson, S., Zucker, S.W.: Shock graphs and shape matching. International Journal of Computer Vision 30, 1–24 (1999)Google Scholar
- 4.Mori, G.: Guiding model search using segmentation. In: ICCV, pp. 1417–1423 (2005)Google Scholar
- 9.Gorelick, L., Galun, M., Sharon, E., Basri, R., Brandt, A.: Shape representation and classification using the poisson equation. In: CVPR (2), pp. 61–67 (2004)Google Scholar
- 15.Buckley, F., Harary, F.: Distances in Graphs. Addison-Wesley Publishing Company, Reading (1990)Google Scholar