Binary Histogrammed Intensity Patches for Efficient and Robust Matching

ISSN： 0920-5691

Source： International Journal of Computer Vision, Vol.94, Iss.2, 2011-09, pp. : 241-265

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 13, Iss. 4, 2017-10 ,pp. : 198-220

IGI Global_journal

Access to resources Recommend Favorite

Efficient matching of large-size histograms

By Jou F.-D. Fan K.-C. Chang Y.-L.

Pattern Recognition Letters, Vol. 25, Iss. 3, 2004-02 ,pp. : 277-286

Elsevier

Access to resources Recommend Favorite

A New Efficient Block-Matching Algorithm for Motion Estimation

By Mahmoud Hanan Goel Sumeer Shaaban Mohsen Bayoumi Magdy

Journal of VLSI Signal Processing, Vol. 42, Iss. 1, 2006-01 ,pp. : 21-33

Springer Publishing Company

Access to resources Recommend Favorite

Efficient validation of matching hypotheses using Mahalanobis distance

By Montiel J.M.M. Montano L.

Engineering Applications of Artificial Intelligence, Vol. 11, Iss. 3, 1998-06 ,pp. : 439-448

Elsevier

Access to resources Recommend Favorite

Space-efficient multiple string matching automata

By Zhang Meng Yang Tianyu Wu Rui

International Journal of Wireless and Mobile Computing, Vol. 5, Iss. 3, 2012-07 ,pp. : 308-313

Inderscience Publishers

Access to resources Recommend Favorite