@article{bergstrom_robust_2017,
	title = {Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach},
	volume = {74},
	issn = {1017-1398, 1572-9265},
	url = {http://link.springer.com/10.1007/s11075-016-0170-3},
	doi = {10.1007/s11075-016-0170-3},
	abstract = {The problem of finding a rigid body transformation, which aligns a set of data points with a given surface, using a robust M-estimation technique is considered. A refined iterative closest point (ICP) algorithm is described where a minimization problem of point-to-plane distances with a proposed constraint is solved in each iteration to find an updating transformation. The constraint is derived from a sum of weighted squared point-to-point distances and forms a natural trust region, which ensures convergence. Only a minor number of additional computations are required to use it. Two alternative trust regions are introduced and analyzed. Finally, numerical results for some test problems are presented. It is obvious from these results that there is a significant advantage, with respect to convergence rate of accuracy, to use the proposed trust region approach in comparison with using point-to-point distance minimization as well as using point-to-plane distance minimization and a Newtontype update without any step size control.},
	language = {en},
	number = {3},
	urldate = {2018-06-27},
	journal = {Numerical Algorithms},
	author = {Bergström, Per and Edlund, Ove},
	month = mar,
	year = {2017},
	pages = {755--779},
}

{"_id":"whxc7yr4HtcZGtHoc","bibbaseid":"bergstrm-edlund-robustregistrationofsurfacesusingarefinediterativeclosestpointalgorithmwithatrustregionapproach-2017","author_short":["Bergström, P.","Edlund, O."],"bibdata":{"bibtype":"article","type":"article","title":"Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach","volume":"74","issn":"1017-1398, 1572-9265","url":"http://link.springer.com/10.1007/s11075-016-0170-3","doi":"10.1007/s11075-016-0170-3","abstract":"The problem of finding a rigid body transformation, which aligns a set of data points with a given surface, using a robust M-estimation technique is considered. A refined iterative closest point (ICP) algorithm is described where a minimization problem of point-to-plane distances with a proposed constraint is solved in each iteration to find an updating transformation. The constraint is derived from a sum of weighted squared point-to-point distances and forms a natural trust region, which ensures convergence. Only a minor number of additional computations are required to use it. Two alternative trust regions are introduced and analyzed. Finally, numerical results for some test problems are presented. It is obvious from these results that there is a significant advantage, with respect to convergence rate of accuracy, to use the proposed trust region approach in comparison with using point-to-point distance minimization as well as using point-to-plane distance minimization and a Newtontype update without any step size control.","language":"en","number":"3","urldate":"2018-06-27","journal":"Numerical Algorithms","author":[{"propositions":[],"lastnames":["Bergström"],"firstnames":["Per"],"suffixes":[]},{"propositions":[],"lastnames":["Edlund"],"firstnames":["Ove"],"suffixes":[]}],"month":"March","year":"2017","pages":"755–779","bibtex":"@article{bergstrom_robust_2017,\n\ttitle = {Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach},\n\tvolume = {74},\n\tissn = {1017-1398, 1572-9265},\n\turl = {http://link.springer.com/10.1007/s11075-016-0170-3},\n\tdoi = {10.1007/s11075-016-0170-3},\n\tabstract = {The problem of finding a rigid body transformation, which aligns a set of data points with a given surface, using a robust M-estimation technique is considered. A refined iterative closest point (ICP) algorithm is described where a minimization problem of point-to-plane distances with a proposed constraint is solved in each iteration to find an updating transformation. The constraint is derived from a sum of weighted squared point-to-point distances and forms a natural trust region, which ensures convergence. Only a minor number of additional computations are required to use it. Two alternative trust regions are introduced and analyzed. Finally, numerical results for some test problems are presented. It is obvious from these results that there is a significant advantage, with respect to convergence rate of accuracy, to use the proposed trust region approach in comparison with using point-to-point distance minimization as well as using point-to-plane distance minimization and a Newtontype update without any step size control.},\n\tlanguage = {en},\n\tnumber = {3},\n\turldate = {2018-06-27},\n\tjournal = {Numerical Algorithms},\n\tauthor = {Bergström, Per and Edlund, Ove},\n\tmonth = mar,\n\tyear = {2017},\n\tpages = {755--779},\n}\n\n","author_short":["Bergström, P.","Edlund, O."],"key":"bergstrom_robust_2017","id":"bergstrom_robust_2017","bibbaseid":"bergstrm-edlund-robustregistrationofsurfacesusingarefinediterativeclosestpointalgorithmwithatrustregionapproach-2017","role":"author","urls":{"Paper":"http://link.springer.com/10.1007/s11075-016-0170-3"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/sede","dataSources":["pQYee5oovEhJF75n6"],"keywords":[],"search_terms":["robust","registration","surfaces","using","refined","iterative","closest","point","algorithm","trust","region","approach","bergström","edlund"],"title":"Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach","year":2017}