Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPham, The Anh-
dc.contributor.authorLe, Dinh Nghiep-
dc.contributor.authorNguyen, Thi Lan Phuong-
dc.description.abstractThis work addresses the problem of feature indexing to significantly accelerate the matching process which is commonly known as a cumbersome task in many computer vision applications. To this aim, we propose to perform product sub-vector quantization (PSVQ) to create finer representation of underlying data while still maintaining reasonable memory allocation. In addition, the quantized data can be jointly used with a clustering tree to perform approximate nearest search very efficiently. Experimental results demonstrate the superiority of the proposed method for different datasets in comparison with other methods.vi_VN
dc.relation.ispartofseriesJournal of Computer Science and Cybernetics;Vol.35 (01) .- P.69–83-
dc.subjectProduct quantizationvi_VN
dc.subjectHierarchical clustering treevi_VN
dc.subjectApproximate nearest searchvi_VN
dc.titleProduct sub-vector quantization for feature indexingvi_VN
Appears in Collections:Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)

Files in This Item:
File Description SizeFormat 
_file_5.8 MBAdobe PDFView/Open
Your IP:

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