Delta-Connection: A Solution for 3D Object Reconstruction
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219 |
Resumo: | Given a set of consecutive slices resulting from a non-invasive examining device, there is an expectation to be able to reconstruct the 3D original object regardless if it is a human organ or the channeling of underground petroleum resources. The slices however, identify a set of curves, which need to be properly connected to give rise of a coherent representation of the object. This analysis is made by a correspondence algorithm within a 3D reconstruction software. This paper presents -connection, a simple and flexible algorithm for the correspondence problem. -connection relies on the well-known heuristic approach of proximal curves. Tests have shown that -connection grows linearly with the size of the raw-data (the slices) and can be fine-tuned by a user-defined parameter to produce a 3D model. The heuristic, advantages and limitations of -connection will also be shown in detail. |
id |
UFLA-5_a96bcba3dbb43f9dea6a2cb2d7c84e1a |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/219 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Delta-Connection: A Solution for 3D Object Reconstruction3D Object ReconstructionReconstruction from SlicesCorrespondence AlgorithmVisualizationGiven a set of consecutive slices resulting from a non-invasive examining device, there is an expectation to be able to reconstruct the 3D original object regardless if it is a human organ or the channeling of underground petroleum resources. The slices however, identify a set of curves, which need to be properly connected to give rise of a coherent representation of the object. This analysis is made by a correspondence algorithm within a 3D reconstruction software. This paper presents -connection, a simple and flexible algorithm for the correspondence problem. -connection relies on the well-known heuristic approach of proximal curves. Tests have shown that -connection grows linearly with the size of the raw-data (the slices) and can be fine-tuned by a user-defined parameter to produce a 3D model. The heuristic, advantages and limitations of -connection will also be shown in detail.Editora da UFLA2008-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219INFOCOMP Journal of Computer Science; Vol. 7 No. 2 (2008): June, 2008; 65-731982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219/204Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessAnzollini, Guilherme RossettiHounsell, Marcelo da SilvaSilva, Alexandre Gonçalves2015-06-27T23:52:43Zoai:infocomp.dcc.ufla.br:article/219Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:25.298725INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Delta-Connection: A Solution for 3D Object Reconstruction |
title |
Delta-Connection: A Solution for 3D Object Reconstruction |
spellingShingle |
Delta-Connection: A Solution for 3D Object Reconstruction Anzollini, Guilherme Rossetti 3D Object Reconstruction Reconstruction from Slices Correspondence Algorithm Visualization |
title_short |
Delta-Connection: A Solution for 3D Object Reconstruction |
title_full |
Delta-Connection: A Solution for 3D Object Reconstruction |
title_fullStr |
Delta-Connection: A Solution for 3D Object Reconstruction |
title_full_unstemmed |
Delta-Connection: A Solution for 3D Object Reconstruction |
title_sort |
Delta-Connection: A Solution for 3D Object Reconstruction |
author |
Anzollini, Guilherme Rossetti |
author_facet |
Anzollini, Guilherme Rossetti Hounsell, Marcelo da Silva Silva, Alexandre Gonçalves |
author_role |
author |
author2 |
Hounsell, Marcelo da Silva Silva, Alexandre Gonçalves |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Anzollini, Guilherme Rossetti Hounsell, Marcelo da Silva Silva, Alexandre Gonçalves |
dc.subject.por.fl_str_mv |
3D Object Reconstruction Reconstruction from Slices Correspondence Algorithm Visualization |
topic |
3D Object Reconstruction Reconstruction from Slices Correspondence Algorithm Visualization |
description |
Given a set of consecutive slices resulting from a non-invasive examining device, there is an expectation to be able to reconstruct the 3D original object regardless if it is a human organ or the channeling of underground petroleum resources. The slices however, identify a set of curves, which need to be properly connected to give rise of a coherent representation of the object. This analysis is made by a correspondence algorithm within a 3D reconstruction software. This paper presents -connection, a simple and flexible algorithm for the correspondence problem. -connection relies on the well-known heuristic approach of proximal curves. Tests have shown that -connection grows linearly with the size of the raw-data (the slices) and can be fine-tuned by a user-defined parameter to produce a 3D model. The heuristic, advantages and limitations of -connection will also be shown in detail. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/219/204 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 7 No. 2 (2008): June, 2008; 65-73 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740817494016 |