An efficient and accurate method for the relaxation of multiview registration error

This paper presents a new method for the relaxation of multiview registration error. The multiview registration problem is represented using a graph. Each node and each edge in the graph represents a 3-D data set and a pairwise registration, respectively. Assuming that all the pairwise registration...

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 17(2008), 6 vom: 01. Juni, Seite 968-81
Auteur principal: Shih, Sheng-Wen (Auteur)
Autres auteurs: Chuang, Yao-Tung, Yu, Tzu-Yi
Format: Article en ligne
Langue:English
Publié: 2008
Accès à la collection:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Sujets:Evaluation Study Journal Article
LEADER 01000caa a22002652 4500
001 NLM179597302
003 DE-627
005 20250209114019.0
007 cr uuu---uuuuu
008 231223s2008 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2008.921987  |2 doi 
028 5 2 |a pubmed25n0599.xml 
035 |a (DE-627)NLM179597302 
035 |a (NLM)18482891 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Shih, Sheng-Wen  |e verfasserin  |4 aut 
245 1 3 |a An efficient and accurate method for the relaxation of multiview registration error 
264 1 |c 2008 
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 19.06.2008 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a This paper presents a new method for the relaxation of multiview registration error. The multiview registration problem is represented using a graph. Each node and each edge in the graph represents a 3-D data set and a pairwise registration, respectively. Assuming that all the pairwise registration processes have converged to fine results, this paper shows that the multiview registration problem can be converted into a quadratic programming problem of Lie algebra parameters. The constraints are obtained from every cycle of the graph to eliminate the accumulation errors of global registration. A linear solution is proposed to distribute the accumulation error to proper positions in the graph, as specified by the quadratic model. Since the proposed method does not involve the original 3-D data, it has low time and space complexity. Additionally, the proposed method can be embedded into a trust-region algorithm and, thus, can correctly handle the nonlinear effects of large accumulation errors, while preserving the global convergence property to the first-order critical point. Experimental results confirm both the efficiency and the accuracy of the proposed method 
650 4 |a Evaluation Study 
650 4 |a Journal Article 
700 1 |a Chuang, Yao-Tung  |e verfasserin  |4 aut 
700 1 |a Yu, Tzu-Yi  |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 17(2008), 6 vom: 01. Juni, Seite 968-81  |w (DE-627)NLM09821456X  |x 1057-7149  |7 nnns 
773 1 8 |g volume:17  |g year:2008  |g number:6  |g day:01  |g month:06  |g pages:968-81 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2008.921987  |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 17  |j 2008  |e 6  |b 01  |c 06  |h 968-81