DocumentCode
3429310
Title
Discovering Details and Scene Structure with Hierarchical Iconoid Shift
Author
Weyand, Tobias ; Leibe, Bastian
Author_Institution
Comput. Vision Group, RWTH Aachen Univ., Aachen, Germany
fYear
2013
fDate
1-8 Dec. 2013
Firstpage
3479
Lastpage
3486
Abstract
Current landmark recognition engines are typically aimed at recognizing building-scale landmarks, but miss interesting details like portals, statues or windows. This is because they use a flat clustering that summarizes all photos of a building facade in one cluster. We propose Hierarchical Iconoid Shift, a novel landmark clustering algorithm capable of discovering such details. Instead of just a collection of clusters, the output of HIS is a set of dendrograms describing the detail hierarchy of a landmark. HIS is based on the novel Hierarchical Medoid Shift clustering algorithm that performs a continuous mode search over the complete scale space. HMS is completely parameter-free, has the same complexity as Medoid Shift and is easy to parallelize. We evaluate HIS on 800k images of 34 landmarks and show that it can extract an often surprising amount of detail and structure that can be applied, e.g., to provide a mobile user with more detailed information on a landmark or even to extend the landmark´s Wikipedia article.
Keywords
image recognition; pattern clustering; structural engineering computing; HIS; dendrograms; hierarchical iconoid shift; hierarchical medoid shift clustering algorithm; landmark clustering algorithm; landmark recognition engines; scene structure; Bandwidth; Corona; Electronic publishing; Encyclopedias; Internet; Kernel; hierarchical clustering; image clustering; medoid shift; scale space; semantic labelling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision (ICCV), 2013 IEEE International Conference on
Conference_Location
Sydney, NSW
ISSN
1550-5499
Type
conf
DOI
10.1109/ICCV.2013.432
Filename
6751544
Link To Document