A new clustering algorithm with adaptive attractor for LIDAR points

Clustering is a semi-supervised or unsupervised algorithm for classifying a set of data according to underlying characteristics or similarity. There are many different algorithms for different applications. Each algorithm has its advantages to some special fields. As to the data obtained from an automotive LUX-LIDAR, the existing algorithms are failed to cluster them accurately or efficiently. It is because that the distances between points are non-uniform and the number of objects is unknown and the object's shape and size are arbitrary. Then, we propose a new clustering algorithm for this kind of LIDAR's sparse data. In the algorithm we introduce a variant described as adaptive attractor. The adaptive attractor is determined by the dataset itself. It determines which class the point belongs to. Compared to the existing clustering algorithm, the advantage of the algorithm lies in the following: i) it is able to classify object with arbitrarily shape and size; ii) the object's number in the ROI is unknown; iii) similarities between data features of different objects are not fixed; iv) its time complexity is low; v) it is simple.

[1]  Lale Akarun,et al.  A fuzzy algorithm for color quantization of images , 2002, Pattern Recognit..

[2]  Ertunc Erdil,et al.  Combining multiple clusterings using similarity graph , 2011, Pattern Recognit..

[3]  S. R. Kannan,et al.  Effective fuzzy c-means clustering algorithms for data clustering problems , 2012, Expert Syst. Appl..

[4]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[5]  Olga Sourina,et al.  Automatic clustering and boundary detection algorithm based on adaptive influence function , 2008, Pattern Recognit..

[6]  Marcello Pelillo,et al.  Dominant Sets and Pairwise Clustering , 2007 .

[7]  Ertunc Erdil,et al.  ASOD: Arbitrary shape object detection , 2011, Eng. Appl. Artif. Intell..

[8]  Daniel A. Keim,et al.  An Efficient Approach to Clustering in Large Multimedia Databases with Noise , 1998, KDD.

[9]  Paul Newman,et al.  What could move? Finding cars, pedestrians and bicyclists in 3D laser data , 2012, 2012 IEEE International Conference on Robotics and Automation.

[10]  Witold Pedrycz,et al.  Fuzzy C-Means, Gustafson-Kessel FCM, and Kernel-Based FCM: A Comparative Study , 2007, Analysis and Design of Intelligent Systems using Soft Computing Techniques.

[11]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

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

[13]  Christian Böhm,et al.  High performance clustering based on the similarity join , 2000, CIKM '00.

[14]  Hans-Peter Kriegel,et al.  A distribution-based clustering algorithm for mining in large spatial databases , 1998, Proceedings 14th International Conference on Data Engineering.

[15]  Anil K. Jain Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[16]  T. Ferguson A Bayesian Analysis of Some Nonparametric Problems , 1973 .

[17]  Hans-Peter Kriegel,et al.  Density‐based clustering , 2011, WIREs Data Mining Knowl. Discov..

[18]  Mohammad Reza Soltani,et al.  Measuring the performance of FCM versus PSO for fuzzy clustering problems , 2013 .

[19]  Keith C. Pelletier,et al.  An object-based system for LiDAR data fusion and feature extraction , 2013 .