Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching

スポンサーリンク

概要

• 論文の詳細を見る

• Image recognition in client server system has a problem of data traffic. However, reducing data traffic gives rise to worsening of performance. Therefore, we represent binary codes as high dimensional local features in client side, and represent real vectors in server side. As a result, we can suppress the worsening of the performance, but it problems of an increase in the computational cost of the distance computation and a different scale of norm between feature vectors. Therefore, to solve the first problem, we optimize the scale factor so as to absorb the scale difference of Euclidean norm. For second problem, we compute efficiently the Euclidean distance by decomposing the real vector into weight factors and binary basis vectors. As a result, the proposed method achieves the keypoint matching with high-speed and high-precision even if the data traffic was reduced.

• Information and Media Technologies 編集運営会議の論文

著者

• Ambai Mitsuru

  Denso It Laboratory Inc.

• Yoshida Yuichi

  Denso It Laboratory Inc.

• Yamauchi Yuji

  Chubu University

• Sato Ikuro

  Denso IT Laboratory, Inc.

• Fujiyoshi Hironobu

  Chubu University

関連論文

• Augmenting Training Samples with a Large Number of Rough Segmentation Datasets
• Dimensionality Reduction for Histogram Features Based on Supervised Non-negative Matrix Factorization
• Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching
• Sparse Isotropic Hashing
• Sparse Isotropic Hashing
• A Single Framework for Action Recognition Based on Boosted Randomized Trees
• Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching

スポンサーリンク