Elastic Shape Registration using an Incremental Free Form Deformation Approach with the ICP Algorithm

Size: px
Start display at page:

Download "Elastic Shape Registration using an Incremental Free Form Deformation Approach with the ICP Algorithm"

Transcription

1 Elastic Shape Registration using an Incremental Free Form Deformation Approach with the ICP Algorithm Hossam Abdelmunim Computer & Systems Engineering Department, Faculty of Engineering, Ain Shams University, Cairo 11517, Egypt. Aly A. Farag Computer Vision and Image Processing Laboratory, Electrical & Computer Engineering Department, University of Louisville, KY 4292, USA. URL: Abstract Shape registration is one of the most challenging problems in computer vision and medical imaging. The process is affected by the way the shape is represented and the form of transformation used to move the source shape. Our paper handles the elastic shape registration by combining the incremental free form deformation (IFFD) with the point-based registration technique using the sum of least squares method. The iterative closest point (ICP) algorithm is used as a criteria to establish point correspondences in each level of the IFFD framework. The free form deformation (FFD) is well known in the literature and works by forming a lattice of control points that can move and hence deform the domain grid points smoothly and uniformly under some shape constrains. The control lattice resolution is increased step by step to achieve a satisfactory deformation of the source shape to exactly match the target boundaries. Our point-based registration is based on least squares that measure the Euclidean distance between source and target boundaries in addition to the shape constrains. The minimization gives a closed form solution of the lattice control points positions. Promising results will be demonstrated for closed and open shapes and structures. The approach can also work for structures that contain multiple parts without any problems. Keywords-Shape Representation; Shape Registration; Anatomical Structures; ICP Algorithm; I. INTRODUCTION Shapes registration [1] is an important complex problem in computer vision, computer graphics and medical imaging. It has been handled in different manners in many applications like shape-based segmentation, shape recognition, and tracking. The shape registration problem is formulated such that a transformation that moves a point from a given source boundary to another target shape according to some dissimilarity measure [2], needs to be estimated. The dissimilarity measure can be defined according to either the curve or the entire region enclosed by the curve. The iterative closest point algorithm was proposed in [3]. The approach is based on finding the correspondence based on the minimum distance criterion. Different shape registration methods based on this technique are provided in the literature (e.g. [4]). It is used in registering either 2D or 3D objects. Different shape registration approaches were proposed in the literature [5], [6], [7]. These approaches suffer from various problems, including scale variations and dependence on initialization. Also local deformations can not be covered. Image boundaries are used for registration in [8]. Images are registered using the iterative closest point algorithm to match these boundaries(shapes). A hierarchical B-spline technique is used to match these surfaces. The algorithm depends mainly on the number of points that represent the source and target images in addition to the number of control points which create a huge matrix equation system. The solution of such equations is sometimes impossible. In [9], internal and external contours of an object are extracted from the image to be matched with a database to mark joints of the human body. Edge detectors are important to extract the features for matching in such cases. A shape registration framework was proposed in [2] using the signed distance map representation. A global transformation which includes homogeneous scale, rotation, and translation, is used to align planar shapes. The local deformations are handled, by minimizing sum of square differences of the shapes representation. The form of local deformations does not give the desired local correspondences. In [1], a 3D shape-segmentation approach was proposed which included a shape registration process. A shape model was built from a set of training shapes using signed distance functions (the conventional representation). A level set function evolved, thus minimizing the shape alignment and the intensity gray level energies. Using a simple global transformation with homogenous scales creates a problem when gathering training shapes from different patients scans. The registration process fails when the target shape requires inhomogeneous scales. An interesting shape registration approach was proposed recently in [11] using maximization of mutual information. Images of signed distance maps of the registered shapes are involved. An affine transformation is used to handle the global registration problem through a gradient descent

2 optimization technique. The local deformations are represented by the incremental free form deformations method. The control points minimize a sum of squared differences energy. Using such a method makes the problem complicated since a large number of control points may be required to cover detailed local deformations. The gradient descent optimization may have a problem with these large number of variables associated with different levels of the IFFD. Vector level set functions are used to represent and register shapes in [12]. The vector components represent the vector projections from any point in space to the nearest point on the shape boundary. A positive sign is used to mark points inside the shape while outside points are given negative values. A simple dissimilarity measure is used to handle the problem of inhomogeneous scaling in the shape registration framework used to solve the shape-based segmentation problem. In this paper, we introduce an elastic shape registration technique using the iterative closest point algorithm. The motion of curves to their targets is described by, the incremental free form deformations. Control points are calculated by a closed form solution for energy minimization as a point-based registration problem. Sum of least squares and smoothing constrains are used to formulate an energy function which is quadratic in terms of control points deformations. We will show that the multi level resolution control lattice approach gives exact and accurate correspondences compared to the single high resolution level case. The minimization of the energy function results in a linear system of size dependence only on the number of control points, which makes the solution possible and reasonable. Different synthetic and real shapes registration will be demonstrated to illustrate the efficiency of the approach. The rest of this paper is organized as follows: Point-based registration is formulated in Sec. II, a prelude to the coarse to fine strategy is given in Sec. III, a quick overview of the ICP algorithm is demonstrated in Sec. IV, the main algorithm steps are listed in Sec. V, experimental results and validation are in Sec. VI, and conclusion in Sec. VII. II. POINT-BASED SHAPE REGISTRATION Our objective is to find a function that gives the point correspondences between the two given domains (source and target). Let us define the 2D shape registration as follows: AmapC s (p) :[, 1] R R 2 defines a planar source curve with a parameter p. The target is defined by C t (p) : [, 1] R R 2. The cartesian coordinates of the point vector can be defined by C(p) =[xy] T where x X and y Y. Assume that C t (p) is the corresponding point of C s (p) (the criteria for finding correspondences will come in the following sections). The output will be a C function f : R 2 R 2 with f(c s (p)) = C t (p), p [, 1]. Different interpolation functions have been proposed to handle this problem [8]. We choose the free form deformation FFD model, based on B-splines [13], [14], which is a powerful tool for modeling deformable objects and has been previously applied to the tracking and motion analysis problems. The basic idea is to deform the shape by manipulating a mesh of control points. The resulting deformation controls the shape of the object and produces a smooth and continuous transformation. Consider a lattice of control points P = P m,n ; m = 1,...,M. n =1,...,N, each point on the source shape will have the following form of deformation: L(p) = 3 k= l= 3 B k (u)b l (v)δp i+k,j+l (1) where δp = δp m,n is the control point deformation, i = (x.(m 1)/X) +1, j = (y.(n 1)/Y ) +1, u = x.m/x (x.m/x), v = y.n/y (y.n/y ), and the spline basis functions (B) are defined in [14]. So the cubic B-spline is used as an approximation function for our interpolation problem. We propose the following energy to measure the difference between the deformed contour and its target points based on the Euclidean distance: E(δP) = 1 C s (p)+l(p) C t (p) 2 dp Also, we need to avoid any undesired distortion in the shape and preserve the regularity of the registration grid flow. Another weighted term (by λ R + ) is added for smoothness constrain as follows [15]: E(δP) = 1 Cs (p)+l(p) C t (p) 2 dp + λ 1 ( L p 2 + L pp 2 )dp (3) where L p and L pp are the first and second derivatives respectively of the deformation vector with respect to the parameterizations p. The above objective function is required to be minimal to calculate the control points locations and hence the deformation field at each point in the domain. Gradient descent and calculus of variation are used to optimize the given function as follows: E δp =2 1 (L(p) C(p))T δp dp +2λ 1 (LT p p δp + L T pp pp δp )dp (4) where C(p) =C t (p) C s (p). A detailed illustration for the local deformation derivatives are found in [11]. By setting the above equation to zero, we get a linear system of the control points coordinates: 1 (C(p))T δp dp = 1 LT δp dp + λ 1 p δp (LT p + L T pp pp δp )dp (5)

3 The left hand side is free from the coordinates of the control points while the other side is linearly a function of these unknowns. The following linear equation holds: ΨΘ = Λ (6) where Θ=[δP x 1,1,...,δPx M,N,δPy 1,1,...,δPy M,N ]T and x, y are the coordinates of the embedding space. The other matrices elements are calculated as follows: Ψ r,c = 1 (Lr,c ) T θ r dp + λ 1 ((Lr,c p )T p θ r +(L r,c pp ) T pp θ r )dp (7) Λ r = 1 (C(p))T θ r dp (8) where θ r Θ and L r,c stands for the coefficient of the control point vector calculated from the cubic spline interpolation. Row and column are represented by randc respectively. The resulting matrix equation size depends on the number of control points and the space dimensions. Size of the data points of the curve does not have any impact on the matrices sizes which guarantees its computational efficiency (this is a huge advantage over the work proposed in [8] where number of linear equations is equal to number of data points). Also note that the smoothing constrains do not add extra load to the solution of the matrix equation. III. A COARSE TO FINE STRATEGY (INCREMENTAL FREE FORM DEFORMATION) The above objective function is required to be minimized by moving the control points to get the correct correspondence over shape boundaries. A very small error can be achieved when using a high resolution control lattice because the number of degrees of freedom increases. However this is not enough. Such sudden movement will result in unnecessary cross overs of the domain grid lines and the registration process will be meaningless. This will result in changing and corrupting the object topology. A better way is to move the grid step by step towards the target. To illustrate the problem, we formed a contour which represents sides of a square (this will stand for the source). Another contour is obtained by rotating the first one by an angle of π/2 (this will stand for the target). Correspondences between the source and target shapes are established by the rotation effect. A control lattice is constructed and computed using the above formula for the point-based registration. When using a relatively high resolution of lattice, foldovers occur as shown in Fig. 1 (top left image). To avoid this, a coarse to fine strategy is used (equivalent to the incremental free form deformations used in [11]). We start with a resolution of 4 4 and solve for the deformation. Iteratively we increase the resolution as 5 5, 6 6, and so on and so forth. In each step, the control points positions Energy x Lattice Resolution Figure 1. Grid local deformation when using a control point resolution of is given in the top left image while multi level deformation to the right. The graph gives the energy calculated at each level of resolution where any value N in the x-axis means a resolution of N N. The steady state energy value is e 12. are computed and the contour moves to the new position until a satisfactory error distance is obtained. The result is smooth and the correspondence is achieved accurately. The final grid deformation is shown in the right image. This process handles extremely well the error and gives impressive infinitesimal energy function and smooth grid deformations at the same time. IV. ITERATIVE CLOSEST POINT (ICP) ALGORITHM The iterative closest point (ICP) algorithm is a widely applied method for the registration of two data sets of points. For two Euclidean point sets, assume that the source point set is C s and the target point is C t. The source point set is assumed to change or deform according to a certain known form of transformation and the target will remain fixed. The ICP algorithm can be described as follows [3]: 1) Initialize transformation parameters. 2) For every point in C s determine its closest point in C t. 3) Compute the transformation parameters that minimize the sum of square differences between the correspondences.

4 (a) (b) (1) Figure 3. Two shapes registration comparison: The source is given in the first row to the left shown in red while the target in blow. The use of the ICP gives directly the points correspondences shown in the right image. Our resulting dense point correspondences are demonstrated in the bottom. (3) Average Error per Pixel Lattice Resolution Figure 2. Illustration of point-based registration example: (1.a) MRI image, (1.b) Deformed image, (2.a) Source edge points, (2.b) Target edge points, (3.a) Final deformed image grid, and (3.b) The checkerboard image. The average error per pixel is plotted versus the resolution level and given at the bottom graph. 4) Based on the new parameters, update the source points C s to the new positions. 5) If the change in the source points is less than a certain threshold terminate, otherwise go to step #2 Transformation parameters will represent the way that the source data set moves to be registered to the target. Since we are focusing on elastic motion, all shapes are assumed to be globally registered. Only local deformations will be handled in this paper. The conventional ICP drawbacks are well known. For elastic registration, it is difficult to find a deformation function to keep the topology of the registered objects. Another issue is that the closest point is not unique. According to [8], a coarse to fine strategy using the B-splines overcomes these problems for covering the local deformations. Below we will use a similar algorithm with our closed form solution for the point-based registration problem. V. A COARSE TO FINE STRATEGY WITH THE ICP Now we will illustrate the whole algorithm for shape registration. Assume that Nx i Ny i is the resolution of the control point lattice initially denoted by i. The resolution at any time will be N x N y. The basic steps will be as follows: 1) Set N x = Nx i and N y = Ny i 2) Construct a control lattice of size N x N y and initialize its point deformation vectors to zeros. 3) For each point in C s, determine its corresponding closest point in C t.

5 4) Solve Eq. 6 to get the new deformation of each control point and hence calculate its new position. 5) Based on the new lattice, update the source points C s by calculating the new deformation field using Eq. 1. 6) Set N x = N x +1 and N y = N y +1. 7) Check the stopping criteria. Either the objective function goes below a certain threshold or a number of maximum resolution levels is reached, otherwise go to step #2. VI. EXPERIMENTAL RESULTS We start our experimental results by demonstrating an example for the point-based registration algorithm. We deformed an MRI image by constructing a lattice of control points over its grid. The control points are moved randomly in a certain direction resulting in deforming the image grid points together as shown in Fig. 2 (1.b). Point correspondences are constructed by taking the edge contours of the original and deformed images (point illustration is given in (2.a) and (2.b)). So each point is associated with its target priori because the control points new position are already known. Now, the situation is reversed. Given the edge contours of the source and target images, we need to calculate the deformation grid using our point-based algorithm. Our approachsuccessfully covers the deformation at each point with the coarse to fine strategy. A final average pixel error of.2 is achieved. As we notice from the graph on the bottom, the average error dramatically gets reduced when increasing the resolution of the control lattice. The deformed image is gathered with its target in a checkerboard illustration as shown in (3.b). Having a closer look at the ventricles shows that the deformation is very accurate since, the two parts coming from different images have no transition. Edges are connected along the squares in all parts of the checkerboard image. To show the difference between our approach and the conventional ICP algorithm ([3], [4]), we demonstrate the registration of two humanoid models in Fig. 3. The ICP fails to establish correct point correspondences. Our approach does the job efficiently because the whole grid moves slowly and step by step towards the target. In all experiments, shapes are priori registered globally using the approach developed in [12] for shape global registration. Different scales, rotations, and translations are estimated for each case. Different elastic shape registration experiments are demonstrated in Fig. 4. The algorithms demonstrated in Sec. V is used for registration. In all experiments, an initial lattice resolution of 7 7 is established and then the level is increased until a satisfactory deformation is achieved. Examples (1) to (4) are dedicated to teeth deformations. The first registration example does not have complicated local difference details between the given shapes. This does not require a high level of resolution. More complicated differences in the tags and roots areas (1) (a) (b) (c) (d) Figure 5. Different elastic registration examples of open shapes (source contour is given in red, target contour is drawn in green, and deformed contour is shown in blue): (a) Initial position, (b) Intermediate stage of point correspondences, (c) Final correspondences, and (d) Final grid deformation. (1) (a) Figure 6. Different elastic registration examples of shapes containing multiple parts: (source contour is given in red, target contour is drawn in green, and deformed contour is shown in blue) two different brain structures are given: (a) Initial position (b) Final correspondences. can be noticed in examples, (3), and (4). Large number of resolution levels are used to successfully achieve these local deformations. Another more complicated deformation example is shown for the fish in (5). Investigating the point correspondence in each case, we find that: our algorithm gives exact physical dense correspondences and the grid deformations do not have crossovers which shows the necessity of the coarse to fine strategy and the smoothness constrains. Our approach does not only work for closed shapes but it can also handle open structures registration problem efficiently as shown in Fig. 5. Another issue is the registration of shapes that include multiple parts. The registration of two brain structures, for example, is shown in Fig. 6. Open and multiple parts shapes are parameterized in different ways. End points of the open shape are different C() C(1) while in closed shapes C() = C(1). For the multiple parts case, each individual curve is parameterized independently then gathered together to handle the entire shape. (b)

6 (1) (3) (4) (5) (a) (b) (c) (d) Figure 4. Different elastic registration examples of closed shapes (source contour is given in red, target contour is drawn in green, and deformed contour is shown in blue): teeth examples are given from (1) to (4) and a fish example is shown in (5). (a) Initial position, (b) Intermediate stage of point correspondences, (c) Final correspondences, and (d) Final grid deformation.

7 VII. CONCLUSION AND FUTURE RESEARCH We have proposed an efficient and simple approach for the elastic shape registration problem. Source and target shapes are represented explicitly and registered to each other by a hierarchical B-splines deformation algorithm. A closed form solution of the control points is obtained to minimize an energy function. The solution does not need huge amount of processing since the linear system size is a function of the number of control points only. The algorithms start with a small size control lattice which is increased step by step to handle the deformations. Exact physical correspondences are achieved through the demonstration of different teeth registration examples. Roots and tags deformations are covered efficiently. Another complicated example is given for the fish registration. The approach can work with open structures in addition to structures having multiple objects without difficulty. Only 2D examples are demonstrated but future work will be geared towards considering 3D applications. Image registration is of great interest and will be considered for future research. REFERENCES [1] R. Veltkamp and M. Hagedoorn, State of the Art in Shape Matching, Technical Report, UU-CS , Utrecht University, Sept [1] M. Rousson, N. Paragios and R. Deriche. Implicit Active Shape Models for 3D Segmentation in MRI Imaging, Medical Image Computing and Computer Assisted Intervention (MIC- CAI), Part 1, pp , Saint-Malo, France, September 26-29, 24. [11] Xiaolei Huang; Paragios, N.; Metaxas, D.N., Shape registration in implicit spaces using information theory and free form deformations, TPAMI, Vol. 28, Issue 8, Aug. 26 Page(s): [12] H. E. Abd El Munim and A. A. Farag, A Shape-Based Segmentation Approach: An Improved Technique Using Level Sets, Tenth IEEE International Conference on Computer Vision (ICCV), Beijing, China, Oct. 17-2,25, pp [13] T. Sederberg and S. Parry, Free-Form Deformation of Solid Geometric Models, in ACM SIGGRAPH, 1986, pp [14] D. Rueckert, L. Sonoda, C. Hayes, D. Hill, M. Leach, and D. Hawkes, Nonrigid Registration Using Free-Form Deformations: Application to Breast MR Images, IEEE Transactions on Medical Imaging,vol. 8, pp , [15] Tim McInerney and Demetri Terzopoulos, Deformable Models in Medical Image Analysis: A Survey, In Medical Image Analysis, 1:9118, [2] Nikos Paragios, Mikael Rousson and Visvanathan Ramesh, Matching Distance Functions: A Shape-to-Area Variational Approach for Global-to-Local Registration, European Conference in Computer Vision, Copenhagen, Denmark, Jun. 22. [3] P. Besl and N. Mckay, A Method for Registration of 3-D Shapes, IEEE Tr. on PAMI, 14: , [4] Z. Zhang, Iterative Point Matching for Registration of Freeform Curves and Surfaces, Ph.D. International Journal of Computer Vision, vol. 13, no. 2, pp , [5] I. Cohen and I. Herlin, Curve Matching Using Geodesic Paths, In IEEE CVPR, pp ,Santa Barbara, USA, [6] A. Fitzgibbon, Robust Registration of 2D and 3D Points Sets, In Proceeding of The British Machine Vision Conference (BMVC), vol. 2, pp ,University of Manchester, UK, 21. [7] D. Kozinska, O. Tretika, J. Nissanov, and C. Ozturk, Multidimensional Alignment Using the Euclidean Distance Transform, Graphical Models and Image Processing, pp 6: ,1997. [8] Z. Xie and G. E. Farin, Image Registration Using Hierarchical B-Splines, IEEE Transaction on Visualization and Computer Graphics, Vol. 1, NO. 1, 24. [9] G. Mori and J. Malik,, Recovering 3D Human Body Configurations Using Shape Contexts, PAMI, VOL. 28, NO. 7,pp , July 26.

Shape Representation and Registration in Vector Implicit Spaces: Adopting a Closed-Form Solution in the Optimization Process

Shape Representation and Registration in Vector Implicit Spaces: Adopting a Closed-Form Solution in the Optimization Process IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 35, NO. 3, MARCH 2013 763 Shape Representation and Registration in Vector Implicit Spaces: Adopting a Closed-Form Solution in the Optimization

More information

Nonrigid Registration using Free-Form Deformations

Nonrigid Registration using Free-Form Deformations Nonrigid Registration using Free-Form Deformations Hongchang Peng April 20th Paper Presented: Rueckert et al., TMI 1999: Nonrigid registration using freeform deformations: Application to breast MR images

More information

Non-rigid Image Registration

Non-rigid Image Registration Overview Non-rigid Image Registration Introduction to image registration - he goal of image registration - Motivation for medical image registration - Classification of image registration - Nonrigid registration

More information

MetaMorphs: Deformable Shape and Texture Models

MetaMorphs: Deformable Shape and Texture Models MetaMorphs: Deformable Shape and Texture Models Xiaolei Huang, Dimitris Metaxas, Ting Chen Division of Computer and Information Sciences Rutgers University New Brunswick, NJ 8854, USA {xiaolei, dnm}@cs.rutgers.edu,

More information

Models. Xiaolei Huang, Member, IEEE, and Dimitris Metaxas, Senior Member, IEEE. Abstract

Models. Xiaolei Huang, Member, IEEE, and Dimitris Metaxas, Senior Member, IEEE. Abstract Metamorphs: Deformable Shape and Appearance Models Xiaolei Huang, Member, IEEE, and Dimitris Metaxas, Senior Member, IEEE Abstract This paper presents a new deformable modeling strategy aimed at integrating

More information

Image Coding with Active Appearance Models

Image Coding with Active Appearance Models Image Coding with Active Appearance Models Simon Baker, Iain Matthews, and Jeff Schneider CMU-RI-TR-03-13 The Robotics Institute Carnegie Mellon University Abstract Image coding is the task of representing

More information

Locally Rigid Globally Non-rigid Surface Registration

Locally Rigid Globally Non-rigid Surface Registration Locally Rigid Globally Non-rigid Surface Registration Kent Fujiwara 1, Ko Nishino 2, Jun Takamatsu 3, Bo Zheng 1 and Katsushi Ikeuchi 1 1 Institute of Industrial Science, The University of Tokyo 2 Department

More information

Range Image Registration with Edge Detection in Spherical Coordinates

Range Image Registration with Edge Detection in Spherical Coordinates Range Image Registration with Edge Detection in Spherical Coordinates Olcay Sertel 1 and Cem Ünsalan2 Computer Vision Research Laboratory 1 Department of Computer Engineering 2 Department of Electrical

More information

Dr. Ulas Bagci

Dr. Ulas Bagci Lecture 9: Deformable Models and Segmentation CAP-Computer Vision Lecture 9-Deformable Models and Segmentation Dr. Ulas Bagci bagci@ucf.edu Lecture 9: Deformable Models and Segmentation Motivation A limitation

More information

Implicit Active Shape Models for 3D Segmentation in MR Imaging

Implicit Active Shape Models for 3D Segmentation in MR Imaging Implicit Active Shape Models for 3D Segmentation in MR Imaging Mikaël Rousson 1, Nikos Paragios 2, and Rachid Deriche 1 1 I.N.R.I.A. Sophia Antipolis, France E-mail: {Mikael.Rousson,Rachid.Deriche}@sophia.inria.fr

More information

Algorithm research of 3D point cloud registration based on iterative closest point 1

Algorithm research of 3D point cloud registration based on iterative closest point 1 Acta Technica 62, No. 3B/2017, 189 196 c 2017 Institute of Thermomechanics CAS, v.v.i. Algorithm research of 3D point cloud registration based on iterative closest point 1 Qian Gao 2, Yujian Wang 2,3,

More information

Super-resolution of Facial Images in Video with Expression Changes

Super-resolution of Facial Images in Video with Expression Changes IEEE Fifth International Conference on Advanced Video and Signal Based Surveillance Super-resolution of Facial Images in Video with Expression Changes Jiangang Yu and Bir Bhanu Center for Research in Intelligent

More information

An Adaptive Eigenshape Model

An Adaptive Eigenshape Model An Adaptive Eigenshape Model Adam Baumberg and David Hogg School of Computer Studies University of Leeds, Leeds LS2 9JT, U.K. amb@scs.leeds.ac.uk Abstract There has been a great deal of recent interest

More information

TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA

TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA Tomoki Hayashi 1, Francois de Sorbier 1 and Hideo Saito 1 1 Graduate School of Science and Technology, Keio University, 3-14-1 Hiyoshi,

More information

CSE 554 Lecture 7: Deformation II

CSE 554 Lecture 7: Deformation II CSE 554 Lecture 7: Deformation II Fall 2011 CSE554 Deformation II Slide 1 Review Rigid-body alignment Non-rigid deformation Intrinsic methods: deforming the boundary points An optimization problem Minimize

More information

Automated Segmentation Using a Fast Implementation of the Chan-Vese Models

Automated Segmentation Using a Fast Implementation of the Chan-Vese Models Automated Segmentation Using a Fast Implementation of the Chan-Vese Models Huan Xu, and Xiao-Feng Wang,,3 Intelligent Computation Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Science,

More information

This week. CENG 732 Computer Animation. Warping an Object. Warping an Object. 2D Grid Deformation. Warping an Object.

This week. CENG 732 Computer Animation. Warping an Object. Warping an Object. 2D Grid Deformation. Warping an Object. CENG 732 Computer Animation Spring 2006-2007 Week 4 Shape Deformation Animating Articulated Structures: Forward Kinematics/Inverse Kinematics This week Shape Deformation FFD: Free Form Deformation Hierarchical

More information

A Method of Automated Landmark Generation for Automated 3D PDM Construction

A Method of Automated Landmark Generation for Automated 3D PDM Construction A Method of Automated Landmark Generation for Automated 3D PDM Construction A. D. Brett and C. J. Taylor Department of Medical Biophysics University of Manchester Manchester M13 9PT, Uk adb@sv1.smb.man.ac.uk

More information

Partial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems

Partial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems Partial Calibration and Mirror Shape Recovery for Non-Central Catadioptric Systems Abstract In this paper we present a method for mirror shape recovery and partial calibration for non-central catadioptric

More information

SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS

SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS M. Hofer and H. Pottmann Institute of Geometry Vienna University of Technology, Vienna, Austria hofer@geometrie.tuwien.ac.at, pottmann@geometrie.tuwien.ac.at

More information

Parameterization of Triangular Meshes with Virtual Boundaries

Parameterization of Triangular Meshes with Virtual Boundaries Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology

More information

Learning Coupled Prior Shape and Appearance Models for Segmentation

Learning Coupled Prior Shape and Appearance Models for Segmentation Learning Coupled Prior Shape and Appearance Models for Segmentation Xiaolei Huang, Zhiguo Li, and Dimitris Metaxas Center for Computational iomedicine Imaging and Modeling, Division of Computer and Information

More information

ISSN: X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 6, Issue 8, August 2017

ISSN: X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 6, Issue 8, August 2017 ENTROPY BASED CONSTRAINT METHOD FOR IMAGE SEGMENTATION USING ACTIVE CONTOUR MODEL M.Nirmala Department of ECE JNTUA college of engineering, Anantapuramu Andhra Pradesh,India Abstract: Over the past existing

More information

AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK

AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK Xiangyun HU, Zuxun ZHANG, Jianqing ZHANG Wuhan Technique University of Surveying and Mapping,

More information

Nonrigid Surface Modelling. and Fast Recovery. Department of Computer Science and Engineering. Committee: Prof. Leo J. Jia and Prof. K. H.

Nonrigid Surface Modelling. and Fast Recovery. Department of Computer Science and Engineering. Committee: Prof. Leo J. Jia and Prof. K. H. Nonrigid Surface Modelling and Fast Recovery Zhu Jianke Supervisor: Prof. Michael R. Lyu Committee: Prof. Leo J. Jia and Prof. K. H. Wong Department of Computer Science and Engineering May 11, 2007 1 2

More information

PHOTOGRAMMETRIC TECHNIQUE FOR TEETH OCCLUSION ANALYSIS IN DENTISTRY

PHOTOGRAMMETRIC TECHNIQUE FOR TEETH OCCLUSION ANALYSIS IN DENTISTRY PHOTOGRAMMETRIC TECHNIQUE FOR TEETH OCCLUSION ANALYSIS IN DENTISTRY V. A. Knyaz a, *, S. Yu. Zheltov a, a State Research Institute of Aviation System (GosNIIAS), 539 Moscow, Russia (knyaz,zhl)@gosniias.ru

More information

RIGID IMAGE REGISTRATION

RIGID IMAGE REGISTRATION RIGID IMAGE REGISTRATION Duygu Tosun-Turgut, Ph.D. Center for Imaging of Neurodegenerative Diseases Department of Radiology and Biomedical Imaging duygu.tosun@ucsf.edu What is registration? Image registration

More information

An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy

An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy Chenyang Xu 1, Siemens Corporate Research, Inc., Princeton, NJ, USA Xiaolei Huang,

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Hybrid Spline-based Multimodal Registration using a Local Measure for Mutual Information

Hybrid Spline-based Multimodal Registration using a Local Measure for Mutual Information Hybrid Spline-based Multimodal Registration using a Local Measure for Mutual Information Andreas Biesdorf 1, Stefan Wörz 1, Hans-Jürgen Kaiser 2, Karl Rohr 1 1 University of Heidelberg, BIOQUANT, IPMB,

More information

A second order algorithm for orthogonal projection onto curves and surfaces

A second order algorithm for orthogonal projection onto curves and surfaces A second order algorithm for orthogonal projection onto curves and surfaces Shi-min Hu and Johannes Wallner Dept. of Computer Science and Technology, Tsinghua University, Beijing, China shimin@tsinghua.edu.cn;

More information

Aligning Concave and Convex Shapes

Aligning Concave and Convex Shapes Aligning Concave and Convex Shapes Silke Jänichen and Petra Perner Institute of Computer Vision and applied Computer Sciences, IBaI, Körnerstr. 10, 04107 Leipzig pperner@ibai-institut.de, www.ibai-institut.de

More information

Chapter 18. Geometric Operations

Chapter 18. Geometric Operations Chapter 18 Geometric Operations To this point, the image processing operations have computed the gray value (digital count) of the output image pixel based on the gray values of one or more input pixels;

More information

Non-rigid Image Registration using Electric Current Flow

Non-rigid Image Registration using Electric Current Flow Non-rigid Image Registration using Electric Current Flow Shu Liao, Max W. K. Law and Albert C. S. Chung Lo Kwee-Seong Medical Image Analysis Laboratory, Department of Computer Science and Engineering,

More information

Subpixel Corner Detection Using Spatial Moment 1)

Subpixel Corner Detection Using Spatial Moment 1) Vol.31, No.5 ACTA AUTOMATICA SINICA September, 25 Subpixel Corner Detection Using Spatial Moment 1) WANG She-Yang SONG Shen-Min QIANG Wen-Yi CHEN Xing-Lin (Department of Control Engineering, Harbin Institute

More information

Non-Rigid Multimodal Medical Image Registration using Optical Flow and Gradient Orientation

Non-Rigid Multimodal Medical Image Registration using Optical Flow and Gradient Orientation M. HEINRICH et al.: MULTIMODAL REGISTRATION USING GRADIENT ORIENTATION 1 Non-Rigid Multimodal Medical Image Registration using Optical Flow and Gradient Orientation Mattias P. Heinrich 1 mattias.heinrich@eng.ox.ac.uk

More information

Multiple Contour Finding and Perceptual Grouping as a set of Energy Minimizing Paths

Multiple Contour Finding and Perceptual Grouping as a set of Energy Minimizing Paths Multiple Contour Finding and Perceptual Grouping as a set of Energy Minimizing Paths Laurent D. COHEN and Thomas DESCHAMPS CEREMADE, UMR 7534, Université Paris-Dauphine 75775 Paris cedex 16, France cohen@ceremade.dauphine.fr

More information

Video Alignment. Literature Survey. Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin

Video Alignment. Literature Survey. Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin Literature Survey Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin Omer Shakil Abstract This literature survey compares various methods

More information

A 3D Point Cloud Registration Algorithm based on Feature Points

A 3D Point Cloud Registration Algorithm based on Feature Points International Conference on Information Sciences, Machinery, Materials and Energy (ICISMME 2015) A 3D Point Cloud Registration Algorithm based on Feature Points Yi Ren 1, 2, a, Fucai Zhou 1, b 1 School

More information

TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA

TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA TEXTURE OVERLAY ONTO NON-RIGID SURFACE USING COMMODITY DEPTH CAMERA Tomoki Hayashi, Francois de Sorbier and Hideo Saito Graduate School of Science and Technology, Keio University, 3-14-1 Hiyoshi, Kohoku-ku,

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Visualization and Analysis of Inverse Kinematics Algorithms Using Performance Metric Maps

Visualization and Analysis of Inverse Kinematics Algorithms Using Performance Metric Maps Visualization and Analysis of Inverse Kinematics Algorithms Using Performance Metric Maps Oliver Cardwell, Ramakrishnan Mukundan Department of Computer Science and Software Engineering University of Canterbury

More information

Translation Symmetry Detection: A Repetitive Pattern Analysis Approach

Translation Symmetry Detection: A Repetitive Pattern Analysis Approach 2013 IEEE Conference on Computer Vision and Pattern Recognition Workshops Translation Symmetry Detection: A Repetitive Pattern Analysis Approach Yunliang Cai and George Baciu GAMA Lab, Department of Computing

More information

Rotation Invariant Image Registration using Robust Shape Matching

Rotation Invariant Image Registration using Robust Shape Matching International Journal of Electronic and Electrical Engineering. ISSN 0974-2174 Volume 7, Number 2 (2014), pp. 125-132 International Research Publication House http://www.irphouse.com Rotation Invariant

More information

Operation Trajectory Control of Industrial Robots Based on Motion Simulation

Operation Trajectory Control of Industrial Robots Based on Motion Simulation Operation Trajectory Control of Industrial Robots Based on Motion Simulation Chengyi Xu 1,2, Ying Liu 1,*, Enzhang Jiao 1, Jian Cao 2, Yi Xiao 2 1 College of Mechanical and Electronic Engineering, Nanjing

More information

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given

More information

Graph-Based Superpixel Labeling for Enhancement of Online Video Segmentation

Graph-Based Superpixel Labeling for Enhancement of Online Video Segmentation Graph-Based Superpixel Labeling for Enhancement of Online Video Segmentation Alaa E. Abdel-Hakim Electrical Engineering Department Assiut University Assiut, Egypt alaa.aly@eng.au.edu.eg Mostafa Izz Cairo

More information

A Registration-Based Atlas Propagation Framework for Automatic Whole Heart Segmentation

A Registration-Based Atlas Propagation Framework for Automatic Whole Heart Segmentation A Registration-Based Atlas Propagation Framework for Automatic Whole Heart Segmentation Xiahai Zhuang (PhD) Centre for Medical Image Computing University College London Fields-MITACS Conference on Mathematics

More information

Non-rigid Registration using Discrete MRFs: Application to Thoracic CT Images

Non-rigid Registration using Discrete MRFs: Application to Thoracic CT Images Non-rigid Registration using Discrete MRFs: Application to Thoracic CT Images Ben Glocker 1, Nikos Komodakis 2, Nikos Paragios 3,4, and Nassir Navab 1 1 Computer Aided Medical Procedures (CAMP), TU Mï

More information

SHAPE registration is critical to various imaging and vision

SHAPE registration is critical to various imaging and vision IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 28, NO. 8, AUGUST 2006 1303 Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations Xiaolei Huang,

More information

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Tomokazu Wakasugi, Masahide Nishiura and Kazuhiro Fukui Corporate Research and Development Center, Toshiba Corporation

More information

Face Recognition At-a-Distance Based on Sparse-Stereo Reconstruction

Face Recognition At-a-Distance Based on Sparse-Stereo Reconstruction Face Recognition At-a-Distance Based on Sparse-Stereo Reconstruction Ham Rara, Shireen Elhabian, Asem Ali University of Louisville Louisville, KY {hmrara01,syelha01,amali003}@louisville.edu Mike Miller,

More information

A New Algorithm for Shape Detection

A New Algorithm for Shape Detection IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 3, Ver. I (May.-June. 2017), PP 71-76 www.iosrjournals.org A New Algorithm for Shape Detection Hewa

More information

Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow

Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Shape-based Diffeomorphic Registration on Hippocampal Surfaces Using Beltrami Holomorphic Flow Abstract. Finding meaningful 1-1 correspondences between hippocampal (HP) surfaces is an important but difficult

More information

Video Alignment. Final Report. Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin

Video Alignment. Final Report. Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin Final Report Spring 2005 Prof. Brian Evans Multidimensional Digital Signal Processing Project The University of Texas at Austin Omer Shakil Abstract This report describes a method to align two videos.

More information

VIDEO OBJECT SEGMENTATION BY EXTENDED RECURSIVE-SHORTEST-SPANNING-TREE METHOD. Ertem Tuncel and Levent Onural

VIDEO OBJECT SEGMENTATION BY EXTENDED RECURSIVE-SHORTEST-SPANNING-TREE METHOD. Ertem Tuncel and Levent Onural VIDEO OBJECT SEGMENTATION BY EXTENDED RECURSIVE-SHORTEST-SPANNING-TREE METHOD Ertem Tuncel and Levent Onural Electrical and Electronics Engineering Department, Bilkent University, TR-06533, Ankara, Turkey

More information

Temporal Resolution Enhancement of Human Vocal Tract Image Sequences based on Non-Rigid Image Registration

Temporal Resolution Enhancement of Human Vocal Tract Image Sequences based on Non-Rigid Image Registration Temporal Resolution Enhancement of Human Vocal Tract Image Sequences based on Non-Rigid Image Registration Ana L. D. Martins; Nelson D. A. Mascarenhas; Cláudio A. T. Suazo Universidade Federal de São Carlos,

More information

Lucas-Kanade Image Registration Using Camera Parameters

Lucas-Kanade Image Registration Using Camera Parameters Lucas-Kanade Image Registration Using Camera Parameters Sunghyun Cho a, Hojin Cho a, Yu-Wing Tai b, Young Su Moon c, Junguk Cho c, Shihwa Lee c, and Seungyong Lee a a POSTECH, Pohang, Korea b KAIST, Daejeon,

More information

Bumptrees for Efficient Function, Constraint, and Classification Learning

Bumptrees for Efficient Function, Constraint, and Classification Learning umptrees for Efficient Function, Constraint, and Classification Learning Stephen M. Omohundro International Computer Science Institute 1947 Center Street, Suite 600 erkeley, California 94704 Abstract A

More information

3D Statistical Shape Model Building using Consistent Parameterization

3D Statistical Shape Model Building using Consistent Parameterization 3D Statistical Shape Model Building using Consistent Parameterization Matthias Kirschner, Stefan Wesarg Graphisch Interaktive Systeme, TU Darmstadt matthias.kirschner@gris.tu-darmstadt.de Abstract. We

More information

NURBS Warps. 1 Introduction. Florent Brunet 123 CNRS/Université Blaise Pascal Clermont-Ferrand, France

NURBS Warps. 1 Introduction. Florent Brunet 123 CNRS/Université Blaise Pascal Clermont-Ferrand, France BRUNET et al.: NURBS WARPS 1 NURBS Warps Florent Brunet 123 florent.brunet@univ-bpclermont.fr Adrien Bartoli 1 adrien.bartoli@gmail.com Nassir Navab 2 navab@cs.tum.edu Rémy Malgouyres 3 remy.malgouyres@laic.u-clermont1.fr

More information

Image Registration I

Image Registration I Image Registration I Comp 254 Spring 2002 Guido Gerig Image Registration: Motivation Motivation for Image Registration Combine images from different modalities (multi-modality registration), e.g. CT&MRI,

More information

Level Set Segmentation using Statistical Shape Priors

Level Set Segmentation using Statistical Shape Priors Level Set Segmentation using Statistical Shape Priors Ayman S. El-Baz, Aly A. Farag, Hossam Abd El Munim and Seniha E. Yuksel Computer Vision & Image Processing Laboratory (CVIP) University of Louisville,

More information

Extract Object Boundaries in Noisy Images using Level Set. Literature Survey

Extract Object Boundaries in Noisy Images using Level Set. Literature Survey Extract Object Boundaries in Noisy Images using Level Set by: Quming Zhou Literature Survey Submitted to Professor Brian Evans EE381K Multidimensional Digital Signal Processing March 15, 003 Abstract Finding

More information

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

More information

Surface Registration. Gianpaolo Palma

Surface Registration. Gianpaolo Palma Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images Each contain 3D points for different parts of the model in the local coordinates of the scanner Find a rigid

More information

Motion Estimation. There are three main types (or applications) of motion estimation:

Motion Estimation. There are three main types (or applications) of motion estimation: Members: D91922016 朱威達 R93922010 林聖凱 R93922044 謝俊瑋 Motion Estimation There are three main types (or applications) of motion estimation: Parametric motion (image alignment) The main idea of parametric motion

More information

Globally Stabilized 3L Curve Fitting

Globally Stabilized 3L Curve Fitting Globally Stabilized 3L Curve Fitting Turker Sahin and Mustafa Unel Department of Computer Engineering, Gebze Institute of Technology Cayirova Campus 44 Gebze/Kocaeli Turkey {htsahin,munel}@bilmuh.gyte.edu.tr

More information

Accurate 3D Face and Body Modeling from a Single Fixed Kinect

Accurate 3D Face and Body Modeling from a Single Fixed Kinect Accurate 3D Face and Body Modeling from a Single Fixed Kinect Ruizhe Wang*, Matthias Hernandez*, Jongmoo Choi, Gérard Medioni Computer Vision Lab, IRIS University of Southern California Abstract In this

More information

VOLUMETRIC HARMONIC MAP

VOLUMETRIC HARMONIC MAP COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2004 International Press Vol. 3, No. 3, pp. 191-202, March 2004 004 VOLUMETRIC HARMONIC MAP YALIN WANG, XIANFENG GU, AND SHING-TUNG YAU Abstract. We develop

More information

3D Surface Reconstruction of the Brain based on Level Set Method

3D Surface Reconstruction of the Brain based on Level Set Method 3D Surface Reconstruction of the Brain based on Level Set Method Shijun Tang, Bill P. Buckles, and Kamesh Namuduri Department of Computer Science & Engineering Department of Electrical Engineering University

More information

Reconstruction of complete 3D object model from multi-view range images.

Reconstruction of complete 3D object model from multi-view range images. Header for SPIE use Reconstruction of complete 3D object model from multi-view range images. Yi-Ping Hung *, Chu-Song Chen, Ing-Bor Hsieh, Chiou-Shann Fuh Institute of Information Science, Academia Sinica,

More information

Announcements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10

Announcements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10 Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal

More information

Iterative Estimation of 3D Transformations for Object Alignment

Iterative Estimation of 3D Transformations for Object Alignment Iterative Estimation of 3D Transformations for Object Alignment Tao Wang and Anup Basu Department of Computing Science, Univ. of Alberta, Edmonton, AB T6G 2E8, Canada Abstract. An Iterative Estimation

More information

arxiv: v1 [cs.cv] 28 Sep 2018

arxiv: v1 [cs.cv] 28 Sep 2018 Camera Pose Estimation from Sequence of Calibrated Images arxiv:1809.11066v1 [cs.cv] 28 Sep 2018 Jacek Komorowski 1 and Przemyslaw Rokita 2 1 Maria Curie-Sklodowska University, Institute of Computer Science,

More information

TUBULAR SURFACES EXTRACTION WITH MINIMAL ACTION SURFACES

TUBULAR SURFACES EXTRACTION WITH MINIMAL ACTION SURFACES TUBULAR SURFACES EXTRACTION WITH MINIMAL ACTION SURFACES XIANGJUN GAO Department of Computer and Information Technology, Shangqiu Normal University, Shangqiu 476000, Henan, China ABSTRACT This paper presents

More information

Edge Grouping Combining Boundary and Region Information

Edge Grouping Combining Boundary and Region Information University of South Carolina Scholar Commons Faculty Publications Computer Science and Engineering, Department of 10-1-2007 Edge Grouping Combining Boundary and Region Information Joachim S. Stahl Song

More information

Implicit free-form-deformations for multi-frame segmentation and tracking

Implicit free-form-deformations for multi-frame segmentation and tracking Implicit free-form-deformations for multi-frame segmentation and tracking Konstantinos Karantzalos 1,2 and Nikos Paragios 1 1 ATLANTIS, CERTIS, Ecole Nationale des Ponts et Chaussees, 6-8 avenue Blaise

More information

Interpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections.

Interpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections. Image Interpolation 48 Interpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections. Fundamentally, interpolation is the process of using known

More information

Spatio-Temporal Registration of Biomedical Images by Computational Methods

Spatio-Temporal Registration of Biomedical Images by Computational Methods Spatio-Temporal Registration of Biomedical Images by Computational Methods Francisco P. M. Oliveira, João Manuel R. S. Tavares tavares@fe.up.pt, www.fe.up.pt/~tavares Outline 1. Introduction 2. Spatial

More information

CS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018

CS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018 CS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018 Homework #3 v4: Shape correspondences, shape matching, multi-way alignments. [100

More information

Image Segmentation and Registration

Image Segmentation and Registration Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation

More information

Raghuraman Gopalan Center for Automation Research University of Maryland, College Park

Raghuraman Gopalan Center for Automation Research University of Maryland, College Park 2D Shape Matching (and Object Recognition) Raghuraman Gopalan Center for Automation Research University of Maryland, College Park 1 Outline What is a shape? Part 1: Matching/ Recognition Shape contexts

More information

Shape fitting and non convex data analysis

Shape fitting and non convex data analysis Shape fitting and non convex data analysis Petra Surynková, Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 186 7 Praha 8, Czech Republic email: petra.surynkova@mff.cuni.cz,

More information

Stereo and Epipolar geometry

Stereo and Epipolar geometry Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka

More information

Tracking in image sequences

Tracking in image sequences CENTER FOR MACHINE PERCEPTION CZECH TECHNICAL UNIVERSITY Tracking in image sequences Lecture notes for the course Computer Vision Methods Tomáš Svoboda svobodat@fel.cvut.cz March 23, 2011 Lecture notes

More information

Multimodal Elastic Image Matching

Multimodal Elastic Image Matching Research results based on my diploma thesis supervised by Prof. Witsch 2 and in cooperation with Prof. Mai 3. 1 February 22 nd 2011 1 Karlsruhe Institute of Technology (KIT) 2 Applied Mathematics Department,

More information

Supervised texture detection in images

Supervised texture detection in images Supervised texture detection in images Branislav Mičušík and Allan Hanbury Pattern Recognition and Image Processing Group, Institute of Computer Aided Automation, Vienna University of Technology Favoritenstraße

More information

INFO0948 Fitting and Shape Matching

INFO0948 Fitting and Shape Matching INFO0948 Fitting and Shape Matching Renaud Detry University of Liège, Belgium Updated March 31, 2015 1 / 33 These slides are based on the following book: D. Forsyth and J. Ponce. Computer vision: a modern

More information

Registration D.A. Forsyth, UIUC

Registration D.A. Forsyth, UIUC Registration D.A. Forsyth, UIUC Registration Place a geometric model in correspondence with an image could be 2D or 3D model up to some transformations possibly up to deformation Applications very important

More information

Smart point landmark distribution for thin-plate splines

Smart point landmark distribution for thin-plate splines Smart point landmark distribution for thin-plate splines John Lewis a, Hea-Juen Hwang a, Ulrich Neumann a, and Reyes Enciso b a Integrated Media Systems Center, University of Southern California, 3740

More information

Segmentation. Separate image into coherent regions

Segmentation. Separate image into coherent regions Segmentation II Segmentation Separate image into coherent regions Berkeley segmentation database: http://www.eecs.berkeley.edu/research/projects/cs/vision/grouping/segbench/ Slide by L. Lazebnik Interactive

More information

Simultaneous surface texture classification and illumination tilt angle prediction

Simultaneous surface texture classification and illumination tilt angle prediction Simultaneous surface texture classification and illumination tilt angle prediction X. Lladó, A. Oliver, M. Petrou, J. Freixenet, and J. Martí Computer Vision and Robotics Group - IIiA. University of Girona

More information

3D Object Scanning to Support Computer-Aided Conceptual Design

3D Object Scanning to Support Computer-Aided Conceptual Design ABSTRACT 3D Object Scanning to Support Computer-Aided Conceptual Design J.S.M. Vergeest and I. Horváth Delft University of Technology Faculty of Design, Engineering and Production Jaffalaan 9, NL-2628

More information

ROBUST LINE-BASED CALIBRATION OF LENS DISTORTION FROM A SINGLE VIEW

ROBUST LINE-BASED CALIBRATION OF LENS DISTORTION FROM A SINGLE VIEW ROBUST LINE-BASED CALIBRATION OF LENS DISTORTION FROM A SINGLE VIEW Thorsten Thormählen, Hellward Broszio, Ingolf Wassermann thormae@tnt.uni-hannover.de University of Hannover, Information Technology Laboratory,

More information

A Method of Generating Calligraphy of Japanese Character using Deformable Contours

A Method of Generating Calligraphy of Japanese Character using Deformable Contours A Method of Generating Calligraphy of Japanese Character using Deformable Contours Lisong Wang Tsuyoshi Nakamura Minkai Wang Hirohisa Seki Hidenori Itoh Department of Intelligence and Computer Science,

More information

Method of Background Subtraction for Medical Image Segmentation

Method of Background Subtraction for Medical Image Segmentation Method of Background Subtraction for Medical Image Segmentation Seongjai Kim Department of Mathematics and Statistics, Mississippi State University Mississippi State, MS 39762, USA and Hyeona Lim Department

More information

Particle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore

Particle Filtering. CS6240 Multimedia Analysis. Leow Wee Kheng. Department of Computer Science School of Computing National University of Singapore Particle Filtering CS6240 Multimedia Analysis Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore (CS6240) Particle Filtering 1 / 28 Introduction Introduction

More information

of Iterative Closest Point ICP algorithm to

of Iterative Closest Point ICP algorithm to Iterative Closest Point Algorithm. L Error Approach via Linear Programming Yaroslav O. Halchenko PhD Student, CS@NJIT yh42@njit.edu Abstract The original goal of this project was a straightforward implementation

More information

Visual Tracking of Human Body with Deforming Motion and Shape Average

Visual Tracking of Human Body with Deforming Motion and Shape Average Visual Tracking of Human Body with Deforming Motion and Shape Average Alessandro Bissacco UCLA Computer Science Los Angeles, CA 90095 bissacco@cs.ucla.edu UCLA CSD-TR # 020046 Abstract In this work we

More information