Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1509
Title: | Algorithms for fast full nearest neighbour search on unstructured codebooks: a comparative study [articol] |
Authors: | Beldianu, Spiridon Florin |
Subjects: | Vector quantization Fast full nearest neighbor search Image vector quantization Linear projections |
Issue Date: | 2006 |
Publisher: | Timişoara: Editura Politehnica |
Citation: | Beldianu, Spiridon Florin. Algorithms for fast full nearest neighbour search on unstructured codebooks: a comparative study. Timişoara: Editura Politehnica, 2006 |
Series/Report no.: | Seria electronică şi telecomunicaţii, Tom 51(65), fasc. 2 (2006) |
Abstract: | This paper presents several fast nearest neighbor search algorithms for vector quantization on unstructured codebooks of arbitrary size and vector dimension that uses linear projections and variance of a vector. Several new inequalities based on orthonormal Tchebichef moments and projections on the first vectors of the DCT and PCA transformations of an image block are introduced to reject those codewords that are impossible to be the nearest codevector and cannot be rejected by inequalities based on Hadamard Transform, sum and variance, thereby saving a great deal of computational time, while introducing no extra distortion compared to the conventional full search algorithm. |
URI: | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Algorithms%20for%20fast%20full%20nearest%20neighbour%20search%20on%20unstructured%20codebooks:%20a%20comparative%20study&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Beldianu_f.pdf | 2.28 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.