Papers › Linked Dynamic Graph CNN: Learning on Point Cloud via Linking Hierarchical Features

Linked Dynamic Graph CNN: Learning on Point Cloud via Linking Hierarchical Features

22 Apr 2019arXiv:1904.10014archive 2025-07-28

Kuangen Zhang, Ming Hao, Jing Wang, Clarence W. de Silva, Chenglong Fu

Learning on point cloud is eagerly in demand because the point cloud is a common type of geometric data and can aid robots to understand environments robustly. However, the point cloud is sparse, unstructured, and unordered, which cannot be recognized accurately by a traditional convolutional neural network (CNN) nor a recurrent neural network (RNN). Fortunately, a graph convolutional neural network (Graph CNN) can process sparse and unordered data. Hence, we propose a linked dynamic graph CNN (LDGCNN) to classify and segment point cloud directly in this paper. We remove the transformation network, link hierarchical features from dynamic graphs, freeze feature extractor, and retrain the classifier to increase the performance of LDGCNN. We explain our network using theoretical analysis and visualization. Through experiments, we show that the proposed LDGCNN achieves state-of-art performance on two standard datasets: ModelNet40 and ShapeNet.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1904.10014")

Code

Syntology Ran 1 of 10 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: official repository: 10 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

KuangenZhang/ldgcnn officialmentioned in papertfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 1 ran; 1 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
9unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from KuangenZhang/ldgcnn. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

pc_normalize KuangenZhang/ldgcnn/part_seg/save_feature.py official repository ran · honoured contract fingerprinted MIT (permissive) · ec413739d406e611 · report
average_gradients KuangenZhang/ldgcnn/part_seg/train_multi_gpu.py official repository unverified MIT (permissive) · 34732848a23a9c10 · report
convert_label_to_one_hot KuangenZhang/ldgcnn/part_seg/train_multi_gpu.py official repository unverified MIT (permissive) · e4ce9986e2de1271 · report
get_loss KuangenZhang/ldgcnn/models/ldgcnn_classifier.py official repository unverified MIT (permissive) · e810480a3d08027d · report
pc_augment_to_point_num KuangenZhang/ldgcnn/part_seg/save_feature.py official repository unverified MIT (permissive) · 70c69a75f695e52e · report
placeholder_inputs KuangenZhang/ldgcnn/models/ldgcnn.py official repository unverified MIT (permissive) · 223ffcb80e41a2b4 · report
placeholder_inputs KuangenZhang/ldgcnn/models/ldgcnn_classifier.py official repository unverified MIT (permissive) · b9d15d9626a4c7c4 · report
rotate_point_cloud KuangenZhang/ldgcnn/provider.py official repository unverified MIT (permissive) · 3c71c023acad0d08 · report
rotate_point_cloud_by_angle KuangenZhang/ldgcnn/provider.py official repository unverified MIT (permissive) · 80a8ebe3a4a0454c · report
shuffle_data KuangenZhang/ldgcnn/provider.py official repository unverified MIT (permissive) · d7c961afec8cc839 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections