{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/mods-fast-and-robust-method-for-two-view","title":"MODS: Fast and Robust Method for Two-View Matching","arxiv_id":"1503.02619","date":"2015-03-09","proceeding":null,"authors":["Dmytro Mishkin","Jiri Matas","Michal Perdoch"],"abstract":"A novel algorithm for wide-baseline matching called MODS - Matching On Demand\nwith view Synthesis - is presented. The MODS algorithm is experimentally shown\nto solve a broader range of wide-baseline problems than the state of the art\nwhile being nearly as fast as standard matchers on simple problems. The\napparent robustness vs. speed trade-off is finessed by the use of progressively\nmore time-consuming feature detectors and by on-demand generation of\nsynthesized images that is performed until a reliable estimate of geometry is\nobtained.\n  We introduce an improved method for tentative correspondence selection,\napplicable both with and without view synthesis. A modification of the standard\nfirst to second nearest distance rule increases the number of correct matches\nby 5-20% at no additional computational cost.\n  Performance of the MODS algorithm is evaluated on several standard publicly\navailable datasets, and on a new set of geometrically challenging wide baseline\nproblems that is made public together with the ground truth. Experiments show\nthat the MODS outperforms the state-of-the-art in robustness and speed.\nMoreover, MODS performs well on other classes of difficult two-view problems\nlike matching of images from different modalities, with wide temporal baseline\nor with significant lighting changes.","url_abs":"http://arxiv.org/abs/1503.02619v2","url_pdf":"http://arxiv.org/pdf/1503.02619v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"mods-fast-and-robust-method-for-two-view","repo_url":"https://github.com/ducha-aiki/mods","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"mods-fast-and-robust-method-for-two-view","repo_url":"https://github.com/ducha-aiki/mods-light-zmq","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.02619","atlas_url":"https://app.syntology.ai/?focus=1503.02619","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1503.02619"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.02619\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.02619"},"call":"get_concepts_for_paper(arxiv_id=\"1503.02619\")"}],"by_repo":[{"repo":"ducha-aiki/mods","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ducha-aiki/mods-light-zmq","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4b86340cc881e83460e65d2b82db369b97b5c6c2b4f6e3ba64c941f88aa26214","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}