5,114 research outputs found

    Discrete curvature approximations and segmentation of polyhedral surfaces

    Get PDF
    The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object. To this end, discrete curvature approximations are introduced as the basis of a segmentation process that lead to a decomposition of digitized data into areas that will help the construction of parametric surface patches. The approach proposed relies on the use of a polyhedral representation of the object built from the digitized data input. Then, it is shown how noise reduction, edge swapping techniques and adapted remeshing schemes can participate to different preparation phases to provide a geometry that highlights useful characteristics for the segmentation process. The segmentation process is performed with various approximations of discrete curvatures evaluated on the polyhedron produced during the preparation phases. The segmentation process proposed involves two phases: the identification of characteristic polygonal lines and the identification of polyhedral areas useful for a patch construction process. Discrete curvature criteria are adapted to each phase and the concept of invariant evaluation of curvatures is introduced to generate criteria that are constant over equivalent meshes. A description of the segmentation procedure is provided together with examples of results for free form object surfaces

    Image segmentation with adaptive region growing based on a polynomial surface model

    Get PDF
    A new method for segmenting intensity images into smooth surface segments is presented. The main idea is to divide the image into flat, planar, convex, concave, and saddle patches that coincide as well as possible with meaningful object features in the image. Therefore, we propose an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L∞ fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main contribution is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way. As a result, the surface segments corresponding to meaningful object features and the contours separating the surface segments coincide with real-image object edges. Moreover, the curvature-based surface shape information facilitates many tasks in image analysis, such as object recognition performed on the polynomial representation. The polynomial representation provides good image approximation while preserving all the necessary details of the objects in the reconstructed images. The method outperforms existing techniques when segmenting images of objects with diffuse reflecting surfaces

    Research in interactive scene analysis

    Get PDF
    Cooperative (man-machine) scene analysis techniques were developed whereby humans can provide a computer with guidance when completely automated processing is infeasible. An interactive approach promises significant near-term payoffs in analyzing various types of high volume satellite imagery, as well as vehicle-based imagery used in robot planetary exploration. This report summarizes the work accomplished over the duration of the project and describes in detail three major accomplishments: (1) the interactive design of texture classifiers; (2) a new approach for integrating the segmentation and interpretation phases of scene analysis; and (3) the application of interactive scene analysis techniques to cartography

    Reverse Engineering Trimmed NURB Surfaces From Laser Scanned Data

    Get PDF
    A common reverse engineering problem is to convert several hundred thousand points collected from the surface of an object via a digitizing process, into a coherent geometric model that is easily transferred to a CAD software such as a solid modeler for either design improvement or manufacturing and analysis. These data are very dense and make data-set manipulation difficult and tedious. Many commercial solutions exist but involve time consuming interaction to go from points to surface meshes such as BSplines or NURBS (Non Uniform Rational BSplines). Our approach differs from current industry practice in that we produce a mesh with little or no interaction from the user. The user can produce degree 2 and higher BSpline surfaces and can choose the degree and number ofsegments as parameters to the system. The BSpline surface is both compact and curvature continuous. The former property reduces the large storage overhead, and the later implies a smooth can be created from noisy data. In addition, the nature ofthe BSpline allows one to easily and smoothly alter the surface, making re-engineering extremely feasible. The BSpline surface is created using the principle ofhigher orders least squares with smoothing functions at the edges. Both linear and cylindrical data sets are handled using an automated parameterization method. Also, because ofthe BSpline's continuous nature, a multiresolutional-triangulated mesh can quickly be produced. This last fact means that an STL file is simple to generate. STL files can also be easily used as input to the system.Mechanical Engineerin

    Boundary and object detection in real world images

    Get PDF
    A solution to the problem of automatic location of objects in digital pictures by computer is presented. A self-scaling local edge detector which can be applied in parallel on a picture is described. Clustering algorithms and boundary following algorithms which are sequential in nature process the edge data to locate images of objects

    A Three-dimensional Deformable Brain Atlas for DBS Targeting. I. Methodology for Atlas Creation and Artifact Reduction.

    Get PDF
    BackgroundTargeting in deep brain stimulation (DBS) relies heavily on the ability to accurately localize particular anatomic brain structures. Direct targeting of subcortical structures has been limited by the ability to visualize relevant DBS targets.Methods and resultsIn this work, we describe the development and implementation, of a methodology utilized to create a three dimensional deformable atlas for DBS surgery. This atlas was designed to correspond to the print version of the Schaltenbrand-Bailey atlas structural contours. We employed a smoothing technique to reduce artifacts inherent in the print version.ConclusionsWe present the methodology used to create a three dimensional patient specific DBS atlas which may in the future be tested for clinical utility

    Planar PØP: feature-less pose estimation with applications in UAV localization

    Get PDF
    © 20xx 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 works.We present a featureless pose estimation method that, in contrast to current Perspective-n-Point (PnP) approaches, it does not require n point correspondences to obtain the camera pose, allowing for pose estimation from natural shapes that do not necessarily have distinguished features like corners or intersecting edges. Instead of using n correspondences (e.g. extracted with a feature detector) we will use the raw polygonal representation of the observed shape and directly estimate the pose in the pose-space of the camera. This method compared with a general PnP method, does not require n point correspondences neither a priori knowledge of the object model (except the scale), which is registered with a picture taken from a known robot pose. Moreover, we achieve higher precision because all the information of the shape contour is used to minimize the area between the projected and the observed shape contours. To emphasize the non-use of n point correspondences between the projected template and observed contour shape, we call the method Planar PØP. The method is shown both in simulation and in a real application consisting on a UAV localization where comparisons with a precise ground-truth are provided.Peer ReviewedPostprint (author's final draft
    • …
    corecore