{"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/end-to-end-lane-marker-detection-via-row-wise","title":"End-to-End Lane Marker Detection via Row-wise Classification","arxiv_id":"2005.08630","date":"2020-05-06","proceeding":null,"authors":["Seungwoo Yoo","Heeseok Lee","Heesoo Myeong","Sungrack Yun","Hyoungwoo Park","Janghoon Cho","Duck Hoon Kim"],"abstract":"In autonomous driving, detecting reliable and accurate lane marker positions is a crucial yet challenging task. The conventional approaches for the lane marker detection problem perform a pixel-level dense prediction task followed by sophisticated post-processing that is inevitable since lane markers are typically represented by a collection of line segments without thickness. In this paper, we propose a method performing direct lane marker vertex prediction in an end-to-end manner, i.e., without any post-processing step that is required in the pixel-level dense prediction task. Specifically, we translate the lane marker detection problem into a row-wise classification task, which takes advantage of the innate shape of lane markers but, surprisingly, has not been explored well. In order to compactly extract sufficient information about lane markers which spread from the left to the right in an image, we devise a novel layer, which is utilized to successively compress horizontal components so enables an end-to-end lane marker detection system where the final lane marker positions are simply obtained via argmax operations in testing time. Experimental results demonstrate the effectiveness of the proposed method, which is on par or outperforms the state-of-the-art methods on two popular lane marker detection benchmarks, i.e., TuSimple and CULane.","url_abs":"https://arxiv.org/abs/2005.08630v1","url_pdf":"https://arxiv.org/pdf/2005.08630v1.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":"end-to-end-lane-marker-detection-via-row-wise","repo_url":"https://github.com/Vipermdl/E2E-ERFNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"lane-detection","task_name":"Lane Detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/lane-detection-on-culane","task":"Lane Detection","dataset":"CULane","model":"ERFNet-E2E","rank_in_archive_order":52,"of":63,"metrics":{"F1 score":"74"},"uses_additional_data":false},{"leaderboard":"/sota/lane-detection-on-culane","task":"Lane Detection","dataset":"CULane","model":"ResNet-101-E2E","rank_in_archive_order":57,"of":63,"metrics":{"F1 score":"71.9"},"uses_additional_data":false},{"leaderboard":"/sota/lane-detection-on-tusimple","task":"Lane Detection","dataset":"TuSimple","model":"R-34-E2E","rank_in_archive_order":22,"of":43,"metrics":{"Accuracy":"96.22%","F1 score":"96.58"},"uses_additional_data":false},{"leaderboard":"/sota/lane-detection-on-tusimple","task":"Lane Detection","dataset":"TuSimple","model":"R-50-E2E","rank_in_archive_order":24,"of":43,"metrics":{"Accuracy":"96.11%","F1 score":"96.37"},"uses_additional_data":false},{"leaderboard":"/sota/lane-detection-on-tusimple","task":"Lane Detection","dataset":"TuSimple","model":"ERF-E2E","rank_in_archive_order":26,"of":43,"metrics":{"Accuracy":"96.02%","F1 score":"96.25"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.08630","atlas_url":"https://app.syntology.ai/?focus=2005.08630","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":"2005.08630"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2005.08630\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2005.08630"},"call":"get_concepts_for_paper(arxiv_id=\"2005.08630\")"}],"by_repo":[{"repo":"Vipermdl/E2E-ERFNet","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":"4b8380d9d35180be4b0eae6c52614f197a2739596d9442a8939bf20e6d82cd7e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}