Creating Simplified 3D Models with High Quality Textures

This paper presents an extension to the KinectFusion algorithm which allows creating simplified 3D models with high quality RGB textures. This is achieved through (i) creating model textures using images from an HD RGB camera that is calibrated with Kinect depth camera, (ii) using a modified scheme to update model textures in an asymmetrical colour volume that contains a higher number of voxels than that of the geometry volume, (iii) simplifying dense polygon mesh model using quadric-based mesh decimation algorithm, and (iv) creating and mapping 2D textures to every polygon in the output 3D model. The proposed method is implemented in real-time by means of GPU parallel processing. Visualization via ray casting of both geometry and colour volumes provides users with a real-time feedback of the currently scanned 3D model. Experimental results show that the proposed method is capable of keeping the model texture quality even for a heavily decimated model and that, when reconstructing small objects, photorealistic RGB textures can still be reconstructed.Comment: 2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA), Page 1 -

Interactive inspection of complex multi-object industrial assemblies

The final publication is available at Springer via http://dx.doi.org/10.1016/j.cad.2016.06.005The use of virtual prototypes and digital models containing thousands of individual objects is commonplace in complex industrial applications like the cooperative design of huge ships. Designers are interested in selecting and editing specific sets of objects during the interactive inspection sessions. This is however not supported by standard visualization systems for huge models. In this paper we discuss in detail the concept of rendering front in multiresolution trees, their properties and the algorithms that construct the hierarchy and efficiently render it, applied to very complex CAD models, so that the model structure and the identities of objects are preserved. We also propose an algorithm for the interactive inspection of huge models which uses a rendering budget and supports selection of individual objects and sets of objects, displacement of the selected objects and real-time collision detection during these displacements. Our solution–based on the analysis of several existing view-dependent visualization schemes–uses a Hybrid Multiresolution Tree that mixes layers of exact geometry, simplified models and impostors, together with a time-critical, view-dependent algorithm and a Constrained Front. The algorithm has been successfully tested in real industrial environments; the models involved are presented and discussed in the paper.Peer ReviewedPostprint (author's final draft

2.5D multi-view gait recognition based on point cloud registration

This paper presents a method for modeling a 2.5-dimensional (2.5D) human body and extracting the gait features for identifying the human subject. To achieve view-invariant gait recognition, a multi-view synthesizing method based on point cloud registration (MVSM) to generate multi-view training galleries is proposed. The concept of a density and curvature-based Color Gait Curvature Image is introduced to map 2.5D data onto a 2D space to enable data dimension reduction by discrete cosine transform and 2D principle component analysis. Gait recognition is achieved via a 2.5D view-invariant gait recognition method based on point cloud registration. Experimental results on the in-house database captured by a Microsoft Kinect camera show a significant performance gain when using MVSM

Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. published a principle of the watershed computation by means of an Image Foresting Transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D case (image) without a detailed discussion of its computation and memory demands for real datasets. As IFT cleverly solves the problem of plateaus and as it gives precise results when thin objects have to be segmented, it is obvious to use this algorithm for 3D datasets taking in mind the minimizing of a higher memory consumption for the 3D case without loosing low asymptotical time complexity of O(m+C) (and also the real computation speed). The main goal of this paper is an implementation of the IFT algorithm with a priority queue with buckets and careful tuning of this implementation to reach as minimal memory consumption as possible. The paper presents five possible modifications and methods of implementation of the IFT algorithm. All presented implementations keep the time complexity of the standard priority queue with buckets but the best one minimizes the costly memory allocation and needs only 19-45% of memory for typical 3D medical imaging datasets. Memory saving was reached by an IFT algorithm simplification, which stores more elements in temporary structures but these elements are simpler and thus need less memory. The best presented modification allows segmentation of large 3D medical datasets (up to 512x512x680 voxels) with 12-or 16-bits per voxel on currently available PC based workstations.Comment: v1: 10 pages, 6 figures, 7 tables EUROGRAPHICS conference, Manchester, UK, 2001. v2: 12 pages, reformated for letter, corrected IFT to "Image Foresting Tranform

Generating descriptive text from functional brain images

Recent work has shown that it is possible to take brain images of a subject acquired while they saw a scene and reconstruct an approximation of that scene from the images. Here we show that it is also possible to generate _text_ from brain images. We began with images collected as participants read names of objects (e.g., ``Apartment'). Without accessing information about the object viewed for an individual image, we were able to generate from it a collection of semantically pertinent words (e.g., "door," "window"). Across images, the sets of words generated overlapped consistently with those contained in articles about the relevant concepts from the online encyclopedia Wikipedia. The technique described, if developed further, could offer an important new tool in building human computer interfaces for use in clinical settings

Orientation, sphericity and roundness evaluation of particles using alternative 3D representations

Sphericity and roundness indices have been used mainly in geology to analyze the shape of particles. In this paper, geometric methods are proposed as an alternative to evaluate the orientation, sphericity and roundness indices of 3D objects. In contrast to previous works based on digital images, which use the voxel model, we represent the particles with the Extreme Vertices Model, a very concise representation for binary volumes. We define the orientation with three mutually orthogonal unit vectors. Then, some sphericity indices based on length measurement of the three representative axes of the particle can be computed. In addition, we propose a ray-casting-like approach to evaluate a 3D roundness index. This method provides roundness measurements that are highly correlated with those provided by the Krumbein's chart and other previous approach. Finally, as an example we apply the presented methods to analyze the sphericity and roundness of a real silica nano dataset.Postprint (published version

Deformation of lyotropic chromonic liquid crystal induced by cylindrical surface

Department of PhysicsInterfaces, where liquid crystals (LCs) is in contact with other materials, play a pivotal role in most LCbased applications such as displays and sensors. Physicochemical properties of interfaces impose a surface anchoring, and the geometry and topology of confining interfaces determine LC???s director configuration and defects. To our interest, the concavely curved interface with anisotropic curvatures gives rise to a so-called surface-elasticity phenomenon. In this work, we report the director configuration around a cylindrical object embedded in nematic Sunset Yellow (SSY), a representative lyotropic chromonic LC with the large K24 modulus. The nematic SSY is sandwiched between two flat substrates, and a cylinder is placed in the SSY. The flat boundaries induce a homogeneous director field orthogonal to the cylinder???s axis, whereas the cylinder aligns neighboring directors parallel to its axis, based on the theory related with K24. These boundary conditions result in the twist deformation near the cylinder, and we investigate the deformation experimentally and theoretically, and evaluate K24 of SSY.clos