Lazy Random Walks for Superpixel Segmentation

DOI10.1109/TIP.2014.2302892MaRDI QIDQ4592115zbMATH OpenOpenAlexDBLPWikidataFDO

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

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(10)

• Spatiotemporal road scene reconstruction using superpixel-based Markov random field
• Fast marching based superpixels generation
• Robust interactive image segmentation via graph-based manifold ranking
• Chan-Vese reformulation for selective image segmentation
• Multi-layer graph constraints for interactive image segmentation via game theory
• Grover search with lackadaisical quantum walks
• Lazy random walks on pseudofractal scale-free web with a perfect trap
• A novel image segmentation algorithm based on continuous-time quantum walk using superpixels
• Impact of local navigation rules on biased random walks in multiplex Markov chains
• Anderson-like localization transition of random walks with resetting

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)