World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A REGION TREE BASED IMAGE DISCRETE LABELING FRAMEWORK

    https://doi.org/10.1142/9789814273398_0007Cited by:0 (Source: Crossref)
    Abstract:

    In this chapter, we present a region-tree based framework for general image discrete labeling problems. In particular, the input image is represented as a tree of over-segmented regions and the labeling problem is solved by optimizing an energy function defined on such a region-tree using dynamic programming (DP). By using the over-segmentation based region-tree as image representation, our framework combines the advantages of enabling labeling primitives that contain more information with a large support area compared to that of the pixel based approaches with a small support area and of reducing the risk of propagating segmentation errors into the labeling process compared to the layer based approaches. The region-tree representation further enables the use of fast DP optimization and enhances the performance by avoiding the use of smoothness constraints crossing discontinuities between adjacent labeling primitives. Variants such as coarse-to-fine region-tree and temporal region-tree are also developed for different applications such as binocular stereo matching, optical flow estimation and multi-view space-time consistent video depth recovery. The corresponding experimental evaluations have shown that our proposed framework is very effective and produces promising results.