Mostrando entradas con la etiqueta photogrammetry. Mostrar todas las entradas
Mostrando entradas con la etiqueta photogrammetry. Mostrar todas las entradas

miércoles, 21 de marzo de 2012

Meshlab

MeshLab is an open source, portable, and extensible system for the processing and editing of unstructured 3D triangular meshes.
The system is aimed to help the processing of the typical not-so-small unstructured models arising in 3D scanning, providing a set of tools for editing, cleaning, healing, inspecting, rendering and converting this kind of meshes.
The system is heavily based on the VCG library developed at the Visual Computing Lab of ISTI - CNR, for all the core mesh processing tasks and it is available for Windows, MacOSX, and Linux. . The MeshLab system started in late 2005 as a part of the FGT course of the Computer Science department of University of Pisa and most of the code (~15k lines) of the first versions was written by a handful of willing students. The following years FGT students have continued to work to this project implementing more and more features. The proud MeshLab developers are listed here.
This project is actively supported by the 3D-CoForm project.

Source: Meshlab


martes, 6 de marzo de 2012

Photomodeler



PhotoModeler is a software application that performs image-based modeling and close range photogrammetry – producing 3D models and measurements from photography.
Close Range Photogrammetry (CRP) is a sub-set of photogrammetry and is differentiated from Aerial Photogrammetry by the type of input photographs. In CRP photographs are taken from the ground, or from aerial positions that are at a closer range to the subject than typical Aerial Photogrammetry.[1][2] PhotoModeler and CRP are used for performing measurement and modeling in archaeology, architecture, biology, engineering, film production, forensics, and mining.[3][4][5] Image-based-modeling is another term used to describe the 3D modeling of existing scenes and objects by using images as input. PhotoModeler, first publicly released in 1993, was the first commercial all-digital close-range photogrammetry and image-based-modeling system.[6]


Source: Wikipedia

Photogrammetry


Photogrammetry is the practice of determining the geometric properties of objects from photographic images. Photogrammetry is as old as modern photography and can be dated to the mid-nineteenth century.
In the simplest example, the distance between two points that lie on a plane parallel to the photographic image plane can be determined by measuring their distance on the image, if the scale (s) of the image is known. This is done by multiplying the measured distance by 1/s.
A more sophisticated technique, called stereophotogrammetry, involves estimating the three-dimensional coordinates of points on an object. These are determined by measurements made in two or more photographic images taken from different positions (see stereoscopy). Common points are identified on each image. A line of sight (or ray) can be constructed from the camera location to the point on the object. It is the intersection of these rays (triangulation) that determines the three-dimensional location of the point. More sophisticated algorithms can exploit other information about the scene that is known a priori, for example symmetries, in some cases allowing reconstructions of 3D coordinates from only one camera position.
Photogrammetry is used in different fields, such as topographic mapping, architecture, engineering, manufacturing, quality control, police investigation, and geology, as well as by archaeologists to quickly produce plans of large or complex sites and by meteorologists as a way to determine the actual wind speed of a tornado where objective weather data cannot be obtained. It is also used to combine live action with computer-generated imagery in movie post-production; The Matrix is a good example of the use of photogrammetry in film (details are given in the DVD extras).
Algorithms for photogrammetry typically express the problem as that of minimizing the sum of the squares of a set of errors. This minimization is known as bundle adjustment and is often performed using the Levenberg–Marquardt algorithm.

Source: Wikipedia