Search Results for author: Shipeng Li

Found 8 papers, 0 papers with code

Content adaptive screen image scaling

no code implementations21 Oct 2015 Yao Zhai, Qifei Wang, Yan Lu, Shipeng Li

This paper proposes an efficient content adaptive screen image scaling scheme for the real-time screen applications like remote desktop and screen sharing.

General Classification

Group $K$-Means

no code implementations5 Jan 2015 Jianfeng Wang, Shuicheng Yan, Yi Yang, Mohan S. Kankanhalli, Shipeng Li, Jingdong Wang

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.

Optimized Cartesian $K$-Means

no code implementations16 May 2014 Jianfeng Wang, Jingdong Wang, Jingkuan Song, Xin-Shun Xu, Heng Tao Shen, Shipeng Li

In OCKM, multiple sub codewords are used to encode the subvector of a data point in a subspace.


Fast Approximate $K$-Means via Cluster Closures

no code implementations11 Dec 2013 Jingdong Wang, Jing Wang, Qifa Ke, Gang Zeng, Shipeng Li

Traditional $k$-means is an iterative algorithm---in each iteration new cluster centers are computed and each data point is re-assigned to its nearest center.

Image Retrieval

Scalable $k$-NN graph construction

no code implementations30 Jul 2013 Jingdong Wang, Jing Wang, Gang Zeng, Zhuowen Tu, Rui Gan, Shipeng Li

The $k$-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 construct $k$-NN graphs remains a challenge, especially for large-scale high-dimensional data.

graph construction

Hybrid Affinity Propagation

no code implementations30 Jul 2013 Jingdong Wang, Hao Xu, Xian-Sheng Hua, Shipeng Li

We formulate this problem as finding a few image exemplars to represent the image set semantically and visually, and solve it in a hybrid way by exploiting both visual and textual information associated with images.

Cannot find the paper you are looking for? You can Submit a new open access paper.