Yangqing Jia
Xian-Sheng Hua
ABSTRACT
In this paper, we propose a novel approach to organize image search results obtained from state-of-the-art image search engines in order to improve user experience. We aim to discover exemplars from search results and simultaneously group the images. The exemplars are delivered to the user as a summary of search results instead of the large amount of unorganized images. This gives the user a brief overview of search results with a small amount of images, and helps the user to further find the images of interest. We adopt the idea of affinity propagation and design a fast sparse affinity propagation algorithm to find exemplars that best represent the image search results. Experiments on real-world data demonstrate the effectiveness of our method both visually and quantitatively.
- D. Cai, X. He, Z. Li, W. Ma, and J. Wen. Hierarchical clustering of WWW image search results using visual, textual and link information. Proc. of ACM MM'05, pages 952--959, 2004. Google Scholar
Digital Library
- B. Frey and D. Dueck. Clustering by Passing Messages Between Data Points. Science, 315(5814):972, 2007.Google ScholarCross Ref
- B. Gao, T. Liu, T. Qin, X. Zheng, Q. Cheng, and W. Ma. Web image clustering by consistent utilization of visual features and surrounding texts. Proc. of ACM MM'05, pages 112--121, 2005. Google ScholarDigital Library
- T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2):293--306, 1985.Google ScholarCross Ref
- Y. Hu, N. Yu, Z. Li, and M. Li. Image Search Result Clustering and Re-Ranking via Partial Grouping. Proc. of ICME'07, pages 603--606, 2007.Google ScholarCross Ref
- Y. Jing and S. Baluja. Pagerank for product image search. In Proc. of ACM WWW'08, pages 307--316, 2008. Google ScholarDigital Library
- I. Simon, N. Snavely, and S. Seitz. Scene Summarization for Online Image Collections. Proc. of ICCV 2007, pages 1--8, 2007.Google ScholarCross Ref
Index Terms
- Finding image exemplars using fast sparse affinity propagation
Recommendations
Image deconvolution using ℓ1 sparse regularization
ICIMCS '15: Proceedings of the 7th International Conference on Internet Multimedia Computing and ServiceThis paper studies sparse regularization image deconvolution scheme over the space of measures. This regularization method is the natural extension of the ℓ1 norm of vectors to the setting of measures. The proposed model is composed of data fitting term ...
A Fast Single Image Haze Removal Algorithm Using Color Attenuation Prior
Single image haze removal has been a challenging problem due to its ill-posed nature. In this paper, we propose a simple but powerful color attenuation prior for haze removal from a single input hazy image. By creating a linear model for modeling the ...
Fast high-quality non-blind deconvolution using sparse adaptive priors
We present an efficient approach for high-quality non-blind deconvolution based on the use of sparse adaptive priors. Its regularization term enforces preservation of strong edges while removing noise. We model the image-prior deconvolution problem as a ...
Comments