Kronecker Products-based Regularized Image Interpolation Techniques

Slides:



Advertisements
Similar presentations
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
Advertisements

Statistical perturbation theory for spectral clustering Harrachov, 2007 A. Spence and Z. Stoyanov.
Beamforming Issues in Modern MIMO Radars with Doppler
CSCI-455/552 Introduction to High Performance Computing Lecture 11.
Hongliang Li, Senior Member, IEEE, Linfeng Xu, Member, IEEE, and Guanghui Liu Face Hallucination via Similarity Constraints.
Efficient Bit Allocation and CTU level Rate Control for HEVC Picture Coding Symposium, 2013, IEEE Junjun Si, Siwei Ma, Wen Gao Insitute of Digital Media,
Sampling, Aliasing, & Mipmaps
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Why Systolic Architecture ? VLSI Signal Processing 台灣大學電機系 吳安宇.
Robust Super-Resolution Presented By: Sina Farsiu.
Image Denoising via Learned Dictionaries and Sparse Representations
A New Scheme for Progressive Image Transmission and Flexible Reconstruction with DCT Minqing Xing and Xue Dong Yang Department of Computer Science University.
ON THE IMPROVEMENT OF IMAGE REGISTRATION FOR HIGH ACCURACY SUPER-RESOLUTION Michalis Vrigkas, Christophoros Nikou, Lisimachos P. Kondi University of Ioannina.
Parallel Processing – Final Project Performed by:Nitsan Mane Jonathan Distler PP9.
1 Bayesian Restoration Using a New Nonstationary Edge-Preserving Image Prior Giannis K. Chantas, Nikolaos P. Galatsanos, and Aristidis C. Likas IEEE Transactions.
1 An Efficient Method for DCT- Domain Image Resizing with Mixed Field/Frame-Mode Macroblocks Changhoon Yim and Michael A. Isnardi IEEE TRANSACTION ON CIRCUITS.
Acceleration on many-cores CPUs and GPUs Dinesh Manocha Lauri Savioja.
1 Friday, November 03, 2006 “The greatest obstacle to discovery is not ignorance, but the illusion of knowledge.” -D. Boorstin.
Image deblurring Seminar inverse problems April 18th 2007 Willem Dijkstra.
Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.
Super-Resolution of Remotely-Sensed Images Using a Learning-Based Approach Isabelle Bégin and Frank P. Ferrie Abstract Super-resolution addresses the problem.
Mathematics and Computation in Imaging Science and Information Processing July-December, 2003 Organized by Institute of Mathematical Sciences and Center.
Unitary Extension Principle: Ten Years After Zuowei Shen Department of Mathematics National University of Singapore.
Yuan Chen Advisor: Professor Paul Cuff. Introduction Goal: Remove reverberation of far-end input from near –end input by forming an estimation of the.
SAR Imaging Radar System A fundamental problem in designing a SAR Image Formation System is finding an optimal estimator as an ideal.
Parallel Imaging Reconstruction
Supplementary Text 2. If the relationship between two random variables X and Y is approximately illustrated in the following figure, then how can we discretize.
Image Resampling CS4670: Computer Vision Noah Snavely.
Copyright, 1996 © Dale Carnegie & Associates, Inc. Image Restoration Hung-Ta Pai Laboratory for Image and Video Engineering Dept. of Electrical and Computer.
Image Resampling CS4670: Computer Vision Noah Snavely.
Image Processing Xuejin Chen Ref:
Figure 1.a AVS China encoder [3] Video Bit stream.
Esmaeil Faramarzi, Member, IEEE, Dinesh Rajan, Senior Member, IEEE, and Marc P. Christensen, Senior Member, IEEE Unified Blind Method for Multi-Image Super-Resolution.
CS654: Digital Image Analysis Lecture 22: Image Restoration - II.
A Frequency-Domain Approach to polynomial-Based Interpolation and the Farrow Structure Advisor : Yung-An Kao Student : Chih-Wei Chen 2006/3/24.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
3.3.1 Synchronized averaging
Least-Squares Warped Distance for Adaptive Linear Image Interpolation
Sequential Monte-Carlo Method -Introduction, implementation and application Fan, Xin
Modeling Singular Valued Decomposition (SVD) Techniques using Parallel Programming with pMATLAB Miguel Goenaga (Presenter) Carlos J. González, Inerys Otero.
Sponsored By Abstract 1 Ritamar Siurano – Undergraduate Student Prof. Domingo Rodriguez – Advisor Abigail Fuentes – Graduate StudentProf. Ana B. Ramirez.
MPEG4 Fine Grained Scalable Multi-Resolution Layered Video Encoding Authors from: University of Georgia Speaker: Chang-Kuan Lin.
Nonlinear State Estimation
1 MOTIVATION AND OBJECTIVE  Discrete Signal Transforms (DSTs) –DFT, DCT: major performance component in many applications –Hardware accelerated but at.
Cameron Rowe.  Introduction  Purpose  Implementation  Simple Example Problem  Extended Kalman Filters  Conclusion  Real World Examples.
Image Enhancement (Frequency Domain)
Homework II Fast Discrete Cosine Transform Jain-Yi Lu ( 呂健益 ) Visual Communications Laboratory Department of Communication Engineering National Central.
Speaker Min-Koo Kang March 26, 2013 Depth Enhancement Technique by Sensor Fusion: MRF-based approach.
Performance Measurement of Image Processing Algorithms By Dr. Rajeev Srivastava ITBHU, Varanasi.
Single Image Interpolation via Adaptive Non-Local Sparsity-Based Modeling The research leading to these results has received funding from the European.
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
VLSI SP Course 2001 台大電機吳安宇 1 Why Systolic Architecture ? H. T. Kung Carnegie-Mellon University.
Divide and Conquer Algorithms Sathish Vadhiyar. Introduction  One of the important parallel algorithm models  The idea is to decompose the problem into.
Iterative Techniques for Image Interpolation
Super-resolution MRI Using Finite Rate of Innovation Curves Greg Ongie*, Mathews Jacob Computational Biomedical Imaging Group (CBIG) University of Iowa.
Computer Vision COURSE OBJECTIVES: To introduce the student to computer vision algorithms, methods and concepts. EXPECTED OUTCOME: Get introduced to computer.
The content of lecture This lecture will cover: Fourier Transform
Image Resampling & Interpolation
Fuzzy type Image Fusion using hybrid DCT-FFT based Laplacian Pyramid Transform Authors: Rajesh Kumar Kakerda, Mahendra Kumar, Garima Mathur, R P Yadav,
Fast edge-directed single-image super-resolution
Khallefi Leïla © esa Supervisors: J. L. Vazquez M. Küppers
A Graph-based Framework for Image Restoration
School of Electronic Engineering, Xidian University, Xi’an, China
Integer transform and Triangular matrix scheme
2D DCT in ARM-based JPEG Processor
Fast Hierarchical Back Projection
12/5/2018.
A Comparative Study of Depth Map Coding Schemes for 3D Video
1-D DISCRETE COSINE TRANSFORM DCT
Image Resampling & Interpolation
Source: IEEE Signal Processing Letters, Vol. 14, No. 3, Mar. 2007, pp
Presentation transcript:

Kronecker Products-based Regularized Image Interpolation Techniques Blas Trigueros (presenter) Ricardo H. Castañeyra Juan Valera Domingo Rodriguez University of Puerto Rico at Mayaguez 9/23/2009 HPEC 2009 Workshop

Problem Formulation In this work, we present a parallel implementation of an image interpolation algorithm based on the Tikhonov regularization technique, for the restoration of a (high resolution) HR image from a (low resolution) LR noisy image. Previous work: Direct interpolation (cubic spline, adaptive spline…) Regularization functional-based interpolation [1]. Discrete Cosine Transform (DCT) based techniques [2]. Solution approach: Parallel implementation performed using pMATLAB based on the regularized interpolation technique proposed by Li Chen et al. [3]. Data parallelism is employed to reduce execution time by partitioning the image into overlapping subimages. Overlapping technique is introduced to avoid edge distortions.

Implementation Model Observation model: Parallel Implementation: SVD: f: high-resolution image g: low-resolution image D: decimation matrix H: low-pass filter (blurring) n: additive noise Observation model: This algorithm takes advantage of SVD and Kronecker products to reduce the computational cost of the regularized solution. But the SVD computation grows as O(N3), prohibitive for large matrices. Parallel Implementation: In our implementation of the algorithm, the image is partitioned into subimages, and each processor computes a portion of the final result. SVD: Each processor Pi computes an SVD of dimension: NxN: dimension of the LR image k: decimation factor Np: number of processors Overlapping zone

(a) LR image, (b) HR image. Performance Results References: [1] Julie Kamm and James G. Nagy, “Kronecker product and SVD approximations in image restoration,” Linear Algebra and its Applications, Vol. 284, pp. 177-192, Jan 1998 [2] Yoshinori Abe, Youji Iuguni, “Image restoration from a downsampled image by using DCT,” Signal Processing, 87, pp. 2370-2380, Mar 2007 [3] Li Chen and Kim-Hui Yap, “Regularized Interpolation Using Kronecker Product for Still Images,” IEEE International Conference on Image Processing, Vol. 2, pp. 1014-17, Sep 2005. HR image size Execution time (s) MATLAB serial time (s) pMATLAB 256 x 256 0.0347 0.0067 512 x 512 0.3397 0.0399 1024 x 1024 1.96 0.2480 2048 x 2048 18.62 1.85 4096 x 4096 211 20.44 8192 x 8192 2471 219 16384 x 16384 13864 1982 (a) Figure 1: (b) (a) LR image, (b) HR image. Table 1: Execution time results of the interpolation algorithm in MATLAB and pMATLAB (4 processors, 2x2 mapping) Computation time is reduced by using distributed arrays on pMATLAB for the SVD operation.