Supervised Assessment of Segmentation Hierarchies
This paper addresses the problem of the supervised assessment of hierarchical region-based image representations. Given the large amount of partitions represented in such structures, the supervised assessment approaches in the literature are based on selecting a reduced set of representative partitions and evaluating their quality. Assessment results, therefore, depend on the partition selection strategy used. Instead, we propose to find the partition in the tree that best matches the ground-truth partition, that is, the upper-bound partition selection. We show that different partition selection algorithms can lead to different conclusions regarding the quality of the assessed trees and that the upper-bound partition selection provides the following advantages: 1) it does not limit the assessment to a reduced set of partitions, and 2) it better discriminates the random trees from actual ones, which reflects a better qualitative behavior. We model the problem as a Linear Fractional Combinatorial Optimization (LFCO) problem, which makes the upper-bound selection feasible and efficient.
KeywordsGround Truth Random Tree Boundary Pixel Boundary Match Quad Tree
Unable to display preview. Download preview PDF.
- 3.Cardelino, J., Caselles, V., Bertalmio, M., Randall, G.: A contrario hierarchical image segmentation. In: IEEE International Conference on Image Processing, pp. 4041–4044 (2009)Google Scholar
- 6.Pont-Tuset, J., Marques, F.: Contour detection using binary partition trees. In: IEEE International Conference on Image Processing, pp. 1609–1612 (2010)Google Scholar
- 10.Radzik, T.: Newton’s method for fractional combinatorial optimization. In: Symposium on Foundations of Computer Science, pp. 659–669 (1992)Google Scholar