75 citations · 414 across the 23 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CV2013★ 2 cited
Fast Neighborhood Graph Search using Cartesian Concatenation
Jingdong Wang, Jing Wang, Gang Zeng +3
In this paper, we propose a new data structure for approximate nearest neighbor search. This structure augments the neighborhood graph with a bridge graph. We propose to exploit Ca…
cs.CV2013★ 20 cited
Fast Approximate -Means via Cluster Closures
Jingdong Wang, Jing Wang, Qifa Ke +2
-means, a simple and effective clustering algorithm, is one of the most widely used algorithms in multimedia and computer vision community. Traditional -means is an iterative…
cs.CV2013★ 2 cited
Scalable -NN graph construction
Jingdong Wang, Jing Wang, Gang Zeng +3
The -NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to cons…