Please use this identifier to cite or link to this item:
|Title:||Large-scale multilabel propagation based on efficient sparse graph construction||Authors:||Chen, X.
|Keywords:||Collaborative multilabel propagation
Sparsity induced graph construction
|Issue Date:||Dec-2013||Citation:||Chen, X., Mu, Y., Liu, H., Yan, S., Rui, Y., Chua, T.-S. (2013-12). Large-scale multilabel propagation based on efficient sparse graph construction. ACM Transactions on Multimedia Computing, Communications and Applications 10 (1) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/2542205.2542209||Abstract:||With the popularity of photo-sharing websites, the number of web images has exploded into unseen magnitude. Annotating such large-scale data will cost huge amount of human resources and is thus unaffordable. Motivated by this challenging problem, we propose a novel sparse graph based multilabel propagation (SGMP) scheme for super large scale datasets. Both the efficacy and accuracy of the image annotation are further investigated under different graph construction strategies, where Gaussian noise and non-Gaussian sparse noise are simultaneously considered in the formulations of these strategies. Our proposed approach outperforms the state-of-the-art algorithms by focusing on: (1) For large-scale graph construction, a simple yet efficient LSH (Locality Sensitive Hashing)-based sparse graph construction scheme is proposed to speed up the construction. We perform the multilabel propagation on this hashing-based graph construction, which is derived with LSH approach followed by sparse graph construction within the individual hashing buckets; (2) To further improve the accuracy, we propose a novel sparsity induced scalable graph construction scheme, which is based on a general sparse optimization framework. Sparsity essentially implies a very strong prior: for large scale optimization, the values of most variables shall be zeros when the solution reaches the optimum. By utilizing this prior, the solutions of large-scale sparse optimization problems can be derived by solving a series of much smaller scale subproblems; (3) For multilabel propagation, different from the traditional algorithms that propagate over individual label independently, our proposed propagation first encodes the label information of an image as a unit label confidence vector and naturally imposes inter-label constraints and manipulates labels interactively. Then, the entire propagation problem is formulated on the concept of Kullback-Leibler divergence defined on probabilistic distributions, which guides the propagation of the supervision information. Extensive experiments on the benchmark dataset NUS-WIDE with 270k images and its lite version NUS-WIDE-LITE with 56k images well demonstrate the effectiveness and scalability of the proposed multi-label propagation scheme. © 2013 ACM.||Source Title:||ACM Transactions on Multimedia Computing, Communications and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/82601||ISSN:||15516857||DOI:||10.1145/2542205.2542209|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 21, 2020
WEB OF SCIENCETM
checked on Feb 13, 2020
checked on Feb 17, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.