{"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/learning-correspondence-from-the-cycle","title":"Learning Correspondence from the Cycle-Consistency of Time","arxiv_id":"1903.07593","date":"2019-03-18","proceeding":"CVPR 2019 6","authors":["Xiaolong Wang","Allan Jabri","Alexei A. Efros"],"abstract":"We introduce a self-supervised method for learning visual correspondence from\nunlabeled video. The main idea is to use cycle-consistency in time as free\nsupervisory signal for learning visual representations from scratch. At\ntraining time, our model learns a feature map representation to be useful for\nperforming cycle-consistent tracking. At test time, we use the acquired\nrepresentation to find nearest neighbors across space and time. We demonstrate\nthe generalizability of the representation -- without finetuning -- across a\nrange of visual correspondence tasks, including video object segmentation,\nkeypoint tracking, and optical flow. Our approach outperforms previous\nself-supervised methods and performs competitively with strongly supervised\nmethods.","url_abs":"http://arxiv.org/abs/1903.07593v2","url_pdf":"http://arxiv.org/pdf/1903.07593v2.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":"learning-correspondence-from-the-cycle","repo_url":"https://github.com/xiaolonw/TimeCycle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"optical-flow-estimation","task_name":"Optical Flow Estimation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"semi-supervised-video-object-segmentation","task_name":"Semi-Supervised Video Object Segmentation"},{"task_slug":"unsupervised-video-object-segmentation","task_name":"Unsupervised Video Object Segmentation"},{"task_slug":"video-object-segmentation","task_name":"Video Object Segmentation"},{"task_slug":"video-semantic-segmentation","task_name":"Video Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/visual-object-tracking-on-davis-2017","task":"Semi-Supervised Video Object Segmentation","dataset":"DAVIS 2017 (val)","model":"CycleTime","rank_in_archive_order":80,"of":81,"metrics":{"F-measure (Mean)":"50.0","F-measure (Recall)":"48.0","J&F":"48.7","Jaccard (Mean)":"46.4","Jaccard (Recall)":"50.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.07593","atlas_url":"https://app.syntology.ai/?focus=1903.07593","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":"1903.07593"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.07593\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.07593"},"call":"get_concepts_for_paper(arxiv_id=\"1903.07593\")"}],"by_repo":[{"repo":"xiaolonw/TimeCycle","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":"9e085029f08dc511cb1d0b6897f1fe32c8d1e57b722a7cdd7d37ba25078202f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}