|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM177547847 |
| 003 |
DE-627 |
| 005 |
20231223150439.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s1999 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/83.799892
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0592.xml
|
| 035 |
|
|
|a (DE-627)NLM177547847
|
| 035 |
|
|
|a (NLM)18267439
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Kapoutsis, C A
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Morphological iterative closest point algorithm
|
| 264 |
|
1 |
|c 1999
|
| 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 11.12.2009
|
| 500 |
|
|
|a Date Revised 12.02.2008
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume. Then this is used for the calculation of the closest point operator. This way a dramatic decrease of the computational cost is achieved
|
| 650 |
|
4 |
|a Letter
|
| 700 |
1 |
|
|a Vavoulidis, C P
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Pitas, I
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 8(1999), 11 vom: 28., Seite 1644-6
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:8
|g year:1999
|g number:11
|g day:28
|g pages:1644-6
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/83.799892
|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 8
|j 1999
|e 11
|b 28
|h 1644-6
|