Show simple item record

Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree

contributor authorArandjelovic, Relja
contributor authorZisserman, Andrew
date accessioned2020-03-13T00:14:24Z
date available2020-03-13T00:14:24Z
date issued2014
identifier issn0162-8828
identifier other6858078.pdf
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/1139378?show=full
formatgeneral
languageEnglish
publisherIEEE
titleExtremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree
typeJournal Paper
contenttypeMetadata Only
identifier padid8321597
subject keywordspattern classification
subject keywordssearch problems
subject keywordsset theory
subject keywordsapproximate nearest neighbor search
subject keywordsdata structure
subject keywordsencoding method
subject keywordsiterative quantization
subject keywordslocality sensitive hashing
subject keywordslow bit-rate nearest neighbor search
subject keywordsproduct quantization
subject keywordsset compression tree
subject keywordsspectral hashing
subject keywordsstandard benchmarks
subject keywordsvector descriptors
subject keywordsvery large scale sets
subject keywordsApproximation methods
subject keywordsBenchmark testing
subject keywordsEncoding
subject keywordsImage coding
subject keywordsIterative decoding
subject keywordsNearest neighbor searches
subject keywordsQuantization (signal)
subject keywordsApproximate search
subject keywordsimage
identifier doi10.1109/TPAMI.2014.2339821
journal titlePattern Analysis and Machine Intelligence, IEEE Transactions on
journal volume36
journal issue12
filesize5551228
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record