Follow
Maksym Ivashechkin
Maksym Ivashechkin
Verified email at surrey.ac.uk
Title
Cited by
Cited by
Year
MAGSAC++, a fast, reliable and accurate robust estimator
D Barath, J Noskova, M Ivashechkin, J Matas
Proceedings of the IEEE/CVF conference on computer vision and pattern …, 2020
2902020
Progressive NAPSAC: sampling from gradually growing neighborhoods
D Barath, M Ivashechkin, J Matas
arXiv preprint arXiv:1906.02295, 2019
342019
VSAC: Efficient and Accurate Estimator for H and F
M Ivashechkin, D Barath, J Matas
IEEE/CVF International Conference on Computer Vision (ICCV), 15243-15252, 2021
292021
Improving 3D Pose Estimation for Sign Language
M Ivashechkin, O Mendez, R Bowden
Eighth International Workshop on Sign Language Translation and Avatar …, 2023
92023
USACv20: robust essential, fundamental and homography matrix estimation
M Ivashechkin, D Barath, J Matas
https://data.vicos.si/cvww20/CVWW20-proceedings.pdf, 2020
92020
a Fast, Reliable and Accurate Robust Estimator
D Barath, J Noskova, M Ivashechkin, JM Matas
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 0
7
Denoising Diffusion for 3D Hand Pose Estimation from Images
M Ivashechkin, O Mendez, R Bowden
Proceedings of the IEEE/CVF International Conference on Computer Vision …, 2023
52023
USAC++ Improved Universal Framework for Random Sample Consensus
M Ivashechkin
Department of Cybernetics Faculty of Electrical Engineering, Czech Technical …, 2019
12019
Two Hands Are Better Than One: Resolving Hand to Hand Intersections via Occupancy Networks
M Ivashechkin, O Mendez, R Bowden
Face and Gesture, 1-9, 2024
2024
USAC 2021 s modelem prostorové koherence robustní vůči degenerovaným datům
I Maksym
České vysoké učení technické v Praze. Vypočetní a informační centrum., 2021
2021
Implementation of the algorithm 1 from" Optimisation based path planning for car parking in narrow environments
M Ivashechkin, J Vlasák, A Novák
2020
Main Conference
M Ivashechkin, O Mendez, R Bowden, I Medvedev, F Shadmand, ...
The system can't perform the operation now. Try again later.
Articles 1–12