Improved embedding product quantization

Real-time object matching and recognition is a challenging task in computer vision probably due to the extensively computational overload posed by large and high dimensional data space. Indexing approaches can help achieving thousands of times in speedups when comparing to sequential search. In this work, we propose a novel usage of product quantization and hierarchical clustering so that search speedups can be even improved further. To validate the proposed indexing algorithm, a number of experiments have been carried out on different datasets. Experimental results demonstrate that the proposed method works very efficiently and far outperforms many other state-of-the-art techniques.