Please use this identifier to cite or link to this item:
|Title:||Towards efficient sparse coding for scalable image annotation|
|Keywords:||Hash-accelerated sparsity induced scalable optimization|
Large-scale image annotation
|Source:||Huang, J.,Liu, H.,Shen, J.,Yan, S. (2013). Towards efficient sparse coding for scalable image annotation. MM 2013 - Proceedings of the 2013 ACM Multimedia Conference : 947-956. ScholarBank@NUS Repository. https://doi.org/10.1145/2502081.2502127|
|Abstract:||Nowadays, content-based retrieval methods are still the de- velopment trend of the traditional retrieval systems. Image labels, as one of the most popular approaches for the semantic representation of images, can fully capture the representative information of images. To achieve the high performance of retrieval systems, the precise annotation for images becomes inevitable. However, as the massive number of images in the Internet, one cannot annotate all the images without a scalable and exible (i.e., training-free) annotation method. In this paper, we particularly investi- gate the problem of accelerating sparse coding based scal- Able image annotation, whose off-the-shelf solvers are gen- erally inefficient on large-scale dataset. By leveraging the prior that most reconstruction coefficients should be zero, we develop a general and efficient framework to derive an accurate solution to the large-scale sparse coding problem through solving a series of much smaller-scale subproblems. In this framework, an active variable set, which expands and shrinks iteratively, is maintained, with each snapshot of the active variable set corresponding to a subproblem. Mean- while, the convergence of our proposed framework to global optimum is theoretically provable. To further accelerate the proposed framework, a sub-linear time complexity hashing strategy, e.g. Locality-Sensitive Hashing, is seamlessly integrated into our framework. Extensive empirical experiments on NUS-WIDE and IMAGENET datasets demonstrate that the orders-of-magnitude acceleration is achieved by the proposed framework for large-scale image annotation, along with zero/negligible accuracy loss for the cases without/with hashing speed-up, compared to the expensive off-the-shelf solvers. Copyright © 2013 ACM.|
|Source Title:||MM 2013 - Proceedings of the 2013 ACM Multimedia Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.