The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Spectral Matting
Abstract
We present spectral matting: a new approach to natural image matting that automatically computes a basis set of fuzzy matting components from the smallest eigenvectors of a suitably defined Laplacian matrix. Thus, our approach extends spectral segmentation techniques, whose goal is to extract hard segments, to the extraction of soft matting components. These components may then be used as building blocks to easily construct semantically meaningful foreground mattes, either in an unsupervised fashion, or based on a small amount of user input.
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
Cites
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Self-Tuning Spectral Clustering
Zelnik‐Manor, L., & Perona, P. (2004) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,942
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015719 · Cited by 1,097
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Multiclass spectral clustering
Yu, & Shi (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238361 · Cited by 947
Cited by
An Augmented Lagrangian Method for Total Variation Video Restoration
Chan, S. H., Khoshabeh, R., Gibson, K. B., Gill, P. E., & Nguyen, T. Q. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2158229 · Cited by 488
A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408931 · Cited by 438
Interactive image segmentation by maximal similarity based region merging
Ning, J., Zhang, L., Zhang, D., & Wu, C. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2009.03.004 · Cited by 424
Unsupervised Learning of Image Segmentation Based on Differentiable Feature Clustering
Kim, W., Kanezaki, A., & Tanaka, M. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.3011269 · Cited by 258
Metadata
- Authors
- Levin, A., Rav Acha, A., & Lischinski, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2008-10
- Volume
- 30
- Issue
- 10
- Pages
- 1699-1712
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2293194425
- Cited by
- 297
- References
- 23
- FWCI
- 23.87
- 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
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.