Abstract. The growth of computational power of contemporary hardware causes technologies working with 3D-data to expand. Examples of the use of this kind of data can be found in ge...
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
— This paper presents clustering techniques (K-means, Fuzzy K-means, Subtractive) applied on specific databases (Flower Classification and Mackey-Glass time series) , to automati...
Juan E. Moreno, Oscar Castillo, Juan R. Castro, Lu...
In this paper, we present a complete computational pipeline for extracting a compact shape descriptor for curve point cloud data. Our shape descriptor, called a barcode, is based ...
Anne D. Collins, Afra Zomorodian, Gunnar Carlsson,...
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...