{"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/faldoi-a-new-minimization-strategy-for-large","title":"FALDOI: A new minimization strategy for large displacement variational optical flow","arxiv_id":"1602.08960","date":"2016-02-29","proceeding":null,"authors":["Roberto P. Palomares","Enric Meinhardt-Llopis","Coloma Ballester","Gloria Haro"],"abstract":"We propose a large displacement optical flow method that introduces a new\nstrategy to compute a good local minimum of any optical flow energy functional.\nThe method requires a given set of discrete matches, which can be extremely\nsparse, and an energy functional which locally guides the interpolation from\nthose matches. In particular, the matches are used to guide a structured\ncoordinate-descent of the energy functional around these keypoints. It results\nin a two-step minimization method at the finest scale which is very robust to\nthe inevitable outliers of the sparse matcher and able to capture large\ndisplacements of small objects. Its benefits over other variational methods\nthat also rely on a set of sparse matches are its robustness against very few\nmatches, high levels of noise and outliers. We validate our proposal using\nseveral optical flow variational models. The results consistently outperform\nthe coarse-to-fine approaches and achieve good qualitative and quantitative\nperformance on the standard optical flow benchmarks.","url_abs":"http://arxiv.org/abs/1602.08960v3","url_pdf":"http://arxiv.org/pdf/1602.08960v3.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":"faldoi-a-new-minimization-strategy-for-large","repo_url":"https://github.com/fperezgamonal/faldoi-ipol","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"optical-flow-estimation","task_name":"Optical Flow Estimation"}],"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":"fperezgamonal/faldoi-ipol","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":"a3d120faa2e79b8d3ffc2b5c2dd1316270d366e7474e7e8a833515a8505c711a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}