The paper addresses the problem of virtual craniofacial reconstruction from a set of Computer Tomography (CT) images, with the multiple objectives of achieving accurate local matching of the opposable fracture surfaces and preservation of the global shape symmetry and the biomechanical stability of the reconstructed mandible. The first phase of the reconstruction, with the mean squared error as...

Point-based three-dimensional volumetric measurement systems are defined as multi-view vision systems which reconstruct a three-dimensional scene by first identifying key points on the views and then performing the reconstruction. Examples of these are defocusing digital particle image velocimetry (DDPIV) (Pereira et al 2000 Exp. Fluids 29 S78–84) and 3D particle tracking velocimetry (3DPTV) (P...

Matrix Decomposition methods are applied to a wide range of tasks, such as data denoising, dimensionality reduction, co-clustering and community detection. However, in the presence of boolean inputs, common methods either do not scale or do not provide a boolean reconstruction, which results in high reconstruction error and low interpretability of the decomposition. We propose a novel step deco...

Bundle Adjustment is a common technique to improve results of any multiple view reconstruction algorithm to obtain 3D structure for computer vision and computer graphics. If the error of a reconstruction can be expressed by an error function, this function can be minimized by numerical methods such as the Levenberg-Marquardt algorithm. By this means, the reconstruction can often be significantl...

Construction of two haplotypes from a set of Single Nucleotide Polymorphism (SNP) fragments is referred to as haplotype reconstruction problem. One of the most important computational models for this problem is Minimum Error Correction (MEC). Since MEC is an NP-hard problem, here we propose a heuristic algorithm for haplotype reconstruction problem. The algorithm is Particle Swarm Optimization ...

This paper discusses the factorization of the RSA modulus when some ‘partial information’ about the bits of the RSA secret parameters are known. Heninger and Shacham (Crypto 2009) considered the reconstruction of RSA secret parameters from a few randomly known bits, and Henecka, May and Meurer (Crypto 2010) studied the reconstruction of secret parameters when all the bits are known with some pr...

Linear reconstruction methods in diffuse optical tomography have been found to produce reasonable good images in cases in which the variation in optical properties within the medium is relatively small and a reference measurement with known background optical properties is available. In this paper we examine the correction of errors when using a first order Born approximation with an infinite s...

A tunable diode laser absorption tomography (TDLAT) technique is being developed at the University of Virginia to determine the spatially-resolved distribution of temperature and water vapor concentration in a scramjet combustor. In order to aid in the development of this technique, the present study simulates integrated line-of-sight projection measurements and reconstructs these projections t...

Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit surface representation enables fast reconstruction for complex object modelling. However, surfaces are represented at a single resolution resulting in impractical storage costs for accurate reconstruction of large obje...

This paper describes a method to upgrade projective reconstruction to afine and to metric reconstructions using rigid general motions of a stereo rig. We make clear the algebraic relationships between projective reconstruction, the plane at infinity (ufine reconstruction), camera calibration, and metric reconstruction. We show that all the computations can be carried out using standard linear r...