{"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/a-numerical-framework-for-efficient-motion","title":"A Numerical Framework for Efficient Motion Estimation on Evolving Sphere-Like Surfaces based on Brightness and Mass Conservation Laws","arxiv_id":"1805.01006","date":"2018-05-02","proceeding":null,"authors":["Lukas F. Lang"],"abstract":"In this work we consider brightness and mass conservation laws for motion\nestimation on evolving Riemannian 2-manifolds that allow for a radial\nparametrisation from the 2-sphere. While conservation of brightness constitutes\nthe foundation for optical flow methods and has been generalised to said\nscenario, we formulate in this article the principle of mass conservation for\ntime-varying surfaces which are embedded in Euclidean 3-space and derive a\ngeneralised continuity equation. The main motivation for this work is efficient\ncell motion estimation in time-lapse (4D) volumetric fluorescence microscopy\nimages of a living zebrafish embryo. Increasing spatial and temporal resolution\nof modern microscopes require efficient analysis of such data. With this\napplication in mind we address this need and follow an emerging paradigm in\nthis field: dimensional reduction. In light of the ill-posedness of considered\nconservation laws we employ Tikhonov regularisation and propose the use of\nspatially varying regularisation functionals that recover motion only in\nregions with cells. For the efficient numerical solution we devise a Galerkin\nmethod based on compactly supported (tangent) vectorial basis functions.\nFurthermore, for the fast and accurate estimation of the evolving sphere-like\nsurface from scattered data we utilise surface interpolation with\nspatio-temporal regularisation. We present numerical results based on\naforementioned zebrafish microscopy data featuring fluorescently labelled\ncells.","url_abs":"http://arxiv.org/abs/1805.01006v1","url_pdf":"http://arxiv.org/pdf/1805.01006v1.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":"a-numerical-framework-for-efficient-motion","repo_url":"https://github.com/lukaslang/ofcm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"motion-estimation","task_name":"Motion Estimation"},{"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":"lukaslang/ofcm","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":"0460d020342698ae8e0c26caf9ed3b3157447990c255f198407d175c1395a3e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}