Please use this identifier to cite or link to this item:
|Title:||Auto-grouped sparse representation for visual analysis||Authors:||Feng, J.
|Issue Date:||2012||Citation:||Feng, J.,Yuan, X.,Wang, Z.,Xu, H.,Yan, S. (2012). Auto-grouped sparse representation for visual analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7572 LNCS (PART 1) : 640-653. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-33718-5_46||Abstract:||In this work, we investigate how to automatically uncover the underlying group structure of a feature vector such that each group characterizes certain object-specific patterns, e.g., visual pattern or motion trajectories from one object. By mining the group structure, we can effectively alleviate the mutual inference of multiple objects and improve the performance in various visual analysis tasks. To this end, we propose a novel auto-grouped sparse representation (ASR) method. ASR groups semantically correlated feature elements together through optimally fusing their multiple sparse representations. Due to the intractability of primal objective function, we also propose well-behaved convex relaxation and smooth approximation to guarantee obtaining a global optimal solution effectively. Finally, we apply ASR in two important visual analysis tasks: multi-label image classification and motion segmentation. Comprehensive experimental evaluations show that ASR is able to achieve superior performance compared with the state-of-the-arts on these two tasks. © 2012 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/69466||ISBN:||9783642337178||ISSN:||03029743||DOI:||10.1007/978-3-642-33718-5_46|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 13, 2019
checked on Apr 7, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.