Stochastic search for 3-d shape registration

نویسندگان

  • P. Kaliamoorthi
  • R. Kakarala
  • J. Xu
چکیده

Global optimization is fundamental in many problems such as 3-d registration, which is critical for Non-Destructive Testing. Global optimization using stochastic search has been popular in human motion capture. These methods use annealing and construct a sequence of particles that approximate a likelihood, whose global mode is searched by the optimization procedure. Treating the minimization objective as the negative log likelihood ensures that the global mode of the likelihood corresponds to the minimum of the cost function. Hardly any research has gone into studying how well these global optimization tools can be adapted for 3-d registration, which require the optimization of non-convex objectives that would result in a multi-modal likelihood. In a previous work, we applied these methods for 3-d bilateral symmetry plane estimation. In this paper, we apply stochastic search techniques to the problem of 3-d shape registration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...

متن کامل

Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration

The iterative closest point (ICP) algorithm is one of the most popular approaches to shape registration currently in use. At the core of ICP is the computationally-intensive determination of nearest neighbors (NN). As of now there has been no comprehensive analysis of competing search strategies for NN. This paper compares several libraries for nearest-neighbor search (NNS) on both simulated an...

متن کامل

Fast ICP Algorithms for Shape Registration

Shape registration plays an important role in applications such as 3D object modeling or object recognition. The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawback is its time complexity O(N), quadratic with the shape size N, which implies long processing time, especially when using high resolution data. Several methods were p...

متن کامل

A Geometric Framework for Stochastic Shape Analysis

We introduce a stochastic model of diffeomorphisms, whose action on a variety of data types descends to stochastic models of shapes, images and landmarks. The stochasticity is introduced in the vector field which transports the data in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework for shape analysis and image registration. The stochasticity thereby models errors or uncert...

متن کامل

On Search for all d-MCs in a Network Flow

A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013