Optimum Slice Reduction Algorithm For Fast Surface Reconstruction From Contour Slices

Tesis ini memfokus kepada pembinaan semula permukaan daripada siri hirisan kontur, dengan tujuan mempercepatkan proses pembinaan semula di samping mengekalkan kualiti output pada tahap yang boleh diterima. This thesis is concerned with the reconstruction of surface from a series of contour slices, with the aim to speed up the reconstruction process while preserving the output quality at an acceptable level

Optimum Slice Reduction Algorithm For Fast Surface Reconstruction From Contour slices [QA571. T164 2007 f rb].

Tesis ini memfokus kepada pembinaan semula permukaan daripada siri hirisan kontur, dengan tujuan mempercepatkan proses pembinaan semula di samping mengekalkan kualiti output pada tahap yang boleh diterima. Teknik yang dicadangkan dalam tesis ini memproses hirisan-hirisan kontur sebelum pembinaan semula permukaan. This thesis is concerned with the reconstruction of surface from a series of contour slices, with the aim to speed up the reconstruction process while preserving the output quality at an acceptable level. The proposed technique in this thesis, preprocesses the slices of contour prior to surface reconstruction

Tangent-ball techniques for shape processing

Shape processing defines a set of theoretical and algorithmic tools for creating, measuring and modifying digital representations of shapes.  Such tools are of paramount importance to many disciplines of computer graphics, including modeling, animation, visualization, and image processing.  Many applications of shape processing can be found in the entertainment and medical industries. In an attempt to improve upon many previous shape processing techniques, the present thesis explores the theoretical and algorithmic aspects of a difference measure, which involves fitting a ball (disk in 2D and sphere in 3D) so that it has at least one tangential contact with each shape and the ball interior is disjoint from both shapes. We propose a set of ball-based operators and discuss their properties, implementations, and applications.  We divide the group of ball-based operations into unary and binary as follows: Unary operators include: * Identifying details (sharp, salient features, constrictions) * Smoothing shapes by removing such details, replacing them by fillets and roundings * Segmentation (recognition, abstract modelization via centerline and radius variation) of tubular structures Binary operators include: * Measuring the local discrepancy between two shapes * Computing the average of two shapes * Computing point-to-point correspondence between two shapes * Computing circular trajectories between corresponding points that meet both shapes at right angles * Using these trajectories to support smooth morphing (inbetweening) * Using a curve morph to construct surfaces that interpolate between contours on consecutive slices The technical contributions of this thesis focus on the implementation of these tangent-ball operators and their usefulness in applications of shape processing. We show specific applications in the areas of animation and computer-aided medical diagnosis.  These algorithms are simple to implement, mathematically elegant, and fast to execute.Ph.D.Committee Chair: Jarek Rossignac; Committee Member: Greg Slabaugh; Committee Member: Greg Turk; Committee Member: Karen Liu; Committee Member: Maryann Simmon

Free-form deformation, mesh morphing and reduced-order methods: enablers for efficient aerodynamic shape optimisation

The work provides an integrated pipeline for the model order reduction of turbulent flows around parametrised geometries in aerodynamics. In particular, Free-Form Deformation is applied for geometry parametrisation, whereas two different reduced-order models based on Proper Orthogonal Decomposition (POD) are employed in order to speed-up the full-order simulations: the first method exploits POD with interpolation, while the second one is based on domain decomposition. For the sampling of the parameter space, we adopt a Greedy strategy coupled with Constrained Centroidal Voronoi Tessellations, in order to guarantee a good compromise between space exploration and exploitation. The proposed framework is tested on an industrially relevant application, i.e. the front-bumper morphing of the DrivAer car model, using the finite-volume method for the full-order resolution of the Reynolds-Averaged Navier-Stokes equations

Dense 3D Face Correspondence

We present an algorithm that automatically establishes dense correspondences between a large number of 3D faces. Starting from automatically detected sparse correspondences on the outer boundary of 3D faces, the algorithm triangulates existing correspondences and expands them iteratively by matching points of distinctive surface curvature along the triangle edges. After exhausting keypoint matches, further correspondences are established by generating evenly distributed points within triangles by evolving level set geodesic curves from the centroids of large triangles. A deformable model (K3DM) is constructed from the dense corresponded faces and an algorithm is proposed for morphing the K3DM to fit unseen faces. This algorithm iterates between rigid alignment of an unseen face followed by regularized morphing of the deformable model. We have extensively evaluated the proposed algorithms on synthetic data and real 3D faces from the FRGCv2, Bosphorus, BU3DFE and UND Ear databases using quantitative and qualitative benchmarks. Our algorithm achieved dense correspondences with a mean localisation error of 1.28mm on synthetic faces and detected $14$ anthropometric landmarks on unseen real faces from the FRGCv2 database with 3mm precision. Furthermore, our deformable model fitting algorithm achieved 98.5% face recognition accuracy on the FRGCv2 and 98.6% on Bosphorus database. Our dense model is also able to generalize to unseen datasets.Comment: 24 Pages, 12 Figures, 6 Tables and 3 Algorithm

Stegano-Morphing: Concealing Attacks on Face Identification Algorithms

© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksFace identification is becoming a well-accepted technology for access control applications, both in the real or virtual world. Systems based on this technology must deal with the persistent challenges of classification algorithms and the impersonation attacks performed by people who do not want to be identified. Morphing is often selected to conduct such attacks since it allows the modification of the features of an original subject's image to make it appear as someone else. Publications focus on impersonating this other person, usually someone who is allowed to get into a restricted place, building, or software app. However, there is no list of authorized people in many other applications, just a blacklist of people no longer allowed to enter, log in, or register. In such cases, the morphing target person is not relevant, and the main objective is to minimize the probability of being detected. In this paper, we present a comparison of the identification rate and behavior of six recognizers (Eigenfaces, Fisherfaces, LBPH, SIFT, FaceNet, and ArcFace) against traditional morphing attacks, in which only two subjects are used to create the altered image: the original subject and the target. We also present a new morphing method that works as an iterative process of gradual traditional morphing, combining the original subject with all the subjects' images in a database. This method multiplies by four the chances of a successful and complete impersonation attack (from 4% to 16%), by deceiving both face identification and morphing detection algorithms simultaneouslyThis work was supported by the Consejería De Ciencia, Universidad e Innovación, Comunidad de Madri