Open AccessPlace recognition for visual loop‐closures using similarities of object graphs
Author(s) -
Oh J.H.,
Jeon J.D.,
Lee B.H.
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.3996
Subject(s) - similarity (geometry) , object (grammar) , enhanced data rates for gsm evolution , representation (politics) , artificial intelligence , computer science , cognitive neuroscience of visual object recognition , computer vision , loop (graph theory) , pattern recognition (psychology) , robot , false positive paradox , key (lock) , theoretical computer science , mathematics , image (mathematics) , combinatorics , computer security , politics , political science , law
A new method for object‐based place recognition, where objects are used as a key intermediate representation of places, is proposed. Places are represented by object graphs and recognised from similarity scores between the generated graphs. An iterative Hungarian method is proposed for aligning graphs, where node and edge differences are used for measuring the similarity. The proposed technique robustly detects places without false positives, as it considers both the appearance and geometric information of places. Experiments are performed with mobile robots in indoor environments verified the effectiveness of the proposed method.