CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
Reconstructing realistic 3D hair geometry is challenging due to omnipresent occlusions, complex discontinuities and specular appearance. To address these challenges, we propose a ...
BMCBI
2011
13 years 2 months ago
2011
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
CISS
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract—Compressive sampling (CS) has emerged as significant signal processing framework to acquire and reconstruct sparse signals at rates significantly below the Nyquist rate...
TMI
2010
13 years 5 months ago
2010
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
TITB
2010
13 years 5 months ago
2010
Katsevich reconstruction algorithm represents a breakthrough for helical cone-beam computed tomography (CT) reconstruction, because it is the first exact cone-beam reconstruction a...
SIAMMA
2011
13 years 6 months ago
2011
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
CGF
2010
13 years 8 months ago
2010
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
CG
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...