Processing math: 100%
Skip to yearly menu bar Skip to main content


Poster

Efficient Graph Field Integrators Meet Point Clouds

Krzysztof Choromanski · Arijit Sehanobish · Han Lin · YUNFAN ZHAO · Eli Berger · Tetiana Parshakova · Qingkai Pan · David Watkins · Tianyi Zhang · Valerii Likhosherstov · Somnath Basu Roy Chowdhury · Kumar Avinava Dubey · Deepali Jain · Tamas Sarlos · Snigdha Chaturvedi · Adrian Weller

Exhibit Hall 1 #533
[ ]
[ Slides [ PDF [ Poster

Abstract: We present two new classes of algorithms for efficient field integration on graphs encoding point cloud data. The first class, SeparatorFactorization (SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion (RFD), uses popular ϵ-nearest-neighbor graph representations for point clouds. Both can be viewed as providing the functionality of Fast Multipole Methods (FMMs), which have had a tremendous impact on efficient integration, but for non-Euclidean spaces. We focus on geometries induced by distributions of walk lengths between points (e.g. shortest-path distance). We provide an extensive theoretical analysis of our algorithms, obtaining new results in structural graph theory as a byproduct. We also perform exhaustive empirical evaluation, including on-surface interpolation for rigid and deformable objects (in particular for mesh-dynamics modeling) as well as Wasserstein distance computations for point clouds, including the Gromov-Wasserstein variant.

Chat is not available.