{"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/mining-point-cloud-local-structures-by-kernel","title":"Mining Point Cloud Local Structures by Kernel Correlation and Graph Pooling","arxiv_id":"1712.06760","date":"2017-12-19","proceeding":"CVPR 2018 6","authors":["Yiru Shen","Chen Feng","Yaoqing Yang","Dong Tian"],"abstract":"Unlike on images, semantic learning on 3D point clouds using a deep network\nis challenging due to the naturally unordered data structure. Among existing\nworks, PointNet has achieved promising results by directly learning on point\nsets. However, it does not take full advantage of a point's local neighborhood\nthat contains fine-grained structural information which turns out to be helpful\ntowards better semantic learning. In this regard, we present two new operations\nto improve PointNet with a more efficient exploitation of local structures. The\nfirst one focuses on local 3D geometric structures. In analogy to a convolution\nkernel for images, we define a point-set kernel as a set of learnable 3D points\nthat jointly respond to a set of neighboring data points according to their\ngeometric affinities measured by kernel correlation, adapted from a similar\ntechnique for point cloud registration. The second one exploits local\nhigh-dimensional feature structures by recursive feature aggregation on a\nnearest-neighbor-graph computed from 3D positions. Experiments show that our\nnetwork can efficiently capture local information and robustly achieve better\nperformances on major datasets. Our code is available at\nhttp://www.merl.com/research/license#KCNet","url_abs":"http://arxiv.org/abs/1712.06760v2","url_pdf":"http://arxiv.org/pdf/1712.06760v2.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":"mining-point-cloud-local-structures-by-kernel","repo_url":"https://github.com/ftdlyc/KCNet_Pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"point-cloud-registration","task_name":"Point Cloud Registration"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1712.06760","atlas_url":"https://app.syntology.ai/?focus=1712.06760","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":"1712.06760"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1712.06760\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1712.06760"},"call":"get_concepts_for_paper(arxiv_id=\"1712.06760\")"}],"by_repo":[{"repo":"ftdlyc/KCNet_Pytorch","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":"59b7a875e936135025a908329a1dc30a14040d82e151e4106635d121fe64630f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}