← Search

Dmytro Mishkin

7 accepted papers

2025

Explaining Human Preferences via Metrics for Structured 3D Reconstruction

ICCV 2025poster

"What cannot be measured cannot be improved" while likely never uttered by Lord Kelvin, summarizes effectively the driving force behind this work. This paper presents a detailed discussion of automated metrics for evaluating structured 3D reconstructions. Pitfalls of each metric are discussed, and a…

Cited by 0SourcePDFScholar
2024

StereoGlue: Joint Feature Matching and Robust Estimation

ECCV 2024poster

"We propose StereoGlue, a method designed for joint feature matching and robust estimation that effectively reduces the combinatorial complexity of these tasks using single-point minimal solvers. StereoGlue is applicable to a range of problems, including but not limited to relative pose and homograp…

2023

A Large-Scale Homography Benchmark

CVPR 2023poster

We present a large-scale dataset of Planes in 3D, Pi3D, of roughly 1000 planes observed in 10 000 images from the 1DSfM dataset, and HEB, a large-scale homography estimation benchmark leveraging Pi3D. The applications of the Pi3D dataset are diverse, e.g. training or evaluating monocular depth, surf…

2021

Efficient Initial Pose-Graph Generation for Global SfM

CVPR 2021poster

We propose ways to speed up the initial pose-graph generation for global Structure-from-Motion algorithms. To avoid forming tentative point correspondences by FLANN and geometric verification by RANSAC, which are the most time-consuming steps of the pose-graph creation, we propose two new methods --…

Cited by 34PDFcodeScholar
2018

DeblurGAN: Blind Motion Deblurring Using Conditional Adversarial Networks

CVPR 2018poster

We present DeblurGAN, an end-to-end learned method for motion deblurring. The learning is based on a conditional GAN and the content loss . DeblurGAN achieves state-of-the art performance both in the structural similarity measure and visual appearance. The quality of the deblurring model is also e…

2018

Repeatability Is Not Enough: Learning Affine Regions via Discriminability

ECCV 2018poster

A method for learning local affine-covariant regions is presented. We show that maximizing geometric repeatability does not lead to local regions, a.k.a features, that are reliably matched and this necessitates descriptor-based learning. We explore factors that influence such learning and registrati…

2017

Working hard to know your neighbor's margins: Local descriptor learning loss

NeurIPS 2017poster

We introduce a loss for metric learning, which is inspired by the Lowe's matching criterion for SIFT. We show that the proposed loss, that maximizes the distance between the closest positive and closest negative example in the batch, is better than complex regularization methods; it works well for b…