Global iterative closet point using nested annealing for initialization

Tao Ngoc Linh, Hiroshi Hasegawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In computer vision, Iterative Closest Point (ICP) has been a key tool for registration algorithms, a fundamental task in computer vision. However, ICP based registration algorithms always face with local minima problem and pre-aligned pointsets are the must to guarantee correct convergence. Pre-alignment used to be carried out by our human in some mesh processing softwares. This paper provides a solution for initialization problem for registering two 3D surfaces under L2 error using ICP algorithm. Our algorithm uses a combination between Nested Annealing (NA) and ICP in which NA is used as global optimization search engine to find the global minima with a novel approach of using point based boundary searching. The algorithm uses ICP to derive local minima as well as local minima error. The integration between ICP and NA is successfully implemented and coded into a program which inputs two range image and outputs the transformation matrix between them at high accuracy and success rate.

Original languageEnglish
Title of host publicationProcedia Computer Science
PublisherElsevier
Pages381-390
Number of pages10
Volume60
Edition1
DOIs
Publication statusPublished - 2015
Event19th International Conference on Knowledge Based and Intelligent Information and Engineering Systems, KES 2015 - , Singapore
Duration: 2015 Sep 72015 Sep 9

Other

Other19th International Conference on Knowledge Based and Intelligent Information and Engineering Systems, KES 2015
CountrySingapore
Period15/9/715/9/9

Fingerprint

Annealing
Computer vision
Global optimization
Search engines
Processing

Keywords

  • 3D registration
  • Global registration
  • Hybrid algorithm
  • ICP
  • Nested Annealing

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Linh, T. N., & Hasegawa, H. (2015). Global iterative closet point using nested annealing for initialization. In Procedia Computer Science (1 ed., Vol. 60, pp. 381-390). Elsevier. https://doi.org/10.1016/j.procs.2015.08.147

Global iterative closet point using nested annealing for initialization. / Linh, Tao Ngoc; Hasegawa, Hiroshi.

Procedia Computer Science. Vol. 60 1. ed. Elsevier, 2015. p. 381-390.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Linh, TN & Hasegawa, H 2015, Global iterative closet point using nested annealing for initialization. in Procedia Computer Science. 1 edn, vol. 60, Elsevier, pp. 381-390, 19th International Conference on Knowledge Based and Intelligent Information and Engineering Systems, KES 2015, Singapore, 15/9/7. https://doi.org/10.1016/j.procs.2015.08.147
Linh, Tao Ngoc ; Hasegawa, Hiroshi. / Global iterative closet point using nested annealing for initialization. Procedia Computer Science. Vol. 60 1. ed. Elsevier, 2015. pp. 381-390
@inproceedings{fc4aa0a4e1d04b88b9f4088d9fb7a5fc,
title = "Global iterative closet point using nested annealing for initialization",
abstract = "In computer vision, Iterative Closest Point (ICP) has been a key tool for registration algorithms, a fundamental task in computer vision. However, ICP based registration algorithms always face with local minima problem and pre-aligned pointsets are the must to guarantee correct convergence. Pre-alignment used to be carried out by our human in some mesh processing softwares. This paper provides a solution for initialization problem for registering two 3D surfaces under L2 error using ICP algorithm. Our algorithm uses a combination between Nested Annealing (NA) and ICP in which NA is used as global optimization search engine to find the global minima with a novel approach of using point based boundary searching. The algorithm uses ICP to derive local minima as well as local minima error. The integration between ICP and NA is successfully implemented and coded into a program which inputs two range image and outputs the transformation matrix between them at high accuracy and success rate.",
keywords = "3D registration, Global registration, Hybrid algorithm, ICP, Nested Annealing",
author = "Linh, {Tao Ngoc} and Hiroshi Hasegawa",
year = "2015",
doi = "10.1016/j.procs.2015.08.147",
language = "English",
volume = "60",
pages = "381--390",
booktitle = "Procedia Computer Science",
publisher = "Elsevier",
edition = "1",

}

TY - GEN

T1 - Global iterative closet point using nested annealing for initialization

AU - Linh, Tao Ngoc

AU - Hasegawa, Hiroshi

PY - 2015

Y1 - 2015

N2 - In computer vision, Iterative Closest Point (ICP) has been a key tool for registration algorithms, a fundamental task in computer vision. However, ICP based registration algorithms always face with local minima problem and pre-aligned pointsets are the must to guarantee correct convergence. Pre-alignment used to be carried out by our human in some mesh processing softwares. This paper provides a solution for initialization problem for registering two 3D surfaces under L2 error using ICP algorithm. Our algorithm uses a combination between Nested Annealing (NA) and ICP in which NA is used as global optimization search engine to find the global minima with a novel approach of using point based boundary searching. The algorithm uses ICP to derive local minima as well as local minima error. The integration between ICP and NA is successfully implemented and coded into a program which inputs two range image and outputs the transformation matrix between them at high accuracy and success rate.

AB - In computer vision, Iterative Closest Point (ICP) has been a key tool for registration algorithms, a fundamental task in computer vision. However, ICP based registration algorithms always face with local minima problem and pre-aligned pointsets are the must to guarantee correct convergence. Pre-alignment used to be carried out by our human in some mesh processing softwares. This paper provides a solution for initialization problem for registering two 3D surfaces under L2 error using ICP algorithm. Our algorithm uses a combination between Nested Annealing (NA) and ICP in which NA is used as global optimization search engine to find the global minima with a novel approach of using point based boundary searching. The algorithm uses ICP to derive local minima as well as local minima error. The integration between ICP and NA is successfully implemented and coded into a program which inputs two range image and outputs the transformation matrix between them at high accuracy and success rate.

KW - 3D registration

KW - Global registration

KW - Hybrid algorithm

KW - ICP

KW - Nested Annealing

UR - http://www.scopus.com/inward/record.url?scp=84941081072&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941081072&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2015.08.147

DO - 10.1016/j.procs.2015.08.147

M3 - Conference contribution

VL - 60

SP - 381

EP - 390

BT - Procedia Computer Science

PB - Elsevier

ER -