作者: Tiezheng Ge , Kaiming He , Jian Sun
关键词: Theoretical computer science 、 Image retrieval 、 Codebook 、 Product (mathematics) 、 Artificial intelligence 、 Neural coding 、 Algorithm 、 Time complexity 、 Computer science 、 Cartesian product 、 Contextual image classification 、 Sparse approximation
摘要: Sparse coding is a widely involved technique in computer vision. However, the expensive computational cost can hamper its applications, typically when codebook size must be limited due to concerns on running time. In this paper, we study special case of sparse which Cartesian product two subcodebooks. We present algorithms decompose problem into smaller subproblems, separately solved. Our solution, named as Product Coding (PSC), reduces time complexity from O(K) O(rK) K. practice, 20-100x faster than standard coding. experiments demonstrate efficiency and quality method applications image classification retrieval.