15 research outputs found
The Hybrid Octree: towards the definition of a multiresolution hybrid framework
The Hybrid Octree (HO) is an octree-based representation scheme for coding in a single model an exact representation of a surface
and volume data. The HO is able to efficiently manipulate surface and volume data independently. Moreover, it facilitates the visualization and composition of surface and volume data using graphic hardware. The HO definition and its construction algorithm are provided. Some examples are presented and the goodness of the model is discussed.Postprint (published version
VolumeEVM: A new surface/volume integrated model
Volume visualization is a very active research area in the field of scien-tific
visualization. The Extreme Vertices Model (EVM) has proven to be
a complete intermediate model to visualize and manipulate volume data
using a surface rendering approach. However, the ability to integrate the
advantages of surface rendering approach with the superiority in visual exploration
of the volume rendering would actually produce a very complete
visualization and edition system for volume data. Therefore, we decided
to define an enhanced EVM-based model which incorporates the volumetric
information required to achieved a nearly direct volume visualization
technique. Thus, VolumeEVM was designed maintaining the same EVM-based
data structure plus a sorted list of density values corresponding to
the EVM-based VoIs interior voxels. A function which relates interior
voxels of the EVM with the set of densities was mandatory to be defined.
This report presents the definition of this new surface/volume integrated
model based on the well known EVM encoding and propose implementations
of the main software-based direct volume rendering techniques
through the proposed model.Postprint (published version
Time-varying volume visualization
Volume rendering is a very active research field in Computer Graphics because of its wide range of applications in various sciences, from medicine to flow mechanics. In this report, we survey a state-of-the-art on time-varying volume rendering. We state several basic concepts and then we establish several criteria to classify the studied works: IVR versus DVR, 4D versus 3D+time, compression techniques, involved architectures, use of parallelism and image-space versus object-space coherence. We also address other related problems as transfer functions and 2D cross-sections computation of time-varying volume data. All the papers reviewed are classified into several tables based on the mentioned classification and, finally, several conclusions are presented.Preprin
Research on generic interactive deformable 3D models: focus on the human inguinal region
The goal of this project is to research for real-time approximate methods of physicallybased
animation in conjunction with static polygonal meshes with the aim of deforming
them and simulating an elastic behaviour for these meshes. Because of this, in
this project it has been developed a software suite capable of doing a lot of tasks, each
one from different computer graphics research fields, conforming a versatile capability
project
Efficiently Storing Well-Composed Polyhedral Complexes Computed Over 3D Binary Images
A 3D binary image I can be naturally represented
by a combinatorial-algebraic structure called cubical complex
and denoted by Q(I ), whose basic building blocks are
vertices, edges, square faces and cubes. In Gonzalez-Diaz
et al. (Discret Appl Math 183:59â77, 2015), we presented a
method to âlocally repairâ Q(I ) to obtain a polyhedral complex
P(I ) (whose basic building blocks are vertices, edges,
specific polygons and polyhedra), homotopy equivalent to
Q(I ), satisfying that its boundary surface is a 2D manifold.
P(I ) is called a well-composed polyhedral complex over the
picture I . Besides, we developed a new codification system
for P(I ), encoding geometric information of the cells
of P(I ) under the form of a 3D grayscale image, and the
boundary face relations of the cells of P(I ) under the form
of a set of structuring elements. In this paper, we build upon
(Gonzalez-Diaz et al. 2015) and prove that, to retrieve topological
and geometric information of P(I ), it is enough to
store just one 3D point per polyhedron and hence neither
grayscale image nor set of structuring elements are needed.
From this âminimalâ codification of P(I ), we finally present
a method to compute the 2-cells in the boundary surface of
P(I ).Ministerio de EconomĂa y Competitividad MTM2015-67072-
Volumetric Medical Images Visualization on Mobile Devices
Volumetric medical images visualization is an important tool in the diagnosis
and treatment of diseases. Through history, one of the most dificult
tasks for Medicine Specialists has been the accurate location of broken bones
and of the damaged tissues during Chemotherapy treatment, among other
applications; like techniques used in Neurological Studies. Thus these situations
enhance the need of visualization in Medicine. New technologies,
the improvement and development of new hardware as well as software and
the updating of old ones for graphic applications have resulted in specialized
systems for medical visualization. However the use of these techniques
in mobile devices has been poor due to its low performance. In our work,
we propose a client-server scheme, where the model is compressed in the
server side and is reconstructed in a nal thin-client device. The technique
restricts the natural density values to achieve good bone visualization in
medical models, transforming the rest of the data to zero. Our proposal
uses a tridimensional Haar Wavelet Function locally applied inside units
blocks of 16x16x16, similar to the Wavelet Based 3D Compression Scheme
for Interactive Visualization of Very Large Volume Data approach. We also
implement a quantization algorithm which handles error coeficients according
to the frequency distributions of these coe cients. Finally, we made
an evaluation of the volume visualization; on current mobile devices .We
present the speci cations for the implementation of our technique in the
Nokia n900 Mobile Phone
Volumetric Medical Images Visualization on Mobile Devices
Volumetric medical images visualization is an important tool in the diagnosis
and treatment of diseases. Through history, one of the most dificult
tasks for Medicine Specialists has been the accurate location of broken bones
and of the damaged tissues during Chemotherapy treatment, among other
applications; like techniques used in Neurological Studies. Thus these situations
enhance the need of visualization in Medicine. New technologies,
the improvement and development of new hardware as well as software and
the updating of old ones for graphic applications have resulted in specialized
systems for medical visualization. However the use of these techniques
in mobile devices has been poor due to its low performance. In our work,
we propose a client-server scheme, where the model is compressed in the
server side and is reconstructed in a nal thin-client device. The technique
restricts the natural density values to achieve good bone visualization in
medical models, transforming the rest of the data to zero. Our proposal
uses a tridimensional Haar Wavelet Function locally applied inside units
blocks of 16x16x16, similar to the Wavelet Based 3D Compression Scheme
for Interactive Visualization of Very Large Volume Data approach. We also
implement a quantization algorithm which handles error coeficients according
to the frequency distributions of these coe cients. Finally, we made
an evaluation of the volume visualization; on current mobile devices .We
present the speci cations for the implementation of our technique in the
Nokia n900 Mobile Phone
Material Recognition Meets 3D Reconstruction : Novel Tools for Efficient, Automatic Acquisition Systems
For decades, the accurate acquisition of geometry and reflectance properties has represented one of the major objectives in computer vision and computer graphics with many applications in industry, entertainment and cultural heritage. Reproducing even the finest details of surface geometry and surface reflectance has become a ubiquitous prerequisite in visual prototyping, advertisement or digital preservation of objects. However, today's acquisition methods are typically designed for only a rather small range of material types. Furthermore, there is still a lack of accurate reconstruction methods for objects with a more complex surface reflectance behavior beyond diffuse reflectance. In addition to accurate acquisition techniques, the demand for creating large quantities of digital contents also pushes the focus towards fully automatic and highly efficient solutions that allow for masses of objects to be acquired as fast as possible. This thesis is dedicated to the investigation of basic components that allow an efficient, automatic acquisition process. We argue that such an efficient, automatic acquisition can be realized when material recognition "meets" 3D reconstruction and we will demonstrate that reliably recognizing the materials of the considered object allows a more efficient geometry acquisition. Therefore, the main objectives of this thesis are given by the development of novel, robust geometry acquisition techniques for surface materials beyond diffuse surface reflectance, and the development of novel, robust techniques for material recognition. In the context of 3D geometry acquisition, we introduce an improvement of structured light systems, which are capable of robustly acquiring objects ranging from diffuse surface reflectance to even specular surface reflectance with a sufficient diffuse component. We demonstrate that the resolution of the reconstruction can be increased significantly for multi-camera, multi-projector structured light systems by using overlappings of patterns that have been projected under different projector poses. As the reconstructions obtained by applying such triangulation-based techniques still contain high-frequency noise due to inaccurately localized correspondences established for images acquired under different viewpoints, we furthermore introduce a novel geometry acquisition technique that complements the structured light system with additional photometric normals and results in significantly more accurate reconstructions. In addition, we also present a novel method to acquire the 3D shape of mirroring objects with complex surface geometry. The aforementioned investigations on 3D reconstruction are accompanied by the development of novel tools for reliable material recognition which can be used in an initial step to recognize the present surface materials and, hence, to efficiently select the subsequently applied appropriate acquisition techniques based on these classified materials. In the scope of this thesis, we therefore focus on material recognition for scenarios with controlled illumination as given in lab environments as well as scenarios with natural illumination that are given in photographs of typical daily life scenes. Finally, based on the techniques developed in this thesis, we provide novel concepts towards efficient, automatic acquisition systems
Representação, visualização e manipulação de dados mĂ©dicos tridimensionais: um estudo sobre as bases da simulação cirĂșrgica imersiva
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro TecnolĂłgico. Programa de PĂłs-Graduação em CiĂȘncia da Computação.Dados tridimensionais referentes a pacientes sĂŁo utilizados em diversos setores mĂ©dico-hospitalares, fornecendo embasamento Ă diagnĂłsticos e orientação durante procedimentos cirĂșrgicos. No entanto, apesar de bastante Ășteis estes dados sĂŁo bastante inflexĂveis, nĂŁo permitindo que o usuĂĄrio interaja com estes ou os manipule. O emprego de tĂ©cnicas de computação grĂĄfica e realidade virtual para a representação destes dados sanaria estas dificuldades, gerando representaçÔes indivĂduais e adaptadas para cada paciente e permitindo a realização de planejamentos cirĂșrgicos e cirurgias auxiliadas por computador, dentre outras possibilidades. A representação destes dados e as formas de manipulação devem conter um conjunto de elementos e obedecer alguns requisitos para que se obtenha realismo nas aplicaçÔes, caso contrĂĄrio, o emprego destas tĂ©cnicas nĂŁo traria grandes vantagens. Analisando os elementos e requisitos a serem obedecidos, Ă© construĂdo um grafo de dependĂȘncias que mostra as tĂ©cnicas e estruturas computacionais necessĂĄrias para a obtenção de ambientes virtuais imersivos realistas. Tal grafo demonstra as estruturas de dados para representação de sĂłlidos como peça chave para este tipo de aplicativos. Para suprir as necessidades destes, Ă© apresentada uma estrutura de dado capaz de representar uma vasta classe de topologias espaciais, alĂ©m de permitir rĂĄpido acesso a elementos e suas vizinhanças, bem como mĂ©todos para a construção de tal estrutura. Ă apresentada, tambĂ©m, uma aplicação para mensuração de artĂ©rias utilizando a estrutura e os mĂ©todos previamente mencionados e os resultados por obtidos por estes
Skeletal representations of orthogonal shapes
Skeletal representations are important shape descriptors which encode topological and geometrical properties of shapes and reduce their dimension. Skeletons are used in several fields of science and attract the attention of many researchers. In the biocad field, the analysis of structural properties such as porosity of biomaterials requires the previous computation of a skeleton. As the size of three-dimensional images become larger, efficient and robust algorithms that extract simple skeletal structures are required. The most popular and prominent skeletal representation is the medial axis, defined as the shape points which have at least two closest points on the shape boundary. Unfortunately, the medial axis is highly sensitive to noise and perturbations of the shape boundary. That is, a small change of the shape boundary may involve a considerable change of its medial axis. Moreover, the exact computation of the medial axis is only possible for a few classes of shapes. For example, the medial axis of polyhedra is composed of non planar surfaces, and its accurate and robust computation is difficult. These problems led to the emergence of approximate medial axis representations. There exists two main approximation methods: the shape is approximated with another shape class or the Euclidean metric is approximated with another metric.
The main contribution of this thesis is the combination of a specific shape and metric simplification. The input shape is approximated with an orthogonal shape, which are polygons or polyhedra enclosed by axis-aligned edges or faces, respectively. In the same vein, the Euclidean metric is replaced by the L infinity or Chebyshev metric. Despite the simpler structure of orthogonal shapes, there are few works on skeletal representations applied to orthogonal shapes. Much of the efforts have been devoted to binary images and volumes, which are a subset of orthogonal shapes. Two new skeletal representations based on this paradigm are introduced: the cube skeleton and the scale cube skeleton. The cube skeleton is shown to be composed of straight line segments or planar faces and to be homotopical equivalent to the input shape. The scale cube skeleton is based upon the cube skeleton, and introduces a family of skeletons that are more stable to shape noise and perturbations. In addition, the necessary algorithms to compute the cube skeleton of polygons and polyhedra and the scale cube skeleton of polygons are presented. Several experimental results confirm the efficiency, robustness and practical use of all the presented methods