Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anastasiia Mishchuk

dblp:247/0895 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-6632-4396ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 100%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
image matching
0.512021
Image Matching Across Wide Baselines: From Paper to Practice · Int. J. Comput. Vis. 2021
Image and video processing › image matching
wide baseline matching
0.512021
Image Matching Across Wide Baselines: From Paper to Practice · Int. J. Comput. Vis. 2021
Computer vision › 3D vision
local feature descriptor
0.412019
Beyond Cartesian Representations for Local Descriptors · ICCV 2019
Computer vision › 3D vision › low-level vision › feature detection
scale-invariant features
0.412019
Beyond Cartesian Representations for Local Descriptors · ICCV 2019

Methods — techniques the papers use, named apart from their topics

evaluation · 0.5benchmarking · 0.5log-polar pooling · 0.4deep network descriptor learning · 0.4
YearPublicationVenuePosition
2021 Image Matching Across Wide Baselines: From Paper to Practice
Yuhe Jin, Dmytro Mishkin, Anastasiia Mishchuk, Jiri Matas, Pascal Fua, Kwang Moo Yi, Eduard Trulls
Int. J. Comput. Vis.3
2019 Beyond Cartesian Representations for Local Descriptors
abstract
The dominant approach for learning local patch descriptors relies on small image regions whose scale must be properly estimated a priori by a keypoint detector. In other words, if two patches are not in correspondence, their descriptors will not match. A strategy often used to alleviate this problem is to “pool” the pixel-wise features over log-polar regions, rather than regularly spaced ones. By contrast, we propose to extract the “support region” directly with a log-polar sampling scheme. We show that this provides us with a better representation by simultaneously oversampling the immediate neighbourhood of the point and undersampling regions far away from it. We demonstrate that this representation is particularly amenable to learning descriptors with deep networks. Our models can match descriptors across a much wider range of scales than was possible before, and also leverage much larger support regions without suffering from occlusions. We report state-of-the-art results on three different datasets.
Patrick Ebel 0002, Eduard Trulls, Kwang Moo Yi, Pascal Fua, Anastasiia Mishchuk
ICCV5