Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Improved Data Structures for Fast Region Merging Segmentation Using a Mumford-Shah Energy Functional

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Crisp, D.J. ; Surveillance & Reconnaissance Div., Defence Sci. Technol. Organ., Edinburgh, SA

One of the more successful approaches to image segmentation involves formulating the problem as the minimisation of a Mumford-Shah functional and then applying region merging algorithms to approximate the minimiser. Moreover, it can be proved mathematically that such segmentations have desirable properties, and further, fast implementations are available. In this paper, we describe improvements to one such algorithm, the full lambda-schedule segmentation algorithm (FLSA). The FLSA maintains a list of merge costs (as measured by the Mumford-Shah functional) for all relevant pairs of neighbouring regions and at each step selects the best pair to merge from the list. This is done quickly and efficiently through the use sophisticated data structures. We present significant improvements to those data structures which further simplify the maintenance of the merge cost list. The new algorithm makes use of a new list, the edge list, which allows the regions neighbouring a newly merged pair to be searched more efficiently. Owing to a change in the way "multiple boundaries'' are handled, the new segmentations may differ slightly from the old ones but we argue that they are equally valid. We refer to the new algorithm as the FLSA Edge List (FLSA-EL) algorithm.

Published in:

Digital Image Computing: Techniques and Applications (DICTA), 2008

Date of Conference:

1-3 Dec. 2008