Search Results for author:
Found 6 papers, 1 papers with code
Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets
The resulting lower bound problem has the merit that it can be efficiently solved via linear assignment and low dimensional convex quadratic programming.
Aligning Partially Overlapping Point Sets: an Inner Approximation Algorithm
Our method is also $\epsilon-$globally optimal and thus is guaranteed to be robust.
Multi-level Wavelet Convolutional Neural Networks
Specifically, MWCNN for image restoration is based on U-Net architecture, and inverse wavelet transform (IWT) is deployed to reconstruct the high resolution (HR) feature maps.
Path-following based Point Matching using Similarity Transformation
To address the problem of 3D point matching where the poses of two point sets are unknown, we adapt a recently proposed path following based method to use similarity transformation instead of the original affine transformation.
A Concave Optimization Algorithm for Matching Partially Overlapping Point Sets
Furthermore, this problem has the property that the objective function can be converted into a form with few nonlinear terms via a linear transformation.
Point Matching in the Presence of Outliers in Both Point Sets: A Concave Optimization Approach
Recently, a concave optimization approach has been proposed to solve the robust point matching (RPM) problem.
