Examinando por Autor "Barandiaran, Javier"
Mostrando 1 - 7 de 7
Resultados por página
Opciones de ordenación
Ítem Adaptative cubical grid for isosurface extraction(2009) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Ruíz, Óscar E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality using the same grid size -- The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved -- After each iteration, the difference between the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm -- The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original gridÍtem Extending Marching Cubes with Adaptative Methods to obtain more accurate iso-surfaces(Springer Berlin Heidelberg, 2010) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Ruíz, Oscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes an extension of the Marching Cubes algorithm, where the goal is to represent implicit functions with higher accuracy using the same grid size -- The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved -- After each iteration, the difference between the implicit and the explicit representations is reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more accurate, as the results shall confirm -- The proposed algorithm corrects some topological problems that may appear in the discretization process using the original gridÍtem Extending marching cubes with adaptative methods to obtain more accurate iso-surfaces(2010-01-01) Congote, John; Moreno, Aitor; Barandiaran, Inigo; Barandiaran, Javier; Ruiz OE; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEÍtem Face Reconstruction with structured light(SciTePress, 2011-03) Congote, John; Barandiaran, Iñigo; Barandiaran, Javier; Nieto, Marcos; Ruíz, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis article presents a methodology for reconstruction of 3D faces which is based on stereoscopic images of the scene using active and passive surface reconstruction -- A sequence of gray patterns is generated, which are projected onto the scene and their projection recorded by a pair of stereo cameras -- The images are rectified to make coincident their epipolar planes and so to generate a stereo map of the scene -- An algorithm for stereo matching is applied, whose result is a bijective mapping between subsets of the pixels of the images -- A particular connected subset of the images (e.g. the face) is selected by a segmentation algorithm -- The stereo mapping is applied to such a subset and enables the triangulation of the two image readings therefore rendering the (x;y; z) points of the face, which in turn allow the reconstruction of the triangular mesh of the face -- Since the surface might have holes, bilateral filters are applied to have the holes filled -- The algorithms are tested in real conditions and we evaluate their performance with virtual datasets -- Our results show a good reconstruction of the faces and an improvement of the results of passive systemsÍtem Marching cubes in an unsigned distance field for surface reconstruction from unorganized point sets(2010) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Posada, Jorge; Ruíz, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAESurface reconstruction from unorganized point set is a common problem in computer graphics -- Generation of the signed distance field from the point set is a common methodology for the surface reconstruction -- The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned nature of the distance -- We propose an extension to the marching cubes algorithm allowing the reconstruction of 0-level iso-surfaces in an unsigned distance field -- We calculate more information inside each cell of the marching cubes lattice and then we extract the intersection points of the surface within the cell then we identify the marching cubes case for the triangulation -- Our algorithm generates good surfaces but the presence of ambiguities in the case selection generates some topological mistakesÍtem Real-time depth map generation architecture for 3D videoconferencing(2010) Congote, John; Barandiaran, Iñigo; Barandiaran, Javier; Montserrat, Tomas; Quelen, Julien; Ferran, Christian; Mindan, Pere J.; Mur, Olga; Tarres, Francesc; Ruíz, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEIn this paper we present a reliable depth estimation system which works in real-time with commodity hardware -- The system is specially intended for 3D visualization using autostereoscopic displays -- The core of this work is an implementation of a modifed version of the adaptive support-weight algorithm that includes highly optimized algorithms for GPU, allowing accurate and stable depth map generation -- Our approach overcomes typical problems of live depth estimation systems such as depth noise and ickering -- Proposed approach is integrated within the versatile GStreamer multimedia software platform -- Accurate depth map estimation together with real-time performance make proposed approach suitable for 3D videoconferencingÍtem Realtime dense stereo matching with dynamic programming in CUDA(2009) Congote, John; Barandiaran, Javier; Barandiaran, Iñigo; Ruíz, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEReal-time depth extraction from stereo images is an important process in computer vision -- This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards -- We compare the running time of the algorithm against CPU implementation and demonstrate the scalability property of the algorithm by testing it on different graphics cards