Kernel-Spectral-Clustering-Driven Motion Segmentation: Rotating-Objects First Trials
Time-varying data characterization and classification is a field of great interest in both scientific and technology communities. There exists a wide range of applications and challenging open issues such as: automatic motion segmentation, moving-object tracking, and movement forecasting, among others. In this paper, we study the use of the so-called kernel spectral clustering (KSC) approach to capture the dynamic behavior of frames - representing rotating objects - by means of kernel functions and feature relevance values. On the basis of previous research works, we formally derive a here-called tracking vector able to unveil sequential behavior patterns. As a remarkable outcome, we alternatively introduce an encoded version of the tracking vector by converting into decimal numbers the resulting clustering indicators. To evaluate our approach, we test the studied KSC-based tracking over a rotating object from the COIL 20 database. Preliminary results produce clear evidence about the relationship between the clustering indicators and the starting/ending time instance of a specific dynamic sequence.
KeywordsKernels Motion tracking Spectral clustering
Authors acknowledge the SDAS Research Group (www.sdas-group.com) for its valuable support.
- 1.Sandhu, M., Upadhyay, S., Krishna, M., Medasani, S.: Motion segmentation using spectral clustering on Indian road scenes. In: The European Conference on Computer Vision (ECCV) Workshops, September 2018Google Scholar
- 2.Huang, W., Zhang, P.: A novel framework to localize moving targets in video surveillance systems via spectral clustering. Proc. Comput. Sci. 147, 480–486 (2019). 2018 International Conference on Identification, Information and Knowledge in the Internet of Things. http://www.sciencedirect.com/science/article/pii/S1877050919302996
- 3.Aamer, B., et al.: Self-tuning spectral clustering for adaptive tracking areas design in 5G ultra-dense networks. arXiv e-prints, arXiv:1902.01342, February 2019
- 4.Alzate, C., Suykens, J.: A weighted kernel PCA formulation with out-of-sample extensions for spectral clustering methods. In: International Joint Conference on Neural Networks, 2006. IJCNN 2006, pp. 138–144. IEEE (2006)Google Scholar
- 6.Peluffo Ordoñez, D.H., Lee, J.A., Verleysen, M., Rodriguez, J.L., Castellanos-Dominguez, G.: Unsupervised relevance analysis for feature extraction and selection. A distance-based approach for feature relevance. In: 3rd International Conference on Pattern Recognition Applications and Methods (ICPRAM 2014) (2015)Google Scholar
- 7.Nene, S.A., Nayar, S.K., Murase, H.: Columbia object image library, COIL-20, Technical report (1996)Google Scholar
- 11.Wolf, L., Shashua, A.: Feature selection for unsupervised and supervised inference: the emergence of sparsity in a weight-based approach. J. Mach. Learn. Res. 6, 1855–1887 (2005). http://portal.acm.org/citation.cfm?id=1046920.1194906
- 12.Alzate, S.J.C.: Highly sparse kernel spectral clustering with predictive out-of-sample extensions (2010)Google Scholar
- 13.Peluffo-Ordóñez, D.H., García-Vega, S., Álvarez-Meza, A.M., Castellanos-Domínguez, C.G.: Kernel spectral clustering for dynamic data. In: Ruiz-Shulcloper, J., Sanniti di Baja, G. (eds.) CIARP 2013. LNCS, vol. 8258, pp. 238–245. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41822-8_30CrossRefGoogle Scholar