The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A Level Set Approach to Image Segmentation With Intensity Inhomogeneity
Abstract
It is often a difficult task to accurately segment images with intensity inhomogeneity, because most of representative algorithms are region-based that depend on intensity homogeneity of the interested object. In this paper, we present a novel level set method for image segmentation in the presence of intensity inhomogeneity. The inhomogeneous objects are modeled as Gaussian distributions of different means and variances in which a sliding window is used to map the original image into another domain, where the intensity distribution of each object is still Gaussian but better separated. The means of the Gaussian distributions in the transformed domain can be adaptively estimated by multiplying a bias field with the original signal within the window. A maximum likelihood energy functional is then defined on the whole image region, which combines the bias field, the level set function, and the piecewise constant function approximating the true image signal. The proposed level set method can be directly applied to simultaneous segmentation and bias correction for 3 and 7T magnetic resonance images. Extensive evaluation on synthetic and real-images demonstrate the superiority of the proposed method over other representative algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177 · cited 2×
“The test images are first preprocessed by bilateral filtering [24] (see the top row of Fig.”
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
Pattern recognition and machine learning
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5091 · Cited by 2,650
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
Vese, L. A., & Chan, T. F. (2002) · International Journal of Computer Vision · doi:10.1023/a:1020874308076 · Cited by 2,384
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
Li, C., Xu, C., Gui, C., & Fox, M. D. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2069690 · Cited by 2,106
Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation
Zhu, S. C., & Yuille, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.537343 · Cited by 1,913
Li, C., Huang, R., Ding, Z., Gatenby, J. C., Metaxas, D. N., & Gore, J. C. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2146190 · Cited by 1,285
Localizing Region-Based Active Contours
Lankton, S., & Tannenbaum, A. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2004611 · Cited by 1,137
Cited by
Multilevel Color Image Segmentation Based on GLCM and Improved Salp Swarm Algorithm
Xing, Z., & Jia, H. (2019) · IEEE Access · doi:10.1109/access.2019.2904511 · Cited by 78
Metadata
- Authors
- Zhang, K., Zhang, L., Lam, K.-M., & Zhang, D.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-02
- Volume
- 46
- Issue
- 2
- Pages
- 546-557
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2080668963
- Cited by
- 408
- References
- 27
- FWCI
- 36.39
- Type
- journal article
- 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 Approach to Image Segmentation With Intensity Inhomogeneity. https://app.cochat.ai/papers/10.1109/tcyb.2015.2409119
- The paper
- Zhang, K., Zhang, L., Lam, K.-M., & Zhang, D. (2016). A Level Set Approach to Image Segmentation With Intensity Inhomogeneity. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2409119
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.