20 citations · 24 across the 5 of their papers we have counts for
8 papers
Content adaptive screen image scaling
Yao Zhai, Qifei Wang, Yan Lu +1
This paper proposes an efficient content adaptive screen image scaling scheme for the real-time screen applications like remote desktop and screen sharing. In the proposed screen s…
Group -Means
Jianfeng Wang, Shuicheng Yan, Yi Yang +3
We study how to learn multiple dictionaries from a dataset, and approximate any data point by the sum of the codewords each chosen from the corresponding dictionary. Although theor…
Optimized Cartesian -Means
Jianfeng Wang, Jingdong Wang, Jingkuan Song +3
Product quantization-based approaches are effective to encode high-dimensional data points for approximate nearest neighbor search. The space is decomposed into a Cartesian product…
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…
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…
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…