Compressed matching for feature vectors

DOI10.1016/j.tcs.2015.12.021zbMath1344.68103OpenAlexW2213371197MaRDI QIDQ294934

Shmuel T. Klein, Dana Shapira

Publication date: 16 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.021

zbMATH Keywords

data compressionfeature vectorsFibonacci codeSIFT

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

Bidirectional adaptive compression ⋮ Forward looking Huffman coding ⋮ New compression schemes for natural number sequences

Uses Software

• SIFT
• SURF

Cites Work

• Huffman coding with non-sorted frequencies
• Approximate matching of run-length compressed strings
• Approximate string matching on Ziv--Lempel compressed text
• Robust universal complete codes for transmission and compression
• Wavelet trees for all
• Faster Approximate Pattern Matching in Compressed Repetitive Texts
• Universal codeword sets and representations of the integers
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• String Processing and Information Retrieval
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compressed matching for feature vectors