2013 IEEE International Conference on Computer Vision 2013
DOI: 10.1109/iccv.2013.432
|View full text |Cite
|
Sign up to set email alerts
|

Discovering Details and Scene Structure with Hierarchical Iconoid Shift

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. HI… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 26 publications
0
11
0
Order By: Relevance
“…A number of image clustering methods based on local features have been introduced [37,38,39]. Due to the spatial verification, the clusters discovered by these methods are reliable.…”
Section: Arxiv:160402426v3 [Cscv] 7 Sep 2016mentioning
confidence: 99%
“…A number of image clustering methods based on local features have been introduced [37,38,39]. Due to the spatial verification, the clusters discovered by these methods are reliable.…”
Section: Arxiv:160402426v3 [Cscv] 7 Sep 2016mentioning
confidence: 99%
“…In addition, solving the visual localization problem enables a system to determine the content of a photo. This can be used to develop interesting new applications, e.g., virtual tourism [9] and automatic annotation of photos [10], [11].…”
Section: Introductionmentioning
confidence: 99%
“…A few works addressed the problem of directly identifying or retrieving details, instead of relying on semantic annotation. Weyand and Liebe [13] address the problem of discovering popular details given a large collection of images of a specific building. They presented an offline hierarchical technique capable of finding iconic images at various scales, iteratively solving a medoid shift increasing the kernel bandwidth.…”
Section: Related Workmentioning
confidence: 99%