A new graph cut-based multiple active contour algorithm without initial contours and seed points

DOI10.1007/S00138-007-0090-2zbMATH Open1331.68232OpenAlexW2108340412MaRDI QIDQ1008482FDOQ1008482

Authors: J. Martínez 

Publication date: 30 March 2009

Published in: Machine Vision and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00138-007-0090-2

Recommendations

• Active contours without edges
• Geometric active contours without re-initialization for image segmentation
• Efficient graph-based image segmentation
• A global and local active contour model based on dual algorithm for image segmentation
• Segmentation of multi-channel image with Markov random field based active contour model

zbMATH Keywords

image segmentationgraph cutsdivisive partitioningmultiple active contours

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cites Work

• Title not available (Why is that?)
• Geodesic active contours
• Active contours without edges
• A multiphase level set framework for image segmentation using the Mumford and Shah model

Cited In (4)

• Hierarchical vibrations for part-based recognition of complex objects
• Color-texture segmentation using unsupervised graph cuts
• Image segmentation by a contrario simulation
• A new one-pass algorithm to detect region boundaries

Uses Software

• BSDS
• GrabCut

This page was built for publication: A new graph cut-based multiple active contour algorithm without initial contours and seed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008482)