scispace - formally typeset
O

Ondrej Chum

Researcher at Czech Technical University in Prague

Publications -  102
Citations -  22597

Ondrej Chum is an academic researcher from Czech Technical University in Prague. The author has contributed to research in topics: Image retrieval & RANSAC. The author has an hindex of 35, co-authored 99 publications receiving 20104 citations. Previous affiliations of Ondrej Chum include University of Oxford.

Papers
More filters
Journal ArticleDOI

Robust wide-baseline stereo from maximally stable extremal regions

TL;DR: The high utility of MSERs, multiple measurement regions and the robust metric is demonstrated in wide-baseline experiments on image pairs from both indoor and outdoor scenes.
Proceedings ArticleDOI

Robust wide baseline stereo from maximally stable extremal regions

TL;DR: The wide-baseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints, is studied and an efficient and practically fast detection algorithm is presented for an affinely-invariant stable subset of extremal regions, the maximally stable extremal region (MSER).
Proceedings ArticleDOI

Object retrieval with large vocabularies and fast spatial matching

TL;DR: To improve query performance, this work adds an efficient spatial verification stage to re-rank the results returned from the bag-of-words model and shows that this consistently improves search quality, though by less of a margin when the visual vocabulary is large.
Proceedings ArticleDOI

Lost in quantization: Improving particular object retrieval in large scale image databases

TL;DR: In this paper, a weighted set of visual words is obtained by selecting words based on proximity in descriptor space, and this representation may be incorporated into a standard tf-idf architecture and how spatial verification is modified in the case of this soft-assignment.
Proceedings ArticleDOI

Matching with PROSAC - progressive sample consensus

Ondrej Chum, +1 more
TL;DR: A new robust matching method, PROSAC, which exploits the linear ordering defined on the set of correspondences by a similarity function used in establishing tentative correspondences and achieves large computational savings.