A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
In this work, we consider the dense reconstruction of specular objects. We propose the use of a specularity constraint, based on surface normal/depth consistency, to define a matc...
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
Most data integration applications require a matching between the schemas of the respective data sets. We show how the existence of duplicates within these data sets can be exploi...