Now showing items 1-4 of 4
Active Testing Search for Point Cloud Matching
We present a general approach for solving the point-cloud matching problem for the case of mildly nonlinear transformations. Our method quickly nds a coarse approximation of the solution by exploring a reduced set of ...
Robust elastic 2D/3D geometric graph matching
We present an algorithm for geometric matching of graphs embedded in 2D or 3D space. It is applicable for registering any graph-like structures appearing in biomedical images, such as blood vessels, pulmonary bronchi, nerve ...
Non-Rigid Graph Registration using Active Testing Search
We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance ...
Robust Non-Rigid Registration of 2D and 3D Graphs
We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial ...