FLIC: Fast linear iterative clustering with active search
暂无分享,去创建一个
Ren Bo | Ming-Ming Cheng | Qibin Hou | Jia-Xin Zhao | Ming-Ming Cheng | Qibin Hou | Jiaxuan Zhao | Ren Bo
[1] Paria Mehrani,et al. Superpixels and Supervoxels in an Energy Optimization Framework , 2010, ECCV.
[2] Pascal Fua,et al. SLIC Superpixels Compared to State-of-the-Art Superpixel Methods , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Daniel P. Huttenlocher,et al. Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.
[4] Rama Chellappa,et al. Entropy rate superpixel segmentation , 2011, CVPR 2011.
[5] Dorin Comaniciu,et al. Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[6] Yong-Jin Liu,et al. Manifold SLIC: A Fast Method to Compute Content-Sensitive Superpixels , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[7] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[9] J. Sethian,et al. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .
[10] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[11] Charless C. Fowlkes,et al. Contour Detection and Hierarchical Image Segmentation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Eli Shechtman,et al. PatchMatch: a randomized correspondence algorithm for structural image editing , 2009, ACM Trans. Graph..
[13] Huchuan Lu,et al. Superpixel tracking , 2011, 2011 International Conference on Computer Vision.
[14] Laurent D. Cohen,et al. Geodesic Methods in Computer Vision and Graphics , 2010, Found. Trends Comput. Graph. Vis..
[15] Shi-Min Hu,et al. HFS: Hierarchical Feature Selection for Efficient Image Segmentation , 2016, ECCV.
[16] Luc Vincent,et al. Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..
[17] S. Osher,et al. Algorithms Based on Hamilton-Jacobi Formulations , 1988 .
[18] Hongsheng Xi,et al. Image Classification via Object-Aware Holistic Superpixel Selection , 2013, IEEE Transactions on Image Processing.
[19] VekslerOlga,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001 .
[20] Hongbin Zha,et al. Structure-sensitive superpixels via geodesic distance , 2011, ICCV.
[21] Jitendra Malik,et al. Learning a classification model for segmentation , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[22] Alexei A. Efros,et al. Automatic photo pop-up , 2005, SIGGRAPH 2005.
[23] Qiang Du,et al. Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..
[24] Sanja Fidler,et al. The Role of Context for Object Detection and Semantic Segmentation in the Wild , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.
[25] Peer Neubert,et al. Superpixel Benchmark and Comparison , 2012 .
[26] Sven J. Dickinson,et al. TurboPixels: Fast Superpixels Using Geometric Flows , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[27] Luc Van Gool,et al. The 2005 PASCAL Visual Object Classes Challenge , 2005, MLCW.
[28] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[29] Luc Van Gool,et al. SEEDS: Superpixels Extracted via Energy-Driven Sampling , 2012, ECCV.
[30] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.