{"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/splatnet-sparse-lattice-networks-for-point","title":"SPLATNet: Sparse Lattice Networks for Point Cloud Processing","arxiv_id":"1802.08275","date":"2018-02-22","proceeding":"CVPR 2018 6","authors":["Hang Su","Varun Jampani","Deqing Sun","Subhransu Maji","Evangelos Kalogerakis","Ming-Hsuan Yang","Jan Kautz"],"abstract":"We present a network architecture for processing point clouds that directly\noperates on a collection of points represented as a sparse set of samples in a\nhigh-dimensional lattice. Naively applying convolutions on this lattice scales\npoorly, both in terms of memory and computational cost, as the size of the\nlattice increases. Instead, our network uses sparse bilateral convolutional\nlayers as building blocks. These layers maintain efficiency by using indexing\nstructures to apply convolutions only on occupied parts of the lattice, and\nallow flexible specifications of the lattice structure enabling hierarchical\nand spatially-aware feature learning, as well as joint 2D-3D reasoning. Both\npoint-based and image-based representations can be easily incorporated in a\nnetwork with such layers and the resulting model can be trained in an\nend-to-end manner. We present results on 3D segmentation tasks where our\napproach outperforms existing state-of-the-art techniques.","url_abs":"http://arxiv.org/abs/1802.08275v4","url_pdf":"http://arxiv.org/pdf/1802.08275v4.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":"splatnet-sparse-lattice-networks-for-point","repo_url":"https://github.com/IsaacRe/splatnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"caffe2","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"splatnet-sparse-lattice-networks-for-point","repo_url":"https://github.com/NVlabs/splatnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"caffe2","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"3d-part-segmentation","task_name":"3D Part Segmentation"},{"task_slug":"3d-semantic-segmentation","task_name":"3D Semantic Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/3d-part-segmentation-on-shapenet-part","task":"3D Part Segmentation","dataset":"ShapeNet-Part","model":"SPLATNet 3D","rank_in_archive_order":59,"of":67,"metrics":{"Class Average IoU":"82.0","Instance Average IoU":"84.6"},"uses_additional_data":false},{"leaderboard":"/sota/3d-semantic-segmentation-on-semantickitti","task":"3D Semantic Segmentation","dataset":"SemanticKITTI","model":"SPLATNet","rank_in_archive_order":39,"of":45,"metrics":{"test mIoU":"18.4%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-scannet","task":"Semantic Segmentation","dataset":"ScanNet","model":"SPLAT Net","rank_in_archive_order":44,"of":45,"metrics":{"test mIoU":"39.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.08275","atlas_url":"https://app.syntology.ai/?focus=1802.08275","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":"1802.08275"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.08275\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.08275"},"call":"get_concepts_for_paper(arxiv_id=\"1802.08275\")"}],"by_repo":[{"repo":"IsaacRe/splatnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"NVlabs/splatnet","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":"96bdac7c6f3c348b61f15cb7a3a89ff5248fdd6c0ec2b67a50c170077837f477","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}