An Improved SLIC Superpixels using Reciprocal nearest Neighbor Clustering
نویسندگان
چکیده
منابع مشابه
Image Segmentation using SLIC Superpixels and Affinity Propagation Clustering
In this paper, we propose a new method of image segmentation, named SLICAP, which combines the simple linear iterative clustering (SLIC) method with the affinity propagation (AP) clustering algorithm. First, the SLICAP technique uses the SLIC superpixel algorithm to form an over-segmentation of an image. Then, a similarity is constructed based on the features of superpixels. Finally, the AP alg...
متن کاملSLIC Superpixels
Superpixels are becoming increasingly popular for use in computer vision applications. However, there are few algorithms that output a desired number of regular, compact superpixels with a low computational overhead. We introduce a novel algorithm that clusters pixels in the combined five-dimensional color and image plane space to efficiently generate compact, nearly uniform superpixels. The si...
متن کاملAn Improved k-Nearest Neighbor Classification Algorithm Using Shared Nearest Neighbor Similarity
k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN classifier may decrease the precision of classification because of the uneven density of t raining samples .In view of the defect, an improved k-nearest neighbor algorithm is presented using shared nearest neighbor similarity which can compute similarity between test ...
متن کاملNearest Neighbor Clustering
Clustering is often formulated as a discrete optimization problem: given a finite set of sample points, the objective is to find, among all partitions of the data set, the best one according to some quality measure. However, in the statistical setting where we assume that the finite data set has been sampled from some underlying space, the goal is not to find the best partition of the given sam...
متن کاملAn Improved Algorithm Finding Nearest Neighbor Using Kd-trees
We suggest a simple modification to the Kd-tree search algorithm for nearest neighbor search resulting in an improved performance. The Kd-tree data structure seems to work well in finding nearest neighbors in low dimensions but its performance degrades even if the number of dimensions increases to more than two. Since the exact nearest neighbor search problem suffers from the curse of dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Signal Processing, Image Processing and Pattern Recognition
سال: 2015
ISSN: 2005-4254
DOI: 10.14257/ijsip.2015.8.5.25