{"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/gpu-based-computation-of-2d-least-median-of","title":"GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection","arxiv_id":"1510.01041","date":"2015-10-05","proceeding":null,"authors":["Gil Shapira","Tal Hassner"],"abstract":"The 2D Least Median of Squares (LMS) is a popular tool in robust regression\nbecause of its high breakdown point: up to half of the input data can be\ncontaminated with outliers without affecting the accuracy of the LMS estimator.\nThe complexity of 2D LMS estimation has been shown to be $\\Omega(n^2)$ where\n$n$ is the total number of points. This high theoretical complexity along with\nthe availability of graphics processing units (GPU) motivates the development\nof a fast, parallel, GPU-based algorithm for LMS computation. We present a CUDA\nbased algorithm for LMS computation and show it to be much faster than the\noptimal state of the art single threaded CPU algorithm. We begin by describing\nthe proposed method and analyzing its performance. We then demonstrate how it\ncan be used to modify the well-known Hough Transform (HT) in order to\nefficiently detect image lines in noisy images. Our method is compared with\nstandard HT-based line detection methods and shown to overcome their\nshortcomings in terms of both efficiency and accuracy.","url_abs":"http://arxiv.org/abs/1510.01041v1","url_pdf":"http://arxiv.org/pdf/1510.01041v1.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":"gpu-based-computation-of-2d-least-median-of","repo_url":"https://github.com/ligaripash/CudaLMS2D","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":null,"task_name":"GPU"},{"task_slug":"line-detection","task_name":"Line Detection"}],"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":"ligaripash/CudaLMS2D","kind":"official","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":"5f1ac1b250b9d196193c4f28ce496e55c208d79963a6de0c14b3ddcdb6176cfb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}