English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28588/40619
Visitors : 4195711      Online Users : 55
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/44040

Title: PLSA-Based Sparse Representation for Object Classification
Authors: Yilin Yan
Jun-Wei Hsieh
Hui-Fen Chiang
Shyi-C. Cheng
Duan-yu Chen
Contributors: 國立臺灣海洋大學:資訊工程學系
NTOU:Department of Computer Science and Engineering
Keywords: sparse representation
pLSA
object classification
Date: 2014-08
Issue Date: 2017-11-13T06:00:18Z
Publisher: 2014 IEEE International Conference on Pattern Recognition
Abstract: Abstract:This paper proposes a novel object classification method which uses the concept of probabilistic latent semantic analysis (pLSA) to overcome the problem of sparse representation in data classification. Sparse representation is widely used and quite successful in many vision-based applications. However, it needs to calculate the sparse reconstruction cost (SRC) of each sample to find the best candidate. Because an optimization process is involved, it is very inefficient. In addition, it uses only the residual and does not consider the arrangement (or distribution) of combination coefficients of visual codes in classification. Thus, it often fails to classify categories if they are similar. In this paper, the pLSA concept is first introduced into the sparse representation to build a new classifier without using the SRC measure. The weakness of the pLSA scheme is the use of EM algorithm for updating the posteriori probability of latent class. Because it is very time-consuming, a novel weighting voting strategy is introduced to improve the pLSA scheme for recognizing objects in real time. The advantages of this classifier are: the accuracy is much higher than the SRC scheme and the efficiency is real-time in data classification. Two applications are demonstrated in this paper to prove the superiority of the new classifier, i.e., vehicle make and model recognition, and action analysis.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/44040
Appears in Collections:[資訊工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat
index.html0KbHTML39View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback