The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Lazy Random Walks for Superpixel Segmentation
Abstract
We present a novel image superpixel segmentation approach using the proposed lazy random walk (LRW) algorithm in this paper. Our method begins with initializing the seed positions and runs the LRW algorithm on the input image to obtain the probabilities of each pixel. Then, the boundaries of initial superpixels are obtained according to the probabilities and the commute time. The initial superpixels are iteratively optimized by the new energy function, which is defined on the commute time and the texture measurement. Our LRW algorithm with self-loops has the merits of segmenting the weak boundaries and complicated texture regions very well by the new global probability maps and the commute time strategy. The performance of superpixel is improved by relocating the center positions of superpixels and dividing the large superpixels into small ones with the proposed optimization algorithm. The experimental results have demonstrated that our method achieves better performance than previous superpixel approaches.
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
Multiresolution gray-scale and rotation invariant texture classification with local binary patterns
Ojala, T., Pietikainen, M., & Maenpaa, T. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017623 · Cited by 15,398
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Efficient Graph-Based Image Segmentation
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000022288.19776.77 · Cited by 6,176
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
Learning a classification model for segmentation
Ren, & Malik (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238308 · Cited by 1,765
TurboPixels: Fast Superpixels Using Geometric Flows
Levinshtein, A., Stere, A., Kutulakos, K. N., Fleet, D. J., Dickinson, S. J., & Siddiqi, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.96 · Cited by 1,146
Entropy rate superpixel segmentation
Liu, M.-Y., Tuzel, O., Ramalingam, S., & Chellappa, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995323 · Cited by 1,026
Reversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 946
Fundamentals of Matrix Computations.
S., G. W., & Watkins, D. S. (1992) · Mathematics of Computation · doi:10.2307/2153000 · Cited by 856
Random Walk: A Modern Introduction
Lawler, G. F., & Limic, V. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511750854 · Cited by 796
A kernel view of the dimensionality reduction of manifolds
Ham, J., Lee, D. D., Mika, S., & Schölkopf, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015417 · Cited by 532
Recovering human body con .gurations:combining segmentation and recognition
Mori, G., Ren, X., Efros, A. A., & Malik, J. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315182 · Cited by 507
Superpixels and Supervoxels in an Energy Optimization Framework
Veksler, O., Boykov, Y., & Mehrani, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_16 · Cited by 443
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
Moore, A. P., Prince, S. J. D., Warrell, J., Mohammed, U., & Jones, G. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587471 · Cited by 380
Power Watershed: A Unifying Graph-Based Optimization Framework
Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.200 · Cited by 305
Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0191-z · Cited by 304
Segmentation using superpixels: A bipartite graph partitioning approach
Li, Z., Wu, X.-M., & Chang, S.-F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247750 · Cited by 292
Sinop, A. K., & Grady, L. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408927 · Cited by 277
Isoperimetric graph partitioning for image segmentation
Grady, L., & Schwartz, E. L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.57 · Cited by 272
Grady, L. J., & Polimeni, J. R. (2010) · Springer eBooks · doi:10.1007/978-1-84996-290-2 · Cited by 230
Random Walks on Graphs for Salient Object Detection in Images
Gopalakrishnan, V., Hu, Y., & Rajan, D. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2053940 · Cited by 178
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
Yang, W., Cai, J., Zheng, J., & Luo, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2048611 · Cited by 140
Learning from Labeled and Unlabeled Data Using Random Walks
Zhou, D., & Schölkopf, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28649-3_29 · Cited by 139
Superpixels via pseudo-Boolean optimization
Zhang, Y., Hartley, R. I., Mashford, J., & Burn, S. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126393 · Cited by 113
VCells: Simple and Efficient Superpixels Using Edge-Weighted Centroidal Voronoi Tessellations
Wang, J., & Wang, X. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.47 · Cited by 108
“Lattice Cut” - Constructing superpixels using layer constraints
Moore, A. P., Prince, S. J. D., & Warrell, J. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5539890 · Cited by 79
TurboPixel Segmentation Using Eigen-Images
Xiang, S., Pan, C., Nie, F., & Zhang, C. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2052268 · Cited by 32
Segmentation of Stochastic Images With a Stochastic Random Walker Method
Pätz, T., & Preußer, T. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2187531 · Cited by 25
Cited by
Video Salient Object Detection via Fully Convolutional Networks
Wang, W., Shen, J., & Shao, L. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2754941 · Cited by 642
Self-citationDeep Visual Attention Prediction
Wang, W., & Shen, J. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2787612 · Cited by 585
Self-citationSuperpixels: An evaluation of the state-of-the-art
Stutz, D., Hermans, A., & Leibe, B. (2018) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2017.03.007 · Cited by 538
Real-Time Superpixel Segmentation by DBSCAN Clustering Algorithm
Shen, J., Hao, X., Liang, Z., Liu, Y., Wang, W., & Shao, L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2616302 · Cited by 384
Self-citationRandom Walks: A Review of Algorithms and Applications
Xia, F., Liu, J., Nie, H., Fu, Y., Wan, L., & Kong, X. (2020) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2019.2952908 · Cited by 295
Metadata
- Authors
- Shen, J., Du, Y., Wang, W., & Li, X.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2014-04
- Volume
- 23
- Issue
- 4
- Pages
- 1451-1462
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2108424265
- Cited by
- 339
- References
- 32
- FWCI
- 26.11
- 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.