default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Perdoch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i5]Cheng-hsin Wuu, Ningyuan Zheng, Scott Ardisson, Rohan Bali, Danielle Belko, Eric Brockmeyer, Lucas Evans, Timothy Godisart, Hyowon Ha, Alexander Hypes, Taylor Koska, Steven Krenn, Stephen Lombardi, Xiaomin Luo, Kevyn McPhail, Laura Millerschoen, Michal Perdoch, Mark Pitts, Alexander Richard, Jason M. Saragih, Junko Saragih, Takaaki Shiratori, Tomas Simon, Matt Stewart, Autumn Trimble, Xinshuo Weng, David Whitewolf, Chenglei Wu, Shoou-I Yu, Yaser Sheikh:
Multiface: A Dataset for Neural Face Rendering. CoRR abs/2207.11243 (2022)- 2021
- [c19]Yaroslava Lochman, Kostiantyn Liepieshov, Jianhui Chen, Michal Perdoch, Christopher Zach, James Pritts
:
BabelCalib: A Universal Approach to Calibrating Central Cameras. ICCV 2021: 15233-15242 - [i4]Yaroslava Lochman, Kostiantyn Liepieshov, Jianhui Chen, Michal Perdoch, Christopher Zach, James Pritts:
BabelCalib: A Universal Approach to Calibrating Central Cameras. CoRR abs/2109.09704 (2021)
2010 – 2019
- 2019
- [j6]Shih-En Wei, Jason M. Saragih, Tomas Simon, Adam W. Harley, Stephen Lombardi, Michal Perdoch, Alexander Hypes, Dawei Wang, Hernán Badino, Yaser Sheikh:
VR facial animation via multiview image translation. ACM Trans. Graph. 38(4): 67:1-67:16 (2019) - 2017
- [c18]Hyowon Ha, Michal Perdoch, Hatem Alismail, In So Kweon, Yaser Sheikh:
Deltille Grids for Geometric Camera Calibration. ICCV 2017: 5354-5362 - [c17]Louis Lettry, Michal Perdoch, Kenneth Vanhoey, Luc Van Gool:
Repeated Pattern Detection Using CNN Activations. WACV 2017: 47-55 - 2016
- [c16]Alex Locher, Michal Perdoch, Luc Van Gool:
Progressive Prioritized Multi-view Stereo. CVPR 2016: 3244-3252 - [c15]Alex Locher, Michal Perdoch, Hayko Riemenschneider, Luc Van Gool:
Mobile phone and cloud - A dream team for 3D reconstruction. WACV 2016: 1-8 - 2015
- [j5]Dmytro Mishkin, Jiri Matas, Michal Perdoch:
MODS: Fast and robust method for two-view matching. Comput. Vis. Image Underst. 141: 81-93 (2015) - [c14]Dmytro Mishkin, Jiri Matas, Michal Perdoch, Karel Lenc:
WxBS: Wide Baseline Stereo Generalizations. BMVC 2015: 12.1-12.12 - [c13]Michal Perdoch, David M. Bradley, Jonathan K. Chang, Herman Herman, Peter Rander, Anthony Stentz:
Leader tracking for a walking logistics robot. IROS 2015: 2994-3001 - [i3]Dmytro Mishkin, Jiri Matas, Michal Perdoch:
MODS: Fast and Robust Method for Two-View Matching. CoRR abs/1503.02619 (2015) - [i2]Dmytro Mishkin, Jiri Matas, Michal Perdoch, Karel Lenc:
WxBS: Wide Baseline Stereo Generalizations. CoRR abs/1504.06603 (2015) - 2014
- [j4]Andrej Mikulík, Michal Perdoch, Ondrej Chum, Jiri Matas:
Erratum to: Learning Vocabularies over a Fine Quantization. Int. J. Comput. Vis. 106(1): 113 (2014) - 2013
- [j3]Andrej Mikulík, Michal Perdoch, Ondrej Chum, Jiri Matas:
Learning Vocabularies over a Fine Quantization. Int. J. Comput. Vis. 103(1): 163-175 (2013) - [c12]Dmytro Mishkin, Michal Perdoch, Jiri Matas:
Two-view matching with view synthesis revisited. IVCNZ 2013: 436-441 - [i1]Dmytro Mishkin, Michal Perdoch, Jiri Matas:
Two-View Matching with View Synthesis Revisited. CoRR abs/1306.3855 (2013) - 2011
- [j2]Cédric Lemaitre, Michal Perdoch, Adel Rahmoune, Jiri Matas, Johel Mitéran:
Detection and matching of curvilinear structures. Pattern Recognit. 44(7): 1514-1527 (2011) - [c11]Ondrej Chum, Andrej Mikulík, Michal Perdoch, Jiri Matas:
Total recall II: Query expansion revisited. CVPR 2011: 889-896 - 2010
- [j1]Jan Cech, Jiri Matas, Michal Perdoch:
Efficient Sequential Correspondence Selection by Cosegmentation. IEEE Trans. Pattern Anal. Mach. Intell. 32(9): 1568-1581 (2010) - [c10]Andrej Mikulík, Michal Perdoch, Ondrej Chum, Jiri Matas:
Learning a Fine Vocabulary. ECCV (3) 2010: 1-14 - [c9]Petr Doubek, Jiri Matas, Michal Perdoch, Ondrej Chum:
Image Matching and Retrieval by Repetitive Patterns. ICPR 2010: 3195-3198 - [c8]Andrej Mikulík, Jiri Matas, Michal Perdoch, Ondrej Chum:
Construction of Precise Local Affine Frames. ICPR 2010: 3565-3569
2000 – 2009
- 2009
- [c7]Michal Perdoch, Ondrej Chum, Jiri Matas:
Efficient representation of local geometry for large scale object retrieval. CVPR 2009: 9-16 - [c6]Ondrej Chum, Michal Perdoch, Jiri Matas:
Geometric min-Hashing: Finding a (thick) needle in a haystack. CVPR 2009: 17-24 - 2008
- [c5]Jan Cech, Jiri Matas, Michal Perdoch:
Efficient sequential correspondence selection by cosegmentation. CVPR 2008 - [c4]Stepán Obdrzálek, Michal Perdoch, Jiri Matas:
Dense linear-time correspondences for tracking. CVPR Workshops 2008: 1-8 - 2007
- [c3]Michal Perdoch, Jiri Matas, Stepán Obdrzálek:
Stable Affine Frames on Isophotes. ICCV 2007: 1-8 - [c2]Hugo Cornelius, Michal Perdoch, Jiri Matas, Gareth Loy:
Efficient Symmetry Detection Using Local Affine Frames. SCIA 2007: 152-161 - 2006
- [c1]Michal Perdoch, Jiri Matas, Ondrej Chum:
Epipolar Geometry from Two Correspondences. ICPR (4) 2006: 215-219
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
