Multi‐image matching for object recognition

2018 ◽  
Vol 12 (3) ◽  
pp. 350-356 ◽  
Author(s):  
Jie Zhu ◽  
Shufang Wu ◽  
Xizhao Wang ◽  
Guoqing Yang ◽  
Liyan Ma
Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 380 ◽  
Author(s):  
Agnese Chiatti ◽  
Gianluca Bardaro ◽  
Emanuele Bastianelli ◽  
Ilaria Tiddi ◽  
Prasenjit Mitra ◽  
...  

To assist humans with their daily tasks, mobile robots are expected to navigate complex and dynamic environments, presenting unpredictable combinations of known and unknown objects. Most state-of-the-art object recognition methods are unsuitable for this scenario because they require that: (i) all target object classes are known beforehand, and (ii) a vast number of training examples is provided for each class. This evidence calls for novel methods to handle unknown object classes, for which fewer images are initially available (few-shot recognition). One way of tackling the problem is learning how to match novel objects to their most similar supporting example. Here, we compare different (shallow and deep) approaches to few-shot image matching on a novel data set, consisting of 2D views of common object types drawn from a combination of ShapeNet and Google. First, we assess if the similarity of objects learned from a combination of ShapeNet and Google can scale up to new object classes, i.e., categories unseen at training time. Furthermore, we show how normalising the learned embeddings can impact the generalisation abilities of the tested methods, in the context of two novel configurations: (i) where the weights of a Convolutional two-branch Network are imprinted and (ii) where the embeddings of a Convolutional Siamese Network are L2-normalised.


2015 ◽  
Vol 15 (3) ◽  
pp. 104-113
Author(s):  
Yingying Li ◽  
Jieqing Tan ◽  
Jinqin Zhong

Abstract The local descriptors based on a binary pattern feature have state-of-the-art distinctiveness. However, their high dimensionality resists them from matching faster and being used in a low-end device. In this paper we propose an efficient and feasible learning method to select discriminative binary patterns for constructing a compact local descriptor. In the selection, a searching tree with Branch&Bound is used instead of the exhaustive enumeration, in order to avoid tremendous computation in training. New local descriptors are constructed based on the selected patterns. The efficiency of selecting binary patterns has been confirmed by the evaluation of these new local descriptors’ performance in experiments of image matching and object recognition.


Author(s):  
Kagehiro NAGAO ◽  
Takayuki OKATANI ◽  
Koichiro DEGUCHI

Sign in / Sign up

Export Citation Format

Share Document