University of California, San Diego
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
A Comparative Analysis of Image Interpolation Algorithms
ISSN (Online) 2278-1021 IJARCCE ISSN (Print) 2319 5940 International Journal of Advanced Research in Computer and Communication Engineering Vol. 5, Issue 1, January 2016 A Comparative Analysis of Image Interpolation Algorithms Mr. Pankaj S. Parsania1, Dr. Paresh V. Virparia2 Research Scholar, Department of Computer Science, Sardar Patel University, Vallabh Vidyanagar, Gujarat, India1 Director, Department of Computer Science, Sardar Patel University, Vallabh Vidyanagar, Gujarat, India2 Abstract: Image interpolation is the most basic requirement for many image processing task such as computer graphics, gaming, medical image processing, virtualization, camera surveillance and quality control. Image interpolation is a technique used in resizing images. To resize an image, every pixel in the new image must be mapped back to a location in the old image in order to calculate a value of new pixel. There are many algorithms available for determining new value of the pixel, most of which involve some form of interpolation among the nearest pixels in the old image. In this paper, we used Nearest-neighbor, Bilinear, Bicubic, Bicubic B-spline, Catmull-Rom, Mitchell- Netravali and Lanzcos of order three algorithms for image interpolation. Each algorithms generates varies artifact such as aliasing, blurring and moiré. This paper presents, quality and computational time consideration of images while using these interpolation algorithms. Keywords: Nearest-neighbor, Bilinear, Bicubic, Bicubic B-spline, Catmull-Rom, Mitchell-Netravali, Lanzcos. I. INTRODUCTION Image interpolation is a term used for image processing, Interpolation using Shape-Preserving Approach [4], but is often used with different terminologies in literature classification and stitching [5], grid based image like image scaling, image resampling and image resize. -
Extensible Implementation of Reliable Pixel Art Interpolation
F O U N D A T I O N S O F C O M P U T I N G A N D D E C I S I O N S C I E N C E S Vol. 44 (2019) No. 2 ISSN 0867-6356 DOI: 10.2478/fcds-2019-0011 e-ISSN 2300-3405 Extensible Implementation of Reliable Pixel Art Interpolation Paweł M. Stasik, Julian Balcerek ∗ y Abstract. Pixel art is aesthetics that emulates the graphical style of old computer systems. Graphics created with this style needs to be scaled up for presentation on modern displays. The authors proposed two new modifications of image scaling for this purpose: a proximity-based coefficient correction and a transition area restriction. Moreover a new interpolation kernel has been introduced. The presented approaches are aimed at reliable and flexible bitmap scaling while overcoming limitations of exist- ing methods. The new techniques were introduced in an extensible .NET application that serves as both an executable program and a library. The project is designed for prototyping and testing interpolation operations and can be easily expanded with new functionality by adding it to the code or by using the provided interface. Keywords: image processing, pixel art, image upscaling, bitmap interpolation, proximity measure, proximity-based coefficient correction (PBCC), p-lin interpola- tion, transition area restriction (TAR) 1. Introduction Old computer systems, in comparison to modern systems, were heavily restricted in their graphical capabilities (in the sense of the amount of available colors and the possible resolutions). Pixel art is an artistic form that was aimed at handling these limitations, but them should not prevent it from being presented with graphical possibilities of the modern systems. -
Linear Methods for Image Interpolation Pascal Getreuer CMLA, ENS Cachan, France ([email protected])
Published in Image Processing On Line on 2011{09{27. Submitted on 2011{00{00, accepted on 2011{00{00. ISSN 2105{1232 c 2011 IPOL & the authors CC{BY{NC{SA This article is available online with supplementary materials, software, datasets and online demo at http://dx.doi.org/10.5201/ipol.2011.g_lmii 2014/07/01 v0.5 IPOL article class Linear Methods for Image Interpolation Pascal Getreuer CMLA, ENS Cachan, France ([email protected]) Abstract We discuss linear methods for interpolation, including nearest neighbor, bilinear, bicubic, splines, and sinc interpolation. We focus on separable interpolation, so most of what is said applies to one-dimensional interpolation as well as N-dimensional separable interpolation. Source Code The source code (ANSI C), its documentation, and the online demo are accessible at the IPOL web page of this article1. Keywords: interpolation; linear methods; separable interpolation 1 Introduction Given input image v with uniformly-sampled pixels vm;n, the goal of interpolation is to find a function u(x; y) satisfying vm;n = u(m; n) for all m; n 2 Z; such that u approximates the underlying function from which v was sampled. Another way to interpret this is consider that v was created by subsampling, and interpolation attempts to invert this process. We discuss linear methods for interpolation, including nearest neighbor, bilinear, bicubic, splines, and sinc interpolation. We focus on separable interpolation, so most of what is said applies to one-dimensional interpolation as well as N-dimensional separable interpolation. 2 Notations We use the following normalization of the Fourier transform, Z 1 f^(ξ) = f(x)e−2πixξdx; −∞ the transform of a function f is denoted by hat. -
3D LANCZOS INTERPOLATION for MEDICAL VOLUMES Thiago
15th International Symposium on Computer Methods in Biomechanics and Biomedical Engineering and 3rd Conference on Imaging and Visualization CMBBE 2018 P. R. Fernandes and J. M. Tavares (Editors) 3D LANCZOS INTERPOLATION FOR MEDICAL VOLUMES Thiago Moraes1, Paulo Amorim1, Jorge Silva1 and Helio Pedrini2 1Division of 3D Technologies, Center for Information Technology Renato Archer Campinas-SP, Brazil, 13069-901 2Institute of Computing, University of Campinas Campinas, SP, Brazil, 13083-852 Keywords: Image Interpolation, Resampling, Medical Imaging. Abstract: Medical imaging techniques have been widely used in the diagnosis and treatment of many diseases, such as magnetic resonance imaging, computed tomography, mammography, ultrasonography, and photon emission tomography. Their main purpose is to enable the visu- alization of internal anatomic structures, such as organs and tissues, for clinical procedures. Resampling is required for certain medical tasks, for instance, registration and reconstruction, which occur when images or volumes are scaled, translated or rotated. The result of the re- sampling depends on the interpolation filter. In this paper, we develop and analyze a novel three-dimensional Lanczos resampling method in the context of medical imaging. 1. INTRODUCTION In the context of numerical analysis, interpolation techniques [12–15, 19, 21–23] aim to con- struct new data points from a set of known samples. In the field of image analysis, resampling techniques [9, 21, 23] transform a sampled image from one coordinate system to another. Resampling is typically employed to create a new version of an image with a different dimension. The increase and reduction of an image are called upsampling and downsampling, respectively. Image interpolation and resampling techniques play an important role in several biomed- ical applications, such as data reslicing, image registration, tomographic reconstruction, and volumetric rendering [23]. -
Image Zooming Using Wavelet Coefficients
IMAGE ZOOMING USING WAVELET COEFFICIENTS Dissertation submitted in partial fulfillment of the requirements for the award of degree of Master of Technology in Computer Science and Applications Submitted By Himanshu Jindal (Roll No. 651103003) Supervised By Dr. Singara Singh Assistant Professor SCHOOL OF MATHEMATICS AND COMPUTER APPLICATION THAPAR UNIVERSITY PATIALA – 147004 July 2014 CERTIFICATE I hereby certify that the work being presented in the dissertation entitled, "Image Zooming Using Wavelet Coefficients", in partial fulfillment of the requirements for the award of degree of Master of Technology in Computer Science and Applications submitted to the School of Mathematics and Computer Applications of Thapar University, Patiala, is a authentic record of my own work carried out under the supervision of Dr. Singara Singh and refers other researcher's work which are duly listed in the reference section. The matter presented in the dissertation has not been submitted for the award of any other desree of this or anv other university. _ .. \,. ->- PL*"*?irf t (Himanshu Jindal) This is to certify that the above statement made by the student is correct and true to the best of my knowledge. ffi1,, (Dr. Singara Singh) Assistant Professor, School of Mathematics and Computer Applications, Thapar University, Patiala Countersigned By - n r / /t I T" \^--Y H4W-- Dr. Rajesh Kumar Dr. S.K. Nlohdpatfa Head, Dean School of Mathematics and Computer Applications, (AcademicAffairs) Thapar University, Patiala Thapar University, Patiala ACKNOWLEDGMENT I would like to acknowledge everyone who supported me during my experience at Thapar University and my work on this dissertation. First and foremost I would like to thank God for providing me with faith, self-confidence and ability to complete the dissertation.