1,821 research outputs found

    Compression for Smooth Shape Analysis

    Full text link
    Most 3D shape analysis methods use triangular meshes to discretize both the shape and functions on it as piecewise linear functions. With this representation, shape analysis requires fine meshes to represent smooth shapes and geometric operators like normals, curvatures, or Laplace-Beltrami eigenfunctions at large computational and memory costs. We avoid this bottleneck with a compression technique that represents a smooth shape as subdivision surfaces and exploits the subdivision scheme to parametrize smooth functions on that shape with a few control parameters. This compression does not affect the accuracy of the Laplace-Beltrami operator and its eigenfunctions and allow us to compute shape descriptors and shape matchings at an accuracy comparable to triangular meshes but a fraction of the computational cost. Our framework can also compress surfaces represented by point clouds to do shape analysis of 3D scanning data

    Laer-induced Breakdown Spectroscopy Instrument for Element Analysis of Planetary Surfaces

    Get PDF
    One of the most fundamental pieces of information about any planetary body is the elemental and mineralogical composition of its surface materials. We are developing an instrument to obtain such data at ranges of up to several hundreds of meters using the technique of Laser-Induced Breakdown Spectroscopy (LIBS). We envision our instrument being used from a spacecraft in close rendezvous with small bodies such as comets and asteroids, or deployed on surface-rover vehicles on large bodies such as Mars and the Moon. The elemental analysis is based on atomic emission spectroscopy of a laser-induced plasma or spark. A pulsed, diode pumped Nd:YAG laser of several hundred millijoules optical energy is used to vaporize and electronically excite the constituent elements of a rock surface remotely located from the laser. Light emitted from the excited plasma is collected and introduced to the entrance slit of a small grating spectrometer. The spectrally dispersed spark light is detected with either a linear photo diode array or area CCD array. When the latter detector is used, the optical and spectrometer components of the LIBS instrument can also be used in a passive imaging mode to collect and integrate reflected sunlight from the same rock surface. Absorption spectral analysis of this reflected light gives mineralogical information that provides a remote geochemical characterization of the rock surface. We performed laboratory calibrations in air and in vacuum on standard rock powders to quantify the LIBS analysis. We performed preliminary field tests using commercially available components to demonstrate remote LIBS analysis of terrestrial rock surfaces at ranges of over 25 m, and we have demonstrated compatibility with a six-wheeled Russian robotic rover vehicle. Based on these results, we believe that all major and most minor elements expected on planetary surfaces can be measured with absolute accuracy of 10-15 percent and much higher relative accuracy. We have performed preliminary systems analysis of a LIBS instrument to evaluate probable mass and power requirements; results of this analysis are summarized

    Non-Rigid Puzzles

    Get PDF
    Shape correspondence is a fundamental problem in computer graphics and vision, with applications in various problems including animation, texture mapping, robotic vision, medical imaging, archaeology and many more. In settings where the shapes are allowed to undergo non-rigid deformations and only partial views are available, the problem becomes very challenging. To this end, we present a non-rigid multi-part shape matching algorithm. We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation. Each of these query parts can be additionally contaminated by clutter, may overlap with other parts, and there might be missing parts or redundant ones. Our method simultaneously solves for the segmentation of the reference model, and for a dense correspondence to (subsets of) the parts. Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method in dealing with this challenging matching scenario

    Iterative graph cuts for image segmentation with a nonlinear statistical shape prior

    Full text link
    Shape-based regularization has proven to be a useful method for delineating objects within noisy images where one has prior knowledge of the shape of the targeted object. When a collection of possible shapes is available, the specification of a shape prior using kernel density estimation is a natural technique. Unfortunately, energy functionals arising from kernel density estimation are of a form that makes them impossible to directly minimize using efficient optimization algorithms such as graph cuts. Our main contribution is to show how one may recast the energy functional into a form that is minimizable iteratively and efficiently using graph cuts.Comment: Revision submitted to JMIV (02/24/13

    SHREC'16: partial matching of deformable shapes

    Get PDF
    Matching deformable 3D shapes under partiality transformations is a challenging problem that has received limited focus in the computer vision and graphics communities. With this benchmark, we explore and thoroughly investigate the robustness of existing matching methods in this challenging task. Participants are asked to provide a point-to-point correspondence (either sparse or dense) between deformable shapes undergoing different kinds of partiality transformations, resulting in a total of 400 matching problems to be solved for each method - making this benchmark the biggest and most challenging of its kind. Five matching algorithms were evaluated in the contest; this paper presents the details of the dataset, the adopted evaluation measures, and shows thorough comparisons among all competing methods

    Optimization of perturbative similarity renormalization group for Hamiltonians with asymptotic freedom and bound states

    Get PDF
    A model Hamiltonian that exhibits asymptotic freedom and a bound state, is used to show on example that similarity renormalization group procedure can be tuned to improve convergence of perturbative derivation of effective Hamiltonians, through adjustment of the generator of the similarity transformation. The improvement is measured by comparing the eigenvalues of perturbatively calculated renormalized Hamiltonians that couple only a relatively small number of effective basis states, with the exact bound state energy in the model. The improved perturbative calculus leads to a few-percent accuracy in a systematic expansion.Comment: 6 pages of latex, 4 eps figure

    A reduced semantics for deciding trace equivalence using constraint systems

    Full text link
    Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M\"odersheim et al. have tackled this problem for reachability properties using partial order reduction techniques. We revisit their work, generalize it and adapt it for equivalence checking. We obtain an optimization in the form of a reduced symbolic semantics that eliminates redundant interleavings on the fly.Comment: Accepted for publication at POST'1
    • …
    corecore