Camera Pose (camera + pose)

Distribution by Scientific Domains
Information Science and Computing50%

Selected Abstracts

A moving planar mirror based approach for cultural reconstruction

COMPUTER ANIMATION AND VIRTUAL WORLDS (PREV: JNL OF VISUALISATION & COMPUTER ANIMATION), Issue 3-4 2004
Kyung Ho Jang
Abstract Modelling from images is a cost-effective means of obtaining virtual cultural heritage models. These models can be effectively constructed from classical Structure from Motion algorithm. However, it's too difficult to reconstruct whole scenes using SFM method since general oriental historic sites contain a very complex shapes and brilliant colours. To overcome this difficulty, the current paper proposes a new reconstruction method based on a moving planar mirror. We devise the mirror posture instead of scene itself as a cue for reconstructing the geometry. That implies that the geometric cues are inserted into the scene by compulsion. With this method, we can obtain the geometrical details regardless of the scene complexity. For this purpose, we first capture image sequences through the moving mirror containing the interested scene, and then calibrate the camera through the mirror's posture. Since the calibration results are still inaccurate due to the detection error, the camera pose is revised using frame-correspondence of the corner points that are easily obtained using the initial camera posture. Finally, 3D information is computed from a set of calibrated image sequences. We validate our approach with a set of experiments on some cultural heritage objects. Copyright © 2004 John Wiley & Sons, Ltd. [source]

Dynamic Textures for Image-based Rendering of Fine-Scale 3D Structure and Animation of Non-rigid Motion

COMPUTER GRAPHICS FORUM, Issue 3 2002
Dana Cobza
The problem of capturing real world scenes and then accurately rendering them is particularly difficult for fine-scale 3D structure. Similarly, it is difficult to capture, model and animate non-rigid motion. We present a method where small image changes are captured as a time varying (dynamic) texture. In particular, a coarse geometry is obtained from a sample set of images using structure from motion. This geometry is then used to subdivide the scene and to extract approximately stabilized texture patches. The residual statistical variability in the texture patches is captured using a PCA basis of spatial filters. The filters coefficients are parameterized in camera pose and object motion. To render new poses and motions, new texture patches are synthesized by modulating the texture basis. The texture is then warped back onto the coarse geometry. We demonstrate how the texture modulation and projective homography-based warps can be achieved in real-time using hardware accelerated OpenGL. Experiments comparing dynamic texture modulation to standard texturing are presented for objects with complex geometry (a flower) and non-rigid motion (human arm motion capturing the non-rigidities in the joints, and creasing of the shirt). Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Image Based Rendering [source]

Semi-Automatic 3D Reconstruction of Urban Areas Using Epipolar Geometry and Template Matching

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Issue 7 2006
José Miguel Sales Dias
The main challenge is to compute the relevant information,building's height and volume, roof's description, and texture,algorithmically, because it is very time consuming and thus expensive to produce it manually for large urban areas. The algorithm requires some initial calibration input and is able to compute the above-mentioned building characteristics from the stereo pair and the availability of the 2D CAD and the digital elevation model of the same area, with no knowledge of the camera pose or its intrinsic parameters. To achieve this, we have used epipolar geometry, homography computation, automatic feature extraction and we have solved the feature correspondence problem in the stereo pair, by using template matching. [source]

Iterative algorithm for optimal fiducials under weak perspective projection

INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, Issue 1 2009
Alfred M. Bruckstein
Abstract In previous work, we designed space fiducials with the aim of making camera pose determination as noise-insensitive as possible. These fiducials turned out to be sets of points that formed concentric regular polyhedra. Here, we apply an idea of Dementhon and Davis and test and analyze an iterative linear algorithm in conjunction with our optimal fiducials to increase the accuracy of the computed camera pose. We also analyze under what circumstances this iterative algorithm is guaranteed to converge to the correct solution. Comprehensive computer simulations illustrate the behavior of the algorithm and the degree of improvement in pose determination in case of convergence. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 27,36, 2009 [source]