DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Image segmentation by hierarchial agglomeration of polygons using ecological statistics

Abstract

A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. Thismore » provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.

Inventors:
;
Issue Date:
Research Org.:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1083290
Patent Number(s):
8428354
Application Number:
12/822,059
Assignee:
Los Alamos National Security, LLC (Los Alamos, NM)
Patent Classifications (CPCs):
G - PHYSICS G06 - COMPUTING G06T - IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
DOE Contract Number:  
AC52-06NA25396
Resource Type:
Patent
Country of Publication:
United States
Language:
English
Subject:
36 MATERIALS SCIENCE

Citation Formats

Prasad, Lakshman, and Swaminarayan, Sriram. Image segmentation by hierarchial agglomeration of polygons using ecological statistics. United States: N. p., 2013. Web.
Prasad, Lakshman, & Swaminarayan, Sriram. Image segmentation by hierarchial agglomeration of polygons using ecological statistics. United States.
Prasad, Lakshman, and Swaminarayan, Sriram. Tue . "Image segmentation by hierarchial agglomeration of polygons using ecological statistics". United States. https://www.osti.gov/servlets/purl/1083290.
@article{osti_1083290,
title = {Image segmentation by hierarchial agglomeration of polygons using ecological statistics},
author = {Prasad, Lakshman and Swaminarayan, Sriram},
abstractNote = {A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. This provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Apr 23 00:00:00 EDT 2013},
month = {Tue Apr 23 00:00:00 EDT 2013}
}

Works referenced in this record: