Barnes-Hut Approximation for Point SetGeodesic Shooting

by   Jiancong Wang, et al.

Geodesic shooting has been successfully applied to diffeo-morphic registration of point sets. Exact computation of the geodesicshooting between point sets, however, requiresO(N2) calculations each time step on the number of points in the point set. We proposean approximation approach based on the Barnes-Hut algorithm to speedup point set geodesic shooting. This approximation can reduce the al-gorithm complexity toO(N b+N logN). The evaluation of the proposedmethod in both simulated images and the medial temporal lobe thick-ness analysis demonstrates a comparable accuracy to the exact point set geodesic shooting while offering up to 3-fold speed up. This improvementopens up a range of clinical research studies and practical problems towhich the method can be effectively applied.


An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm

An unsupervised, iterative point-set registration algorithm for an unlab...

Exact Sampling of Determinantal Point Processes without Eigendecomposition

Determinantal point processes (DPPs) enable the modelling of repulsion: ...

Fully-Automated Verification of Linear Systems Using Inner- and Outer-Approximations of Reachable Sets

Reachability analysis is a formal method to guarantee safety of dynamica...

Improved Approximation Algorithms for Tverberg Partitions

Tverberg's theorem states that a set of n points in ^d can be partiti...

Fast Coherent Point Drift

Nonrigid point set registration is widely applied in the tasks of comput...

Evaluation of Robust Point Set Registration Applied to Automotive Doppler Radar

Point set registration is the process of finding the best alignment betw...

Polylidar – Polygons from Triangular Meshes

This paper presents Polylidar, an efficient algorithm to extract non-con...

Please sign up or login with your details

Forgot password? Click here to reset