F3-A2/F3-A3: Tensor-based formulation for Spectral Computed Tomography (CT) with novel regularization techniques
|
|
- Grant Freeman
- 5 years ago
- Views:
Transcription
1 F3-A2/F3-A3: Tensor-based formulation for Spectral Computed Tomography (CT) with novel regularization techniques Abstract Spectral computed tomography (CT) has become possible with the development of photon counting X-ray detector technology. Energy selective measurement capabilities of these devices open the doors to many exciting directions in CT research. In this work we assume perfect energy resolution at detectors, which results in a family of monochromatic CT problems. We propose a tensor based iterative algorithm that simultaneously reconstructs the X-ray attenuation distribution for each energy level. Specifically, we model the multi-spectral unknown as a 3rd order tensor where first two dimensions are in space and the 3rd dimension is in energy. This approach allows the design of a regularizer based on low rank assumptions on the multi-spectral unknown where we apply tensor spectral norm penalties. In addition, when accompanied to total variation (TV) it enhances the regularization capability and provides superior reconstructions. Additionally, we have developed an adaptively weighted L2 norm regularizer with excellent edge preserving capabilities. The problem is cast as a convex optimization problem that is solved using the alternating direction method of multipliers (ADMM). Simulation results show that the proposed regularizer is applicable to the spectral CT problem and reliable in recovering multi-linear structures in an inverse problem set up. I. PARTICIPANTS Faculty/Staff Name Title Institution Phone Eric Miller Professor Tufts University eric.miller@tufts edu Brian Tracey Research Assistant Tufts University btracey@eecs.tufts Professor edu Students Name Degree Pursued Institution Intended Year of Graduation Oguz Semerici PhD Tufts University Oguz.Semerci@ tufts.edu 2012 II. PROJECT OVERVIEW AND SIGNIFICANCE Preventing the access of explosive materials to aviation facilities is the first step of airport security. Therefore, automatic detection of explosives is crucial. This aim of this project is to design X-ray CT image formation methods with potential application for luggage screening in airports. Our work introduces a novel iterative algorithm for spectral CT problem. Accurate identification of the spectral characteristics of the medium under investigation is required as the first step to material characterization. Our approach is specifically designed to increase the detection probability of explosives as well as to decrease the false alarm rate.
2 III. RESEARCH AND EDUCATION ACTIVITY A. State-of-the-Art and Technical Approach A conventional computed tomography (CT) imaging system utilizes energy integrating detector technology [1] and provides a monochromatic reconstruction of the linear attenuation coefficient distribution of an object under investigation. The polychromatic nature of the X-ray spectra is either neglected [2], [3] or incorporated into the model in an iterative reconstruction method to achieve more accurate results [4], [5]. Energy resolving (photon counting) detector technology [6], on the other hand, provides the possibility of energy selective measurement and opens the door to spectral CT technology. Spectral CT promises improved diagnostic imaging [7], [8] and applicability to the security domain [9] due to the contrast enhancement and material characterization capabilities. In this work, we propose an iterative reconstruction method for the spectral CT problem where we model the multi spectral unknown as a low rank 3rd order tensor. Recently, there has been considerable work on recovering corrupted matrices or tensors based on low-rank and sparse decomposition [10] or solely on low-rank assumptions [11], [12], [13], [14]. Our goal here is to adopt the generalized tensor rank formulation [15] to regularize the spectral CT problem. Similar studies where the multi spectral unknown is modeled as a superposition of low rank and sparse matrices had been conducted for 4D cone beam CT [16] and spectral tomography [17]. In these approaches, the multi spectral unknown is represented as a matrix with row dimension in space and column dimension in energy. Applying the low rank prior to the multi-spectral matrix is a special case of our tensor model where only the unfolding in the energy dimension is considered. However, more powerful regularization can be achieved, especially when the number of energy bins is limited, if the redundancy in the spatial dimensions is exploited with the incorporation of unfoldings in spatial dimensions [14]. One of the purposes of this work is to investigate the effect of low-rank assumptions on the unfoldings in the spatial dimensions. At the photon counting detectors the photons in the polychromatic spectrum are classified into energy bins. If we assume perfect energy resolution (i.e., infinitesimal bin width) the polychromatic X-ray CT problem reduces to N E linear monochromatic problems: Ax i = y i + n i, i = 1,..., N E Here A is the CT system matrix discretizing the Radon transform, x i is the vectorized 2D linear attenuation coefficient image, n i is the noise 1 vector and y i is the measurement vector for the i th energy bin. Let us define the 3rd order tensor where N1 and N2 are the number of pixels in spatial dimensions. Note that can be obtained by lexicographical ordering of the N 1 x N 2 attenuation distribution (frontal slice) at the i th energy. A depiction of the multi-spectral phantom used in this study along with the corresponding attenuation curves are given in Figure 1. With this notation we can define the forward operator K in a block diagonal form as follows: Figure 1: (Left) Polyenergetic phantom to be recovered from processing. (Right) Attenuation curves of matericals present in phantom. For the tensor unfolding the mode-k is a matrix whose
3 columns are mode-k fibers, where mode-k fibers are vectors in R Nk that are obtained by varying the index in k th dimension and fixing the others [18]. It is easy to visualize unfolding operations in terms of frontal, horizontal and lateral slices. Figure 2 depicts the 1st and 2nd unfoldings for a 3 rd order tensor. Matrix 2: The polyenergetic phantom is viewed as a rank three tensor, whose unfoldings (arramgent of entries into matix form) provides the basis for our novel regularization methods. The nuclear norm of a matrix X is defined as where σ i s are the singular values. It is shown that the nuclear norm provides the tightest convex relaxation for the rank operation in matrices [12]. Consequently, convex optimization methods for low-rank matrix completion and rank estimation via minimization of the nuclear norm [12] were proposed. This idea has been generalized to tensors for an N-way tensor [15] as: Except for K-edge materials X-ray attenuation at neighboring energies are highly correlated. Therefore, for spectral CT, one expects the third unfolding x 3 to be low-rank [17]. However, structural redundancies can also be exploited by enforcing low-rank structure on other two unfoldings. To this end, we use a more general form of the tensor nuclear norm as a regularizer: In addition to the nuclear norm regularizer, this year we have also developed a new, weighted L2 type regularizer designed to perform edge enhancement within the context of standard linear least squares processing algorithms. The regularizer is defined as: where is discrete gradient operator in x and y directions and is the diagonal weighting matrix with (W) ii s close to one if the i th pixel is an edge and zero otherwise. As the location of edges is not known a prior, W is constructed in an iterative manner. We now use a slight abuse of notation and rename WD as D k where k refers to the iteration count. The reconstruction algorithm solves series of minimization problems and at each step it updates according to the results from previous step as follows: Here f: [01] -> [01] is monotonic decreasing function that adaptively generates weights inversely propor-
4 tional to the edge magnitude. We suggest two functions, which are demonstrated in Figure 3, for these purposes. We seek a solution for the spectral CT problem via the convex optimization problem: where R(x) is replaced by R L2 (x) or total variation regularizer (TV) regularizer for comparison purposes. We compared following methods Figure 3. in our simulations: 1. Filtered back projection (FBP) algorithm applied to each energy bin separately. 2. Only TV regularization at each energy bin separately (i.e., λ 1 = 0 and R (x) = TV (x)). 3. Only nuclear norm regularization (i.e., λ 2 = 0). 4. TV and nuclear norm regularization (i.e., R(x) = R L2 (x)) Figure 4 - Ground Truth 80,20 kev 5. Weighted L2 and nuclear norm regularization (i.e., R(x) = TV (x)) We simulated multi-spectral data for 12 energies between 20 and 80 kev with 60dB SNR for 16 uniformly distributed angles between 0 and 180 degrees. We have added some texture on the objects and a small linear variation to the background of the phantom (128x128 pixels) given in Figure 1. The ground truth images for 20 and 80 kev bins are given in Fig. 4. Fig. 5 shows reconstruction results for 20 and 80 kev images. Figure 5 - Reconstructions with methods given above. IV. FUTURE PLANS The current approach can be extended to the detection of explosives by inducing the prior knowledge of their different chemical properties. Future research will be dedicated to the development of such priors.
5 V. LEVERAGING OF RESOURCES We have been in contact with Analogic Corporation concerning collaboration on this project. Dr. Miller and Mr. Semerci visited Analogic in November 2012 to discuss acquiring data from their scanners and the associated models for use in our processing schemes that could be used to further validate the methods we are developing. To date, intellectual property issues have prevented this collaboration from moving forward. VI. DOCUMENTATION A. Publications and Conference Presentations 1. Oguz Semerci and Eric Miller, An iterative reconstruction method for spectral CT with tensor based formulation and nuclear norm regularization, International Conference on Image Formation in X ray Computed Tomography, 2012, Salt Lake City, USA. 2. O. Semerci, N. Hao, M. E. Kilmer, and E. Miller, Tensor-based Formulation for Spectral Computed Tomography, 2012 SIAM Conference on Imaging Science, May 20-22, 2012, Philadelphia PA. 3. O. Semerici and E. L. Miller, Parametric Level Set Approach to Simultaneous Object Identification and Background Reconstruction for Dual Energy Computed Tomography, IEEE Transactions on Image Processing, Vol. 21, No. 5, pp , May Oguz Semerci and Eric Miller, Tensor-based formulation for Spectral Computed Tomography (CT) with novel regularization techniques. To be submitted to Inverse Problems. B. Technology Transfer We are in the process of filing a provisional patent for the weighted L2 regularizer. C. Seminars, Workshops and Short Courses Prof. Miller and Mr. Semerci has presented this work as part of the following seminars over the past 12 months: 1. E. L. Miller, Model-Based Ideas for Sensor Fusion, Algorithm Development for Security Applications (ADSA) Workshop 06: Development of Fused Explosive Detection Equipment with Specific Application to Advanced Imaging Technology, November 8-9, 2011, Northeastern University, Boston, MA 2. E. Miller, Model-Based, Variational Methods for Segmentation with Applications to Inverse Problems, Lawrence Livermore National Laboratory Seminar, January 26, O. Semerci and E. L. Miller, Iterative Reconstruction Methods for Dual and Multi Energy Computed Tomography, Algorithm Development for Security Applications (ADSA) Workshop Development of Fused Explosive Detection Equipment with Specific Application to Advanced Imaging Technology, May 15-16, 2012, Northeastern University, Boston, MA VII. REFERENCES [1] B. Whiting, P. Massoumzadeh, O. Earl, J. O Sullivan, D. Snyder, and J. Williamson, Properties of preprocessed sinogram data in X-ray computed tomography, Medical physics, vol. 33, p. 3290, [2] C. Bouman and K. Sauer, A unified approach to statistical tomography using coordinate descent optimization, Image Processing, IEEE Transactions on, vol. 5, no. 3, pp , mar [3] X. Pan, E. Sidky, and M. Vannier, Why do commercial ct scanners still employ traditional, filtered back-
6 projection for image reconstruction? Inverse problems, vol. 25, p , [4] I. Elbakri and J. Fessler, Statistical image reconstruction for polyenergetic X-ray computed tomography, Medical Imaging, IEEE Transactions on, vol. 21, no. 2, pp , [5] O. Semerci and E. Miller, A parametric level-set approach to simultaneous object identification and background reconstruction for dual energy computed tomography, Image Processing, IEEE Transactions on, vol. 21, no. 5, pp , may [6] P. Shikhaliev, Energy-resolved computed tomography: first experimental results, Physics in medicine and biology, vol. 53, p. 5595, [7] P. Shikhaliev and S. Fritz, Photon counting spectral ct versus conventional ct: comparative evaluation for breast imaging application, Physics in medicine and biology, vol. 56, p. 1905, [8] J. Schlomka, E. Roessl, R. Dorscheid, S. Dill, G. Martens, T. Istel, C. B aumer, C. Herrmann, R. Steadman, G. Zeitler et al., Experimental feasibility of multi-energy photon-counting k-edge imaging in pre-clinical computed tomography, Physics in medicine and biology, vol. 53, p. 4031, [9] V. Ivakhnenko, A novel quasi-linearization method for ct image reconstruction in scanners with a multienergy detector system, Nuclear Science, IEEE Transactions on, vol. 57, no. 2, pp , [10] E. Candes, X. Li, Y. Ma, and J. Wright, Robust principal component analysis? Arxiv preprint ArXiv: , [11] J. Cai, E. Candes, and Z. Shen, A singular value thresholding algorithm for matrix completion, Arxiv preprint Arxiv: , [12] E. Cand`es and B. Recht, Exact matrix completion via convex optimization, Foundations of Computational Mathematics, vol. 9, no. 6, pp , [13] R. Tomioka, K. Hayashi, and H. Kashima, Estimation of low-rank tensors via convex optimization, Arxiv preprint arxiv: , [14] J. Liu, P. Musialski, P. Wonka, and J. Ye, Tensor completion for estimating missing values in visual data, in Computer Vision, 2009 IEEE 12th International Conference on. IEEE, 2009, pp [15] M. Signoretto, L. De Lathauwer, and J. Suykens, Nuclear norms for tensors and their use for convex multilinear estimation, Technical Report , ESAT-SISTA, K.U.Leuven, [16] J. Cai, X. Jia, H. Gao, S. Jiang, Z. Shen, and H. Zhao, Cine cone beam ct reconstruction using low-rank matrix factorization: algorithm and a proof-of-princple study, Arxiv preprint arxiv: , [17] H. Gao, H. Yu, S. Osher, and G. Wang, Multi-energy ct based on a prior rank, intensity and sparsity model (prism), Inverse problems, vol. 27, p , [18] T. Kolda and B. Bader, Tensor decompositions and applications, SIAM review, vol. 51, no. 3, p. 455, 2009.
Novel methods for multilinear data completion and de-noising based on tensor-svd
Novel methods for multilinear data completion and de-noising based on tensor-svd Zemin Zhang, Gregory Ely, Shuchin Aeron Department of ECE, Tufts University Medford, MA 02155 zemin.zhang@tufts.com gregoryely@gmail.com
More informationLow-Rank Tensor Completion by Truncated Nuclear Norm Regularization
Low-Rank Tensor Completion by Truncated Nuclear Norm Regularization Shengke Xue, Wenyuan Qiu, Fan Liu, and Xinyu Jin College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou,
More informationTensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization
Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization Canyi Lu 1, Jiashi Feng 1, Yudong Chen, Wei Liu 3, Zhouchen Lin 4,5,, Shuicheng Yan 6,1
More informationR4-B.2: Multi-energy, Limited View Computed Tomography (CT)
R4-B.2: Multi-energy, Limited View Computed Tomography (CT) I. PARTICIPANTS Faculty/Staff Name Title Institution Email Eric Miller PI Tufts University eric.miller@tufts.edu Brian Tracey Professor of the
More informationA Randomized Approach for Crowdsourcing in the Presence of Multiple Views
A Randomized Approach for Crowdsourcing in the Presence of Multiple Views Presenter: Yao Zhou joint work with: Jingrui He - 1 - Roadmap Motivation Proposed framework: M2VW Experimental results Conclusion
More informationCSC 576: Variants of Sparse Learning
CSC 576: Variants of Sparse Learning Ji Liu Department of Computer Science, University of Rochester October 27, 205 Introduction Our previous note basically suggests using l norm to enforce sparsity in
More informationSupplementary Material of A Novel Sparsity Measure for Tensor Recovery
Supplementary Material of A Novel Sparsity Measure for Tensor Recovery Qian Zhao 1,2 Deyu Meng 1,2 Xu Kong 3 Qi Xie 1,2 Wenfei Cao 1,2 Yao Wang 1,2 Zongben Xu 1,2 1 School of Mathematics and Statistics,
More informationApplication of Tensor and Matrix Completion on Environmental Sensing Data
Application of Tensor and Matrix Completion on Environmental Sensing Data Michalis Giannopoulos 1,, Sofia Savvaki 1,, Grigorios Tsagkatakis 1, and Panagiotis Tsakalides 1, 1- Institute of Computer Science
More informationA FISTA-like scheme to accelerate GISTA?
A FISTA-like scheme to accelerate GISTA? C. Cloquet 1, I. Loris 2, C. Verhoeven 2 and M. Defrise 1 1 Dept. of Nuclear Medicine, Vrije Universiteit Brussel 2 Dept. of Mathematics, Université Libre de Bruxelles
More information2D X-Ray Tomographic Reconstruction From Few Projections
2D X-Ray Tomographic Reconstruction From Few Projections Application of Compressed Sensing Theory CEA-LID, Thalès, UJF 6 octobre 2009 Introduction Plan 1 Introduction 2 Overview of Compressed Sensing Theory
More informationSupplemental Figures: Results for Various Color-image Completion
ANONYMOUS AUTHORS: SUPPLEMENTAL MATERIAL (NOVEMBER 7, 2017) 1 Supplemental Figures: Results for Various Color-image Completion Anonymous authors COMPARISON WITH VARIOUS METHODS IN COLOR-IMAGE COMPLETION
More informationResearch Article Exact Interior Reconstruction with Cone-Beam CT
Biomedical Imaging Volume 2007, Article ID 10693, 5 pages doi:10.1155/2007/10693 Research Article Exact Interior Reconstruction with Cone-Beam CT Yangbo Ye, 1 Hengyong Yu, 2 and Ge Wang 2 1 Department
More informationA Characterization of Sampling Patterns for Union of Low-Rank Subspaces Retrieval Problem
A Characterization of Sampling Patterns for Union of Low-Rank Subspaces Retrieval Problem Morteza Ashraphijuo Columbia University ashraphijuo@ee.columbia.edu Xiaodong Wang Columbia University wangx@ee.columbia.edu
More informationMAP Reconstruction From Spatially Correlated PET Data
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL 50, NO 5, OCTOBER 2003 1445 MAP Reconstruction From Spatially Correlated PET Data Adam Alessio, Student Member, IEEE, Ken Sauer, Member, IEEE, and Charles A Bouman,
More informationTruncation Strategy of Tensor Compressive Sensing for Noisy Video Sequences
Journal of Information Hiding and Multimedia Signal Processing c 2016 ISSN 207-4212 Ubiquitous International Volume 7, Number 5, September 2016 Truncation Strategy of Tensor Compressive Sensing for Noisy
More informationTensor Low-Rank Completion and Invariance of the Tucker Core
Tensor Low-Rank Completion and Invariance of the Tucker Core Shuzhong Zhang Department of Industrial & Systems Engineering University of Minnesota zhangs@umn.edu Joint work with Bo JIANG, Shiqian MA, and
More informationTwo-Material Decomposition From a Single CT Scan Using Statistical Image Reconstruction
/ 5 Two-Material Decomposition From a Single CT Scan Using Statistical Image Reconstruction Yong Long and Jeffrey A. Fessler EECS Department James M. Balter Radiation Oncology Department The University
More informationSome Optimization and Statistical Learning Problems in Structural Biology
Some Optimization and Statistical Learning Problems in Structural Biology Amit Singer Princeton University, Department of Mathematics and PACM January 8, 2013 Amit Singer (Princeton University) January
More informationCompressive Sensing (CS)
Compressive Sensing (CS) Luminita Vese & Ming Yan lvese@math.ucla.edu yanm@math.ucla.edu Department of Mathematics University of California, Los Angeles The UCLA Advanced Neuroimaging Summer Program (2014)
More informationSelf-Calibration and Biconvex Compressive Sensing
Self-Calibration and Biconvex Compressive Sensing Shuyang Ling Department of Mathematics, UC Davis July 12, 2017 Shuyang Ling (UC Davis) SIAM Annual Meeting, 2017, Pittsburgh July 12, 2017 1 / 22 Acknowledgements
More informationGeneralized Higher-Order Tensor Decomposition via Parallel ADMM
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Generalized Higher-Order Tensor Decomposition via Parallel ADMM Fanhua Shang 1, Yuanyuan Liu 2, James Cheng 1 1 Department of
More informationRecovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
July 12, 212 Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies Morteza Mardani Dept. of ECE, University of Minnesota, Minneapolis, MN 55455 Acknowledgments:
More informationCombining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation
UIUC CSL Mar. 24 Combining Sparsity with Physically-Meaningful Constraints in Sparse Parameter Estimation Yuejie Chi Department of ECE and BMI Ohio State University Joint work with Yuxin Chen (Stanford).
More information3D INTERPOLATION USING HANKEL TENSOR COMPLETION BY ORTHOGONAL MATCHING PURSUIT A. Adamo, P. Mazzucchelli Aresys, Milano, Italy
3D INTERPOLATION USING HANKEL TENSOR COMPLETION BY ORTHOGONAL MATCHING PURSUIT A. Adamo, P. Mazzucchelli Aresys, Milano, Italy Introduction. Seismic data are often sparsely or irregularly sampled along
More informationTensor-Tensor Product Toolbox
Tensor-Tensor Product Toolbox 1 version 10 Canyi Lu canyilu@gmailcom Carnegie Mellon University https://githubcom/canyilu/tproduct June, 018 1 INTRODUCTION Tensors are higher-order extensions of matrices
More informationNonnegative Tensor Factorization using a proximal algorithm: application to 3D fluorescence spectroscopy
Nonnegative Tensor Factorization using a proximal algorithm: application to 3D fluorescence spectroscopy Caroline Chaux Joint work with X. Vu, N. Thirion-Moreau and S. Maire (LSIS, Toulon) Aix-Marseille
More informationLow Rank Matrix Completion Formulation and Algorithm
1 2 Low Rank Matrix Completion and Algorithm Jian Zhang Department of Computer Science, ETH Zurich zhangjianthu@gmail.com March 25, 2014 Movie Rating 1 2 Critic A 5 5 Critic B 6 5 Jian 9 8 Kind Guy B 9
More informationRobust Principal Component Analysis
ELE 538B: Mathematics of High-Dimensional Data Robust Principal Component Analysis Yuxin Chen Princeton University, Fall 2018 Disentangling sparse and low-rank matrices Suppose we are given a matrix M
More informationA Primal-dual Three-operator Splitting Scheme
Noname manuscript No. (will be inserted by the editor) A Primal-dual Three-operator Splitting Scheme Ming Yan Received: date / Accepted: date Abstract In this paper, we propose a new primal-dual algorithm
More information/16/$ IEEE 1728
Extension of the Semi-Algebraic Framework for Approximate CP Decompositions via Simultaneous Matrix Diagonalization to the Efficient Calculation of Coupled CP Decompositions Kristina Naskovska and Martin
More informationApproximate Low-Rank Tensor Learning
Approximate Low-Rank Tensor Learning Yaoliang Yu Dept of Machine Learning Carnegie Mellon University yaoliang@cs.cmu.edu Hao Cheng Dept of Electric Engineering University of Washington kelvinwsch@gmail.com
More informationNeural Network Approach for Photon-counting Detection The First Step: PPE Correction
Neural Network Approach for Photon-counting Detection The First Step: PPE Correction Ruibin Feng, Ph.D. Biomedical Imaging Center, CBIS/BME, RPI fengr@rpi.edu David Rundle JairiNovus Technologies Ltd.
More informationStructured matrix factorizations. Example: Eigenfaces
Structured matrix factorizations Example: Eigenfaces An extremely large variety of interesting and important problems in machine learning can be formulated as: Given a matrix, find a matrix and a matrix
More informationA Modular NMF Matching Algorithm for Radiation Spectra
A Modular NMF Matching Algorithm for Radiation Spectra Melissa L. Koudelka Sensor Exploitation Applications Sandia National Laboratories mlkoude@sandia.gov Daniel J. Dorsey Systems Technologies Sandia
More informationMulti-energy CT: Future Directions. Acknowledgements. Overview 7/23/2014. Taly Gilat Schmidt, PhD. Kevin Zimmerman Franco Rupcich Steven Haworth
Multi-energy CT: Future Directions Taly Gilat Schmidt, PhD Department of Biomedical Engineering Marquette University Acknowledgements Kevin Zimmerman Franco Rupcich Steven Haworth Results in this talk:
More informationAdaptive Corrected Procedure for TVL1 Image Deblurring under Impulsive Noise
Adaptive Corrected Procedure for TVL1 Image Deblurring under Impulsive Noise Minru Bai(x T) College of Mathematics and Econometrics Hunan University Joint work with Xiongjun Zhang, Qianqian Shao June 30,
More informationRIP-based performance guarantee for low tubal rank tensor recovery
RIP-based performance guarantee for low tubal rank tensor recovery Feng Zhang a, Wendong Wang a, Jianwen Huang a, Jianjun Wang a,b, a School of Mathematics and Statistics, Southwest University, Chongqing
More informationSuperiorized Inversion of the Radon Transform
Superiorized Inversion of the Radon Transform Gabor T. Herman Graduate Center, City University of New York March 28, 2017 The Radon Transform in 2D For a function f of two real variables, a real number
More informationCoordinate Update Algorithm Short Course Operator Splitting
Coordinate Update Algorithm Short Course Operator Splitting Instructor: Wotao Yin (UCLA Math) Summer 2016 1 / 25 Operator splitting pipeline 1. Formulate a problem as 0 A(x) + B(x) with monotone operators
More informationA Tensor Completion Approach for Efficient and Robust Fingerprint-based Indoor Localization
A Tensor Completion Approach for Efficient and Robust Fingerprint-based Indoor Localization Yu Zhang, Xiao-Yang Liu Shanghai Institute of Measurement and Testing Technology, China Shanghai Jiao Tong University,
More informationSeismic data interpolation and denoising using SVD-free low-rank matrix factorization
Seismic data interpolation and denoising using SVD-free low-rank matrix factorization R. Kumar, A.Y. Aravkin,, H. Mansour,, B. Recht and F.J. Herrmann Dept. of Earth and Ocean sciences, University of British
More informationFactor Matrix Trace Norm Minimization for Low-Rank Tensor Completion
Factor Matrix Trace Norm Minimization for Low-Rank Tensor Completion Yuanyuan Liu Fanhua Shang Hong Cheng James Cheng Hanghang Tong Abstract Most existing low-n-rank imization algorithms for tensor completion
More informationENGG5781 Matrix Analysis and Computations Lecture 10: Non-Negative Matrix Factorization and Tensor Decomposition
ENGG5781 Matrix Analysis and Computations Lecture 10: Non-Negative Matrix Factorization and Tensor Decomposition Wing-Kin (Ken) Ma 2017 2018 Term 2 Department of Electronic Engineering The Chinese University
More informationExact Low-rank Matrix Recovery via Nonconvex M p -Minimization
Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Lingchen Kong and Naihua Xiu Department of Applied Mathematics, Beijing Jiaotong University, Beijing, 100044, People s Republic of China E-mail:
More informationPotentials for Dual-energy kv/mv On-board Imaging and Therapeutic Applications
Potentials for Dual-energy kv/mv On-board Imaging and Therapeutic Applications Fang-Fang Yin Department of Radiation Oncology Duke University Medical Center Acknowledgement Dr Hao Li for his excellent
More informationOptimized first-order minimization methods
Optimized first-order minimization methods Donghwan Kim & Jeffrey A. Fessler EECS Dept., BME Dept., Dept. of Radiology University of Michigan web.eecs.umich.edu/~fessler UM AIM Seminar 2014-10-03 1 Disclosure
More informationHamburger Beiträge zur Angewandten Mathematik
Hamburger Beiträge zur Angewandten Mathematik Error Estimates for Filtered Back Projection Matthias Beckmann and Armin Iske Nr. 2015-03 January 2015 Error Estimates for Filtered Back Projection Matthias
More informationNonlinear Flows for Displacement Correction and Applications in Tomography
Nonlinear Flows for Displacement Correction and Applications in Tomography Guozhi Dong 1 and Otmar Scherzer 1,2 1 Computational Science Center, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Wien,
More informationA Convex Approach for Designing Good Linear Embeddings. Chinmay Hegde
A Convex Approach for Designing Good Linear Embeddings Chinmay Hegde Redundancy in Images Image Acquisition Sensor Information content
More informationAn Effective Tensor Completion Method Based on Multi-linear Tensor Ring Decomposition
An Effective Tensor Completion Method Based on Multi-linear Tensor Ring Decomposition Jinshi Yu, Guoxu Zhou, Qibin Zhao and Kan Xie School of Automation, Guangdong University of Technology, Guangzhou,
More informationAn Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion
An Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion Robert M. Freund, MIT joint with Paul Grigas (UC Berkeley) and Rahul Mazumder (MIT) CDC, December 2016 1 Outline of Topics
More informationMaximal Entropy for Reconstruction of Back Projection Images
Maximal Entropy for Reconstruction of Back Projection Images Tryphon Georgiou Department of Electrical and Computer Engineering University of Minnesota Minneapolis, MN 5545 Peter J Olver Department of
More informationCVPR A New Tensor Algebra - Tutorial. July 26, 2017
CVPR 2017 A New Tensor Algebra - Tutorial Lior Horesh lhoresh@us.ibm.com Misha Kilmer misha.kilmer@tufts.edu July 26, 2017 Outline Motivation Background and notation New t-product and associated algebraic
More informationSolving Corrupted Quadratic Equations, Provably
Solving Corrupted Quadratic Equations, Provably Yuejie Chi London Workshop on Sparse Signal Processing September 206 Acknowledgement Joint work with Yuanxin Li (OSU), Huishuai Zhuang (Syracuse) and Yingbin
More informationMinimizing the Difference of L 1 and L 2 Norms with Applications
1/36 Minimizing the Difference of L 1 and L 2 Norms with Department of Mathematical Sciences University of Texas Dallas May 31, 2017 Partially supported by NSF DMS 1522786 2/36 Outline 1 A nonconvex approach:
More informationProbabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms Adrien Todeschini Inria Bordeaux JdS 2014, Rennes Aug. 2014 Joint work with François Caron (Univ. Oxford), Marie
More informationGeneralized Orthogonal Matching Pursuit- A Review and Some
Generalized Orthogonal Matching Pursuit- A Review and Some New Results Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur, INDIA Table of Contents
More informationarxiv: v1 [cs.cv] 7 Jan 2019
Truncated nuclear norm regularization for low-rank tensor completion Shengke Xue, Wenyuan Qiu, Fan Liu, Xinyu Jin College of Information Science and Electronic Engineering, Zhejiang University, No 38 Zheda
More informationStructured tensor missing-trace interpolation in the Hierarchical Tucker format Curt Da Silva and Felix J. Herrmann Sept. 26, 2013
Structured tensor missing-trace interpolation in the Hierarchical Tucker format Curt Da Silva and Felix J. Herrmann Sept. 6, 13 SLIM University of British Columbia Motivation 3D seismic experiments - 5D
More informationEE364b Convex Optimization II May 30 June 2, Final exam
EE364b Convex Optimization II May 30 June 2, 2014 Prof. S. Boyd Final exam By now, you know how it works, so we won t repeat it here. (If not, see the instructions for the EE364a final exam.) Since you
More informationTENSOR COMPLETION VIA ADAPTIVE SAMPLING OF TENSOR FIBERS: APPLICATION TO EFFICIENT INDOOR RF FINGERPRINTING
TENSOR COMPLETION VIA ADAPTIVE SAMPLING OF TENSOR FIBERS: APPLICATION TO EFFICIENT INDOOR RF FINGERPRINTING Xiao-Yang Liu 1,4, Shuchin Aeron 2, Vaneet Aggarwal 3, Xiaodong Wang 4 and, Min-You Wu 1 1 Shanghai-Jiatong
More informationAQA Physics /7408
AQA Physics - 7407/7408 Module 10: Medical physics You should be able to demonstrate and show your understanding of: 10.1 Physics of the eye 10.1.1 Physics of vision The eye as an optical refracting system,
More informationGeneralized Tensor Total Variation Minimization for Visual Data Recovery
Generalized Tensor Total Variation Minimization for Visual Data Recovery Xiaojie Guo 1 and Yi Ma 2 1 State Key Laboratory of Information Security IIE CAS Beijing 193 China 2 School of Information Science
More informationA Riemannian Framework for Denoising Diffusion Tensor Images
A Riemannian Framework for Denoising Diffusion Tensor Images Manasi Datar No Institute Given Abstract. Diffusion Tensor Imaging (DTI) is a relatively new imaging modality that has been extensively used
More informationPHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION. A Thesis MELTEM APAYDIN
PHASE RETRIEVAL OF SPARSE SIGNALS FROM MAGNITUDE INFORMATION A Thesis by MELTEM APAYDIN Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the
More informationSome tensor decomposition methods for machine learning
Some tensor decomposition methods for machine learning Massimiliano Pontil Istituto Italiano di Tecnologia and University College London 16 August 2016 1 / 36 Outline Problem and motivation Tucker decomposition
More informationProbabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms François Caron Department of Statistics, Oxford STATLEARN 2014, Paris April 7, 2014 Joint work with Adrien Todeschini,
More informationNew perspectives in X-ray detection of concealed illicit materials brought by CdTe/CdZnTe spectrometric detectors
New perspectives in X-ray detection of concealed illicit materials brought by CdTe/CdZnTe spectrometric detectors Jean-Marc Dinten, Jean-Louis Amans, Loïck Verger, Olivier Peyret CEA-LETI, MINATEC, Recherche
More informationMatrix completion: Fundamental limits and efficient algorithms. Sewoong Oh Stanford University
Matrix completion: Fundamental limits and efficient algorithms Sewoong Oh Stanford University 1 / 35 Low-rank matrix completion Low-rank Data Matrix Sparse Sampled Matrix Complete the matrix from small
More informationStatistical Performance of Convex Tensor Decomposition
Slides available: h-p://www.ibis.t.u tokyo.ac.jp/ryotat/tensor12kyoto.pdf Statistical Performance of Convex Tensor Decomposition Ryota Tomioka 2012/01/26 @ Kyoto University Perspectives in Informatics
More informationA Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices Ryota Tomioka 1, Taiji Suzuki 1, Masashi Sugiyama 2, Hisashi Kashima 1 1 The University of Tokyo 2 Tokyo Institute of Technology 2010-06-22
More informationFrequency-Domain Rank Reduction in Seismic Processing An Overview
Frequency-Domain Rank Reduction in Seismic Processing An Overview Stewart Trickett Absolute Imaging Inc. Summary Over the last fifteen years, a new family of matrix rank reduction methods has been developed
More informationLow-rank Matrix Completion with Noisy Observations: a Quantitative Comparison
Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison Raghunandan H. Keshavan, Andrea Montanari and Sewoong Oh Electrical Engineering and Statistics Department Stanford University,
More informationAnalysis of Robust PCA via Local Incoherence
Analysis of Robust PCA via Local Incoherence Huishuai Zhang Department of EECS Syracuse University Syracuse, NY 3244 hzhan23@syr.edu Yi Zhou Department of EECS Syracuse University Syracuse, NY 3244 yzhou35@syr.edu
More informationEE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)
EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement to the material discussed in
More informationCollaborative Filtering
Case Study 4: Collaborative Filtering Collaborative Filtering Matrix Completion Alternating Least Squares Machine Learning/Statistics for Big Data CSE599C1/STAT592, University of Washington Carlos Guestrin
More informationMatrix Completion for Structured Observations
Matrix Completion for Structured Observations Denali Molitor Department of Mathematics University of California, Los ngeles Los ngeles, C 90095, US Email: dmolitor@math.ucla.edu Deanna Needell Department
More informationMetal Artifact Reduction and Dose Efficiency Improvement on Photon Counting Detector CT using an Additional Tin Filter
Metal Artifact Reduction and Dose Efficiency Improvement on Photon Counting Detector CT using an Additional Tin Filter Wei Zhou, Dilbar Abdurakhimova, Kishore Rajendran, Cynthia McCollough, Shuai Leng
More informationPostgraduate Course Signal Processing for Big Data (MSc)
Postgraduate Course Signal Processing for Big Data (MSc) Jesús Gustavo Cuevas del Río E-mail: gustavo.cuevas@upm.es Work Phone: +34 91 549 57 00 Ext: 4039 Course Description Instructor Information Course
More informationCollaborative Filtering Matrix Completion Alternating Least Squares
Case Study 4: Collaborative Filtering Collaborative Filtering Matrix Completion Alternating Least Squares Machine Learning for Big Data CSE547/STAT548, University of Washington Sham Kakade May 19, 2016
More informationFast Angular Synchronization for Phase Retrieval via Incomplete Information
Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department
More informationLow-tubal-rank Tensor Completion using Alternating Minimization
Low-tubal-rank Tensor Completion using Alternating Minimization Xiao-Yang Liu 1,2, Shuchin Aeron 3, Vaneet Aggarwal 4, and Xiaodong Wang 1 1 Department of Electrical Engineering, Columbia University, NY,
More informationMatrix Completion: Fundamental Limits and Efficient Algorithms
Matrix Completion: Fundamental Limits and Efficient Algorithms Sewoong Oh PhD Defense Stanford University July 23, 2010 1 / 33 Matrix completion Find the missing entries in a huge data matrix 2 / 33 Example
More informationOn Optimal Frame Conditioners
On Optimal Frame Conditioners Chae A. Clark Department of Mathematics University of Maryland, College Park Email: cclark18@math.umd.edu Kasso A. Okoudjou Department of Mathematics University of Maryland,
More informationSparse PCA with applications in finance
Sparse PCA with applications in finance A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon 1 Introduction
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon
More informationLecture Notes 10: Matrix Factorization
Optimization-based data analysis Fall 207 Lecture Notes 0: Matrix Factorization Low-rank models. Rank- model Consider the problem of modeling a quantity y[i, j] that depends on two indices i and j. To
More informationOptimal mass transport as a distance measure between images
Optimal mass transport as a distance measure between images Axel Ringh 1 1 Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden. 21 st of June 2018 INRIA, Sophia-Antipolis, France
More informationLearning with matrix and tensor based models using low-rank penalties
Learning with matrix and tensor based models using low-rank penalties Johan Suykens KU Leuven, ESAT-SCD/SISTA Kasteelpark Arenberg 10 B-3001 Leuven (Heverlee), Belgium Email: johan.suykens@esat.kuleuven.be
More informationX-ray scattering tomography for biological applications
Journal of X-Ray Science and Technology 19 (2011) 219 227 219 DOI 10.3233/XST-2011-0288 IOS Press X-ray scattering tomography for biological applications W. Cong and G. Wang Biomedical Imaging Division,
More informationA METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY
IJAMML 3:1 (015) 69-78 September 015 ISSN: 394-58 Available at http://scientificadvances.co.in DOI: http://dx.doi.org/10.1864/ijamml_710011547 A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE
More informationWhat is Image Deblurring?
What is Image Deblurring? When we use a camera, we want the recorded image to be a faithful representation of the scene that we see but every image is more or less blurry, depending on the circumstances.
More informationAn Optimization-based Approach to Decentralized Assignability
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016 Boston, MA, USA An Optimization-based Approach to Decentralized Assignability Alborz Alavian and Michael Rotkowitz Abstract
More informationWindow-based Tensor Analysis on High-dimensional and Multi-aspect Streams
Window-based Tensor Analysis on High-dimensional and Multi-aspect Streams Jimeng Sun Spiros Papadimitriou Philip S. Yu Carnegie Mellon University Pittsburgh, PA, USA IBM T.J. Watson Research Center Hawthorne,
More informationSingle-Trial Evoked Potentials Extraction Based on Sparsifying Transforms
Journal of Pharmacy and Pharmacology 3 (5) 556-56 doi:.765/38-5/5..3 D DAVID PUBLISHING Single-Trial Evoked Potentials Extraction Based on Sparsifying Transforms Nannan Yu, Qisheng Ding and Hanbing Lu.
More informationRegularizing inverse problems using sparsity-based signal models
Regularizing inverse problems using sparsity-based signal models Jeffrey A. Fessler William L. Root Professor of EECS EECS Dept., BME Dept., Dept. of Radiology University of Michigan http://web.eecs.umich.edu/
More informationEfficient Sparse Low-Rank Tensor Completion Using the Frank-Wolfe Algorithm
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) Efficient Sparse Low-Rank Tensor Completion Using the Frank-Wolfe Algorithm Xiawei Guo, Quanming Yao, James T. Kwok
More informationRelaxed linearized algorithms for faster X-ray CT image reconstruction
Relaxed linearized algorithms for faster X-ray CT image reconstruction Hung Nien and Jeffrey A. Fessler University of Michigan, Ann Arbor The 13th Fully 3D Meeting June 2, 2015 1/20 Statistical image reconstruction
More informationSparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach
Sparse Sensing in Colocated MIMO Radar: A Matrix Completion Approach Athina P. Petropulu Department of Electrical and Computer Engineering Rutgers, the State University of New Jersey Acknowledgments Shunqiao
More informationOptimisation Combinatoire et Convexe.
Optimisation Combinatoire et Convexe. Low complexity models, l 1 penalties. A. d Aspremont. M1 ENS. 1/36 Today Sparsity, low complexity models. l 1 -recovery results: three approaches. Extensions: matrix
More information