Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 260

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

A level set algorithm for minimizing the Mumford-Shah functional in image processing

Chan, T.F., Vese, L.A. · 2002 · Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision

Abstract

We show how the piecewise-smooth Mumford-Shah segmentation problem can be solved using the level set method of Osher and Sethian (1988). The obtained algorithm can be simultaneously used to denoise, segment, detect-extract edges, and perform active contours. The proposed model is also a generalisation of a previous active contour model without edges, proposed by the authors in Chan et al., (2001), and of its extension to the case with more than two segments for piecewise-constant segmentation Chan et al., (2000). Based on the four color theorem, we can assume that in general, at most two level set functions are sufficient to detect and represent distinct objects of distinct intensities, with triple junctions, or T-junctions.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/vlsm.2001.938895

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 11 references

Cited by

See all 260

Metadata

Authors
Chan, T. F., & Vese, L. A.
Venue
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision
Published
2002-11-13
Pages
161-168
OpenAlex
W2096201928
Cited by
260
References
11
FWCI
10.26
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A level set algorithm for minimizing the Mumford-Shah functional in image processing. https://app.cochat.ai/papers/10.1109/vlsm.2001.938895
The paper
Chan, T. F., & Vese, L. A. (2002). A level set algorithm for minimizing the Mumford-Shah functional in image processing. Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision. https://doi.org/10.1109/vlsm.2001.938895

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.