Name
Abstract | ||
|---|---|---|
We propose a new method to solve the point matching problem by l1 regularization. The non-rigid transformation function based on compact support radial basis functions (CSRBF) is represented by the linear system with respect to its coefficients. The transformation function is estimated by the proposed sparse optimization model with regularizing the CSRBF coefficients by l1 norm and the affine coefficients by the square of l2 norm. The optimization model for linear problem of transformation function can be efficiently solved by a fast iterative shrinkage-thresholding algorithm (FISTA) to accelerate the convergence speed of iterative procedure. Experiments on simulated point sets and lung datasets show that our method by l1 regularization obtains accurate registration results and is robust to estimate the correspondence and the transformation between two point sets in the presence of noise and outlier. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/BIBM.2015.7359709 | IEEE International Conference on Bioinformatics and Biomedicine |
Keywords | Field | DocType |
Point matching,transformation,l1 norm regularization,linear problem | Affine transformation,Radial basis function,Linear system,Computer science,Regularization (mathematics),Artificial intelligence,Mathematical optimization,Point set registration,Transformation (function),Outlier,Algorithm,Norm (mathematics),Machine learning | Conference |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JianBing Yi | 1 | 1 | 0.69 |
| Yan-Ran Li | 2 | 122 | 8.00 |
| Xuan Yang | 3 | 42 | 13.98 |
| Tiancheng He | 4 | 61 | 10.27 |
| Guoliang Chen | 5 | 305 | 46.48 |