[Invited Paper] A Survey of Product Quantization
ITE Transactions on Media Technology and Applications2017Vol. 6(1), pp. 2–10
Citations Over Time
Abstract
Product Quantization (PQ) search and its derivatives are popular and successful methods for large-scale approximated nearest neighbor search. In this paper, we review the fundamental algorithm of this class of algorithms and provide executable sample codes. We then provide a comprehensive survey of the recent PQ-based methods.
Related Papers
- → Executable Paper Grand Challenge Workshop(2011)12 cited
- → Automatic building of executable models from abstract soc architectures made of heterogeneous subsystems(2004)6 cited
- → Methods of executable code protection(2014)
- Research on executable model simulation for system of systems(2014)