Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy

Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, they often contain more data than is required for an efficient description. This paper shows Laplacian graph energy is a generic measure that can be used to identify semantic structures within hierarchies, independently of the algorithm that produces them. Quantitative experimental validation using hierarchies from two state of art algorithms show we can reduce the number of levels and regions in a hierarchy by an order of magnitude with little or no loss in performance when compared against human produced ground truth. We provide a tracking application that illustrates the value of reduced hierarchies.

• Type: Conference
• Year: 2010
• Where: ECCV
• Keywords: Computer Vision, ECCV 2010, Hierarchies, Laplacian Graph Energy, Many Segmentation Algorithms