DOCSLIB.ORG

Non-Rigid Articulated Point Set Registration with Local Structure Preservation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Non-Rigid Articulated Point Set Registration with Local Structure Preservation Non-rigid Articulated Point Set Registration with Local Structure Preservation Song Ge and Guoliang Fan∗ School of Electrical and Computer Engineering Oklahoma State University, Stillwater, OK 74078 {song.ge,guoliang.fan}@okstate.edu Abstract ment between two distributions [8, 9]. Coherent Point Drift (CPD) [16, 15] is an effective GMM-based non-rigid reg- We propose a new Gaussian mixture model (GMM)- istration algorithm that imposes a coherence constraint to based probabilistic point set registration method, called Lo- preserve the topology of the point sets. cal Structure Preservation (LSP), which is aimed at com- On the other hand, articulated point set registration is be- plex non-rigid and articulated deformations. LSP integrates coming an attractive topic, e.g, human pose estimation [23] two complementary shape descriptors to preserve the lo- or body shape modeling [21]. Some initial conditions or cal structure. The first one is the Local Linear Embedding new constraints are needed to cope with the complicated (LLE)-based topology constraint to retain the local neigh- non-rigid articulated deformation. In [23], a pose initial- borhood relationship, and the other is the Laplacian Coor- ization from a large training dataset is used to reduce the dinate (LC)-based energy to encode the local neighborhood articulated deformation between two point sets to be regis- scale. The registration is formulated as a density estima- tered. In [13], Laplacian eigenfunctions are used to align tion problem where the LLE and LC terms are embedded in two voxels represented by spectral graphs for registration the GMM-based Coherent Point Drift (CPD) framework. A initialization. By incorporating the global (CPD) and lo- closed form solution is solved by an Expectation Maximiza- cal topological constraints (LLE) into a GMM-based frame- tion (EM) algorithm where the two local terms are jointly work, the Global-Local Topology Preservation (GLTP) al- optimized along with the CPD coherence constraint. The gorithm was proposed in [6] which obtains promising per- experimental results on a challenging 3D human dataset formance. Some approaches treat the articulated deforma- show the accuracy and efficiency of our proposed approach tion as a chain of constrained rigid motions, where pre- to handle non-rigid highly articulated deformations. segmentation and locally rigid assumption are usually re- quired. An articulated ICP (AICP) algorithm was proposed in [18] which adopts a divide-and-conquer strategy to iter- 1. Introduction atively estimate the articulated structure by assuming it is Point set registration is a fundamental issue in computer partially rigid. The similar strategy was applied in [7] by vision. The registration techniques usually fall into two using a GMM-based rigid registration algorithm instead of categories: rigid and non-rigid depending on the under- ICP. By using the exponential maps based parametrization, lying transformation model. Iterative Closest Point (ICP) the articulated deformation is effectively embedded in the [2, 26] is a classic rigid registration method which itera- GMM-based framework in [24]. tively assigns correspondence and then finds the least square We propose a new GMM-based point set registration al- transformation by using the estimated correspondence. For gorithm, called Local Structure Preservation (LSP), to deal non-rigid registration, shape features are commonly used with non-rigid highly articulated deformations, such as 3D for correspondence initialization [27, 11, 12] or directly in- human data. Without involving the locally rigid assump- volved in the matching process [22, 20]. Gaussian Mixture tion or requiring any initial conditions, LSP is non-rigid Model (GMM)-based registration algorithms are becoming both globally and locally which is more flexible and gen- an important category, where the point sets are represented eral to handle the non-rigid articulated deformations than by density functions and then registration is cast as either those with the locally rigid assumption (e.g. [18, 7, 24]). a density estimation problem [4, 5, 16, 15] or an align- The key is to involve two local shape descriptors, the Local ∗ Linear Embedding (LE) and Laplacian Coordinate (LC), to This work is supported by the Oklahoma Center for the Advancement of Science and Technology (OCAST) under grant HR12-30 and the Na- preserve the local structure in terms of the neighborhood tional Science Foundation (NSF) under grant NRI-1427345. relationship and the neighborhood scale, respectively. The two local regularization terms are unified with the CPD co- old GMM parameters based on the Bayes rule as herence constraint into the GMM-based density estimation exp(− 1 xn−T (ym,Θ) 2) framework. A joint optimization of three terms is achieved old 2 σold p (m|xn)= D . 2 by an Expectation and Maximization (EM) algorithm for M exp(− 1 xn−T (yi,Θ) 2)+ (2πσ ) 2 ωM i=1 2 σold (1−ω)N Maximum Likelihood (ML) optimization. (3) Then in the M-step the new GMM parameters are updated 2. Proposed Method by minimizing (2). The EM algorithm performs iteratively by alternating between E-step and M-step until it converges. We first review the GMM-based registration frame- The different type of transformations can lead to different work along some existing regularization terms for non-rigid optimization strategies. transformation estimation. Then we will introduce a new local regularization term ELSP . Afterwards, we present 2.2. Non-rigid Transformation Regularization the formulation and optimization of the proposed LSP al- Particularly, Coherent Point Drift (CPD) [15] is a pow- gorithm followed by a discussion of parameter selection. erful and noteworthy GMM-based non-rigid registration method where the underlying non-rigid transformation 2.1. Registration as Mixture Density Estimation T (Y, Θ) is defined as the initial position Y plus a dis- We consider point set registration as a probability den- placement function f(Y). The displacement function f is sity estimation problem, where one point set (Y = modeled in a Reproducing Kernel Hilbert Space (RKHS) T D [y1, ··· , yM ] , ym ∈ R ) is treated as the template with and the spatial smoothness regularization is defined as the a sparse distribution which presents the centroids from the Fourier domain norm of f. It has been proved that the opti- Gaussian mixture model (GMM), while the other point set mal function f which minimizes the objective (2) under the X =[x ··· x ]T x ∈ D ( 1, , N , n R )isservedasthetar- spatial smoothness constraint is given by a linear combina- get with a dense distribution, and M,N,D are the num- tion of Gaussian kernel functions as ber of points and the dimension of each point respectively. Then the goal is to find the optimal GMM parameters (e.g. T (Y, W)=Y + GW, (4) the centroids which are controlled by unknown transforma- tion) to maximize the GMM posterior probability. We de- where GM×M is the Gaussian kernel matrix with element note the spatial transformation as T (Y, Θ), which can be 1 yi−yj 2 gij =exp(− ) and WM×D is the weight ma- considered as a function of Y with parameters Θ. To ac- 2 β X trix of the Gaussian kernel. The corresponding constraint count for outliers in , a uniform component with weight W ω (0 ≤ ω ≤ 1) is added [15, 4]. For simplicity, we consider which regularizes the weight matrix has the form as all Gaussian components are independently distributed with T 2 EMC(W)=Tr(W GW). (5) an equal isotropic variance σ and an equal weight, then the joint GMM probability density function is written as It was shown in [15] that the selection of the Gaussian ker- N N M+1 nel makes the regularization equivalent to the one in the Mo- p(X)= p(xn)= πmp(xn|m), (1) tion Coherence Theory [25] which forces points to move to- n=1 n=1 m=1 gether as a group to keep the motion coherence. The motion coherence is helpful to keep the overall spatial connectivity 2 1 x−T (ym,Θ) of a complicated point set during the registration. However, where p(x|m)= D exp(− 2σ2 ) (m = (2πσ2) 2 it may not handle the non-rigid highly articulated deforma- 1 ··· (x| )= 1 = +1 = 1−ω , ,M), p m N for m M , πm M tion where the motion coherence assumption may be vio- =1 ··· = (m , ,M), and πM+1 ω. Then registration is con- lated. Θ 2 verted to the problem of finding and σ that minimizes Recently some specific regularization terms were pro- the negative log-likelihood of (1). posed and embedded in the GMM-based CPD framework Following the EM algorithm for GMM-based clustering for improving registration performance. In [17], a Graph- [3, 15], we can find the objective (E-step) as Laplacian (GL) based regularization term, which enforces transformation smoothness to avoid mis-matches during N M x −T(y , Θ) 2 Q(Θ,σ2)= pold(m|x ) n m registration, is added to restrict a large displacement be- n 2σ2 n=1 m=1 tween two neighboring points. This regularization term N D enhances the registration robustness under noise, outliers + p ln(σ2), 2 (2) and occlusions. It mainly penalizes large displacements be- tween the adjacent neighbors, but does not consider the spa- N M old old where Np = n=1 m=1 p (m|xn) and p (m|xn) are tial relationship between the edges (constructed by neigh- the posterior probabilities that can be computed using the boring points) which may not be effective to preserve the local shape structure. On the other hand, the LLE-based pressed as topology constraint proposed in [6] is intended to preserve the neighborhood structure by retaining the local neighbor- L(vi)= Aij (vi − vj ), (8) hood relationship. This was found helpful to cope with non- (i,j)∈E rigid articulated deformations.
Load more

Recommended publications
  • Point Set Registration: Coherent Point Drift,” in NIPS, 2007, Pp
    1 Point Set Registration: Coherent Point Drift Andriy Myronenko and Xubo Song Abstract—Point set registration is a key component in many computer vision tasks. The goal of point set registration is to assign correspondences between two sets of points and to recover the transformation that maps one point set to the other. Multiple factors, including an unknown non-rigid spatial transformation, large dimensionality of point set, noise and outliers, make the point set registration a challenging problem. We introduce a probabilistic method, called the Coherent Point Drift (CPD) algorithm, for both rigid and non-rigid point set registration. We consider the alignment of two point sets as a probability density estimation problem. We fit the GMM centroids (representing the first point set) to the data (the second point set) by maximizing the likelihood. We force the GMM centroids to move coherently as a group to preserve the topological structure of the point sets. In the rigid case, we impose the coherence constraint by re-parametrization of GMM centroid locations with rigid parameters and derive a closed form solution of the maximization step of the EM algorithm in arbitrary dimensions. In the non-rigid case, we impose the coherence constraint by regularizing the displacement field and using the variational calculus to derive the optimal transformation. We also introduce a fast algorithm that reduces the method computation complexity to linear. We test the CPD algorithm for both rigid and non-rigid transformations in the presence of noise, outliers and missing points, where CPD shows accurate results and outperforms current state-of-the-art methods.
    [Show full text]
  • A Probabilistic Framework for Color-Based Point Set Registration
    A Probabilistic Framework for Color-Based Point Set Registration Martin Danelljan, Giulia Meneghetti, Fahad Shahbaz Khan, Michael Felsberg Computer Vision Laboratory, Department of Electrical Engineering, Linkoping¨ University, Sweden fmartin.danelljan, giulia.meneghetti, fahad.khan, [email protected] Abstract In recent years, sensors capable of measuring both color and depth information have become increasingly popular. Despite the abundance of colored point set data, state- of-the-art probabilistic registration techniques ignore the (a) First set. available color information. In this paper, we propose a probabilistic point set registration framework that exploits (b) Second set. available color information associated with the points. Our method is based on a model of the joint distribution of 3D-point observations and their color information. The proposed model captures discriminative color information, while being computationally efficient. We derive an EM al- gorithm for jointly estimating the model parameters and the relative transformations. Comprehensive experiments are performed on the Stan- (c) Baseline registration [5]. (d) Our color-based registration. ford Lounge dataset, captured by an RGB-D camera, and Figure 1. Registration of the two colored point sets (a) and (b), two point sets captured by a Lidar sensor. Our results of an indoor scene captured by a Lidar. The baseline GMM-based demonstrate a significant gain in robustness and accuracy method (c) fails to register the two point sets due to the large initial when incorporating color information. On the Stanford rotation error of 90 degrees. Our method accurately registers the Lounge dataset, our approach achieves a relative reduction two sets (d), by exploiting the available color information.
    [Show full text]
  • Robust Low-Overlap 3-D Point Cloud Registration for Outlier Rejection
    Robust low-overlap 3-D point cloud registration for outlier rejection John Stechschulte,1 Nisar Ahmed,2 and Christoffer Heckman1 Abstract— When registering 3-D point clouds it is expected y1 y2 y3 y4 that some points in one cloud do not have corresponding y5 y6 y7 y8 points in the other cloud. These non-correspondences are likely z1 z2 z3 z4 to occur near one another, as surface regions visible from y9 y10 y11 y12 one sensor pose are obscured or out of frame for another. z5 z6 z7 z8 In this work, a hidden Markov random field model is used to capture this prior within the framework of the iterative y13 y14 y15 y16 z9 z10 z11 z12 closest point algorithm. The EM algorithm is used to estimate the distribution parameters and learn the hidden component z13 z14 z15 z16 memberships. Experiments are presented demonstrating that this method outperforms several other outlier rejection methods when the point clouds have low or moderate overlap. Fig. 1. Graphical model for nearest fixed point distance, shown for a 4×4 grid of pixels in the free depth map. At pixel i, the Zi 2 f±1g value is I. INTRODUCTION the unobserved inlier/outlier state, and Yi 2 R≥0 is the observed distance to the closest fixed point. Depth sensing is an increasingly ubiquitous technique for robotics, 3-D modeling and mapping applications. Struc- Which error measure is minimized in step 3 has been con- tured light sensors, lidar, and stereo matching produce point sidered extensively [4], and is explored further in Section II.
    [Show full text]
  • Robust Estimation of Nonrigid Transformation for Point Set Registration
    2013 IEEE Conference on Computer Vision and Pattern Recognition Robust Estimation of Nonrigid Transformation for Point Set Registration Jiayi Ma1,2, Ji Zhao3, Jinwen Tian1, Zhuowen Tu4, and Alan L. Yuille2 1Huazhong University of Science and Technology, 2Department of Statistics, UCLA 3The Robotics Institute, CMU, 4Lab of Neuro Imaging, UCLA {jyma2010, zhaoji84, zhuowen.tu}@gmail.com, [email protected], [email protected] Abstract widely studied [5, 4, 7, 19, 14]. By contrast, nonrigid reg- istration is more difficult because the underlying nonrigid We present a new point matching algorithm for robust transformations are often unknown, complex, and hard to nonrigid registration. The method iteratively recovers the model [6]. But nonrigid registration is very important be- point correspondence and estimates the transformation be- cause it is required for many real world tasks including tween two point sets. In the first step of the iteration, fea- hand-written character recognition, shape recognition, de- ture descriptors such as shape context are used to establish formable motion tracking and medical image registration. rough correspondence. In the second step, we estimate the In this paper, we focus on the nonrigid case and present transformation using a robust estimator called L2E. This is a robust algorithm for nonrigid point set registration. There the main novelty of our approach and it enables us to deal are two unknown variables we have to solve for in this prob- with the noise and outliers which arise in the correspon- lem: the correspondence and the transformation. Although dence step. The transformation is specified in a functional solving for either variable without information regarding space, more specifically a reproducing kernel Hilbert space.
    [Show full text]
  • A Simple Method Free of SVD and Eigen-Decomposition Jin Wu, Member, IEEE, Ming Liu, Member, IEEE, Zebo Zhou and Rui Li, Member, IEEE
    1 Fast Rigid 3D Registration Solution: A Simple Method Free of SVD and Eigen-Decomposition Jin Wu, Member, IEEE, Ming Liu, Member, IEEE, Zebo Zhou and Rui Li, Member, IEEE Abstract—A novel solution is obtained to solve the rigid 3D singular value decomposition (SVD), although there have been registration problem, motivated by previous eigen-decomposition some similar early ideas occured in very early solutions to approaches. Different from existing solvers, the proposed algo- Wahba’s problem since 1960s [9], [10]. Arun’s method is rithm does not require sophisticated matrix operations e.g. sin- gular value decomposition or eigenvalue decomposition. Instead, not robust enough and it has been improved by Umeyama the optimal eigenvector of the point cross-covariance matrix can in the later 4 years [11]. The accurate estimation by means be computed within several iterations. It is also proven that of SVD allows for very fast computation of orientation and the optimal rotation matrix can be directly computed for cases translation which are highly needed by the robotic devices. without need of quaternion. The simple framework provides The idea of the closest iterative points (ICP, [12], [13]) was very easy approach of integer-implementation on embedded platforms. Simulations on noise-corrupted point clouds have then proposed to considering the registration of two point verified the robustness and computation speed of the proposed sets with different dimensions i.e. numbers of points. In the method. The final results indicate that the proposed algorithm conventional ICP literature [12], the eigenvalue decomposition is accurate, robust and owns over 60% ∼ 80% less computation (or eigen-decomposition i.e.
    [Show full text]
  • Robust L2E Estimation of Transformation for Non-Rigid Registration Jiayi Ma, Weichao Qiu, Ji Zhao, Yong Ma, Alan L
    IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Robust L2E Estimation of Transformation for Non-Rigid Registration Jiayi Ma, Weichao Qiu, Ji Zhao, Yong Ma, Alan L. Yuille, and Zhuowen Tu Abstract—We introduce a new transformation estimation al- problem of dense correspondence is typically associated with gorithm using the L2E estimator, and apply it to non-rigid reg- image alignment/registration, which aims to overlaying two istration for building robust sparse and dense correspondences. or more images with shared content, either at the pixel level In the sparse point case, our method iteratively recovers the point correspondence and estimates the transformation between (e.g., stereo matching [5] and optical flow [6], [7]) or the two point sets. Feature descriptors such as shape context are object/scene level (e.g., pictorial structure model [8] and SIFT used to establish rough correspondence. We then estimate the flow [4]). It is a crucial step in all image analysis tasks in transformation using our robust algorithm. This enables us to which the final information is gained from the combination deal with the noise and outliers which arise in the correspondence of various data sources, e.g., in image fusion, change detec- step. The transformation is specified in a functional space, more specifically a reproducing kernel Hilbert space. In the dense point tion, multichannel image restoration, as well as object/scene case for non-rigid image registration, our approach consists of recognition. matching both sparsely and densely sampled SIFT features, and The registration problem can also be categorized into rigid it has particular advantages in handling significant scale changes or non-rigid registration depending on the form of the data.
    [Show full text]
  • Analysis of Robust Functions for Registration Algorithms
    Analysis of Robust Functions for Registration Algorithms Philippe Babin, Philippe Giguere` and Franc¸ois Pomerleau∗ Abstract— Registration accuracy is influenced by the pres- Init Final L2 L1 Huber Max. Dist. ence of outliers and numerous robust solutions have been 1 developed over the years to mitigate their effect. However, without a large scale comparison of solutions to filter outliers, it is becoming tedious to select an appropriate algorithm for a given application. This paper presents a comprehensive analysis of the effects of outlier filters on the Iterative Closest Point Weight (ICP) algorithm aimed at a mobile robotic application. Fourteen of the most common outlier filters (such as M-estimators) Cauchy SC GM Welsch Tukey Student w ( e have been tested in different types of environments, for a ) total of more than two million registrations. Furthermore, the influence of tuning parameters has been thoroughly explored. The experimental results show that most outlier filters have a similar performance if they are correctly tuned. Nonetheless, filters such as Var. Trim., Cauchy, and Cauchy MAD are more stable against different environment types. Interestingly, the 0 simple norm L1 produces comparable accuracy, while being parameterless. Fig. 1: The effect of different outlier filters on the registration of two I. INTRODUCTION overlapping curves. The blue circles and red squares are respectively the reference points and the reading points. The initial graph depicts the data A fundamental task in robotics is finding the rigid trans- association from the nearest neighbor at the first iteration. The final graph formation between two overlapping point clouds. The most shows the registration at the last iteration.
    [Show full text]
  • Robust Estimation of Nonrigid Transformation for Point Set Registration
    Robust Estimation of Nonrigid Transformation for Point Set Registration Jiayi Ma1;2, Ji Zhao3, Jinwen Tian1, Zhuowen Tu4, and Alan L. Yuille2 1Huazhong University of Science and Technology, 2Department of Statistics, UCLA 3The Robotics Institute, CMU, 4Lab of Neuro Imaging, UCLA jyma2010, zhaoji84, zhuowen.tu @gmail.com, [email protected], [email protected] f g Abstract widely studied [5,4,7, 19, 14]. By contrast, nonrigid reg- istration is more difficult because the underlying nonrigid We present a new point matching algorithm for robust transformations are often unknown, complex, and hard to nonrigid registration. The method iteratively recovers the model [6]. But nonrigid registration is very important be- point correspondence and estimates the transformation be- cause it is required for many real world tasks including tween two point sets. In the first step of the iteration, fea- hand-written character recognition, shape recognition, de- ture descriptors such as shape context are used to establish formable motion tracking and medical image registration. rough correspondence. In the second step, we estimate the In this paper, we focus on the nonrigid case and present transformation using a robust estimator called L2E. This is a robust algorithm for nonrigid point set registration. There the main novelty of our approach and it enables us to deal are two unknown variables we have to solve for in this prob- with the noise and outliers which arise in the correspon- lem: the correspondence and the transformation. Although dence step. The transformation is specified in a functional solving for either variable without information regarding space, more specifically a reproducing kernel Hilbert space.
    [Show full text]
  • Density Adaptive Point Set Registration
    Density Adaptive Point Set Registration Felix Jaremo¨ Lawin, Martin Danelljan, Fahad Shahbaz Khan, Per-Erik Forssen,´ Michael Felsberg Computer Vision Laboratory, Department of Electrical Engineering, Linkoping¨ University, Sweden {felix.jaremo-lawin, martin.danelljan, fahad.khan, per-erik.forssen, michael.felsberg}@liu.se Abstract Probabilistic methods for point set registration have demonstrated competitive results in recent years. These techniques estimate a probability distribution model of the point clouds. While such a representation has shown promise, it is highly sensitive to variations in the den- sity of 3D points. This fundamental problem is primar- ily caused by changes in the sensor location across point sets. We revisit the foundations of the probabilistic regis- tration paradigm. Contrary to previous works, we model the underlying structure of the scene as a latent probabil- ity distribution, and thereby induce invariance to point set density changes. Both the probabilistic model of the scene and the registration parameters are inferred by minimiz- ing the Kullback-Leibler divergence in an Expectation Max- imization based framework. Our density-adaptive regis- tration successfully handles severe density variations com- monly encountered in terrestrial Lidar applications. We perform extensive experiments on several challenging real- world Lidar datasets. The results demonstrate that our ap- proach outperforms state-of-the-art probabilistic methods for multi-view registration, without the need of re-sampling. Figure 1. Two example Lidar scans (top row), with signifi- cantly varying density of 3D-points. State-of-the-art probabilistic method [6] (middle left) only aligns the regions with high density. This is caused by the emphasis on dense regions, as visualized by 1.
    [Show full text]
  • Unsupervised Learning of Non-Rigid Point Set Registration Lingjing Wang, Xiang Li, Jianchun Chen, and Yi Fang
    1 Coherent Point Drift Networks: Unsupervised Learning of Non-Rigid Point Set Registration Lingjing Wang, Xiang Li, Jianchun Chen, and Yi Fang Abstract—Given new pairs of source and target point sets, the registration task turns into to process to determine the standard point set registration methods often repeatedly conduct displacement field that moves the source point set towards the the independent iterative search of desired geometric transfor- target one. Regardless of the model-based or model-free point mation to align the source point set with the target one. This limits their use in applications to handle the real-time point set registration approaches, most existing efforts have to start set registration with large volume dataset. This paper presents over a new iterative optimization process for each pair of input a novel method, named coherent point drift networks (CPD- to determine the geometric transformation. Consequently, the Net), for the unsupervised learning of geometric transformation intensive computation in the iterative routine pose great chal- towards real-time non-rigid point set registration. In contrast to previous efforts (e.g. coherent point drift), CPD-Net can learn displacement field function to estimate geometric transformation from a training dataset, consequently, to predict the desired geometric transformation for the alignment of previously unseen pairs without any additional iterative optimization process. Fur- thermore, CPD-Net leverages the power of deep neural networks to fit an arbitrary function, that adaptively accommodates differ- ent levels of complexity of the desired geometric transformation. Particularly, CPD-Net is proved with a theoretical guarantee to learn a continuous displacement vector function that could fur- ther avoid imposing additional parametric smoothness constraint as in previous works.
    [Show full text]
  • Robust Variational Bayesian Point Set Registration
    Robust Variational Bayesian Point Set Registration Jie Zhou 1,2,† Xinke Ma 1,2,† Li Liang 1,2 Yang Yang 1,2,∗ Shijin Xu 1,2 Yuhe Liu 1,2 Sim Heng Ong 3 1 School of Information Science and Technology, Yunnan Normal University 2Laboratory of Pattern Recognition and Artificial Intelligence, Yunnan Normal University 3 Department of Electrical and Computer Engineering, National University of Singapore † Jie Zhou and Xinke Ma contributed equally to this work. ∗Yang Yang is corresponding author. ∗ Email: yyang [email protected] Abstract We summarize the existing problems of traditional point set registration algorithms in dealing with outliers, missing cor- In this work, we propose a hierarchical Bayesian net- respondences and objective function optimization. work based point set registration method to solve missing There are three approaches to deal with outliers: (i) The correspondences and various massive outliers. We con- first approach is to construct extra modeling for outliers. struct this network first using the finite Student’s t laten- Robust Point Matching (RPM) [4] utilizes a correspondence t mixture model (TLMM), in which distributions of latent matrix where extra entries are added to address outliers, and variables are estimated by a tree-structured variational in- the number of outliers is reasonable restrained by conduct- ference (VI) so that to obtain a tighter lower bound under ing a linear assignment to the correspondence matrix. Mix- the Bayesian framework. We then divide the TLMM into t- ture point matching (MPM) [3] and Coherent Point Drift wo different mixtures with isotropic and anisotropic covari- (CPD) [20] employ an extra component of uniform distri- ances for correspondences recovering and outliers identifi- bution embedded into Gaussian mixture model to handle cation, respectively.
    [Show full text]
  • Validation of Non-Rigid Point-Set Registration Methods Using a Porcine Bladder Pelvic Phantom
    Validation of non-rigid point-set registration methods using a porcine bladder pelvic phantom Roja Zakariaee1;2, Ghassan Hamarneh3, Colin J Brown3 and Ingrid Spadinger2 1 Department of Physics and Astronomy, University of British Columbia, Vancouver, BC, Canada 2 BC Cancer Agency Vancouver Center, Vancouver, BC, Canada 3 Medical Image Analysis Lab, Simon Fraser University, Burnaby, BC, Canada E-mail: [email protected], [email protected] Submitted to Phys. Med. Biol. on July 2015, Revised: Nov 2015 Abstract. The problem of accurate dose accumulation in fractionated radiotherapy treatment for highly deformable organs, such as bladder, has garnered increasing interest over the past few years. However, more research is required in order to find a robust and efficient solution and to increase the accuracy over the current methods. The purpose of this study was to evaluate the feasibility and accuracy of utilizing non-rigid (affine or deformable) point-set registration in accumulating dose in bladder of different sizes and shapes. A pelvic phantom was built to house an ex-vivo porcine bladder with fiducial landmarks adhered onto its surface. Four different volume fillings of the bladder were used (90, 180, 360 and 480 cc). The performance of MATLAB implementations of five different methods were compared, in aligning the bladder contour point-sets. The approaches evaluated were Coherent Point Drift (CPD), Gaussian Mixture Model (GMM), Shape Context (SC), Thin-plate Spline Robust Point Matching (TPS-RPM) and Finite Iterative Closest Point (ICP-finite). The evaluation metrics included registration runtime, target registration error (TRE), root-mean- square error (RMS) and Hausdorff distance (HD).
    [Show full text]