This paper studies matching of fragmented objects to recompose their original geometry. Solving this geometric reassembly problem has direct applications in archaeology and forensic investigation in the computer-aided restoration of damaged artifacts and evidence. We develop a new algorithm to effectively integrate both guidance from a template and from matching of adjacent pieces\u27 fracture-regions. First, we compute partial matchings between fragments and a template, and pairwise matchings among fragments. Many potential matches are obtained and then selected/refined in a multi-piece matching stage to maximize global groupwise matching consistency. This pipeline is effective in composing fragmented thin-shell objects containing small pi...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We describe here an efficient algorithm for reassembling one or more unknown objects that have been...
Geometric restoration that composes 3D fragmented pieces into the original complete object is an imp...
This work presents our results on reassembly of broken objects using a newly developed fragment topo...
We introduce a novel reassembly method for fragmented, thin objects that uses minimal user interacti...
Figure 1: Automatic reassembly of fractured cultural heritage objects from their parts using the pro...
3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in...
Many fragile antiques had already been broken upon being discovered at archaeology sites. The fragme...
We describe here an efficient algorithm for re-assembling one or more un-known objects that have bee...
We develop a geometric reassembly algorithm that composes a 3D model from its fragments. One importa...
We propose a graph-based optimization framework for automatic 2D image fragment reassembly. First, w...
Presented here is a fast method that combines curve matching techniques with a surface matching algo...
AbstractThis paper introduces a new approach for the automated reconstruction- reassembly of fragmen...
An automated assembling of shredded/torn documents (2D) or broken pottery (3D) will support philolog...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We describe here an efficient algorithm for reassembling one or more unknown objects that have been...
Geometric restoration that composes 3D fragmented pieces into the original complete object is an imp...
This work presents our results on reassembly of broken objects using a newly developed fragment topo...
We introduce a novel reassembly method for fragmented, thin objects that uses minimal user interacti...
Figure 1: Automatic reassembly of fractured cultural heritage objects from their parts using the pro...
3D laser scanning of broken cultural heritage content is becoming increasingly popular, resulting in...
Many fragile antiques had already been broken upon being discovered at archaeology sites. The fragme...
We describe here an efficient algorithm for re-assembling one or more un-known objects that have bee...
We develop a geometric reassembly algorithm that composes a 3D model from its fragments. One importa...
We propose a graph-based optimization framework for automatic 2D image fragment reassembly. First, w...
Presented here is a fast method that combines curve matching techniques with a surface matching algo...
AbstractThis paper introduces a new approach for the automated reconstruction- reassembly of fragmen...
An automated assembling of shredded/torn documents (2D) or broken pottery (3D) will support philolog...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We develop a completion pipeline for fragmented and damaged skulls. The goal of this work is to conv...
We describe here an efficient algorithm for reassembling one or more unknown objects that have been...