{"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/feastnet-feature-steered-graph-convolutions","title":"FeaStNet: Feature-Steered Graph Convolutions for 3D Shape Analysis","arxiv_id":"1706.05206","date":"2017-06-16","proceeding":"CVPR 2018 6","authors":["Nitika Verma","Edmond Boyer","Jakob Verbeek"],"abstract":"Convolutional neural networks (CNNs) have massively impacted visual\nrecognition in 2D images, and are now ubiquitous in state-of-the-art\napproaches. CNNs do not easily extend, however, to data that are not\nrepresented by regular grids, such as 3D shape meshes or other graph-structured\ndata, to which traditional local convolution operators do not directly apply.\nTo address this problem, we propose a novel graph-convolution operator to\nestablish correspondences between filter weights and graph neighborhoods with\narbitrary connectivity. The key novelty of our approach is that these\ncorrespondences are dynamically computed from features learned by the network,\nrather than relying on predefined static coordinates over the graph as in\nprevious work. We obtain excellent experimental results that significantly\nimprove over previous state-of-the-art shape correspondence results. This shows\nthat our approach can learn effective shape representations from raw input\ncoordinates, without relying on shape descriptors.","url_abs":"http://arxiv.org/abs/1706.05206v2","url_pdf":"http://arxiv.org/pdf/1706.05206v2.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":"feastnet-feature-steered-graph-convolutions","repo_url":"https://github.com/nitika-verma/FeaStNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.05206","atlas_url":"https://app.syntology.ai/?focus=1706.05206","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":"1706.05206"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.05206\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.05206"},"call":"get_concepts_for_paper(arxiv_id=\"1706.05206\")"}],"by_repo":[{"repo":"nitika-verma/FeaStNet","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":"0cd98cac6c7ec942f4db5410c6f6c51cba799f7dce210afc384abfae5597f4a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}