|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM273226347 |
| 003 |
DE-627 |
| 005 |
20231225000713.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2018 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2017.2717829
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0910.xml
|
| 035 |
|
|
|a (DE-627)NLM273226347
|
| 035 |
|
|
|a (NLM)28644798
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Evangelidis, Georgios Dimitrios
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Joint Alignment of Multiple Point Sets with Batch and Incremental Expectation-Maximization
|
| 264 |
|
1 |
|c 2018
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 04.04.2019
|
| 500 |
|
|
|a Date Revised 04.04.2019
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a This paper addresses the problem of registering multiple point sets. Solutions to this problem are often approximated by repeatedly solving for pairwise registration, which results in an uneven treatment of the sets forming a pair: a model set and a data set. The main drawback of this strategy is that the model set may contain noise and outliers, which negatively affects the estimation of the registration parameters. In contrast, the proposed formulation treats all the point sets on an equal footing. Indeed, all the points are drawn from a central Gaussian mixture, hence the registration is cast into a clustering problem. We formally derive batch and incremental EM algorithms that robustly estimate both the GMM parameters and the rotations and translations that optimally align the sets. Moreover, the mixture's means play the role of the registered set of points while the variances provide rich information about the contribution of each component to the alignment. We thoroughly test the proposed algorithms on simulated data and on challenging real data collected with range sensors. We compare them with several state-of-the-art algorithms, and we show their potential for surface reconstruction from depth data
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Horaud, Radu
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 40(2018), 6 vom: 01. Juni, Seite 1397-1410
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:40
|g year:2018
|g number:6
|g day:01
|g month:06
|g pages:1397-1410
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2017.2717829
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 40
|j 2018
|e 6
|b 01
|c 06
|h 1397-1410
|