English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105277 (86%)
Visitors : 8138961      Online Users : 99
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/111661


    Title: Vehicle Verification Between Two Nonoverlapped Views Using Sparse Representation
    Authors: 徐士中;Hsu, Shih-Chung;張意政;Chang, I-Cheng;黃仲陵;Huang, Chung-Lin
    Contributors: 行動商務與多媒體應用學系
    Date: 2018-09
    Issue Date: 2018-12-24 17:17:41 (UTC+8)
    Abstract: Vehicle verification in different scenes is a nontrivial problem that cannot be solved by simple correspondence matching. In the paper, the verification problem is treated as a binary classification problem. If the two vehicles in two views are the same, they are a positive pair; otherwise, a negative pair. Here, we propose an effective sparse representation (SR) method called Boost K-SVD to generate the feature vectors for vehicle representation. In Boost K-SVD, the particle filtering is first applied for the initial atom selection. Then, it finds the atoms satisfying the restricted isometry property (RIP). Finally, we propose a discrimination criterion to determine the optimal dictionary size. Instead of initial random atom selection, Boost K-SVD generates the atoms incrementally to create a more compact dictionary. Furthermore, the dictionary with RIP can produce sparser representation vectors with higher verification accuracy. Experimental results show that our method has better performance compared with the other methods.
    Relation: PATTERN RECOGNITION
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML40View/Open


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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback