Finding stable salient contours

Authors:
Yuxuan Lan;Richard Harvey;Jose Roberto Perez Torres
Affiliations:
School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK;School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK;School of Computing Sciences, University of East Anglia, Norwich NR4 7TJ, UK
Venue:
Image and Vision Computing
Year:
2010

Citing 5
Cited 0

A Multiresolution Hierarchical Approach to Image Segmentation Based on Intensity Extrema

IEEE Transactions on Pattern Analysis and Machine Intelligence
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Video Google: A Text Retrieval Approach to Object Matching in Videos

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
A Comparison of Affine Region Detectors

International Journal of Computer Vision
Salient regions from scale-space trees

SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Methods for generating maximally stable extremal regions are generalized to make intensity trees. Such trees may be computed quickly, but they are large so there is a need to select useful nodes within the tree. Methods for simplifying the tree are developed and it is shown that standard confidence tests may be applied to regions identified as parent and child nodes in the tree. These tests provide a principled way to edit the tree and hence control its size. One of the algorithms for simplifying trees is able to reduce the tree size by at least 90% while retaining important nodes. Furthermore the tree can be parsed to identify salient contours which are presented as generalisations of maximally stable extremal regions.