{"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/deepmatching-hierarchical-deformable-dense","title":"DeepMatching: Hierarchical Deformable Dense Matching","arxiv_id":"1506.07656","date":"2015-06-25","proceeding":null,"authors":["Jerome Revaud","Philippe Weinzaepfel","Zaid Harchaoui","Cordelia Schmid"],"abstract":"We introduce a novel matching algorithm, called DeepMatching, to compute\ndense correspondences between images. DeepMatching relies on a hierarchical,\nmulti-layer, correlational architecture designed for matching images and was\ninspired by deep convolutional approaches. The proposed matching algorithm can\nhandle non-rigid deformations and repetitive textures and efficiently\ndetermines dense correspondences in the presence of significant changes between\nimages. We evaluate the performance of DeepMatching, in comparison with\nstate-of-the-art matching algorithms, on the Mikolajczyk (Mikolajczyk et al\n2005), the MPI-Sintel (Butler et al 2012) and the Kitti (Geiger et al 2013)\ndatasets. DeepMatching outperforms the state-of-the-art algorithms and shows\nexcellent results in particular for repetitive textures.We also propose a\nmethod for estimating optical flow, called DeepFlow, by integrating\nDeepMatching in the large displacement optical flow (LDOF) approach of Brox and\nMalik (2011). Compared to existing matching algorithms, additional robustness\nto large displacements and complex motion is obtained thanks to our matching\napproach. DeepFlow obtains competitive performance on public benchmarks for\noptical flow estimation.","url_abs":"http://arxiv.org/abs/1506.07656v2","url_pdf":"http://arxiv.org/pdf/1506.07656v2.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":"deepmatching-hierarchical-deformable-dense","repo_url":"https://github.com/vwegn/dm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"dense-pixel-correspondence-estimation","task_name":"Dense Pixel Correspondence Estimation"},{"task_slug":"optical-flow-estimation","task_name":"Optical Flow Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dense-pixel-correspondence-estimation-on","task":"Dense Pixel Correspondence Estimation","dataset":"HPatches","model":"DeepMatching*","rank_in_archive_order":4,"of":8,"metrics":{"Viewpoint I AEPE":"5.84","Viewpoint II AEPE":"4.63","Viewpoint III AEPE":"12.43","Viewpoint IV AEPE":"12.17","Viewpoint V AEPE":"22.55"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"vwegn/dm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1409.1556"],"harvested_for_calls":[{"arxiv_id":"1409.1556","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1409.1556"},"call":"get_harvested_code_for_paper(arxiv_id=\"1409.1556\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"adaf178a6f4809745f9e8b14f6784ed1d280d54e5d102524f5bf3c07b84cac12","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}