scholarly journals Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces

2005 ◽  
pp. 127-138 ◽  
Author(s):  
Rodrigo Paredes ◽  
Edgar Chávez
Keyword(s):  
Metric Spaces ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Neighbor Graph ◽  
Nearest Neighbor Graph

DRSA: a non-hierarchical clustering algorithm using k-NN graph and its application in vegetation classification

2015 ◽  
pp. 125-138 ◽  
Author(s):  
I. V. Goncharenko
Keyword(s):  
Cluster Analysis ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Protein Structures ◽  
Hierarchical Cluster ◽  
Vegetation Classification ◽  
K Nearest Neighbor ◽  
Neighbor Graph ◽  
Nearest Neighbor Graph

In this article we proposed a new method of non-hierarchical cluster analysis using k-nearest-neighbor graph and discussed it with respect to vegetation classification. The method of k-nearest neighbor (k-NN) classification was originally developed in 1951 (Fix, Hodges, 1951). Later a term “k-NN graph” and a few algorithms of k-NN clustering appeared (Cover, Hart, 1967; Brito et al., 1997). In biology k-NN is used in analysis of protein structures and genome sequences. Most of k-NN clustering algorithms build «excessive» graph firstly, so called hypergraph, and then truncate it to subgraphs, just partitioning and coarsening hypergraph. We developed other strategy, the “upward” clustering in forming (assembling consequentially) one cluster after the other. Until today graph-based cluster analysis has not been considered concerning classification of vegetation datasets.

A Novel clustering method based on hybrid K-nearest-neighbor graph

2018 ◽  
Vol 74 ◽  
pp. 1-14 ◽  
Author(s):  
Yikun Qin ◽  
Zhu Liang Yu ◽  
Chang-Dong Wang ◽  
Zhenghui Gu ◽  
Yuanqing Li
Keyword(s):  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Clustering Method ◽  
Neighbor Graph ◽  
Nearest Neighbor Graph

Region-Based Graph Learning towards Large Scale Image Annotation

2012 ◽  
pp. 244-260
Author(s):  
Bao Bing-Kun ◽  
Yan Shuicheng
Keyword(s):  
Large Scale ◽  
Nearest Neighbor ◽  
Image Annotation ◽  
Learning Algorithm ◽  
Label Propagation ◽  
Locality Sensitive Hashing ◽  
K Nearest Neighbor ◽  
Neighbor Graph ◽  
Nearest Neighbor Graph ◽  
Modeling Data

Graph-based learning provides a useful approach for modeling data in image annotation problems. In this chapter, the authors introduce how to construct a region-based graph to annotate large scale multi-label images. It has been well recognized that analysis in semantic region level may greatly improve image annotation performance compared to that in whole image level. However, the region level approach increases the data scale to several orders of magnitude and lays down new challenges to most existing algorithms. To this end, each image is firstly encoded as a Bag-of-Regions based on multiple image segmentations. And then, all image regions are constructed into a large k-nearest-neighbor graph with efficient Locality Sensitive Hashing (LSH) method. At last, a sparse and region-aware image-based graph is fed into the multi-label extension of the Entropic graph regularized semi-supervised learning algorithm (Subramanya & Bilmes, 2009). In combination they naturally yield the capability in handling large-scale dataset. Extensive experiments on NUS-WIDE (260k images) and COREL-5k datasets well validate the effectiveness and efficiency of the framework for region-aware and scalable multi-label propagation.

scholarly journals Robust and Efficient Person Re-Identification Model using K-Nearest Neighbor Graph

2019 ◽  
Vol 9 (2) ◽  
pp. 1544-1550
Keyword(s):  
Nearest Neighbor ◽  
Research Problem ◽  
Ranking Method ◽  
Retrieval Process ◽  
K Nearest Neighbor ◽  
Robust Learning ◽  
Feature Sets ◽  
Neighbor Graph ◽  
Improve Accuracy ◽  
Nearest Neighbor Graph

the state-of-art person re-identification (prid) models for ranking generally depends on labeled pairwise feature sets information to learn a task-dependent distance metric. Further, in retrieval process, re-ranking is an important mechanism for enhancing the accuracy. However, very limited work is carried out for designing a re-ranking method, particularly for automatic and unsupervised strategies. The existing re-ranking based prid model is not efficient when multiple persons appears simultaneously in second camera. This is because the existing model identify person in second camera by matching the feature sets with feature sets in first camera, individually with respect to other person in the second camera. For overcoming research problem, this paper present robust and efficient prid (reprid) model. First, present a robust learning/ranking method using k-nearest neighbor (knn) graph. Then, this work present a re-ranking method to improve accuracy of prid by using information of co-occurrence persons for matching and reorganizing given rank lists. Experiment are conducted on standard dataset shows robustness and effectiveness of proposed prid method.

Sign in / Sign up

Export Citation Format

Share Document