An Iterative Boundary Random Walks Algorithm for Interactive Image Segmentation
The interactive image segmentation algorithm can provide an intelligent ways to understand the intention of user input. Many interactive methods have the problem of that ask for large number of user input. To efficient produce intuitive segmentation under limited user input is important for industrial application. In this paper, we reveal a positive feedback system on image segmentation to show the pixels of self-learning. Two approaches, iterative random walks and boundary random walks, are proposed for segmentation potential, which is the key step in feedback system. Experiment results on image segmentation indicates that proposed algorithms can obtain more efficient input to random walks. And higher segmentation performance can be obtained by applying the iterative boundary random walks algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
Image SegmentationSegmentationSelf-LearningSemantic SegmentationSimilar Papers 제목 키워드 기반
Robust Saliency Detection via Regularized Random Walks Ranking
In the field of saliency detection, many graph-based algorithms heavily depend on the accuracy of the pre-processed superpixel segmentation, which leads to significant sacrifice of detail information from the input image…
Saliency DetectionRandom Walks: A Review of Algorithms and Applications
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer…
Link PredictionNetwork EmbeddingEfficient and Local Parallel Random Walks
Random walks are a fundamental primitive used in many machine learning algorithms with several applications in clustering and semi-supervised learning. Despite their relevance, the first efficient parallel algorithm to c…
ClusteringOn the Emergence of Shortest Paths by Reinforced Random Walks
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this cont…
Leveraging History for Faster Sampling of Online Social Networks
With a vast amount of data available on online social networks, how to enable efficient analytics over such data has been an increasingly important research problem. Given the sheer size of such social networks, many exi…