Variational Methods in Image Segmentation
Birkhäuser Boston eBooksPublished 1 January 1995
Jean‐Michel Morel, Sergio Solimini
Citations622
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This book contains both a synthesis and mathematical analysis of a wide set of algorithms and theories whose aim is the automatic segmen tation of digital images as well as the understanding of visual
Keywords
Computer Science
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
MIT Press eBooksGeometric invariance in computer vision
1,022 Citations1992Joseph L. Mundy, Andrew Zisserman
Part 1 foundations: algebraic invariants - invariant theory and enumerative combinatorics of young tableaux, and applications: transformation invariant indexing and invariant linear methods in photogrammetry and model-matching.
Acta Applicandae MathematicaeVariational problems in SBV and image segmentation
94 Citations1989Luigi Ambrosio
This paper shows how it is possible to prove the existence of solutions of the Mumford-Shah image segmentation functional F(u,K) and deals with the regularity of minimizers and the approximation of F by elliptic functionals defined on Sobolev spaces.
Indexing visual representations through the complexity map
16 Citations2002Benoit Dubuc, Steven W. Zucker
A formal complexity theory of curves is proposed appropriate for computational vision in general and for problems like separating straight lines from jumbles in particular, and the theory is applied to the problem of perceptual grouping.