{"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/geometry-consistent-generative-adversarial","title":"Geometry-Consistent Generative Adversarial Networks for One-Sided Unsupervised Domain Mapping","arxiv_id":"1809.05852","date":"2018-09-16","proceeding":"CVPR 2019 6","authors":["Huan Fu","Mingming Gong","Chaohui Wang","Kayhan Batmanghelich","Kun Zhang","DaCheng Tao"],"abstract":"Unsupervised domain mapping aims to learn a function to translate domain X to\nY by a function GXY in the absence of paired examples. Finding the optimal GXY\nwithout paired data is an ill-posed problem, so appropriate constraints are\nrequired to obtain reasonable solutions. One of the most prominent constraints\nis cycle consistency, which enforces the translated image by GXY to be\ntranslated back to the input image by an inverse mapping GYX. While cycle\nconsistency requires the simultaneous training of GXY and GY X, recent studies\nhave shown that one-sided domain mapping can be achieved by preserving pairwise\ndistances between images. Although cycle consistency and distance preservation\nsuccessfully constrain the solution space, they overlook the special properties\nthat simple geometric transformations do not change the semantic structure of\nimages. Based on this special property, we develop a geometry-consistent\ngenerative adversarial network (GcGAN), which enables one-sided unsupervised\ndomain mapping. GcGAN takes the original image and its counterpart image\ntransformed by a predefined geometric transformation as inputs and generates\ntwo images in the new domain coupled with the corresponding\ngeometry-consistency constraint. The geometry-consistency constraint reduces\nthe space of possible solutions while keep the correct solutions in the search\nspace. Quantitative and qualitative comparisons with the baseline (GAN alone)\nand the state-of-the-art methods including CycleGAN and DistanceGAN demonstrate\nthe effectiveness of our method.","url_abs":"http://arxiv.org/abs/1809.05852v2","url_pdf":"http://arxiv.org/pdf/1809.05852v2.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":"geometry-consistent-generative-adversarial","repo_url":"https://github.com/hufu6371/gcgan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":null,"task_name":"Generative Adversarial Network"}],"methods":[{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"cycle-consistency-loss","method_name":"Cycle Consistency Loss"},{"method_slug":"gan-least-squares-loss","method_name":"GAN Least Squares Loss"},{"method_slug":"instance-normalization","method_name":"Instance Normalization"},{"method_slug":"patchgan","method_name":"PatchGAN"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.05852","atlas_url":"https://app.syntology.ai/?focus=1809.05852","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":"1809.05852"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.05852\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.05852"},"call":"get_concepts_for_paper(arxiv_id=\"1809.05852\")"}],"by_repo":[{"repo":"hufu6371/gcgan","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":"257a7cba70999febe7cb24b3fc0bd8db29c27fd91c57b8c715af199f7d3d7bdc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}