The DOI matches its Crossref record.
Local Histogram Based Segmentation Using the Wasserstein Distance
Open accessAbstract
We propose and analyze a nonparametric region-based active contour model for segmenting cluttered scenes. The proposed model is unsupervised and assumes pixel intensity is independently identically distributed. Our proposed energy functional consists of a geometric regularization term that penalizes the length of the partition boundaries and a region-based image term that uses histograms of pixel intensity to distinguish different regions. More specifically, the region data encourages segmentation so that local histograms within each region are approximately homogeneous. An advantage of using local histograms in the data term is that histogram differentiation is not required to solve the energy minimization problem. We use Wasserstein distance with exponent 1 to determine the dissimilarity between two histograms. The Wasserstein distance is a metric and is able to faithfully measure the distance between two histograms, compared to many pointwise distances. Moreover, it is insensitive to oscillations, and therefore our model is robust to noise. A fast global minimization method based on (Chan et al. in SIAM J. Appl. Math. 66(5):1632–1648, 2006 ; Bresson et al. in J. Math. Imaging Vis. 28(2):151–167, 2007 ) is employed to solve the proposed model. The advantages of using this method are two-fold. First, the computational time is less than that of the method by gradient descent of the associated Euler-Lagrange equation (Chan et al. in Proc. of SSVM, pp. 697–708, 2007 ). Second, it is able to find a global minimizer. Finally, we propose a variant of our model that is able to properly segment a cluttered scene with local illumination changes.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 857
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Automatic 3D liver location and segmentation via convolutional neural network and graph cut
Lu, F., Wu, F., Hu, P., Peng, Z., & Kong, D. (2017) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-016-1467-3 · Cited by 284
“here W(1)(·, ·) is the L1 Wasserstein distance [26].”
Background
Metadata
- Authors
- Ni, K., Bresson, X., Chan, T., & Esedoglu, S.
- Venue
- International Journal of Computer Vision
- Published
- 2009-04-04
- Volume
- 84
- Issue
- 1
- Pages
- 97-111
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2019393228
- Cited by
- 237
- References
- 0
- FWCI
- 19.42
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Local Histogram Based Segmentation Using the Wasserstein Distance. https://app.cochat.ai/papers/10.1007/s11263-009-0234-0
- The paper
- Ni, K., Bresson, X., Chan, T., & Esedoglu, S. (2009). Local Histogram Based Segmentation Using the Wasserstein Distance. International Journal of Computer Vision. https://doi.org/10.1007/s11263-009-0234-0
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.