{"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/neural-best-buddies-sparse-cross-domain","title":"Neural Best-Buddies: Sparse Cross-Domain Correspondence","arxiv_id":"1805.04140","date":"2018-05-10","proceeding":null,"authors":["Kfir Aberman","Jing Liao","Mingyi Shi","Dani Lischinski","Baoquan Chen","Daniel Cohen-Or"],"abstract":"Correspondence between images is a fundamental problem in computer vision,\nwith a variety of graphics applications. This paper presents a novel method for\nsparse cross-domain correspondence. Our method is designed for pairs of images\nwhere the main objects of interest may belong to different semantic categories\nand differ drastically in shape and appearance, yet still contain semantically\nrelated or geometrically similar parts. Our approach operates on hierarchies of\ndeep features, extracted from the input images by a pre-trained CNN.\nSpecifically, starting from the coarsest layer in both hierarchies, we search\nfor Neural Best Buddies (NBB): pairs of neurons that are mutual nearest\nneighbors. The key idea is then to percolate NBBs through the hierarchy, while\nnarrowing down the search regions at each level and retaining only NBBs with\nsignificant activations. Furthermore, in order to overcome differences in\nappearance, each pair of search regions is transformed into a common\nappearance. We evaluate our method via a user study, in addition to comparisons\nwith alternative correspondence approaches. The usefulness of our method is\ndemonstrated using a variety of graphics applications, including cross-domain\nimage alignment, creation of hybrid images, automatic image morphing, and more.","url_abs":"http://arxiv.org/abs/1805.04140v2","url_pdf":"http://arxiv.org/pdf/1805.04140v2.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":"neural-best-buddies-sparse-cross-domain","repo_url":"https://github.com/kfiraberman/neural_best_buddies","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"neural-best-buddies-sparse-cross-domain","repo_url":"https://github.com/sunniesuhyoung/DST","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"image-morphing","task_name":"Image Morphing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"kfiraberman/neural_best_buddies","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sunniesuhyoung/DST","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":"c3ad99013c1f69e34d9a5d6b93143466b51d164b4220251044c738a84d5f903d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}