A Linear Optimal Transportation Framework for Quantifying and Visualizing Variations in Sets of Images

被引:109
作者
Wang, Wei [1 ]
Slepcev, Dejan [2 ]
Basu, Saurav [1 ]
Ozolek, John A. [3 ]
Rohde, Gustavo K. [4 ]
机构
[1] Carnegie Mellon Univ, Dept Biomed Engn, Ctr Bioimage Informat, Pittsburgh, PA 15213 USA
[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[3] Childrens Hosp Pittsburgh, Dept Pathol, Pittsburgh, PA 15224 USA
[4] Carnegie Mellon Univ, Ctr Bioimage Informat, Dept Biomed Engn, Dept Elect & Comp Engn,Lane Ctr Computat Biol, Pittsburgh, PA 15213 USA
基金
美国国家科学基金会;
关键词
Optimal transportation; Linear embedding; EARTH-MOVERS-DISTANCE; NUCLEAR-STRUCTURE; KANTOROVICH; REGISTRATION; MORPHOMETRY; BRAIN; FLOWS;
D O I
10.1007/s11263-012-0566-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Transportation-based metrics for comparing images have long been applied to analyze images, especially where one can interpret the pixel intensities (or derived quantities) as a distribution of 'mass' that can be transported without strict geometric constraints. Here we describe a new transportation-based framework for analyzing sets of images. More specifically, we describe a new transportation-related distance between pairs of images, which we denote as linear optimal transportation (LOT). The LOT can be used directly on pixel intensities, and is based on a linearized version of the Kantorovich-Wasserstein metric (an optimal transportation distance, as is the earth mover's distance). The new framework is especially well suited for computing all pairwise distances for a large database of images efficiently, and thus it can be used for pattern recognition in sets of images. In addition, the new LOT framework also allows for an isometric linear embedding, greatly facilitating the ability to visualize discriminant information in different classes of images. We demonstrate the application of the framework to several tasks such as discriminating nuclear chromatin patterns in cancer cells, decoding differences in facial expressions, galaxy morphologies, as well as sub cellular protein distributions.
引用
收藏
页码:254 / 269
页数:16
相关论文
共 44 条
[1]  
Ambrosio L., 2008, Lectures in Mathematics ETH Zurich
[2]   Minimizing flows for the Monge-Kantorovich problem [J].
Angenent, S ;
Haker, S ;
Tannenbaum, A .
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2003, 35 (01) :61-97
[3]  
[Anonymous], 2006, Pattern recognition and machine learning
[4]  
Barrett JW, 2009, INTERFACE FREE BOUND, V11, P201
[5]   Computing large deformation metric mappings via geodesic flows of diffeomorphisms [J].
Beg, MF ;
Miller, MI ;
Trouvé, A ;
Younes, L .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2005, 61 (02) :139-157
[6]  
Benamou JD, 2000, NUMER MATH, V84, P375, DOI 10.1007/s002119900117
[7]  
Bengtsson E., 1999, Medical Imaging Technology, V17, P203
[8]   A neural network classifier capable of recognizing the patterns of all major subcellular structures in fluorescence microscope images of HeLa cells [J].
Boland, MV ;
Murphy, RF .
BIOINFORMATICS, 2001, 17 (12) :1213-1223
[9]   Intensity-based image registration using earth mover's distance [J].
Chefd'hotel, Christophe ;
Bousquet, Guillaume .
MEDICAL IMAGING 2007: IMAGE PROCESSING, PTS 1-3, 2007, 6512
[10]  
Darrell T., 2004, P 2004 IEEE COMP SOC