Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Yandex et al., 2017 - Google Patents
[go: Go Back, main page]

Yandex et al., 2017 - Google Patents

Annarbor: Approximate nearest neighbors using arborescence coding

Yandex et al., 2017

Document ID
8271275731529599948
Author
Yandex A
Lempitsky V
Publication year
Publication venue
2017 IEEE International Conference on Computer Vision (ICCV)

External Links

Snippet

To compress large datasets of high-dimensional descriptors, modern quantization schemes learn multiple codebooks and then represent individual descriptors as combinations of codewords. Once the codebooks are learned, these schemes encode descriptors …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6251—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on a criterion of topology preservation, e.g. multidimensional scaling, self-organising maps
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures

Similar Documents

Publication Publication Date Title
He et al. K-means hashing: An affinity-preserving quantization method for learning binary compact codes
Jain et al. Subic: A supervised, structured binary code for image search
Babenko et al. The inverted multi-index
Baranchuk et al. Revisiting the inverted indices for billion-scale approximate nearest neighbors
Babenko et al. Tree quantization for large-scale similarity search and classification
Zhang et al. Sparse composite quantization
Ge et al. Optimized product quantization for approximate nearest neighbor search
He et al. K-nearest neighbors hashing
Abdelhadi et al. Accelerated approximate nearest neighbors search through hierarchical product quantization
US6608924B2 (en) Neural network model for compressing/decompressing image/acoustic data files
CN102905137B (en) The quick difference vector of ultraphotic spectrum signal quantizes compaction coding method
Noh et al. Product quantizer aware inverted index for scalable nearest neighbor search
Babenko et al. AnnArbor: approximate nearest neighbors using arborescence coding
Yandex et al. Annarbor: Approximate nearest neighbors using arborescence coding
CN103269429B (en) A kind of ultraphotic spectrum signal rapid vector quantization coding method
Vallaeys et al. Qinco2: Vector compression and search with improved implicit neural codebooks
Liu et al. Generalized residual vector quantization and aggregating tree for large scale search
Wu et al. Acceleration of the LBG algorithm
Weng et al. Concatenation hashing: A relative position preserving method for learning binary codes
Yuan et al. Product tree quantization for approximate nearest neighbor search
Zhao et al. The ordinal relation preserving binary codes
CN107133348B (en) Approximate searching method based on semantic consistency in large-scale picture set
Li et al. Online variable coding length product quantization for fast nearest neighbor search in mobile retrieval
Chen et al. Hierarchical quantization for billion-scale similarity retrieval on gpus
Liu et al. Generalized residual vector quantization for large scale data