Lazy Random Walks for Superpixel Segmentation
From MaRDI portal
Publication:4592115
DOI10.1109/TIP.2014.2302892zbMATH Open1374.94338DBLPjournals/tip/ShenDWL14OpenAlexW2108424265WikidataQ51108693 ScholiaQ51108693MaRDI QIDQ4592115FDOQ4592115
Authors: Jianbing Shen, Yunfan du, Wenguan Wang, Xuelong Li 
Publication date: 20 November 2017
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tip.2014.2302892
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cited In (9)
- Fast marching based superpixels generation
- A novel image segmentation algorithm based on continuous-time quantum walk using superpixels
- Spatiotemporal road scene reconstruction using superpixel-based Markov random field
- Lazy random walks on pseudofractal scale-free web with a perfect trap
- Chan-Vese reformulation for selective image segmentation
- Impact of local navigation rules on biased random walks in multiplex Markov chains
- Robust interactive image segmentation via graph-based manifold ranking
- Grover search with lackadaisical quantum walks
- Multi-layer graph constraints for interactive image segmentation via game theory
This page was built for publication: Lazy Random Walks for Superpixel Segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592115)
