Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1008482
Jump to:navigation, search

DOI10.1007/s00138-007-0090-2zbMath1331.68232OpenAlexW2108340412MaRDI QIDQ1008482

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


zbMATH Keywords

image segmentationgraph cutsdivisive partitioningmultiple active contours


Mathematics Subject Classification ID

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


Related Items (3)

Hierarchical vibrations for part-based recognition of complex objects ⋮ Color-texture segmentation using unsupervised graph cuts ⋮ Image segmentation by a contrario simulation


Uses Software

  • BSDS
  • GrabCut


Cites Work

  • Geodesic active contours
  • A multiphase level set framework for image segmentation using the Mumford and Shah model
  • Active contours without edges
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1008482&oldid=13002640"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 21:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki