FLIC: Fast linear iterative clustering with active search
Abstract In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm called “active search” which explicitly considers neighbor continuity. Based on this search method, we design a back-and-forth traversal strategy and a...
Main Authors: | Jiaxing Zhao, Ren Bo, Qibin Hou, Ming-Ming Cheng, Paul Rosin |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2018-10-01
|
Series: | Computational Visual Media |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41095-018-0123-y |
Similar Items
-
A Practical GrabCut Color Image Segmentation Based on Bayes Classification and Simple Linear Iterative Clustering
by: Dayong Ren, et al.
Published: (2017-01-01) -
A Solution to the Back and Forth Problem in the Design Space Forming Process: A Method to Convert Time Issue to Space Issue
by: Taura, Toshiharu
Published: (2008-03-01) -
When Preparing Veterinary Patients for Surgery Is the Friction (Back and Forth) Method of Scrubbing the Skin More Effective Than Concentric Circles at Reducing Bacterial Levels on the Skin?
by: Alison Claire Mann
Published: (2018-04-01) -
Spectral Clustering Algorithm Based on Fast Search of Natural Neighbors
by: Mengshi Yuan, et al.
Published: (2020-01-01) -
Automatic Smoke Detection Based on SLIC-DBSCAN Enhanced Convolutional Neural Network
by: Dali Sheng, et al.
Published: (2021-01-01)