The Trainable Alternating Gradient Shrinkage method
|
|
- Arleen Henry
- 5 years ago
- Views:
Transcription
1 The Trainable Alternating Gradient Shrinkage method Carlos Malanche, supervised by Ha Nguyen April 24, 2018 LIB (prof. Michael Unser), EPFL
2 Quick example 1
3 The reconstruction problem Challenges in image reconstruction Restore blured and noisy pictures with acceptable quality Input signal in the order of megapixels. Not too expensive (neither in memory, neither in time). Hopefully flexible towards different corruption conditions 2
4 The reconstruction problem Nevertheless, solutions for this problem are already here with complex convolutional neural networks, giving an amazing performance. The goal here is to develop a method that mixes theoretical knowledge in inverse problems with machine learning. 3
5 Mathematical model
6 The Augmented Lagrangian Model to solve: y = }{{} Measure L. sys. {}}{ H x }{{} Signal + n }{{} Noise The MAP estimator for this model is written as:, x, n, y R n, H R n n ˆx MAP (y) = argmin{ 1 2 Hs y 2 +σ 2 φ(ls)} s We turn the problem into a two variable problem by defining the innovation as u = Ls 4
7 The Augmented Lagrangian With that new variable, we can write the Augmented Lagrangian of this system: L A (s, u, α) = 1 2 Hs y 2 +σ 2 φ(u) α, Ls u + µ Ls u 2 2 Where α are the Lagrange multipliers and µ is a penalty parameter, to who we ll come back later. 5
8 Proposed solution We can find an iterative solution for each of our three variables. Taking as an advantage the linearity of the operator H, the update rule for s is found by taking a derivative and equating to zero, which yields: s (k+1) = argmin s L A (s, u (k), α (k) ) = (H T H + µl T L) 1 (H T y + µl T (u (k) + α(k) µ )) 6
9 Proposed solution We update the Lagrange multipliers before updating the innovation variable as it will make computations easier after. α (k+1) = α (k) µ(ls (k+1) u (k) ) We notice that the convergence of these multipliers comes from the convergence on the other two variables 7
10 Proposed solution With a bit of algebra over the Augmented Lagrangian, we can see that the update rule for the innovation reduces to solving a proximal u (k+1) = argmin u L A (s (k+1), u, α (k+1) ) = prox σ 2 µ φ(ls(k+1) 1 µ α(k+1) ) We will rename this proximal as a shrinkage operator, denoted by T ( ). 8
11 Proposed solution Putting our three update rules together, we arrive to the Alternating Direction Method of Multipliers s (k+1) = (H T H + µl T L) 1 (H T y + µl T (u (k) + α(k) µ )) α (k+1) = α (k) µ(ls (k+1) u (k) ) u (k+1) = T (Ls (k+1) 1 µ α(k+1) ) We will call a k-stage method that which final estimation is given by ˆx := s (k) 9
12 The learning part
13 Shrinkage Interpolation As the shrinkage function might not even have an analytic expression (it can be difficult to find or very expensive to approximate), we consider that we have a cubic B-Spline interpolation of this function T (v) = i=m i= M c i ψ( v i=m i) = i= M c i ψ i (v); When this function is applied to tensors of rank higher than 0, it is simply applied element-wise. 10
14 Gradient Descent Using a Squared Loss function, we want c to be such that it minimizes it. J(c, µ) = 1 2 ˆx(c, µ, y train) x train 2 Using Gradient Descent c (r+1) = c (r) η c c J(c (r), µ) 11
15 The c explicit expression This gradient can be expressed as c J = z (k) c LA T (ˆx x), with A = H T H + µl T L := c α (k) + µ c u (k) holding the following iterative property and z (k) c Where z (k) c = z (k 1) c (I D (k) + µla T L T (2D (k) I )) + µψ (k) Ψ (k) i,j := D (k) i,j := z (0) c = 0 (k) T (v j ) c i (k) T (v j ) v (k) i = ψ i (v (k) j ) = δ i,j T (v k i ) 12
16 Gradient Descent We think also of a gradient descent approach to estimate the penalty parameter µ. µ (r+1) = µ (r) η µ µ J(c, µ (r) ) This penalty parameter will allow us to test robustness of a model against blur kernels and noise that it was not trained to restore. 13
17 Implementation
18 All done in Matlab The software Matlab was used as it has already been optimized to perform matrix operations (and it also provides easy access to GPU computation when it is possible). I kept object oriented programming in mind to make benchmarking, debugging and general use easier and faster for people that is not familiar with the code. 14
19 Small code diagram 15
20 Particular configuration As a simple first choice, we decided to take as filter L a stack of two whitening filters, the discrete forward derivatives in the canonical directions of the picture. 16
21 Results
22 System specs All the tests that are in this section were carried out in a Dell laptop, with high end components but still a consumer grade laptop. Processor Frequency RAM GPU Intel Core i7-6700hq, 4 cores, 8 threads 2.6GHz base (3.5GHz turbo) 8GB GTX960m, 640 CUDA cores, 1096MHz, 4GB GDDR5 17
23 Training time Evolution of PSNR in a training set of grayscale pictures. 18
24 Two or one shrinkage spline In theory, the advantage of using a shrinkage spline per direction of the gradient, statistically, has no relevance. The graph to the right shows this, as in the BSD68 benchmark, we see just a marginal difference between using two splines or one. 19
25 The shrinkage spline We verify the behavior of the shrinkage training in three different scenarios: Noise-only case Blur-only case Noise and Blur case. For the following tests, µ was fixed to
26 Noise-only case Noise σ = 25 Result obtained with a batch-sgd of 3 images per iteration, 100 iterations. Training time: 66 seconds 21
27 Blur-only case Blur σ = 1.6, kernel Result obtained with a batch-sgd of 3 images per iteration, 100 iterations. Training time: 64 seconds 22
28 Noise and Blur case Noise σ = 25 Blur σ = 1.6, kernel Result obtained with a batch-sgd of 3 images per iteration, 100 iterations. Training time: 65 seconds 23
29 Against gradient based methods σ TAGS CSF 5 pw TV-Opt We compare with the CSF 5 pw and the Anisotropic TV. CSF 5 pw contains 540 parameters to be trained, against 54 of our model. 24
30 The State-of-the-Art σ TAGS CSF 5 pw TV-Opt TNRD DnCNN BM3D DnCNN and TNRD take around 20+ hours of training, against 12 minutes of our model. 25
31 Noise Robustness In the beginning, we discarded the dependence on the factor σ 2 µ 1 (which can, in fact, be f (σ)µ 1 ) in our proximal interpolation. To add more value to our model, we wanted to test if, across different noise levels, keeping this value as a constant would improve the performance of the model running in levels of noise different from the training noise. 26
32 Noise Robustness Similar behavior across noise levels Shrinkages keeping µ constant 27
33 Noise Robustness Train models for odd σ [15, 45] Declare as σ 0, µ 0 the parameters for a chosen base model TAGS 0. Heuristically scale the base model as µ = σσ 0 µ 1 0 and benchmark with noise = σ. Learn only µ in a training set with noise σ, starting with model TAGS 0. 28
34 Noise Robustness Base model with σ = 25, µ = 1.9 µ training time 30 seconds. 29
35 Noise Robustness The SSIM tells a similar story. 30
36 Against Anisotropic TV [2] 31
37 Some Examples
38 The parrot No blur, σ =
39 The parrot TAGS TV 33
40 Slight detail enhancement TAGS TV The original image was corrupted with σ = 45, no blur. 34
41 Slight detail enhancement The original image was corrupted with σ = 45, box blur
42 Slight detail enhancement On the left side, TAGS method. Right side, TV. The denoising was calibrated such that the outside of the spiral was black in both cases. 36
43 Thank you for your attention
44 Bibliography Uwe Schmidt & Stefan Roth, Shrinkage Fields for Effective Image Restoration, The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp Ulugbek S. Kamilov. A Parallel Proximal Algorithm for Anisotropic Total Variation Minimization, IEEE Transactions on Image Processing ( Volume: 26, Issue: 2, Feb. 2017, pages ) C.J.Schuler, H.C.Burger, S.Harmeling, andb.scholkopf. A Machine Learning Approach for Non-blind Image Deconvolution. CVPR, pages , 2013 Neal Parikh and Stephen Boyd, Proximal Algorithms Foundations and Trends R in Optimization Vol. 1, No. 3 (2013) c 2013 N. 37
Investigating Image Inpainting via the Alternating Direction Method of Multipliers
Investigating Image Inpainting via the Alternating Direction Method of Multipliers Jonathan Tuck Stanford University jonathantuck@stanford.edu Abstract In many imaging applications, there exists potential
More informationA Comparative Study & Analysis of Image Restoration by Non Blind Technique
A Comparative Study & Analysis of Image Restoration by Non Blind Technique Saurav Rawat 1, S.N.Tazi 2 M.Tech Student, Assistant Professor, CSE Department, Government Engineering College, Ajmer Abstract:
More informationApplication of Proximal Algorithms to Three Dimensional Deconvolution Microscopy
Application of Proximal Algorithms to Three Dimensional Deconvolution Microscopy Paroma Varma Stanford University paroma@stanford.edu Abstract In microscopy, shot noise dominates image formation, which
More informationThe Alternating Direction Method of Multipliers
The Alternating Direction Method of Multipliers With Adaptive Step Size Selection Peter Sutor, Jr. Project Advisor: Professor Tom Goldstein October 8, 2015 1 / 30 Introduction Presentation Outline 1 Convex
More informationMarkov Random Fields and Gibbs Sampling for Image Denoising
Markov Random Fields and Gibbs Sampling for Image Denoising Chang Yue Electrical Engineering Stanford University changyue@stanfoed.edu Abstract This project applies Gibbs Sampling based on different Markov
More informationCOMP 551 Applied Machine Learning Lecture 16: Deep Learning
COMP 551 Applied Machine Learning Lecture 16: Deep Learning Instructor: Ryan Lowe (ryan.lowe@cs.mcgill.ca) Slides mostly by: Class web page: www.cs.mcgill.ca/~hvanho2/comp551 Unless otherwise noted, all
More informationarxiv: v1 [cs.cv] 30 Oct 2018
Image Restoration using Total Variation Regularized Deep Image Prior Jiaming Liu 1, Yu Sun 2, Xiaojian Xu 2 and Ulugbek S. Kamilov 1,2 1 Department of Electrical and Systems Engineering, Washington University
More informationImage Restoration Using DNN
Image Restoration Using DNN Hila Levi & Eran Amar Images were taken from: http://people.tuebingen.mpg.de/burger/neural_denoising/ Agenda Domain Expertise vs. End-to-End optimization Image Denoising and
More informationSuper-Resolution for Hyperspectral Remote Sensing Images with Parallel Level Sets
Super-Resolution for Hyperspectral Remote Sensing Images with Parallel Level Sets Leon Bungert 1, Matthias J. Ehrhardt 2, Marc Aurele Gilles 3, Jennifer Rasch 4, Rafael Reisenhofer 5 (1) Applied Mathematics
More informationDiscriminative Transfer Learning for General Image Restoration
IEEE TRANSACTIONS ON IMAGE PROCESSING 1 Discriminative Transfer Learning for General Image Restoration Lei Xiao, Felix Heide, Wolfgang Heidrich, Bernhard Schölkopf, Michael Hirsch Abstract Recently, several
More informationarxiv: v2 [cs.cv] 18 Dec 2018
Unrolled Optimization with Deep Priors Steven Diamond Vincent Sitzmann Felix Heide Gordon Wetzstein December 20, 2018 arxiv:1705.08041v2 [cs.cv] 18 Dec 2018 Abstract A broad class of problems at the core
More informationOptimal Denoising of Natural Images and their Multiscale Geometry and Density
Optimal Denoising of Natural Images and their Multiscale Geometry and Density Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Joint work with Anat Levin (WIS),
More informationB. Tech. Project Second Stage Report on
B. Tech. Project Second Stage Report on GPU Based Active Contours Submitted by Sumit Shekhar (05007028) Under the guidance of Prof Subhasis Chaudhuri Table of Contents 1. Introduction... 1 1.1 Graphic
More informationWEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS
WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati
More informationSEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH
SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH Ignazio Gallo, Elisabetta Binaghi and Mario Raspanti Universitá degli Studi dell Insubria Varese, Italy email: ignazio.gallo@uninsubria.it ABSTRACT
More informationNotes 9: Optical Flow
Course 049064: Variational Methods in Image Processing Notes 9: Optical Flow Guy Gilboa 1 Basic Model 1.1 Background Optical flow is a fundamental problem in computer vision. The general goal is to find
More informationCompressive Sensing Algorithms for Fast and Accurate Imaging
Compressive Sensing Algorithms for Fast and Accurate Imaging Wotao Yin Department of Computational and Applied Mathematics, Rice University SCIMM 10 ASU, Tempe, AZ Acknowledgements: results come in part
More informationLearning Data Terms for Non-blind Deblurring Supplemental Material
Learning Data Terms for Non-blind Deblurring Supplemental Material Jiangxin Dong 1, Jinshan Pan 2, Deqing Sun 3, Zhixun Su 1,4, and Ming-Hsuan Yang 5 1 Dalian University of Technology dongjxjx@gmail.com,
More informationThe flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R
Journal of Machine Learning Research 6 (205) 553-557 Submitted /2; Revised 3/4; Published 3/5 The flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R Xingguo Li Department
More informationACCELERATION OF IMAGE RESTORATION ALGORITHMS FOR DYNAMIC MEASUREMENTS IN COORDINATE METROLOGY BY USING OPENCV GPU FRAMEWORK
URN (Paper): urn:nbn:de:gbv:ilm1-2014iwk-140:6 58 th ILMENAU SCIENTIFIC COLLOQUIUM Technische Universität Ilmenau, 08 12 September 2014 URN: urn:nbn:de:gbv:ilm1-2014iwk:3 ACCELERATION OF IMAGE RESTORATION
More informationDeep Learning and Its Applications
Convolutional Neural Network and Its Application in Image Recognition Oct 28, 2016 Outline 1 A Motivating Example 2 The Convolutional Neural Network (CNN) Model 3 Training the CNN Model 4 Issues and Recent
More informationAN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES
AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES Nader Moayeri and Konstantinos Konstantinides Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304-1120 moayeri,konstant@hpl.hp.com
More informationImage Restoration under Significant Additive Noise
1 Image Restoration under Significant Additive Noise Wenyi Zhao 1 and Art Pope Sarnoff Corporation 01 Washington Road, Princeton, NJ 08540, USA email: { wzhao, apope }@ieee.org Tel: 408-53-178 Abstract
More informationOne Network to Solve Them All Solving Linear Inverse Problems using Deep Projection Models
One Network to Solve Them All Solving Linear Inverse Problems using Deep Projection Models [Supplemental Materials] 1. Network Architecture b ref b ref +1 We now describe the architecture of the networks
More informationRobust l p -norm Singular Value Decomposition
Robust l p -norm Singular Value Decomposition Kha Gia Quach 1, Khoa Luu 2, Chi Nhan Duong 1, Tien D. Bui 1 1 Concordia University, Computer Science and Software Engineering, Montréal, Québec, Canada 2
More informationDigital Image Processing Laboratory: MAP Image Restoration
Purdue University: Digital Image Processing Laboratories 1 Digital Image Processing Laboratory: MAP Image Restoration October, 015 1 Introduction This laboratory explores the use of maximum a posteriori
More informationCS 179 Lecture 16. Logistic Regression & Parallel SGD
CS 179 Lecture 16 Logistic Regression & Parallel SGD 1 Outline logistic regression (stochastic) gradient descent parallelizing SGD for neural nets (with emphasis on Google s distributed neural net implementation)
More informationAdvanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude
Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,
More informationCS545 Contents IX. Inverse Kinematics. Reading Assignment for Next Class. Analytical Methods Iterative (Differential) Methods
CS545 Contents IX Inverse Kinematics Analytical Methods Iterative (Differential) Methods Geometric and Analytical Jacobian Jacobian Transpose Method Pseudo-Inverse Pseudo-Inverse with Optimization Extended
More informationProblem Set 4. Assigned: March 23, 2006 Due: April 17, (6.882) Belief Propagation for Segmentation
6.098/6.882 Computational Photography 1 Problem Set 4 Assigned: March 23, 2006 Due: April 17, 2006 Problem 1 (6.882) Belief Propagation for Segmentation In this problem you will set-up a Markov Random
More informationMultichannel Image Restoration Based on Optimization of the Structural Similarity Index
Multichannel Image Restoration Based on Optimization of the Structural Similarity Index Maja Temerinac-Ott and Hans Burkhardt Institute of Computer Science, University of Freiburg, Chair of Pattern Recognition
More informationImage Deblurring Using Adaptive Sparse Domain Selection and Adaptive Regularization
Volume 3, No. 3, May-June 2012 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info ISSN No. 0976-5697 Image Deblurring Using Adaptive Sparse
More informationThe Alternating Direction Method of Multipliers
The Alternating Direction Method of Multipliers Customizable software solver package Peter Sutor, Jr. Project Advisor: Professor Tom Goldstein April 27, 2016 1 / 28 Background The Dual Problem Consider
More informationNonrigid Surface Modelling. and Fast Recovery. Department of Computer Science and Engineering. Committee: Prof. Leo J. Jia and Prof. K. H.
Nonrigid Surface Modelling and Fast Recovery Zhu Jianke Supervisor: Prof. Michael R. Lyu Committee: Prof. Leo J. Jia and Prof. K. H. Wong Department of Computer Science and Engineering May 11, 2007 1 2
More informationDEEP LEARNING OF COMPRESSED SENSING OPERATORS WITH STRUCTURAL SIMILARITY (SSIM) LOSS
DEEP LEARNING OF COMPRESSED SENSING OPERATORS WITH STRUCTURAL SIMILARITY (SSIM) LOSS ABSTRACT Compressed sensing (CS) is a signal processing framework for efficiently reconstructing a signal from a small
More informationApplication of partial differential equations in image processing. Xiaoke Cui 1, a *
3rd International Conference on Education, Management and Computing Technology (ICEMCT 2016) Application of partial differential equations in image processing Xiaoke Cui 1, a * 1 Pingdingshan Industrial
More informationImage Registration Lecture 4: First Examples
Image Registration Lecture 4: First Examples Prof. Charlene Tsai Outline Example Intensity-based registration SSD error function Image mapping Function minimization: Gradient descent Derivative calculation
More informationColor Correction for Image Stitching by Monotone Cubic Spline Interpolation
Color Correction for Image Stitching by Monotone Cubic Spline Interpolation Fabio Bellavia (B) and Carlo Colombo Computational Vision Group, University of Florence, Firenze, Italy {fabio.bellavia,carlo.colombo}@unifi.it
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Neural Computation : Lecture 14 John A. Bullinaria, 2015 1. The RBF Mapping 2. The RBF Network Architecture 3. Computational Power of RBF Networks 4. Training
More informationBlind Image Deblurring Using Dark Channel Prior
Blind Image Deblurring Using Dark Channel Prior Jinshan Pan 1,2,3, Deqing Sun 2,4, Hanspeter Pfister 2, and Ming-Hsuan Yang 3 1 Dalian University of Technology 2 Harvard University 3 UC Merced 4 NVIDIA
More informationTHE importance of image denoising in low level vision can. FFDNet: Toward a Fast and Flexible Solution for CNN based Image Denoising
1 FFDNet: Toward a Fast and Flexible Solution for CNN based Image Denoising Kai Zhang, Wangmeng Zuo, Senior Member, IEEE, and Lei Zhang, Fellow, IEEE Abstract Due to the fast inference and good performance,
More informationA primal-dual framework for mixtures of regularizers
A primal-dual framework for mixtures of regularizers Baran Gözcü baran.goezcue@epfl.ch Laboratory for Information and Inference Systems (LIONS) École Polytechnique Fédérale de Lausanne (EPFL) Switzerland
More informationRobust Principal Component Analysis (RPCA)
Robust Principal Component Analysis (RPCA) & Matrix decomposition: into low-rank and sparse components Zhenfang Hu 2010.4.1 reference [1] Chandrasekharan, V., Sanghavi, S., Parillo, P., Wilsky, A.: Ranksparsity
More informationBilevel Sparse Coding
Adobe Research 345 Park Ave, San Jose, CA Mar 15, 2013 Outline 1 2 The learning model The learning algorithm 3 4 Sparse Modeling Many types of sensory data, e.g., images and audio, are in high-dimensional
More informationImage Deconvolution.
Image Deconvolution. Mathematics of Imaging. HW3 Jihwan Kim Abstract This homework is to implement image deconvolution methods, especially focused on a ExpectationMaximization(EM) algorithm. Most of this
More informationIterative Methods for Solving Linear Problems
Iterative Methods for Solving Linear Problems When problems become too large (too many data points, too many model parameters), SVD and related approaches become impractical. Iterative Methods for Solving
More informationImage Restoration. Diffusion Denoising Deconvolution Super-resolution Tomographic Reconstruction
Image Restoration Image Restoration Diffusion Denoising Deconvolution Super-resolution Tomographic Reconstruction Diffusion Term Consider only the regularization term E-L equation: (Laplace equation) Steepest
More informationDenoising an Image by Denoising its Components in a Moving Frame
Denoising an Image by Denoising its Components in a Moving Frame Gabriela Ghimpețeanu 1, Thomas Batard 1, Marcelo Bertalmío 1, and Stacey Levine 2 1 Universitat Pompeu Fabra, Spain 2 Duquesne University,
More informationACCELERATED DUAL GRADIENT-BASED METHODS FOR TOTAL VARIATION IMAGE DENOISING/DEBLURRING PROBLEMS. Donghwan Kim and Jeffrey A.
ACCELERATED DUAL GRADIENT-BASED METHODS FOR TOTAL VARIATION IMAGE DENOISING/DEBLURRING PROBLEMS Donghwan Kim and Jeffrey A. Fessler University of Michigan Dept. of Electrical Engineering and Computer Science
More informationSuper-resolution on Text Image Sequences
November 4, 2004 Outline Outline Geometric Distortion Optical/Motion Blurring Down-Sampling Total Variation Basic Idea Outline Geometric Distortion Optical/Motion Blurring Down-Sampling No optical/image
More informationCPSC 535 Assignment 1: Introduction to Matlab and Octave
CPSC 535 Assignment 1: Introduction to Matlab and Octave The goal of this assignment is to become familiar with Matlab and Octave as tools for scientific investigation. Matlab, a product of Mathworks,
More informationSynthesis and Analysis Sparse Representation Models for Image Restoration. Shuhang Gu 顾舒航. Dept. of Computing The Hong Kong Polytechnic University
Synthesis and Analysis Sparse Representation Models for Image Restoration Shuhang Gu 顾舒航 Dept. of Computing The Hong Kong Polytechnic University Outline Sparse representation models for image modeling
More informationImage Compression With Haar Discrete Wavelet Transform
Image Compression With Haar Discrete Wavelet Transform Cory Cox ME 535: Computational Techniques in Mech. Eng. Figure 1 : An example of the 2D discrete wavelet transform that is used in JPEG2000. Source:
More informationMathematics in Image Processing
Mathematics in Image Processing Michal Šorel Department of Image Processing Institute of Information Theory and Automation (ÚTIA) Academy of Sciences of the Czech Republic http://zoi.utia.cas.cz/ Mathematics
More informationDIGITAL TERRAIN MODELLING. Endre Katona University of Szeged Department of Informatics
DIGITAL TERRAIN MODELLING Endre Katona University of Szeged Department of Informatics katona@inf.u-szeged.hu The problem: data sources data structures algorithms DTM = Digital Terrain Model Terrain function:
More informationOptimization for Machine Learning
Optimization for Machine Learning (Problems; Algorithms - C) SUVRIT SRA Massachusetts Institute of Technology PKU Summer School on Data Science (July 2017) Course materials http://suvrit.de/teaching.html
More informationTHE importance of image denoising in low level vision can. FFDNet: Toward a Fast and Flexible Solution for CNN based Image Denoising
1 FFDNet: Toward a Fast and Flexible Solution for CNN based Image Denoising Kai Zhang, Wangmeng Zuo, Senior Member, IEEE, and Lei Zhang, Fellow, IEEE arxiv:1710.04026v2 [cs.cv] 22 May 2018 Abstract Due
More informationDetecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference
Detecting Burnscar from Hyperspectral Imagery via Sparse Representation with Low-Rank Interference Minh Dao 1, Xiang Xiang 1, Bulent Ayhan 2, Chiman Kwan 2, Trac D. Tran 1 Johns Hopkins Univeristy, 3400
More informationOptical Flow Estimation with CUDA. Mikhail Smirnov
Optical Flow Estimation with CUDA Mikhail Smirnov msmirnov@nvidia.com Document Change History Version Date Responsible Reason for Change Mikhail Smirnov Initial release Abstract Optical flow is the apparent
More informationConvex or non-convex: which is better?
Sparsity Amplified Ivan Selesnick Electrical and Computer Engineering Tandon School of Engineering New York University Brooklyn, New York March 7 / 4 Convex or non-convex: which is better? (for sparse-regularized
More informationA Brief Look at Optimization
A Brief Look at Optimization CSC 412/2506 Tutorial David Madras January 18, 2018 Slides adapted from last year s version Overview Introduction Classes of optimization problems Linear programming Steepest
More informationFilters. Advanced and Special Topics: Filters. Filters
Filters Advanced and Special Topics: Filters Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong Kong ELEC4245: Digital Image Processing (Second Semester, 2016 17)
More informationImage Super-Resolution Reconstruction Based On L 1/2 Sparsity
Buletin Teknik Elektro dan Informatika (Bulletin of Electrical Engineering and Informatics) Vol. 3, No. 3, September 4, pp. 55~6 ISSN: 89-39 55 Image Super-Resolution Reconstruction Based On L / Sparsity
More informationAdaptive Reconstruction Methods for Low-Dose Computed Tomography
Adaptive Reconstruction Methods for Low-Dose Computed Tomography Joseph Shtok Ph.D. supervisors: Prof. Michael Elad, Dr. Michael Zibulevsky. Technion IIT, Israel, 011 Ph.D. Talk, Apr. 01 Contents of this
More informationOptimization for Machine Learning
with a focus on proximal gradient descent algorithm Department of Computer Science and Engineering Outline 1 History & Trends 2 Proximal Gradient Descent 3 Three Applications A Brief History A. Convex
More informationEnhanced Decision Median Filter for Color Video Sequences and Medical Images Corrupted by Impulse Noise
Biomedical & Pharmacology Journal Vol. 8(1), 385-390 (2015) Enhanced Decision Median Filter for Color Video Sequences and Medical Images Corrupted by Impulse Noise G.ELAIYARAJA 1 *, N.KUMARATHARAN 2 and
More informationConvex Optimization MLSS 2015
Convex Optimization MLSS 2015 Constantine Caramanis The University of Texas at Austin The Optimization Problem minimize : f (x) subject to : x X. The Optimization Problem minimize : f (x) subject to :
More informationREGRESSION ANALYSIS : LINEAR BY MAUAJAMA FIRDAUS & TULIKA SAHA
REGRESSION ANALYSIS : LINEAR BY MAUAJAMA FIRDAUS & TULIKA SAHA MACHINE LEARNING It is the science of getting computer to learn without being explicitly programmed. Machine learning is an area of artificial
More informationIMAGE RESTORATION VIA EFFICIENT GAUSSIAN MIXTURE MODEL LEARNING
IMAGE RESTORATION VIA EFFICIENT GAUSSIAN MIXTURE MODEL LEARNING Jianzhou Feng Li Song Xiaog Huo Xiaokang Yang Wenjun Zhang Shanghai Digital Media Processing Transmission Key Lab, Shanghai Jiaotong University
More informationCNN for Low Level Image Processing. Huanjing Yue
CNN for Low Level Image Processing Huanjing Yue 2017.11 1 Deep Learning for Image Restoration General formulation: min Θ L( x, x) s. t. x = F(y; Θ) Loss function Parameters to be learned Key issues The
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationComposite Self-concordant Minimization
Composite Self-concordant Minimization Volkan Cevher Laboratory for Information and Inference Systems-LIONS Ecole Polytechnique Federale de Lausanne (EPFL) volkan.cevher@epfl.ch Paris 6 Dec 11, 2013 joint
More informationTERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis
TERM PAPER ON The Compressive Sensing Based on Biorthogonal Wavelet Basis Submitted By: Amrita Mishra 11104163 Manoj C 11104059 Under the Guidance of Dr. Sumana Gupta Professor Department of Electrical
More informationSINGLE image restoration (IR) aims to generate a visually
Concat 1x1 JOURNAL OF L A T E X CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 1 Residual Dense Network for Image Restoration Yulun Zhang, Yapeng Tian, Yu Kong, Bineng Zhong, and Yun Fu, Fellow, IEEE arxiv:1812.10477v1
More informationRecovery of Piecewise Smooth Images from Few Fourier Samples
Recovery of Piecewise Smooth Images from Few Fourier Samples Greg Ongie*, Mathews Jacob Computational Biomedical Imaging Group (CBIG) University of Iowa SampTA 2015 Washington, D.C. 1. Introduction 2.
More informationA Lagrange method based L-curve for image restoration
Journal of Physics: Conference Series OPEN ACCESS A Lagrange method based L-curve for image restoration To cite this article: G Landi 2013 J. Phys.: Conf. Ser. 464 012011 View the article online for updates
More informationGuided Image Super-Resolution: A New Technique for Photogeometric Super-Resolution in Hybrid 3-D Range Imaging
Guided Image Super-Resolution: A New Technique for Photogeometric Super-Resolution in Hybrid 3-D Range Imaging Florin C. Ghesu 1, Thomas Köhler 1,2, Sven Haase 1, Joachim Hornegger 1,2 04.09.2014 1 Pattern
More informationImproving Reconstructed Image Quality in a Limited-Angle Positron Emission
Improving Reconstructed Image Quality in a Limited-Angle Positron Emission Tomography System David Fan-Chung Hsu Department of Electrical Engineering, Stanford University 350 Serra Mall, Stanford CA 94305
More informationHigher Degree Total Variation for 3-D Image Recovery
Higher Degree Total Variation for 3-D Image Recovery Greg Ongie*, Yue Hu, Mathews Jacob Computational Biomedical Imaging Group (CBIG) University of Iowa ISBI 2014 Beijing, China Motivation: Compressed
More informationLocally Adaptive Regression Kernels with (many) Applications
Locally Adaptive Regression Kernels with (many) Applications Peyman Milanfar EE Department University of California, Santa Cruz Joint work with Hiro Takeda, Hae Jong Seo, Xiang Zhu Outline Introduction/Motivation
More informationHartley - Zisserman reading club. Part I: Hartley and Zisserman Appendix 6: Part II: Zhengyou Zhang: Presented by Daniel Fontijne
Hartley - Zisserman reading club Part I: Hartley and Zisserman Appendix 6: Iterative estimation methods Part II: Zhengyou Zhang: A Flexible New Technique for Camera Calibration Presented by Daniel Fontijne
More informationDeep Boosting for Image Denoising
Deep Boosting for Image Denoising Chang Chen, Zhiwei Xiong ( ), Xinmei Tian, and Feng Wu University of Science and Technology of China changc@mail.ustc.edu.cn, {zwxiong,xinmei,fengwu}@ustc.edu.cn Abstract.
More informationConvex optimization algorithms for sparse and low-rank representations
Convex optimization algorithms for sparse and low-rank representations Lieven Vandenberghe, Hsiao-Han Chao (UCLA) ECC 2013 Tutorial Session Sparse and low-rank representation methods in control, estimation,
More informationImage Restoration with Deep Generative Models
Image Restoration with Deep Generative Models Raymond A. Yeh *, Teck-Yian Lim *, Chen Chen, Alexander G. Schwing, Mark Hasegawa-Johnson, Minh N. Do Department of Electrical and Computer Engineering, University
More informationMODEL-based recovery of images from noisy and sparse. MoDL: Model Based Deep Learning Architecture for Inverse Problems
1 MoDL: Model Based Deep Learning Architecture for Inverse Problems Hemant K. Aggarwal, Member, IEEE, Merry P. Mani, and Mathews Jacob, Senior Member, IEEE arxiv:1712.02862v3 [cs.cv] 10 Aug 2018 Abstract
More informationWilliam Yang Group 14 Mentor: Dr. Rogerio Richa Visual Tracking of Surgical Tools in Retinal Surgery using Particle Filtering
Mutual Information Computation and Maximization Using GPU Yuping Lin and Gérard Medioni Computer Vision and Pattern Recognition Workshops (CVPR) Anchorage, AK, pp. 1-6, June 2008 Project Summary and Paper
More informationFAST PRINCIPAL COMPONENT PURSUIT VIA ALTERNATING MINIMIZATION
FAST PRICIPAL COMPOET PURSUIT VIA ALTERATIG MIIMIZATIO Paul Rodríguez Department of Electrical Engineering Pontificia Universidad Católica del Perú Lima, Peru Brendt Wohlberg T-5 Applied Mathematics and
More informationNeural Networks and Deep Learning
Neural Networks and Deep Learning Example Learning Problem Example Learning Problem Celebrity Faces in the Wild Machine Learning Pipeline Raw data Feature extract. Feature computation Inference: prediction,
More informationImage Restoration using Accelerated Proximal Gradient method
Image Restoration using Accelerated Proximal Gradient method Alluri.Samuyl Department of computer science, KIET Engineering College. D.Srinivas Asso.prof, Department of computer science, KIET Engineering
More informationSection 5 Convex Optimisation 1. W. Dai (IC) EE4.66 Data Proc. Convex Optimisation page 5-1
Section 5 Convex Optimisation 1 W. Dai (IC) EE4.66 Data Proc. Convex Optimisation 1 2018 page 5-1 Convex Combination Denition 5.1 A convex combination is a linear combination of points where all coecients
More informationUnsupervised Learning
Unsupervised Learning Learning without Class Labels (or correct outputs) Density Estimation Learn P(X) given training data for X Clustering Partition data into clusters Dimensionality Reduction Discover
More informationDeep Learning Benchmarks Mumtaz Vauhkonen, Quaizar Vohra, Saurabh Madaan Collaboration with Adam Coates, Stanford Unviersity
Deep Learning Benchmarks Mumtaz Vauhkonen, Quaizar Vohra, Saurabh Madaan Collaboration with Adam Coates, Stanford Unviersity Abstract: This project aims at creating a benchmark for Deep Learning (DL) algorithms
More informationx' = c 1 x + c 2 y + c 3 xy + c 4 y' = c 5 x + c 6 y + c 7 xy + c 8
1. Explain about gray level interpolation. The distortion correction equations yield non integer values for x' and y'. Because the distorted image g is digital, its pixel values are defined only at integer
More informationFast-Lipschitz Optimization
Fast-Lipschitz Optimization DREAM Seminar Series University of California at Berkeley September 11, 2012 Carlo Fischione ACCESS Linnaeus Center, Electrical Engineering KTH Royal Institute of Technology
More informationA Comparison of SIFT and SURF
A Comparison of SIFT and SURF P M Panchal 1, S R Panchal 2, S K Shah 3 PG Student, Department of Electronics & Communication Engineering, SVIT, Vasad-388306, India 1 Research Scholar, Department of Electronics
More informationReal-Time Scene Reconstruction. Remington Gong Benjamin Harris Iuri Prilepov
Real-Time Scene Reconstruction Remington Gong Benjamin Harris Iuri Prilepov June 10, 2010 Abstract This report discusses the implementation of a real-time system for scene reconstruction. Algorithms for
More informationNEW TECHNIQUES TO CONQUER THE IMAGE RESOLUTION ENHANCEMENT PROBLEM
Progress In Electromagnetics Research B, Vol. 7, 13 51, 2008 NEW TECHNIQUES TO CONQUER THE IMAGE RESOLUTION ENHANCEMENT PROBLEM S. E. El-Khamy Department of Electrical Engineering Faculty of Engineering
More informationRadial Basis Function (RBF) Neural Networks Based on the Triple Modular Redundancy Technology (TMR)
Radial Basis Function (RBF) Neural Networks Based on the Triple Modular Redundancy Technology (TMR) Yaobin Qin qinxx143@umn.edu Supervisor: Pro.lilja Department of Electrical and Computer Engineering Abstract
More informationOptimizing the Deblocking Algorithm for. H.264 Decoder Implementation
Optimizing the Deblocking Algorithm for H.264 Decoder Implementation Ken Kin-Hung Lam Abstract In the emerging H.264 video coding standard, a deblocking/loop filter is required for improving the visual
More informationCombine the PA Algorithm with a Proximal Classifier
Combine the Passive and Aggressive Algorithm with a Proximal Classifier Yuh-Jye Lee Joint work with Y.-C. Tseng Dept. of Computer Science & Information Engineering TaiwanTech. Dept. of Statistics@NCKU
More information