Grouping objects in multi-band images using an improved eigenvector-based algorithm

Spectral clustering algorithms have attracted considerable attention in recent years. However, a problem still exists. These approaches are too slow to scale to large problem sizes. This paper aims at addressing a coarsening algorithm for efficiently grouping large-dataset objects within multi-band images. The coarsening algorithm is based on random graph theory, and it proceeds by combining local homogeneous resolution cells into a set of irregular blocks so the spectral clustering algorithms run efficiently at some coarse level. For multi-band images, we formulate the similarity between pairwise objects as a novel normalized expression and reformulate it in the form of a matrix so that we can implement our algorithm in a few lines using IDL. Finally, we illustrate two examples in agriculture which confirm the effectiveness and efficiency of the proposed algorithm.

[1]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Charles J. Alpert,et al.  Spectral Partitioning: The More Eigenvectors, The Better , 1995, 32nd Design Automation Conference.

[3]  Jan Poland,et al.  Amplifying the Block Matrix Structure for Spectral Clustering. , 2005 .

[4]  Piotr Indyk.  A sublinear time approximation scheme for clustering in metric spaces , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[5]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[6]  Anders P. Eriksson,et al.  Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints , 2007, ICCV.

[7]  Sudeep Sarkar,et al.  Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[9]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Anderson Rocha,et al.  A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures , 2006, ACIVS.

[12]  David B. Shmoys,et al.  A constant-factor approximation for the k-median problem , 1999 .

[13]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[14]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[16]  Adrian Barbu,et al.  Graph partition by Swendsen-Wang cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[17]  Andrew B. Kahng,et al.  Spectral Partitioning with Multiple Eigenvectors , 1999, Discret. Appl. Math..

[18]  Abraham Duarte,et al.  Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic , 2006, Pattern Recognit. Lett..

[19]  Jianbo Shi,et al.  Spectral segmentation with multiscale graph decomposition , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[20]  Ronen Basri,et al.  Fast multiscale image segmentation , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[21]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  Stella X. Yu.  Segmentation using multiscale cues , 2004, CVPR 2004.

[23]  A.A. Alatan,et al.  Region-based image segmentation via graph cuts , 2008, 2008 IEEE 16th Signal Processing, Communication and Applications Conference.

[24]  A. Frieze,et al.  A simple heuristic for the p-centre problem , 1985 .