SIA OpenIR  > 机器人学研究室
Low-Rank Online Metric Learning
Cong Y(丛杨); Liu J(刘霁); Yuan JS(袁浚菘); Luo JB(罗杰波)
Source PublicationLow-Rank and Sparse Modeling for Visual Analysis
Contributor中国科学院沈阳自动化研究所 ; Fu, Yun
Publication PlaceBerlin
Indexed ByEI
EI Accession number20172803914384
KeywordLow-rank Online Learning Metric Learning Image Categorization
AbstractImage classification is a key problem in computer vision community. Most of the conventional visual recognition systems usually train an image classifier in an offline batch mode with all training data provided in advance. Unfortunately in many practical applications, usually only a small amount of training samples are available in the initialization stage and many more would come sequentially during the online process. Because the image data characteristics could dramatically change over time, it is important for the classifier to adapt to the new data incrementally. In this chapter, we present an online metric learning model to address the online image classification/scene recognition problem via adaptive similarity measurement. Given a number of labeled samples followed by a sequential input of unseen testing samples, the similarity metric is learned to maximize the margin of the distance among different classes of samples. By considering the low-rank constraint, our online metric learning model not only provides competitive performance compared with the state-of-the-art methods, but also guarantees to converge. A bi-linear graph is also applied to model the pair-wise similarity, and an unseen sample is labeled depending on the graph-based label propagation, while the model can also self-update using the new samples that are more confident labeled. With the ability of online learning, our methodology can well handle the large-scale streaming video data with the ability of incremental self-update. We also demonstrate that the low-rank property widely exists in natural data. In the experiments, we evaluate our model to online scene categorization and experiments on various benchmark datasets and comparisons with state-of-the-art methods demonstrate the effectiveness and efficiency of our algorithm.
Contribution Rank1
Document Type专著章节
Corresponding AuthorCong Y(丛杨)
Affiliation1.State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
2.Department of Computer Science, University of Rochester, Rochester, USA
3.Department of Computer Science, University of Rochester, Rochester 14627, USA
4.School of EEE, Nanyang Technological University, Singapore 639798, Singapore
Recommended Citation
GB/T 7714
Cong Y,Liu J,Yuan JS,et al. Low-Rank Online Metric Learning. Low-Rank and Sparse Modeling for Visual Analysis. Berlin:Springer,2014:203-234.
Files in This Item: Download All
File Name/Size DocType Version Access License
Low-Rank Online Metr(1000KB)专著章节/文集论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Cong Y(丛杨)]'s Articles
[Liu J(刘霁)]'s Articles
[Yuan JS(袁浚菘)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Cong Y(丛杨)]'s Articles
[Liu J(刘霁)]'s Articles
[Yuan JS(袁浚菘)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Cong Y(丛杨)]'s Articles
[Liu J(刘霁)]'s Articles
[Yuan JS(袁浚菘)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Low-Rank Online Metric Learning.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.