MICCAI/ EMPIRE10 Lung Registration Challenge 3D Slicer Non-rigid Registration
|
|
- Shawn Arnold
- 5 years ago
- Views:
Transcription
1 MICCAI/ EMPIRE10 Lung Registration Challenge 3D Slicer Non-rigid Registration Dominik S. Meier 1,, Lidwien Veugen 2, Raul S Jose 1, James V. Miller 3, Ron Kikinis 1 1 Brigham & Women's Hospital, Dept. of Radiology, Boston, MA; U.S.A. 2 Eindhoven University of Technology, Dept. of Biomedical Eng., Eindhoven, Netherlands 3 Visualization and Computer Vision Laboratory, GE Research, Niskayuna, NY, U.S.A. Abstract. Combinations of three different registration modules within the 3DSlicer software were applied, seeking a fast and fully automated registration without any preprocessing or the use of masks. Ease of use and speed were key criteria for the choice of methods, i.e. desired was a pipeline with less than one hour total processing time and no preprocessing requirements. Employed were Affine, BSpline and DemonWarp algorithms. BSpline registration consisted of three cycles with increasing degrees of freedom (DOF) and cubic grids of 7,12 and 17 grid-points, respectively. A second pipeline invoking the BRAINSDemonWarp routine on the result of the first method was also applied, to test if high-dof warping could improve the results. Average lung boundary error achieved was 0.03% (rank 19) by the BSpline method and 0.05% (rank 26) by the DemonWarp. The use of the DemonWarp incurred significant singularity penalties. Achievable result accuracy was limited by the necessary fusion of multiple deformation fields into a single solution, which necessitates roundoff errors at each stage and prevents subvoxel accuracy. All images were processed in a fully automated fashion and with a single set of parameters, hence results are not representative for using the 3DSlicer registration modules in a semi-automated fashion, with interactive tuning of parameters and the use of masks. Keywords: 3DSlicer, BSpline, Demons, BRAINSDemonWarp Introduction The open source software 3DSlicer ( [1] contains a large set of registration algorithms, including automated and interactive, intensity-, surface- or landmark-based. Three different registration tools were used and their result transforms combined into two pipelines. All three registration modules are based on registration transforms, similarity metrics and optimizers implemented from the Insight Toolkit (ITK) [2]. The rationale for the methods used in this registration challenge may differ somewhat from other algorithm compared in this challenge: we sought to test the feasibility of applying the 3DSlicer registration modules from a clinician researcher perspective. Hence the method of choice needed to be fully automated with little or no
2 preprocessing. Ease of use and overall processing time were important considerations along with achievable accuracy and robustness. As a benchmark we sought overall processing time of less than 1 hour. Two pipelines were tested: the first employed a stepwise approach of four consecutive registrations with increasing degrees of freedom (DOF). The second method applied an additional high-dof warping algorithm based on optical flow concepts, starting from the position obtained by method 1. Both methods were fully automated, ran all images with a single set of settings and did not use any masks. Neither the similarity metric, nor the optimizer were tailored in any form to the geometry or contrast or image content encountered in the images. Methods Pipeline The overall pipeline of the two methods is shown in Figure 1. Affine (12 DOF) BSpline1 (~10 2 DOF) BSpline2 (~10 3 DOF) BSpline3 (~10 4 DOF) DemonWarp (~10 5 DOF) Method 1 Method 2 Figure 1: Overview of two registration pipelines tested within the 3DSlicer software package. Method 1 comprised initialization with an affine transform, followed by 3 consecutive nonrigid BSpline warps of increasing DOF. The second method was a high-dof warping based on the Demons algorithm, starting from the output of method 1. Fast Affine Initial alignment was obtained with the "Fast Affine Registration" module in 3DSlicer ( based on ITK algorithm implemented from [3]. Input images were the original fixed and moving images, as provided, without any preprocessing or masking. Mutual information was the cost function criterion for all registrations. Parameters used are listed in Table 1. Result of this step was a 12 DOF linear affine transform, used as starting pose for the subsequent BSpline registration. Fast Nonrigid BSpline The "Fast Nonrigid BSpline" module in 3DSlicer is built on the ITK BSpline algorithm, based in turn on [4]. Details on the algorithm can be found in the ITK Users Guide [2]. The method places a 3D grid of evenly spaced control points over the image, with three translational DOF per point. Cost function was mutual information; no masking or intensity normalizations were applied. Input images were the original images, as provided, along with the affine transform result from step one
3 as starting pose. Result of each BSpline registration was a resampled/warped moving image and a vector deformation field, saved as a 4D volume. Three consecutive rounds of BSpline registrations were applied, using the registered image of the previous as moving input for the next. The parameters used at each iteration are listed in Table 1. Step samples iterations grid size DOF hist.bin initial pose 1.Affine 150, BSpline 1 150, x 7 x 7 1, Affine 3.BSpline 2 150, x 12 x 12 5, BSpline 1 4.BSpline 3 250, x 17 x 17 14, BSpline 2 Table 1: Parameters used for the Affine and BSpline registration steps. samples: the number of sample points randomly selected that actively contribute to the cost function. For the large 3D volumes of this study the sample points correspond to less than 1% of the total image matrix; iterations: max. iteration limit; grid size: number of control grid points, DOF: total degree of freedom; hist.bin: number of histogram bins used in calculating the mutual information cost function; initial pose: starting/input transform for each cycle. BRAINSDemonWarp The BRAINSDemonWarp algorithm [5] is a high-dof nonrigid registration method, based on the Demons concept, which uses an optical flow paradigm to drive and constrain the deformation. Inputs tare the image pair to be registered and control parameters, such as multi-resolution levels, smoothing kernels, global histogram matching etc. Output was analogous to the BSpline modules, consisting of a deformation field and resampled output image. The optimizer uses the MultiResolutionPDEDeformableRegistration filter with nearest-neighbor extra- and intrapolation. Each vector in the deformation field represents the distance between a geometric point in the input space and a point in the output space. The resampled output image is generated by warping the input moving image with the deformation field using the ItkWarpImageFilter [2]. Image values at mapped non-integer positions are interpolated from the grid-positions via the ITK function LinearInterpolateImage for this application. The program uses the Insight Toolkit [2] for all the computations, For a detailed description of the Slicer implementation of BRAINSDemonWarp, see the reference section in [1]. DemonWarp employs a multi-resolution scheme with variable pyramid levels. Used here were three pyramid levels with 1,, scales, respectively, with 10, 15, 20 iterations at each level and a Gaussian smoothing of the deformation field at each iteration with a sigma of 0.3. A symmetrical gradient type was used to compute the demons forces. Deformation Field Resampling/Concatenation Each separate instance of a BSpline or DemonsWarp registration produced a backward mapping deformation field. To produce the final deformation field the
4 individual fields are first resampled in reverse order and then summed. Resampling occurred with the 3DSlicer resampling tool "ResampleScalar/Vector/DWI" module, which is based on an ITK resampling algorithm [6]. Detailed documentation on the resampling module can be found on the reference pages at [1]. Hardware / OS All registrations were run on DELL compute servers with quad Xeon 2.0GHz processors, running a UNIX operating system, with 8GB of RAM each and 36GB SCSI hard drives. Results Processing Time / Speed The affine portion completed on average in 1.2±1.1 minutes. The three BSpline iterations all completed in about 11±4 minutes each. The DemonWarp completed in 21±9 minutes on average. Detailed processing times for each of the twenty image pairs are shown in Figure 2 for BSpline and Figure 3 for the DemonWarp. Total processing time for the BSpline method averaged 37±14 minutes (range 7-51 minutes). Total processing time for the DemonWarp method was 58±22 minutes on average (range minutes). Distributions for all five elements are compared in Figure Affine BSpline 1 Bspline 2 BSpline 3 exam processing time [min] Figure 2: Summary processing times for method 1 (BSpline). Median processing time was less than one minute for the Affine, 13 minutes for each of the BSplines.
5 20 15 exam 10 5 Affine+BSpline DemonWarp processing time [min] Figure 3: Processing time for method 2 (DemonWarp). Average processing time was 23 minutes per case for the DemonWarp. Since the initial pose was the output of method 1, the total processing time on average was 58 minutes. processing time [min] Affine BSpline 1 Bspline 2 BSpline 3DemonWarp Figure 4: Summary processing times for all 5 elements. Median processing time was less than one minute for the Affine, 13 minutes for each of the BSplines, and 23 minutes for the DemonWarp. Average processing time per case for methods 1 & 2 thus was 37 and 58 minutes, respectively. Accuracy Registration accuracy was evaluated based on alignment of lung boundaries, fissures and expert landmarks and also on the presence of singularities in the final deformation field. Details on the evaluation method can be found in [7]. Summary scores and ranks for the BSpline and DemonWarp methods can be found in Table 2 and Table 3, respectively.
6 Lung Boundaries Fissures Landmarks Singularities Scan Pair Score Rank Score Rank Score Rank Score Rank Avg Average Ranking Overall Final Placement 25 Table 2: Results for the BSpline method for each scan pair, per category and overall. Rankings and final placement are from a total of 34 competing algorithms. Lung Boundaries Fissures Landmarks Singularities Scan Pair Score Rank Score Rank Score Rank Score Rank Avg Average Ranking Overall Final Placement 32 Table 3: Results for the DemonWarp method, for each scan pair, per category and overall. Rankings and final placement are from a total of 34 competing algorithms.
7 4 Discussion Accuracy Registration accuracy was modest compared to other more tailored methods participating in the EMPIRE10 challenge. Judging overall performance however should take the potential preprocessing effort into account: we decided to deliberately not use the masks and restrict total processing time to less than 90 minutes. The results achieved should therefore be interpreted in the context of a fast & fully automated registration without prior editing, i.e. comparability with methods that did use the masks is limited. In a clinical setting the creation of high-precision masks would incur a significant and possibly prohibitive time and resource effort. Hence speed and ease of use were relevant criteria, followed by robustness and accuracy. An additional source of error came from roundoff errors incurred when obtaining the backward mapping deformation fields requested for the competition. The concatenation of nonrigid deformation fields includes a round-off to grid-coordinates at each step, which ultimately limits the final accuracy. Considering that most methods obtained accuracies within a few voxels, we assume that significantly better accuracy can be obtained from the algorithms tested if this resampling step can be avoided. The DemonWarp method is an optical flow algorithm based on the demons principle. Goal was to see if this method as an additional high-dof registration step could further improve the results. While the method did in some cases reduce residual misalignment, it incurred large penalties in others and consistently produced singularities in the final deformation field. In 4 of the 20 cases lung boundary- and landmar-error were significantly increased by the added step, which drastically reduced the overall mean scores. So at least in some cases the DemonWarp appears to have moved away from the correct result. This may also in part also be due to the cumulative roundoff error introduced by the abovementioned concatenation of deformation fields, which for the DemonWarp addition added a fourth deformation to the series and associated increase in total error. In conclusion the combination of BSpline and DemonWarp pipelines in the configuration applied is not the method of choice, particularly in the light of the computational cost (see below). Particularly based on the weighting of singularities the DemonWarp addition to the BSpline pipeline did not improve the results. Further improvement of the alignment beyond that achieved by the finer BSpline grid is likely to require masking to avoid the cost function being dominated by non-lung parenchyma. Processing Time / Speed Premise for the pipeline used was a targeted total processing time of 1 hour. The BSpline registration methods all completed on an average in 37 minutes, and the DemonWarp averaged 58 minutes. However there were several cases in which the DemonWarp exceeded the 1 hour range, with a maximum of 88 minutes for case #2. The images provided in this challenge were very large and deformation fields generated from them could exceed 1GB in size.
8 The multi-step approach with gradual increases from 12 affine DOF to the BSpline grids of increasing size proved very robust and did not fail in a single case in fully automated processing. However the feasibility of concatenating transforms depends critically on the desired result. Without a specific tool to concatenate the transforms in a forward manner, inevitable interpolation and round-off errors accumulate and can prevent achieving sub-voxel accuracy. If the desired output is the registered image, and some blurring from interpolation is acceptable, then this method is a viable candidate for a robust fast and fully automated approach. If the deformation field is required, then a method for linking the transforms in a manner that minimizes error accumulation is necessary to achieve sub-voxel accuracy. Acknowledgments This work was funded in part by NIH/NCRR P41 RR S1 and NIH/NCRR P41 RR Special thanks go to Drs. Hans Johnson and Yongqiang Zhao for the implementation of the 3DSlicer BRAINSDemonWarp method, and also to Bill Lorensen and Yinglin Lee for help with the 3DSlicer BSpline module implementation. References 1. 3DSlicer v3.6; (NA-MIC, NAC); 2010; 2. Ibanez, L., Schroeder, W., Ng, L., Cates, J.: The Insight Toolkit (itk) Software Guide. (2005) 3. Mattes, D., Haynor, D.R., Vesselle, H., Lewellen, T.K., Eubank, W.: PET-CT image registration in the chest using free-form deformations. IEEE Trans Med Imaging 22 (2003) Rueckert, D., Hayes, C., Studholme, C., Summers, P., Leach, M., Hawkes, D.: Non-rigid registration of breast MR images using mutual information. Lecture Notes in Computer Science 1496 (1998) Johnson, H., Zhao, Y.: BRAINSDemonWarp: An Applicaton to Perform Demons Registration. (2009) 6. Ibanez, L., Schroeder, W., Ng, L., Cates, J.: The Insight Toolkit (itk) Software Guide - sections 6.9, 8.8, 8.9. (2005) 7. Murphy, K., van Ginneken, B., Reinhardt, J., Kabus, S., Ding, K., Deng, X., Pluim, J.: Evaluation of Methods for Pulmonary Image Registration: The EMPIRE10 Study. Grand Challenges in Medical Image Analysis (2010)
Deformable image registration with automated motion-mask extraction
Deformable image registration with automated motion-mask extraction Jef Vandemeulebroucke, Simon Rit, Joël Schaerer, and David Sarrut Université de Lyon, CREATIS, CNRS UMR5220, Léon Bérard cancer center.
More informationDiffeomorphic Diffusion Registration of Lung CT Images
Diffeomorphic Diffusion Registration of Lung CT Images Alexander Schmidt-Richberg, Jan Ehrhardt, René Werner, and Heinz Handels Institute of Medical Informatics, University of Lübeck, Lübeck, Germany,
More informationRegularized Nonrigid Registration of Lung CT Images by Preserving Tissue Volume and Vesselness Measure
Regularized Nonrigid Registration of Lung CT Images by Preserving Tissue Volume and Vesselness Measure Kunlin Cao 1,3, Kaifang Du 2,3, Kai Ding 2,3, Joseph M. Reinhardt 2,3,, and Gary E. Christensen 1,3
More informationMedical Image Synthesis via Monte Carlo Simulation
Medical Image Synthesis via Monte Carlo Simulation An Application of Statistics in Geometry & Building a Geometric Model with Correspondence James Z. Chen, Stephen M. Pizer, Edward L. Chaney, Sarang Joshi,
More informationCIND Pre-Processing Pipeline For Diffusion Tensor Imaging. Overview
CIND Pre-Processing Pipeline For Diffusion Tensor Imaging Overview The preprocessing pipeline of the Center for Imaging of Neurodegenerative Diseases (CIND) prepares diffusion weighted images (DWI) and
More informationAdaptive diffeomorphic multi-resolution demons and its application to same. modality medical image registration with large deformation 1
Adaptive diffeomorphic multi-resolution demons and its application to same modality medical image registration with large deformation 1 Chang Wang 1 Qiongqiong Ren 1 Xin Qin 1 Yi Yu 1 1 (School of Biomedical
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE
SIFT: SCALE INVARIANT FEATURE TRANSFORM BY DAVID LOWE Overview Motivation of Work Overview of Algorithm Scale Space and Difference of Gaussian Keypoint Localization Orientation Assignment Descriptor Building
More informationQuantitative Neuro-Anatomic and Functional Image Assessment Recent progress on image registration and its applications
Quantitative Neuro-Anatomic and Functional Image Assessment Recent progress on image registration and its applications Guido Gerig Sarang Joshi Tom Fletcher Applications of image registration in neuroimaging
More informationWatershed Modeling With DEMs
Watershed Modeling With DEMs Lesson 6 6-1 Objectives Use DEMs for watershed delineation. Explain the relationship between DEMs and feature objects. Use WMS to compute geometric basin data from a delineated
More informationAnisotropic Interpolation of DT-MRI
Anisotropic Interpolation of DT-MRI Carlos A. Castaño-Moraga 1, Miguel A. Rodriguez-Florido 1, Luis Alvarez 2, Carl-Fredrik Westin 3, and Juan Ruiz-Alzola 1,3 1 Medical Technology Center, Signals & Communications
More informationSIFT: Scale Invariant Feature Transform
1 SIFT: Scale Invariant Feature Transform With slides from Sebastian Thrun Stanford CS223B Computer Vision, Winter 2006 3 Pattern Recognition Want to find in here SIFT Invariances: Scaling Rotation Illumination
More informationMass Preserving Mappings and Image Registration
Mass Preserving Mappings and Image Registration Steven Haker 1, Allen Tannenbaum 2, and Ron Kikinis 1 1 Department of Radiology, Surgical Planning Laboratory Brigham and Women s Hospital, Boston, MA 02115,
More informationAn Anisotropic Material Model for Image Guided Neurosurgery
An Anisotropic Material Model for Image Guided Neurosurgery Corey A. Kemper 1, Ion-Florin Talos 2, Alexandra Golby 2, Peter M. Black 2, Ron Kikinis 2, W. Eric L. Grimson 1, and Simon K. Warfield 2 1 Massachusetts
More informationAn Experimental Evaluation of Passage-Based Process Discovery
An Experimental Evaluation of Passage-Based Process Discovery H.M.W. Verbeek and W.M.P. van der Aalst Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513, 5600
More informationGraphical Presentation of a Nonparametric Regression with Bootstrapped Confidence Intervals
Graphical Presentation of a Nonparametric Regression with Bootstrapped Confidence Intervals Mark Nicolich & Gail Jorgensen Exxon Biomedical Science, Inc., East Millstone, NJ INTRODUCTION Parametric regression
More informationNonlinear Registration of Diffusion MR Images Based on Fiber Bundles
Nonlinear Registration of Diffusion MR Images Based on Fiber Bundles Ulas Ziyan 1, Mert R. Sabuncu 1, Lauren J. O Donnell 2,3, and Carl-Fredrik Westin 1,3 1 MIT Computer Science and Artificial Intelligence
More informationDiffeomorphic Demons Using ITK s Finite Difference Solver Hierarchy Release 0.02
Diffeomorphic Demons Using ITK s Finite Difference Solver Hierarchy Release 0.02 Tom Vercauteren 1,2, Xavier Pennec 1, Aymeric Perchant 2 and Nicholas Ayache 1 September 10, 2007 1 Asclepios Research Group,
More informationLeast squares contour alignment
Least squares contour alignment Ivan Markovsky and Sasan Mahmoodi School of Electronics and Computer Science University of Southampton, SO7 BJ, UK Emails: {im,sm3}@ecssotonacuk Abstract The contour alignment
More informationUSE OF STATISTICAL BOOTSTRAPPING FOR SAMPLE SIZE DETERMINATION TO ESTIMATE LENGTH-FREQUENCY DISTRIBUTIONS FOR PACIFIC ALBACORE TUNA (THUNNUS ALALUNGA)
FRI-UW-992 March 1999 USE OF STATISTICAL BOOTSTRAPPING FOR SAMPLE SIZE DETERMINATION TO ESTIMATE LENGTH-FREQUENCY DISTRIBUTIONS FOR PACIFIC ALBACORE TUNA (THUNNUS ALALUNGA) M. GOMEZ-BUCKLEY, L. CONQUEST,
More informationChoosing the best set of variables in regression analysis using integer programming
DOI 10.1007/s10898-008-9323-9 Choosing the best set of variables in regression analysis using integer programming Hiroshi Konno Rei Yamamoto Received: 1 March 2007 / Accepted: 15 June 2008 Springer Science+Business
More informationAdvanced Features. Advanced Features: Topics. Jana Kosecka. Slides from: S. Thurn, D. Lowe, Forsyth and Ponce. Advanced features and feature matching
Advanced Features Jana Kosecka Slides from: S. Thurn, D. Lowe, Forsyth and Ponce Advanced Features: Topics Advanced features and feature matching Template matching SIFT features Haar features 2 1 Features
More informationDT-REFinD: Diffusion Tensor Registration With Exact Finite-Strain Differential
DT-REFinD: Diffusion Tensor Registration With Exact Finite-Strain Differential The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationNeuroimage Processing
Neuroimage Processing Instructor: Moo K. Chung mkchung@wisc.edu Lecture 10-11. Deformation-based morphometry (DBM) Tensor-based morphometry (TBM) November 13, 2009 Image Registration Process of transforming
More informationDiffusion Tensor Imaging tutorial
NA-MIC http://na-mic.org Diffusion Tensor Imaging tutorial Sonia Pujol, PhD Surgical Planning Laboratory Harvard University DTI tutorial This tutorial is an introduction to the advanced Diffusion MR capabilities
More informationPart 01 Introduction to X-ray imaging. Overview Module 07 Part 1 X-ray
1 Introduction to Medical Image Processing (5XSA0), Module 07 Part 01 Introduction to X-ray imaging Peter H.N. de With (p.h.n.de.with@tue.nl ) With Contributions from D. Ruijters of Philips Healthcare
More informationImage Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington
Image Filtering Slides, adapted from Steve Seitz and Rick Szeliski, U.Washington The power of blur All is Vanity by Charles Allen Gillbert (1873-1929) Harmon LD & JuleszB (1973) The recognition of faces.
More informationComputing the Geodesic Interpolating Spline
Computing the Geodesic Interpolating Spline Anna Mills 1, Tony Shardlow 1, and Stephen Marsland 2 1 The University of Manchester, UK 2 Massey University, NZ Abstract. We examine non-rigid image registration
More informationStat 401XV Final Exam Spring 2017
Stat 40XV Final Exam Spring 07 I have neither given nor received unauthorized assistance on this exam. Name Signed Date Name Printed ATTENTION! Incorrect numerical answers unaccompanied by supporting reasoning
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationImproved FMRI Time-series Registration Using Probability Density Priors
Improved FMRI Time-series Registration Using Probability Density Priors R. Bhagalia, J. A. Fessler, B. Kim and C. R. Meyer Dept. of Electrical Engineering and Computer Science and Dept. of Radiology University
More informationFast approximate curve evolution
Fast approximate curve evolution James Malcolm Yogesh Rathi Anthony Yezzi Allen Tannenbaum Georgia Institute of Technology, Atlanta, GA Brigham and Women s Hospital, Boston, MA James Malcolm Georgia Institute
More informationLongitudinal growth analysis of early childhood brain using deformation based morphometry
Longitudinal growth analysis of early childhood brain using deformation based morphometry Junki Lee 1, Yasser Ad-Dab'bagh 2, Vladimir Fonov 1, Alan C. Evans 1 and the Brain Development Cooperative Group
More informationParametric non-rigid registration using a stationary velocity field
Parametric non-rigid registration using a stationary velocity field Marc Modat, Pankaj Daga, M. Jorge Cardoso, Sebastien Ourselin, Centre for Medical Image Computing, University College London, WC1 6BT,
More informationEnvironment (Parallelizing Query Optimization)
Advanced d Query Optimization i i Techniques in a Parallel Computing Environment (Parallelizing Query Optimization) Wook-Shin Han*, Wooseong Kwak, Jinsoo Lee Guy M. Lohman, Volker Markl Kyungpook National
More informationApplications of Inertial Measurement Units in Monitoring Rehabilitation Progress of Arm in Stroke Survivors
Applications of Inertial Measurement Units in Monitoring Rehabilitation Progress of Arm in Stroke Survivors Committee: Dr. Anura P. Jayasumana Dr. Matthew P. Malcolm Dr. Sudeep Pasricha Dr. Yashwant K.
More informationScale and Statistics in Variable Conductance Diffusion
Scale and Statistics in Variable Conductance Diffusion Terry S. Yoo Department of Computer Science University of North Carolina Chapel Hill, NC 7599-3175 Introduction Non-linear diffusion or Variable Conductance
More informationA comparison of sequencing formulations in a constraint generation procedure for avionics scheduling
A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling Department of Mathematics, Linköping University Jessika Boberg LiTH-MAT-EX 2017/18 SE Credits: Level:
More informationCSE 473/573 Computer Vision and Image Processing (CVIP)
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu inwogu@buffalo.edu Lecture 11 Local Features 1 Schedule Last class We started local features Today More on local features Readings for
More informationThree-Dimensional Electron Microscopy of Macromolecular Assemblies
Three-Dimensional Electron Microscopy of Macromolecular Assemblies Joachim Frank Wadsworth Center for Laboratories and Research State of New York Department of Health The Governor Nelson A. Rockefeller
More informationDiscrete Multi-material Topology Optimization under Total Mass Constraint
Discrete Multi-material Topology Optimization under Total Mass Constraint Xingtong Yang Ming Li State Key Laboratory of CAD&CG, Zhejiang University Solid and Physical Modeling Bilbao, June 12, 2018 Problem
More informationChapter 9. Non-Parametric Density Function Estimation
9-1 Density Estimation Version 1.1 Chapter 9 Non-Parametric Density Function Estimation 9.1. Introduction We have discussed several estimation techniques: method of moments, maximum likelihood, and least
More informationLoG Blob Finding and Scale. Scale Selection. Blobs (and scale selection) Achieving scale covariance. Blob detection in 2D. Blob detection in 2D
Achieving scale covariance Blobs (and scale selection) Goal: independently detect corresponding regions in scaled versions of the same image Need scale selection mechanism for finding characteristic region
More informationA Program for Data Transformations and Kernel Density Estimation
A Program for Data Transformations and Kernel Density Estimation John G. Manchuk and Clayton V. Deutsch Modeling applications in geostatistics often involve multiple variables that are not multivariate
More informationActive Robot Calibration Algorithm
Active Robot Calibration Algorithm Yu Sun and John M. Hollerbach Abstract This paper presents a new updating algorithm to reduce the complexity of computing an observability index for kinematic calibration
More informationVECTOR REPETITION AND MODIFICATION FOR PEAK POWER REDUCTION IN VLSI TESTING
th 8 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems Sopron, Hungary, April 13-16, 2005 VECTOR REPETITION AND MODIFICATION FOR PEAK POWER REDUCTION IN VLSI TESTING M. Bellos
More informationMedical Image Analysis
Medical Image Analysis Instructor: Moo K. Chung mchung@stat.wisc.edu Lecture 3. Deformation-based Morphometry (DBM) January 30, 2007 Deformation based Morphometry (DBM) It uses deformation fields obtained
More informationOver-enhancement Reduction in Local Histogram Equalization using its Degrees of Freedom. Alireza Avanaki
Over-enhancement Reduction in Local Histogram Equalization using its Degrees of Freedom Alireza Avanaki ABSTRACT A well-known issue of local (adaptive) histogram equalization (LHE) is over-enhancement
More informationChapter 9. Non-Parametric Density Function Estimation
9-1 Density Estimation Version 1.2 Chapter 9 Non-Parametric Density Function Estimation 9.1. Introduction We have discussed several estimation techniques: method of moments, maximum likelihood, and least
More informationAchieving scale covariance
Achieving scale covariance Goal: independently detect corresponding regions in scaled versions of the same image Need scale selection mechanism for finding characteristic region size that is covariant
More informationLab 4 Radial Velocity Determination of Membership in Open Clusters
Lab 4 Radial Velocity Determination of Membership in Open Clusters Sean Lockwood 1, Dipesh Bhattarai 2, Neil Lender 3 December 2, 2007 Abstract We used the Doppler velocity of 29 stars in the open clusters
More informationMS-C1620 Statistical inference
MS-C1620 Statistical inference 10 Linear regression III Joni Virta Department of Mathematics and Systems Analysis School of Science Aalto University Academic year 2018 2019 Period III - IV 1 / 32 Contents
More informationINTEREST POINTS AT DIFFERENT SCALES
INTEREST POINTS AT DIFFERENT SCALES Thank you for the slides. They come mostly from the following sources. Dan Huttenlocher Cornell U David Lowe U. of British Columbia Martial Hebert CMU Intuitively, junctions
More informationLinear Model Selection and Regularization
Linear Model Selection and Regularization Recall the linear model Y = β 0 + β 1 X 1 + + β p X p + ɛ. In the lectures that follow, we consider some approaches for extending the linear model framework. In
More informationGaussian Process Based Image Segmentation and Object Detection in Pathology Slides
Gaussian Process Based Image Segmentation and Object Detection in Pathology Slides CS 229 Final Project, Autumn 213 Jenny Hong Email: jyunhong@stanford.edu I. INTRODUCTION In medical imaging, recognizing
More informationDiscontinuous Galerkin methods for nonlinear elasticity
Discontinuous Galerkin methods for nonlinear elasticity Preprint submitted to lsevier Science 8 January 2008 The goal of this paper is to introduce Discontinuous Galerkin (DG) methods for nonlinear elasticity
More informationRegistration of Time Varying Scans
Simon Flöry FSP Meeting Graz, March 2007 joint work with N. Mitra H. Pottmann M. Ovsjanikov N. Gelfand Introduction Space-Time Registration Properties of Space-Time Registration Applications and Results
More informationUncertainty Quantification for LDDMM Using a Low-rank Hessian Approximation
Uncertainty Quantification for LDDMM Using a Low-rank Hessian Approximation Xiao Yang, Marc Niethammer, Department of Computer Science and Biomedical Research Imaging Center University of North Carolina
More informationCUYAHOGA COUNTY URBAN TREE CANOPY & LAND COVER MAPPING
CUYAHOGA COUNTY URBAN TREE CANOPY & LAND COVER MAPPING FINAL REPORT M IKE GALVIN S AVATREE D IRECTOR, CONSULTING GROUP P HONE: 914 403 8959 E MAIL: MGALVIN@SAVATREE. COM J ARLATH O NEIL DUNNE U NIVERSITY
More informationCalculator Exam 2009 University of Houston Math Contest. Name: School: There is no penalty for guessing.
Calculator Exam 2009 University of Houston Math Contest Name: School: Please read the questions carefully. Unless otherwise requested, round your answers to 8 decimal places. There is no penalty for guessing.
More information6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005
6.869 Advances in Computer Vision Prof. Bill Freeman March 1 2005 1 2 Local Features Matching points across images important for: object identification instance recognition object class recognition pose
More informationA Discriminatively Trained, Multiscale, Deformable Part Model
A Discriminatively Trained, Multiscale, Deformable Part Model P. Felzenszwalb, D. McAllester, and D. Ramanan Edward Hsiao 16-721 Learning Based Methods in Vision February 16, 2009 Images taken from P.
More information3D Thermal-Diffusion Analysis on a Moisture Loaded Epoxy Sample
Excerpt from the Proceedings of the COMSOL Conference 2010 Boston 3D Thermal-Diffusion Analysis on a Moisture Loaded Epoxy Sample S. Madduri* 1, W. Infantolino 2, and B.G.Sammakia 1 1 Department of Mechanical
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 04 Greyscale Image Analysis Lecture 03 Summary Images as 2-D signals
More informationNumerical Analysis Exam with Solutions
Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the
More informationIMAGE WARPING APPLICATIONS. register multiple images (registration) correct system distortions. register image to map (rectification)
APPLICATIONS IMAGE WARPING N correct system distortions Rectification of Landsat TM image register multiple images (registration) original register image to map (rectification) N fill Speedway rectified
More informationMorphometrics with SPM12
Morphometrics with SPM12 John Ashburner Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. What kind of differences are we looking for? Usually, we try to localise regions of difference.
More informationAdvanced Laser Surface Analyzer. Francis V. Krantz Ashland Inc Blazer Parkway Dublin, Ohio Abstract
Advanced Laser Surface Analyzer Francis V. Krantz Ashland Inc. 5200 Blazer Parkway Dublin, Ohio 43017 Abstract The Advanced Laser Surface Analyzer (ALSA) is the result of continuing development of surface
More informationJerk derivative feedforward control for motion systems
Jerk derivative feedforward control for motion systems Matthijs Boerlage Rob Tousain Maarten Steinbuch Abstract This work discusses reference trajectory relevant model based feedforward design. For motion
More information5.1 2D example 59 Figure 5.1: Parabolic velocity field in a straight two-dimensional pipe. Figure 5.2: Concentration on the input boundary of the pipe. The vertical axis corresponds to r 2 -coordinate,
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationNo EFFICIENT LINE SEARCHING FOR CONVEX FUNCTIONS. By E. den Boef, D. den Hertog. May 2004 ISSN
No. 4 5 EFFICIENT LINE SEARCHING FOR CONVEX FUNCTIONS y E. den oef, D. den Hertog May 4 ISSN 94-785 Efficient Line Searching for Convex Functions Edgar den oef Dick den Hertog 3 Philips Research Laboratories,
More informationImage preprocessing in spatial domain
Image preprocessing in spatial domain Sharpening, image derivatives, Laplacian, edges Revision: 1.2, dated: May 25, 2007 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering Center
More information1. The following two-way frequency table shows information from a survey that asked the gender and the language class taken of a group of students.
Name Algebra Unit 13 Practice Test 1. The following two-way frequency table shows information from a survey that asked the gender and the language class taken of a group of students. Spanish French other
More informationMorphometry. John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.
Morphometry John Ashburner Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. Morphometry is defined as: Measurement of the form of organisms or of their parts. The American Heritage
More informationStatistical Geometry Processing Winter Semester 2011/2012
Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian
More informationUse of Geostatistically-constrained Potential Field Inversion and Downhole Drilling to Predict Distribution of Sulphide and Uranium Mineralisation
Use of Geostatistically-constrained Potential Field Inversion and Downhole Drilling to Predict Distribution of Sulphide and Uranium Mineralisation Matthew Zengerer Talk Outline Introduction Purpose and
More informationIntroduction to the genlasso package
Introduction to the genlasso package Taylor B. Arnold, Ryan Tibshirani Abstract We present a short tutorial and introduction to using the R package genlasso, which is used for computing the solution path
More informationAn IDL Based Image Deconvolution Software Package
An IDL Based Image Deconvolution Software Package F. Városi and W. B. Landsman Hughes STX Co., Code 685, NASA/GSFC, Greenbelt, MD 20771 Abstract. Using the Interactive Data Language (IDL), we have implemented
More informationLecture Slides. Elementary Statistics. by Mario F. Triola. and the Triola Statistics Series
Lecture Slides Elementary Statistics Tenth Edition and the Triola Statistics Series by Mario F. Triola Slide 1 Chapter 13 Nonparametric Statistics 13-1 Overview 13-2 Sign Test 13-3 Wilcoxon Signed-Ranks
More informationSUBJECTIVE EVALUATION OF IMAGE UNDERSTANDING RESULTS
18th European Signal Processing Conference (EUSIPCO-2010) Aalborg, Denmark, August 23-27, 2010 SUBJECTIVE EVALUATION OF IMAGE UNDERSTANDING RESULTS Baptiste Hemery 1, Hélène Laurent 2, and Christophe Rosenberger
More informationNIH Public Access Author Manuscript Conf Proc IEEE Eng Med Biol Soc. Author manuscript; available in PMC 2009 December 10.
NIH Public Access Author Manuscript Published in final edited form as: Conf Proc IEEE Eng Med Biol Soc. 2006 ; 1: 2622 2625. doi:10.1109/iembs.2006.259826. On Diffusion Tensor Estimation Marc Niethammer,
More informationEmpirical Models Interpolation Polynomial Models
Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained
More informationSUBJECT: SPIRE Spectrometer Detector Thermal Time Constant Derivation Procedure
SUBJECT: PREPARED BY: Time Constant Derivation Procedure Trevor Fulton DOCUMENT No: SPIRE-BSS-NOT- ISSUE: Draft 0.2 APPROVED BY: Date: Page: 2 of 11 Distribution Name Sarah Leeks Edward Polehampton Trevor
More informationGeometric Algorithms in GIS
Geometric Algorithms in GIS GIS Software Dr. M. Gavrilova GIS System What is a GIS system? A system containing spatially referenced data that can be analyzed and converted to new information for a specific
More informationLecture Slides. Section 13-1 Overview. Elementary Statistics Tenth Edition. Chapter 13 Nonparametric Statistics. by Mario F.
Lecture Slides Elementary Statistics Tenth Edition and the Triola Statistics Series by Mario F. Triola Slide 1 Chapter 13 Nonparametric Statistics 13-1 Overview 13-2 Sign Test 13-3 Wilcoxon Signed-Ranks
More informationSuper-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion
Super-Resolution Dr. Yossi Rubner yossi@rubner.co.il Many slides from Mii Elad - Technion 5/5/2007 53 images, ratio :4 Example - Video 40 images ratio :4 Example Surveillance Example Enhance Mosaics Super-Resolution
More informationCS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015
CS 3710: Visual Recognition Describing Images with Features Adriana Kovashka Department of Computer Science January 8, 2015 Plan for Today Presentation assignments + schedule changes Image filtering Feature
More informationBLIND SOURCE SEPARATION IN POST NONLINEAR MIXTURES
BLIND SURCE SEPARATIN IN PST NNLINEAR MIXTURES Sophie Achard, Dinh Tuan Pham Univ of Grenoble Laboratory of Modeling Computation, IMAG, CNRS BP 53X, 384 Grenoble Cedex, France SophieAchard@imagfr, DinhTuanPham@imagfr
More informationIntegration of SAS and NONMEM for Automation of Population Pharmacokinetic/Pharmacodynamic Modeling on UNIX systems
Integration of SAS and NONMEM for Automation of Population Pharmacokinetic/Pharmacodynamic Modeling on UNIX systems Alan J Xiao, Cognigen Corporation, Buffalo NY Jill B Fiedler-Kelly, Cognigen Corporation,
More informationFRAM V5.2. Plutonium and Uranium Isotopic Analysis Software
V5.2 Plutonium and Uranium Isotopic Analysis Software Advanced Isotopic Ratio Analysis Software for HPGe Gamma-Ray Spectra Analyzes Pu, and a wide variety of heterogeneous samples containing Pu, Am, U,
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT -09 Computational and Sensitivity Aspects of Eigenvalue-Based Methods for the Large-Scale Trust-Region Subproblem Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug
More informationA recursive model-based trust-region method for derivative-free bound-constrained optimization.
A recursive model-based trust-region method for derivative-free bound-constrained optimization. ANKE TRÖLTZSCH [CERFACS, TOULOUSE, FRANCE] JOINT WORK WITH: SERGE GRATTON [ENSEEIHT, TOULOUSE, FRANCE] PHILIPPE
More informationChapter 1 Statistical Inference
Chapter 1 Statistical Inference causal inference To infer causality, you need a randomized experiment (or a huge observational study and lots of outside information). inference to populations Generalizations
More informationPlease read these instructions carefully, but do not open the question paper until you are told that you may do so.
TST OF MTHMTIS FOR UNIVRSITY MISSION PPR SPIMN Time: 75 minutes dditional Materials: nswer sheet INSTRUTIONS TO NITS Please read these instructions carefully, but do not open the question paper until you
More informationBiometrics: Introduction and Examples. Raymond Veldhuis
Biometrics: Introduction and Examples Raymond Veldhuis 1 Overview Biometric recognition Face recognition Challenges Transparent face recognition Large-scale identification Watch list Anonymous biometrics
More informationOverlap Invariance of Cumulative Residual Entropy Measures for Multimodal Image Alignment
Overlap Invariance of Cumulative Residual Entropy Measures for Multimodal Image Alignment Nathan D. Cahill a,b, Julia A. Schnabel a, J. Alison Noble a and David J. Hawkes c a Institute of Biomedical Engineering,
More informationTwo-Stream Bidirectional Long Short-Term Memory for Mitosis Event Detection and Stage Localization in Phase-Contrast Microscopy Images
Two-Stream Bidirectional Long Short-Term Memory for Mitosis Event Detection and Stage Localization in Phase-Contrast Microscopy Images Yunxiang Mao and Zhaozheng Yin (B) Computer Science, Missouri University
More informationLecture 11. Data Description Estimation
Lecture 11 Data Description Estimation Measures of Central Tendency (continued, see last lecture) Sample mean, population mean Sample mean for frequency distributions The median The mode The midrange 3-22
More informationPreconditioned Parallel Block Jacobi SVD Algorithm
Parallel Numerics 5, 15-24 M. Vajteršic, R. Trobec, P. Zinterhof, A. Uhl (Eds.) Chapter 2: Matrix Algebra ISBN 961-633-67-8 Preconditioned Parallel Block Jacobi SVD Algorithm Gabriel Okša 1, Marián Vajteršic
More informationImage preprocessing in spatial domain
Image preprocessing in spatial domain Sampling theorem, aliasing, interpolation, geometrical transformations Revision: 1.4, dated: May 25, 2006 Tomáš Svoboda Czech Technical University, Faculty of Electrical
More information