Abstract
Incomplete observations in the data are always troublesome to data clustering algorithms. In fact, most of the well-received techniques are not designed to encounter such imperative scenarios. Hence, clustering of images under incomplete samples is an inquisitive yet unaddressed area of research. Therefore, the aim of this article is to design a single-stage optimization procedure for clustering as well as simultaneous reconstruction of images without breaking the intrinsic spatial structure. The method employs the self-expressiveness property of submodules, and images are stacked as the lateral slices of a three-dimensional tensor. The proposed optimization method is designed to extract a sparse t-linear combination tensor with low multirank constraint, consisting of a unique set of linear coefficients in the form of mode-3 fibers and the spectral clustering is performed on these fibers. Simultaneously, the recovery of lost samples is accomplished by twisting the entire lateral slices of the data tensor and applying a low-rank approximation on each slice. The prominence of the proposed method lies in the simultaneous execution of data clustering and reconstruction of incomplete observations in a single step. Experimental results reveal the excellence of the proposed method over state-of-the-art clustering algorithms in the context of incomplete imaging data.
- Amir Gandomi and Murtaza Haider. 2015. Beyond the hype: Big data concepts, methods, and analytics. Int. J. Inf. Manage. 35, 2 (2015), 137--144.Google Scholar
Digital Library
- Qiquan Shi, Yiu-Ming Cheung, Qibin Zhao, and Haiping Lu. 2018. Feature extraction for incomplete data via low-rank tensor decomposition with feature regularization. IEEE Trans. Neural Netw. Learn. Syst. 30, 6 (2018), 1803--1817.Google Scholar
Cross Ref
- Pavel Berkhin. 2006. A survey of clustering data mining techniques. In Grouping Multidimensional Data. Springer, 25--71.Google Scholar
- David L. Davies and Donald W. Bouldin. 1979. A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1, 2 (1979), 224--227.Google Scholar
Digital Library
- Zhe Xue, Guorong Li, Shuhui Wang, Jun Huang, Weigang Zhang, and Qingming Huang. 2019. Beyond global fusion: A group-aware fusion approach for multi-view image clustering. Inf. Sci. 493 (2019), 176--191.Google Scholar
Digital Library
- Nasir Ahmed. 2015. Recent review on image clustering. IET Image Process. 9, 11 (2015), 1020--1032.Google Scholar
Cross Ref
- Xiaowei Zhou, Can Yang, Hongyu Zhao, and Weichuan Yu. 2015. Low-rank modeling and its applications in image analysis. ACM Comput. Surv. 47, 2 (2015), 36.Google Scholar
Digital Library
- Amit Saxena, Mukesh Prasad, Akshansh Gupta, Neha Bharill, Om Prakash Patel, Aruna Tiwari, Meng Joo Er, Weiping Ding, and Chin-Teng Lin. 2017. A review of clustering techniques and developments. Neurocomputing 267 (2017), 664--681.Google Scholar
Digital Library
- Michel Verleysen and Damien François. 2005. The curse of dimensionality in data mining and time series prediction. In Computational Intelligence and Bioinspired Systems, Joan Cabestany, Alberto Prieto, and Francisco Sandoval (Eds.). Springer, Berlin, 758--770.Google Scholar
- Mahdi Soltanolkotabi, Emmanuel J. Candes, et al. 2012. A geometric analysis of subspace clustering with outliers. Ann. Stat. 40, 4 (2012), 2195--2238.Google Scholar
Cross Ref
- Ehsan Elhamifar and Rene Vidal. 2013. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35, 11 (2013), 2765--2781.Google Scholar
Digital Library
- Xun Yang, Meng Wang, Richang Hong, Qi Tian, and Yong Rui. 2017. Enhancing person re-identification in a self-trained subspace. ACM Trans. Multimedia Comput. Commun. Appl. 13, 3 (2017), 27.Google Scholar
Digital Library
- Tong Wu and Waheed U. Bajwa. 2018. A low tensor-rank representation approach for clustering of imaging data. IEEE Sign. Process. Lett. 25, 8 (2018), 1196--1200.Google Scholar
Cross Ref
- Baburaj Madathil and Sudhish N George. 2018. Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery. Inf. Sci. 423 (2018), 376--397.Google Scholar
Digital Library
- Eric Kernfeld, Shuchin Aeron, and Misha Kilmer. 2014. Clustering multi-way data: A novel algebraic approach. arXiv preprint arXiv:1412.7056 (2014).Google Scholar
- Zemin Zhang, Gregory Ely, Shuchin Aeron, Ning Hao, and Misha Kilmer. 2013. Novel factorization strategies for higher order tensors: Implications for compression and recovery of multi-linear data. arXiv preprint arXiv:1307.0805 (2013).Google Scholar
- Congyuan Yang, Daniel Robinson, and René Vidal. 2015. Sparse subspace clustering with missing entries. In Proceedings of the International Conference on Machine Learning. 2463--2472.Google Scholar
- Anju Jose Tom and Sudhish N. George. 2019. Video completion and simultaneous moving object detection for extreme surveillance environments. IEEE Sign. Process. Lett. 26, 4 (2019), 577--581.Google Scholar
Cross Ref
- Sunrita Poddar and Mathews Jacob. 2018. Clustering of data with missing entries. In Proceedings of the 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP’18). IEEE, 2831--2835.Google Scholar
Cross Ref
- Guojun Gan, Chaoqun Ma, and Jianhong Wu. 2007. Data Clustering: Theory, Algorithms, and Applications. Vol. 20. SIAM.Google Scholar
Cross Ref
- Steven C. H. Hoi, Wei Liu, and Shih-Fu Chang. 2010. Semi-supervised distance metric learning for collaborative image retrieval and clustering. ACM Trans. Multimedia Comput. Commun. Appl. 6, 3 (2010), 18.Google Scholar
Digital Library
- Jörg Sander, Martin Ester, Hans-Peter Kriegel, and Xiaowei Xu. 1998. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Min. Knowl. Discov. 2, 2 (1 June 1998), 169--194. DOI:http://dx.doi.org/10.1023/A:1009745219419Google Scholar
- Dongkuan Xu and Yingjie Tian. 2015. A comprehensive survey of clustering algorithms. Ann. Data Sci. 2, 2 (1 June 2015), 165--193. DOI:http://dx.doi.org/10.1007/s40745-015-0040-1Google Scholar
- Jiawei Han and Micheline Kamber. 2005. Data Mining: Concepts and Techniques. Kaufmann, San Francisco, CA.Google Scholar
Digital Library
- Lance Parsons, Ehtesham Haque, and Huan Liu. 2004. Subspace clustering for high dimensional data: A review. SIGKDD Explor. Newsl. 6, 1 (June 2004), 90--105. DOI:http://dx.doi.org/10.1145/1007730.1007731Google Scholar
Digital Library
- Kewei Tang, Risheng Liu, Zhixun Su, and Jie Zhang. 2014. Structure-constrained low-rank representation. IEEE Trans. Neural Netw. Learn. Syst. 25, 12 (2014), 2167--2179.Google Scholar
Cross Ref
- Teng Zhang, Arthur Szlam, and Gilad Lerman. 2009. Median k-flats for hybrid linear modeling with many outliers. In Proceedings of the 2009 IEEE 12th International Conference on Computer Vision Workshops (ICCV Workshops’09). IEEE, 234--241.Google Scholar
Cross Ref
- Yi Ma, Allen Y. Yang, Harm Derksen, and Robert Fossum. 2008. Estimation of subspace arrangements with applications in modeling and segmenting mixed data. SIAM Rev. 50, 3 (2008), 413--458.Google Scholar
Digital Library
- Martin A. Fischler and Robert C. Bolles. 1981. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 6 (1981), 381--395.Google Scholar
Digital Library
- Ulrike von Luxburg. 2007. A tutorial on spectral clustering. Stat. Comput. 17, 4 (1 December 2007), 395--416. DOI:http://dx.doi.org/10.1007/s11222-007-9033-zGoogle Scholar
- Xiaofei He, Deng Cai, Haifeng Liu, and Jiawei Han. 2005. Image clustering with tensor representation. In Proceedings of the 13th Annual ACM International Conference on Multimedia. ACM, 132--140.Google Scholar
Digital Library
- Guangcan Liu, Zhouchen Lin, and Yong Yu. 2010. Robust subspace segmentation by low-rank representation. In Proceedings of the International Conference on Machine Learning (ICML’10), Vol. 1. 8.Google Scholar
- Hongyan Zhang, Han Zhai, Liangpei Zhang, and Pingxiang Li. 2016. Spectral--spatial sparse subspace clustering for hyperspectral remote sensing images. IEEE Trans. Geosci. Remote Sens. 54, 6 (2016), 3672--3684.Google Scholar
Cross Ref
- Xinglin Piao, Yongli Hu, Junbin Gao, Yanfeng Sun, and Zhouchen Lin. 2016. A submodule clustering method for multi-way data by sparse and low-rank representation. arXiv preprint arXiv:1601.00149 (2016).Google Scholar
- Shuchin Aeron and Eric Kernfeld. 2015. Group-invariant subspace clustering. In Proceedings of the 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 666--671.Google Scholar
Digital Library
- Shengke Xue, Wenyuan Qiu, Fan Liu, and Xinyu Jin. 2019. Truncated nuclear norm regularization for low-rank tensor completion. arXiv preprint arXiv:1901.01997 (2019).Google Scholar
- Emmanuel J. Candès and Benjamin Recht. 2009. Exact matrix completion via convex optimization. Found. Comput. Math. 9, 6 (2009), 717.Google Scholar
Cross Ref
- Qiquan Shi, Haiping Lu, and Yiu-Ming Cheung. 2017. Rank-one matrix completion with automatic rank estimation via L1-norm regularization. IEEE Trans. Neural Netw. Learn. Syst. 29, 10 (2017), 4744--4757.Google Scholar
Cross Ref
- Baburaj Madathil and Sudhish N. George. 2018. Dct based weighted adaptive multi-linear data completion and denoising. Neurocomputing 318 (2018), 120--136.Google Scholar
Cross Ref
- Gil Shabat, Yaniv Shmueli, and Amir Averbuch. 2013. Missing entries matrix approximation and completion. arXiv preprint arXiv:1302.6768 (2013).Google Scholar
- Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. 2012. Tensor completion for estimating missing values in visual data. IEEE Transa. Pattern Anal. Mach. Intell. 35, 1 (2012), 208--220.Google Scholar
Digital Library
- Yuanyuan Liu, Fanhua Shang, Licheng Jiao, James Cheng, and Hong Cheng. 2014. Trace norm regularized CANDECOMP/PARAFAC decomposition with missing data. IEEE Trans. Cybernet. 45, 11 (2014), 2437--2448.Google Scholar
Cross Ref
- Zemin Zhang and Shuchin Aeron. 2016. Exact tensor completion using t-SVD. IEEE Trans. Sign. Process. 65, 6 (2016), 1511--1526.Google Scholar
Digital Library
- Xiangyang Kong, Yongqiang Zhao, Jize Xue, and Jonathan Cheung-Wai Chan. 2019. Hyperspectral image denoising using global weighted tensor norm minimum and nonlocal low-rank approximation. Remote Sens. 11, 19 (2019), 2281.Google Scholar
Cross Ref
- Jize Xue, Yongqiang Zhao, Wenzhi Liao, and Jonathan Cheung-Wai Chan. 2019. Nonconvex tensor rank minimization and its applications to tensor recovery. Inf. Sci. 503 (2019), 109--128.Google Scholar
Digital Library
- Jize Xue, Yongqiang Zhao, Wenzhi Liao, and Jonathan Cheung-Wai Chan. 2019. Nonlocal low-rank regularized tensor decomposition for hyperspectral image denoising. IEEE Trans. Geosci. Remote Sens. 57, 7 (2019), 5174--5189.Google Scholar
Cross Ref
- Pan Zhou, Canyi Lu, Jiashi Feng, Zhouchen Lin, and Shuicheng Yan. 2019. Tensor low-rank representation for data recovery and clustering. IEEE Trans. Pattern Anal. Mach. Intell. (2019).Google Scholar
Cross Ref
- Jinhui Tang, Xiangbo Shu, Guo-Jun Qi, Zechao Li, Meng Wang, Shuicheng Yan, and Ramesh Jain. 2016. Tri-clustered tensor completion for social-aware image tag refinement. IEEE Trans. Pattern Anal. Mach. Intell. 39, 8 (2016), 1662--1674.Google Scholar
Cross Ref
- Jinhui Tang, Xiangbo Shu, Zechao Li, Yu-Gang Jiang, and Qi Tian. 2019. Social anchor-unit graph regularized tensor completion for large-scale image retagging. IEEE Trans. Pattern Anal. Mach. Intell. 41, 8 (2019), 2027--2034.Google Scholar
Cross Ref
- Joseph L. Schafer and John W. Graham. 2002. Missing data: Our view of the state of the art. Psychol. Methods 7, 2 (2002), 147.Google Scholar
Cross Ref
- Hongyang Zhang, Zhouchen Lin, Chao Zhang, and Junbin Gao. 2015. Relations among some low-rank subspace recovery models. Neural Comput. 27, 9 (2015), 1915--1950.Google Scholar
Digital Library
- Sameera V. Mohd Sagheer and Sudhish N. George. 2017. Ultrasound image despeckling using low rank matrix approximation approach. Biomed. Sign. Process. Contr. 38 (2017), 236--249.Google Scholar
Cross Ref
- Yuan Xie, Dacheng Tao, Wensheng Zhang, Yan Liu, Lei Zhang, and Yanyun Qu. 2018. On unifying multi-view self-representations for clustering by tensor multi-rank minimization. Int. J. Comput. Vis. 126, 11 (2018), 1157--1179.Google Scholar
Digital Library
- Allen Altman and Steven Kleiman. 2013. A Term of Commutative Algebra. Worldwide Center of Mathematics.Google Scholar
- Canyi Lu, Jiashi Feng, Yudong Chen, Wei Liu, Zhouchen Lin, and Shuicheng Yan. 2016. Tensor robust principal component analysis: Exact recovery of corrupted low-rank tensors via convex optimization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 5249--5257.Google Scholar
Cross Ref
- Richard O. Duda, Peter E. Hart, and David G. Stork. 2012. Pattern Classification. John Wiley 8 Sons.Google Scholar
- Zhiyuan Zha, Xin Yuan, Bei Li, Xinggan Zhang, Xin Liu, Lan Tang, and Ying-Chang Liang. 2017. Analyzing the weighted nuclear norm minimization and nuclear norm minimization based on group sparse representation. arXiv preprint arXiv:1702.04463 (2017).Google Scholar
- Baburaj M. and Sudhish N. George. 2019. Tensor based approach for inpainting of video containing sparse text. Multimedia Tools Appl. 78, 2 (1 Jan 2019), 1805--1829. DOI:http://dx.doi.org/10.1007/s11042-018-6251-7Google Scholar
- Xiaowei Zhou, Can Yang, and Weichuan Yu. 2012. Moving object detection by detecting contiguous outliers in the low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35, 3 (2012), 597--610.Google Scholar
Digital Library
- Yangyang Xu, Ruru Hao, Wotao Yin, and Zhixun Su. 2013. Parallel matrix factorization for low-rank tensor completion. arXiv preprint arXiv:1312.1254 (2013).Google Scholar
- Xiao-Yang Liu, Shuchin Aeron, Vaneet Aggarwal, and Xiaodong Wang. 2016. Low-tubal-rank tensor completion using alternating minimization. In Modeling and Simulation for Defense Systems and Applications XI, Vol. 9848. International Society for Optics and Photonics, 984809.Google Scholar
- B. Shijila, Anju Jose Tom, and Sudhish N. George. 2019. Simultaneous denoising and moving object detection using low rank approximation. Fut. Gener. Comput. Syst. 90 (2019), 198--210.Google Scholar
Cross Ref
- Lin Zhu, Yuanhong Hao, and Yuejin Song. 2017. Norm and spatial continuity regularized low-rank approximation for moving object detection in dynamic background. IEEE Sign. Process. Lett. 25, 1 (2017), 15--19.Google Scholar
Cross Ref
- Wenrui Hu, Dacheng Tao, Wensheng Zhang, Yuan Xie, and Yehui Yang. 2016. The twist tensor nuclear norm for video completion. IEEE Trans. Neural Netw. Learn. Syst. 28, 12 (2016), 2961--2973.Google Scholar
Cross Ref
- J. Cai, E. Candès, and Z. Shen. 2010. A singular value thresholding algorithm for matrix completion. SIAM J. Optimiz. 20, 4 (2010), 1956--1982. DOI:http://dx.doi.org/10.1137/080738970Google Scholar
Cross Ref
- Simone Romano, Nguyen Xuan Vinh, James Bailey, and Karin Verspoor. 2016. Adjusting for chance clustering comparison measures. J. Mach. Learn. Res. 17, 1 (2016), 4635--4666.Google Scholar
Digital Library
- Christopher Manning, Prabhakar Raghavan, and Hinrich Schütze. 2010. Introduction to information retrieval. Natural Language Engineering 16, 1 (2010), 100--103.Google Scholar
- Anju Jose Tom and Sudhish N. George. 2019. A three-way optimization technique for noise robust moving object detection using tensor low-rank approximation, l1/2, and TTV regularizations. IEEE Trans. Cybernet. (2019).Google Scholar
- Swagatam Das and Sudeshna Sil. 2010. Kernel-induced fuzzy clustering of image pixels with an improved differential evolution algorithm. Inf. Sci. 180, 8 (2010), 1237--1256.Google Scholar
Digital Library
- Guilherme O. Campos, Arthur Zimek, Jörg Sander, Ricardo J. G. B. Campello, Barbora Micenková, Erich Schubert, Ira Assent, and Michael E. Houle. 2016. On the evaluation of unsupervised outlier detection: Measures, datasets, and an empirical study. Data Min. Knowl. Discov. 30, 4 (2016), 891--927.Google Scholar
Digital Library
Index Terms
A Unified Tensor Framework for Clustering and Simultaneous Reconstruction of Incomplete Imaging Data
Recommendations
Image clustering with tensor representation
MULTIMEDIA '05: Proceedings of the 13th annual ACM international conference on MultimediaWe consider the problem of image representation and clustering. Traditionally, an n1 x n2 image is represented by a vector in the Euclidean space ℝ n1 x n2. Some learning algorithms are then applied to these vectors in such a high dimensional space for ...
Subspace Clustering for High-Dimensional Data Using Cluster Structure Similarity
This article describes how recently, because of the curse of dimensionality in high dimensional data, a significant amount of research has been conducted on subspace clustering aiming at discovering clusters embedded in any possible attributes ...
Image representation using Laplacian regularized nonnegative tensor factorization
Tensor provides a better representation for image space by avoiding information loss in vectorization. Nonnegative tensor factorization (NTF), whose objective is to express an n-way tensor as a sum of k rank-1 tensors under nonnegative constraints, has ...






Comments