NDLI: Beyond connecting the dots: A polynomial-time algorithm for segmentation and boundary estimation with imprecise user input

Content Provider	IEEE Xplore Digital Library
Author	Windheuser, T. Schoenemann, T. Cremers, D.
Copyright Year	2009
Description	Author affiliation: Department of Computer Science, University of Bonn, Germany (Windheuser, T.; Schoenemann, T.; Cremers, D.)
Abstract	We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to existing algorithms which impose that the segmenting boundary passes through these points, our algorithm allows an imprecision in the user input. An energy minimization approach imposes that the segmenting boundary optimally passes along high-contrast edges in such a way that at least one point along the computed boundary is as close as possible to any given attraction point. In this sense, the user input can be seen as a soft constraint. We prove that the resulting optimization problem is NP-hard. We prove that in the case that the user attraction points are ordered, then optimal solutions can be computed in polynomial time using a shortest path formulation in an appropriately constructed four-dimensional graph spanned by the image pixels, a set of tangent angles and the user attraction points. Experimental results on a variety of images demonstrate that good quality segmentations can be obtained with a few imprecise user clicks.
Starting Page	717
Ending Page	722
File Size	1465228
Page Count	6
File Format	PDF
ISBN	9781424444205
ISSN	15505499
DOI	10.1109/ICCV.2009.5459281
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-09-29
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Joining processes Polynomials Image segmentation Pixel Computer vision Computer science Layout Level set Labeling Degradation
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Beyond connecting the dots: a polynomial-time algorithm for segmentation and boundary estimation with imprecise user input.

Region Classification with Markov Field Aspect Models

Connecting modalities: Semi-supervised segmentation and annotation of images using unaligned text corpora

A Bayesian approach for image segmentation with shape priors

A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm

Tiered scene labeling with dynamic programming

Extracting and Labeling Boundary Segments in Natural Scenes

Real-time Planar Surface Segmentation in Disparity Space

A region based stereo matching algorithm using cooperative optimization

Beyond connecting the dots: A polynomial-time algorithm for segmentation and boundary estimation with imprecise user input

Similar Documents

Beyond connecting the dots: a polynomial-time algorithm for segmentation and boundary estimation with imprecise user input.

Region Classification with Markov Field Aspect Models

Connecting modalities: Semi-supervised segmentation and annotation of images using unaligned text corpora

A Bayesian approach for image segmentation with shape priors

A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm

Tiered scene labeling with dynamic programming

Extracting and Labeling Boundary Segments in Natural Scenes

Real-time Planar Surface Segmentation in Disparity Space

A region based stereo matching algorithm using cooperative optimization

Beyond connecting the dots: A polynomial-time algorithm for segmentation and boundary estimation with imprecise user input