SIAM OP 08 Mathematics Meets Medicine – An Optimal Alignment

(modersit@cas.mcmaster.ca). Abstract Image registration is the process of aligning two or more images of the same scene taken at different times, from different viewpoints and/or by different sensors. Image registration is a crucial step in imaging problems where the valuable information is contained in more than one image. Here, spatial alignment is required to properly integrate useful information from the separate images. It is the goal of this note to give an overview on modern techniques in this area. It turns out that the registration problem is an inverse problem which requires regularization and the use of modern optimization methods. We address these issues and supplement it by real-life examples.

[1]  Kent Andersen,et al.  Split closure and intersection cuts , 2002, Math. Program..

[2]  Michel X. Goemans,et al.  Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..

[3]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[4]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[5]  Gérard Cornuéjols,et al.  On the relative strength of split, triangle and quadrilateral cuts , 2009, Math. Program..

[6]  Claus-Peter Schnorr,et al.  Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.

[7]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[8]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[9]  Laurence A. Wolsey,et al.  Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.

[10]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[11]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[12]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[13]  Gérard Cornuéjols,et al.  Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..

[14]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[15]  Markus Jorg.  k-Disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs , 2007 .

[16]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[17]  W. Murray.  SIAG/OPT Views and News , 2005 .

[18]  Claude-Alain Burdet,et al.  A subadditive approach to the group problem of integer programming , 1974 .

[19]  Gérard Cornuéjols,et al.  On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..

[20]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[21]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[22]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[23]  L. Lovász,et al.  Annals of Discrete Mathematics , 1986 .

[24]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.