Afficher la notice abrégée

Semi-automatic geometry-driven reassembly of fractured archeological objects

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA ]
dc.contributor.authorMELLADO, Nicolas
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA ]
dc.contributor.authorREUTER, Patrick
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA ]
dc.contributor.authorSCHLICK, Christophe
dc.date.accessioned2024-04-15T09:45:10Z
dc.date.available2024-04-15T09:45:10Z
dc.date.issued2010-09-25
dc.date.conference2010-09-21
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197894
dc.description.abstractEn3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in large collections of detailed fractured archeological 3D objects that have to be reassembled virtually. In this paper, we present a new semi-automatic reassembly approach for pairwise matching of the fragments, that makes it possible to take into account both the archeologist's expertise, as well as the power of automatic geometry-driven matching algorithms. Our semi-automatic reassembly approach is based on a real-time interaction loop: an expert user steadily specifies approximate initial relative positions and orientations between two fragments by means of a bimanual tangible user interface. These initial poses are continuously corrected and validated in real-time by an algorithm based on the Iterative Closest Point (ICP): the potential contact surface of the two fragments is identified by efficiently pruning insignificant areas of a pair of two bounding sphere hierarchies, that is combined with a k-d tree for closest vertex queries. The locally optimal relative pose for the best match is robustly estimated by taking into account the distance of the closest vertices as well as their normals. We provide feedback to the user by a visual representation of the locally optimal best match and its associated error. Our first results on a concrete dataset show that our system is capable of assisting an expert user in real-time during the pairwise matching of downsampled 3D fragments.
dc.description.sponsorshipStockage d'Electricité par Air comprimé avec Récupération de la CHaleur de compression - Electricity storage by means of compressed air with compression heat recovery - ANR-09-STKE-0008
dc.language.isoen
dc.title.enSemi-automatic geometry-driven reassembly of fractured archeological objects
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Multimédia [cs.MM]
dc.subject.halInformatique [cs]/Synthèse d'image et réalité virtuelle [cs.GR]
bordeaux.page00
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleVAST 2010 - The 11th International Symposium on Virtual Reality, Archaeology and Cultural Heritage
bordeaux.countryFR
bordeaux.conference.cityParis
bordeaux.peerReviewedoui
hal.identifierhal-00516092
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2010-09-24
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00516092v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2010-09-25&rft.spage=00&rft.epage=00&rft.au=MELLADO,%20Nicolas&REUTER,%20Patrick&SCHLICK,%20Christophe&rft.genre=unknown


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée