{"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/dgc-net-dense-geometric-correspondence","title":"DGC-Net: Dense Geometric Correspondence Network","arxiv_id":"1810.08393","date":"2018-10-19","proceeding":null,"authors":["Iaroslav Melekhov","Aleksei Tiulpin","Torsten Sattler","Marc Pollefeys","Esa Rahtu","Juho Kannala"],"abstract":"This paper addresses the challenge of dense pixel correspondence estimation\nbetween two images. This problem is closely related to optical flow estimation\ntask where ConvNets (CNNs) have recently achieved significant progress. While\noptical flow methods produce very accurate results for the small pixel\ntranslation and limited appearance variation scenarios, they hardly deal with\nthe strong geometric transformations that we consider in this work. In this\npaper, we propose a coarse-to-fine CNN-based framework that can leverage the\nadvantages of optical flow approaches and extend them to the case of large\ntransformations providing dense and subpixel accurate estimates. It is trained\non synthetic transformations and demonstrates very good performance to unseen,\nrealistic, data. Further, we apply our method to the problem of relative camera\npose estimation and demonstrate that the model outperforms existing dense\napproaches.","url_abs":"http://arxiv.org/abs/1810.08393v2","url_pdf":"http://arxiv.org/pdf/1810.08393v2.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":"dgc-net-dense-geometric-correspondence","repo_url":"https://github.com/AaltoVision/DGC-Net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"dgc-net-dense-geometric-correspondence","repo_url":"https://github.com/2023-MindSpore-1/ms-code-211/tree/main/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"dgc-net-dense-geometric-correspondence","repo_url":"https://github.com/MindSpore-paper-code-3/code8/tree/main/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"dgc-net-dense-geometric-correspondence","repo_url":"https://github.com/code-implementation1/Code1/tree/main/dgcnet_res101","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"camera-pose-estimation","task_name":"Camera Pose Estimation"},{"task_slug":"dense-pixel-correspondence-estimation","task_name":"Dense Pixel Correspondence Estimation"},{"task_slug":"optical-flow-estimation","task_name":"Optical Flow Estimation"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/dense-pixel-correspondence-estimation-on","task":"Dense Pixel Correspondence Estimation","dataset":"HPatches","model":"DGC-Net aff+tps+homo","rank_in_archive_order":2,"of":8,"metrics":{"Viewpoint I AEPE":"1.55","Viewpoint II AEPE":"5.53","Viewpoint III AEPE":"8.98","Viewpoint IV AEPE":"11.66","Viewpoint V AEPE":"16.70"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.08393","atlas_url":"https://app.syntology.ai/?focus=1810.08393","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":"1810.08393"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.08393\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.08393"},"call":"get_concepts_for_paper(arxiv_id=\"1810.08393\")"}],"by_repo":[{"repo":"AaltoVision/DGC-Net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-1/ms-code-211","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"code-implementation1/Code1","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2012.12877"],"harvested_for_calls":[{"arxiv_id":"2012.12877","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.12877"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.12877\")"}]}],"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":"e1cb42cef25d167a67db56ecafbab48ca9e7a1efb968d328d94732a5253fc601","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}