Wavelet representation of contour sets

Journal ArticleWe present a new wavelet compression and multiresolution modeling approach for sets of contours (level sets). In contrast to previous wavelet schemes, our algorithm creates a parametrization of a scalar field induced by its contours and compactly stores this parametrization rather than function values sampled on a regular grid. Our representation is based on hierarchical polygon meshes with subdivision connectivity whose vertices are transformed into wavelet coefficients. From this sparse set of coefficients, every set of contours can be efficiently reconstructed at multiple levels of resolution. When applying lossy compression, introducing high quantization errors, our method preserves contour topology, in contrast to compression methods applied to the corresponding field function. We provide numerical results for scalar fields defined on planar domains. Our approach generalizes to volumetric domains, time-varying contours, and level sets of vector fields

Multiresolution analysis as an approach for tool path planning in NC machining

Wavelets permit multiresolution analysis of curves and surfaces. A complex curve can be decomposed using wavelet theory into lower resolution curves. The low-resolution (coarse) curves are similar to rough-cuts and high-resolution (fine) curves to finish-cuts in numerical controlled (NC) machining.;In this project, we investigate the applicability of multiresolution analysis using B-spline wavelets to NC machining of contoured 2D objects. High-resolution curves are used close to the object boundary similar to conventional offsetting, while lower resolution curves, straight lines and circular arcs are used farther away from the object boundary.;Experimental results indicate that wavelet-based multiresolution tool path planning improves machining efficiency. Tool path length is reduced, sharp corners are smoothed out thereby reducing uncut areas and larger tools can be selected for rough-cuts

Multiresolution Layered Manufacturing

PURPOSE: Two-photon polymerization (TPP) has become one of the most popular techniques for stereolithography at very high resolutions. When printing relatively large structures at high resolutions, one of the main limiting factors is the printing time. The goal of this work is to present a new slicing algorithm to minimize printing times. DESIGN/METHODOLOGY/APPROACH: Typically, slicing algorithms used for TPP do not take into account the fact that TPP can print at a range of resolutions (i.e. with different heights and diameters) by varying parameters such as exposure time, laser power, photoresist properties, and optical arrangements. This work presents Multiresolution Layered Manufacturing (MLM), a novel slicing algorithm that processes 3D structures to separate parts manufacturable at low resolution from those that require a higher resolution. FINDINGS: MLM can significantly reduce the printing time of 3D structures at high resolutions. The maximum theoretical speed-up depends on the range of printing resolutions, but the effective speed-up also depends on the geometry of each 3D structure. RESEARCH LIMITATIONS/IMPLICATIONS: MLM opens the possibility to significantly decrease printing times, potentially opening the use of TPP to new applications in many disciplines such as microfluidics, metamaterial research or wettability. ORIGINALITY/VALUE: There are many instances of previous research on printing at several resolutions. However, in most cases, the toolpaths have to be manually arranged. In some cases, previous research also automates the generation of toolpaths, but they are limited in various ways. MLM is the first algorithm to comprehensively solve this problem for a wide range of true 3D structures.NANO3D (a BEWARE Fellowship from the Walloon Region, Belgium, part of the Marie Curie Programme of the ERC). IAP 7/38 MicroMAST (Interuniversity Attraction Poles Programme from the Belgian Science Policy Office, the Walloon Region and the FNRS)

Optimized synthesis of art patterns and layered textures

published_or_final_versio

Real-time Photorealistic Visualisation of Large-scaleMultiresolution Terrain Models

Height field terrain rendering is an important aspect of GIS, outdoor virtual reality applicationssuch as flight simulation, 3-D games, etc. A polygonal model of very large terrain data requiresa large number of triangles. So, even most high-performance graphics workstations have greatdifficulty to display even moderately sized height fields at interactive frame rates. To bringphotorealism in visualisation, it is required to drape corresponding high-resolution satellite oraerial phototexture over 3-D digital terrain and also to place multiple collections of point-location-based static objects such as buildings, trees, etc and to overlay polyline vector objects suchas roads on top of the terrain surface. It further complicates the requirement of interactive framerates while navigation over the terrain. This paper describes a novel approach for objects andterrain visualisation by combination of two algorithms, one for terrain data and the other forobjects. The terrain rendering is accomplished by an efficient dynamic multiresolution view-dependent level-of-detail mesh simplification algorithm. It is augmented with out-of-corevisualisation of large-height geometry and phototexture terrain data populated with 3-D/2-Dstatic objects as well as vector overlays without extensive memory load. The proposedmethodology provides interactive frame rates on a general-purpose desktop PC with OpenGL-enabled graphics hardware. The software TREND has been successfully tested on different real-world height maps and satellite phototextures of sizes up to 16K*16K coupled with thousandsof static objects and polyline vector overlays

A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity

The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design of image representations, which trade off between efficiency and complexity, while achieving accurate rendering of smooth regions as well as reproducing faithful contours and textures. The most recent ones, proposed in the past decade, share an hybrid heritage highlighting the multiscale and oriented nature of edges and patterns in images. This paper presents a panorama of the aforementioned literature on decompositions in multiscale, multi-orientation bases or dictionaries. They typically exhibit redundancy to improve sparsity in the transformed domain and sometimes its invariance with respect to simple geometric deformations (translation, rotation). Oriented multiscale dictionaries extend traditional wavelet processing and may offer rotation invariance. Highly redundant dictionaries require specific algorithms to simplify the search for an efficient (sparse) representation. We also discuss the extension of multiscale geometric decompositions to non-Euclidean domains such as the sphere or arbitrary meshed surfaces. The etymology of panorama suggests an overview, based on a choice of partially overlapping "pictures". We hope that this paper will contribute to the appreciation and apprehension of a stream of current research directions in image understanding.Comment: 65 pages, 33 figures, 303 reference

VisIVO - Integrated Tools and Services for Large-Scale Astrophysical Visualization

VisIVO is an integrated suite of tools and services specifically designed for the Virtual Observatory. This suite constitutes a software framework for effective visual discovery in currently available (and next-generation) very large-scale astrophysical datasets. VisIVO consists of VisiVO Desktop - a stand alone application for interactive visualization on standard PCs, VisIVO Server - a grid-enabled platform for high performance visualization and VisIVO Web - a custom designed web portal supporting services based on the VisIVO Server functionality. The main characteristic of VisIVO is support for high-performance, multidimensional visualization of very large-scale astrophysical datasets. Users can obtain meaningful visualizations rapidly while preserving full and intuitive control of the relevant visualization parameters. This paper focuses on newly developed integrated tools in VisIVO Server allowing intuitive visual discovery with 3D views being created from data tables. VisIVO Server can be installed easily on any web server with a database repository. We discuss briefly aspects of our implementation of VisiVO Server on a computational grid and also outline the functionality of the services offered by VisIVO Web. Finally we conclude with a summary of our work and pointers to future developments

A comparative evaluation of 3 different free-form deformable image registration and contour propagation methods for head and neck MRI : the case of parotid changes radiotherapy

Purpose: To validate and compare the deformable image registration and parotid contour propagation process for head and neck magnetic resonance imaging in patients treated with radiotherapy using 3 different approachesthe commercial MIM, the open-source Elastix software, and an optimized version of it. Materials and Methods: Twelve patients with head and neck cancer previously treated with radiotherapy were considered. Deformable image registration and parotid contour propagation were evaluated by considering the magnetic resonance images acquired before and after the end of the treatment. Deformable image registration, based on free-form deformation method, and contour propagation available on MIM were compared to Elastix. Two different contour propagation approaches were implemented for Elastix software, a conventional one (DIR_Trx) and an optimized homemade version, based on mesh deformation (DIR_Mesh). The accuracy of these 3 approaches was estimated by comparing propagated to manual contours in terms of average symmetric distance, maximum symmetric distance, Dice similarity coefficient, sensitivity, and inclusiveness. Results: A good agreement was generally found between the manual contours and the propagated ones, without differences among the 3 methods; in few critical cases with complex deformations, DIR_Mesh proved to be more accurate, having the lowest values of average symmetric distance and maximum symmetric distance and the highest value of Dice similarity coefficient, although nonsignificant. The average propagation errors with respect to the reference contours are lower than the voxel diagonal (2 mm), and Dice similarity coefficient is around 0.8 for all 3 methods. Conclusion: The 3 free-form deformation approaches were not significantly different in terms of deformable image registration accuracy and can be safely adopted for the registration and parotid contour propagation during radiotherapy on magnetic resonance imaging. More optimized approaches (as DIR_Mesh) could be preferable for critical deformations

BSP-fields: An Exact Representation of Polygonal Objects by Differentiable Scalar Fields Based on Binary Space Partitioning

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modeling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples