.png){kind=icon}
Return
Multiple Kernel Point Set Registration
.png){kind=icon}
PRE
AI
DOI：10.1109/TMI.2015.2511063.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The finite Gaussian mixture model with kernel correlation is a flexible tool that has recently received attention for point set registration. While there are many algorithms for point set registration presented in the literature, an important issue arising from these studies concerns the mapping of data with nonlinear relationships and the ability to select a suitable kernel. Kernel selection is crucial for effective point set registration. We focus here on multiple kernel point set registration. We make several contributions in this paper. First, each observation is modeled using the Student's t-distribution, which is heavily tailed and more robust than the Gaussian distribution. Second, by automatically adjusting the kernel weights, the proposed method allows us to prune the ineffective kernels. This makes the choice of kernels less crucial. After parameter learning, the kernel saliencies of the irrelevant kernels go to zero. Thus, the choice of kernels is less crucial and it is easy to include other kinds of kernels. Finally, we show empirically that our model outperforms state-of-the-art methods recently proposed in the literature.
Keywords:
Multiple kernel learning
point set registration
Student's t-distribution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.8
Papers:
6.3K
Citations:
3.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveThe dual-bootstrap iterative closest point algorithm with application to retinal image registration
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more