ECE 484 Digital Image Processing Lec 10 - Image Interpolation

Total Page:16

File Type:pdf, Size:1020Kb

ECE 484 Digital Image Processing Lec 10 - Image Interpolation ECE 484 Digital Image Processing Lec 10 - Image Interpolation Zhu Li Dept of CSEE, UMKC Office: FH560E, Email: [email protected], Ph: x 2346. http://l.web.umkc.edu/lizhu slides created with WPS Office Linux and EqualX equation editor Z. Li, ECE 484 Digital Image Processing, 2019 p.1 Outline Recap of Lec 09 Image Sampling . subsampling . interpolation Summary Z. Li, ECE 484 Digital Image Processing, 2019 p.2 BF - kernel reflects range and value changes Bilateral Filtering process W Ws Ws*Wc * c Output input geometry kernelphotometry kernel bilateral kernel Z. Li, ECE 484 Digital Image Processing, 2019 p.3 Non Local Means (NLM) Filters Baudes et al. (2005) use a weighted average based on similarity . BL filter's spatial kernel is turned off . intensity kernel reflects similarity between self similar patches: pixel j and its neighborhood y(j) is defined as say 5x5 block centered at j. Z. Li, ECE 484 Digital Image Processing, 2019 p.4 CBF - Cross Bilateral Filter Decouple the filter image input, from the images that gives range/value kernel . a guide image I (in a way NLM is a guided filter ) from say short exposure images, while filter input is the long exposure image Z. Li, ECE 484 Digital Image Processing, 2019 p.5 Guided Filter - Definitions Motivated by the Cross Bilateral Filter: . Filter input image pixels {pi} . Guide image {Ii} . Filter output {qi} Output: . weight W is completely derived from the guidance image I. Guided image filter output: where {ak, bk} is totally defined by the neigborhood wk • The filter image output model: qi = pi - ni . The output is the input image subtract some noise Z. Li, ECE 484 Digital Image Processing, 2019 p.6 Guided Filter Operations Denoising . when covariance of I and P is small, then GF is in denoising/smoothing mode Edge Preserving . when covariance of I and P are large, i.e, very similar, then GF is preserving edge. Z. Li, ECE 484 Digital Image Processing, 2019 p.7 Outline Recap of Lec 09 Image Sampling . anti-aliasing subsampling . interpolation Summary Z. Li, ECE 484 Digital Image Processing, 2019 p.8 Image Scaling Need to resample images This image is too big to fit on the screen. How can we reduce it? How to generate a half- sized version? Z. Li, ECE 484 Digital Image Processing, 2019 p.9 Image sub-sampling sub-sample without filtering, what is wrong ? 1/8 1/4 Throw away every other row and column to create a 1/2 size image - called image sub-sampling Z. Li, ECE 484 Digital Image Processing, 2019 p.10 Image sub-sampling Aliasing... 1/2 (2x zoom) 1/4 1/8 (4x zoom) Why does this look so crufty? Z. Li, ECE 484 Digital Image Processing, 2019 p.11 Even worse for synthetic images Aliasing effect Z. Li, ECE 484 Digital Image Processing, 2019 p.12 Sampling and the Nyquist rate Aliasing can arise when you sample a continuous signal or image . occurs when your sampling rate is not high enough to capture the amount of detail in your image . Can give you the wrong signal/image—an alias . formally, the image contains structure at different scales . called “frequencies” in the Fourier domain . the sampling rate must be high enough to capture the highest frequency in the image To avoid aliasing: . sampling rate > 2 * max frequency in the image . This minimum sampling rate is called the Nyquist rate Z. Li, ECE 484 Digital Image Processing, 2019 p.13 Sampling in Time Domain Computer needs a discrete representation of signals • Many signals originate as continuous-time signals, e.g. conventional music or voice • By sampling a continuous-time signal at isolated, equally-spaced points in time, we obtain a sequence of numbers Ts n {…, -2, -1, 0, 1, 2,…} t T Ts is the sampling period. s s(t) Sampled analog impulse waveform train Z. Li, ECE 484 Digital Image Processing, 2019 p.14 Spectrum of several special functions Spatial-Frequency signatures Z. Li, ECE 484 Digital Image Processing, 2019 p.15 Consequence in Freq Domain Multiplication with sampling train function, is convolving in freq domain • Replicates spectrum of continuous-time signal At offsets that are integer multiples of sampling frequency • Fourier series of impulse train where s = 2 fs • Example Modulation by Modulation by cos(2 cos( t) t) F() s G() s -2f 2f max max s s s s Z. Li, ECE 484 Digital Image Processing, 2019 p.16 Shannon/Nyquist Sampling Theorem What is the sampling rate to recover the original continuous signal w/o loss ? • A continuous-time signal x(t) with frequencies no higher than fmax can be reconstructed from its samples x[n] = x(n Ts) if the samples are taken at a rate fs which is greater than 2 fmax. Nyquist rate = 2 fmax Nyquist frequency = fs/2. • What happens if fs = 2fmax? • Consider a sinusoid sin(2 p fmax t) Use a sampling period of Ts = 1/fs = 1/2fmax. Sketch: sinusoid with zeros at t = 0, 1/2fmax, 1/fmax, … Z. Li, ECE 484 Digital Image Processing, 2019 p.17 Illustration of Sampling Theorem 1-D example sampling pattern w 1/w sampled signal Spatial domain Frequency domain Z. Li, ECE 484 Digital Image Processing, 2019 p.18 Reconstruction Recon via convolving with Sinc function (low pass filtering) . in practice, truncated sinc() function sinc function w 1/w reconstructed signal Spatial domain Frequency domain Z. Li, ECE 484 Digital Image Processing, 2019 p.19 Aliasing from under-sampled reconstruction Aliasing effect (a) f(x) and its spectrum (b) sampling train (c) aliasing from under sampling (a) (d) reconstruction via convolving with sinc function (e) aliasing (b) (c) (d) (e) Z. Li, ECE 484 Digital Image Processing, 2019 p.20 Anti-Aliasing Filtering Apply low pass filtering to limit the band of signal before filtering . ideally need to use sinc filter . infinite taps, not practical . use Gaussian instead or . Low Pass FIR design below Z. Li, ECE 484 Digital Image Processing, 2019 p.21 Image Anti-Aliasing Filtering Images are not bandlimited as we would like 2D sampling effects Z. Li, ECE 484 Digital Image Processing, 2019 p.22 2D image anti aliasing example Pre-Low Pass Filter before subsampling Z. Li, ECE 484 Digital Image Processing, 2019 p.23 Subsampling with Gaussian pre-filtering Pre LP filtering with Gaussian G 1/8 G 1/4 Gaussian 1/2 Solution: filter the image, then subsample • Filter size should double for each ½ size reduction. Why? Z. Li, ECE 484 Digital Image Processing, 2019 p.24 Subsampling with Gaussian pre-filtering Anti-alias filtered sub-sampling Gaussian 1/2 G 1/4 G 1/8 Solution: filter the image, then subsample • Filter size should double for each ½ size reduction. Why? • How can we speed this up? Z. Li, ECE 484 Digital Image Processing, 2019 p.25 Aliasing w/o pre filtering In comparison, w/o anti-aliasing filtering: 1/2 1/4 (2x zoom) 1/8 (4x zoom) Z. Li, ECE 484 Digital Image Processing, 2019 p.26 Outline Recap of Lec 09 Image Sampling . anti-aliasing subsampling . interpolation Summary Z. Li, ECE 484 Digital Image Processing, 2019 p.27 Image Resampling/Interpolation Reconstruct the continuous signal with different filters Z. Li, ECE 484 Digital Image Processing, 2019 p.28 0-th and 1-st Order Interpolation Simple interpolation schemes 1st order: not differentiable 0-th order: introduced discontinuity Z. Li, ECE 484 Digital Image Processing, 2019 p.29 Linear Image resampling/interpolation So what to do if we don’t know • Answer: guess an approximation • Can be done in a principled way: filtering 1 d = 1 in this example 1 2 2.5 3 4 5 Image reconstruction • Convert to a continuous function • Reconstruct by convolution: Z. Li, ECE 484 Digital Image Processing, 2019 p.30 Cubic Interpolation Linear, Quadratic and Cubic Interpolation Cubic is popular, supported in Matlab x = -3:3; y = [-1 -1 -1 0 1 1 1]; xq1 = -3:.01:3; s = spline(x,y,xq1); plot(x,y,'o',xq1,p,'-',xq1,s,'-.') legend('Sample Points','spline','Location','SouthEast') Z. Li, ECE 484 Digital Image Processing, 2019 p.31 2D Interpolation Divide & conquer . 1/2 pel position interpolation Z. Li, ECE 484 Digital Image Processing, 2019 p.32 Bilinear Interpolation 2D linear interpolation Z. Li, ECE 484 Digital Image Processing, 2019 p.33 Interpolation Results NN, Bilinear vs Bicubic Original image: x 10 Nearest-neighbor interpolation Bilinear interpolation Bicubic interpolation Z. Li, ECE 484 Digital Image Processing, 2019 p.34 DCT derived Interpolation Filter DCTIF: Elena & Alex Alshina from Samsung DMC: . JVTVC-F247: https://www.itu.int/wftp3/av-arch/jctvc- site/2011_07_F_Torino/JCTVC-F247-v6.zip Basic Idea: . DCT for signal representation: . then the signal at fractional pixel location can be derived as, Z. Li, ECE 484 Digital Image Processing, 2019 p.35 DCTIF Interpolation Filter DCT Derived interpolation filters (DCTIF, Samsung) . 1/4 pel interpolations . row first then column Z. Li, ECE 484 Digital Image Processing, 2019 p.36 DCTIF Filter Filter derived from DCT transforms . row interpolation . column interpolation Performance . better than bicubicle ! Z. Li, ECE 484 Digital Image Processing, 2019 p.37 Deep Learning Interpolation Filter High performing solution in HEVC for sub-pel motion estimation . half pixel location images: . Deep learning ground truth: . Network: Z. Li, ECE 484 Digital Image Processing, 2019 p.38 Summary Downsampling images: . downsampling is multiplication with the impulse train in time domain . it is convolution with signal spectrum in freq domain . if not sampling at 2fmax, aliasing. Interpolation . Ideal reconstruction via Sinc function, infinite support not practical .
Recommended publications
  • An End-To-End System for Automatic Characterization of Iba1 Immunopositive Microglia in Whole Slide Imaging
    Neuroinformatics (2019) 17:373–389 https://doi.org/10.1007/s12021-018-9405-x ORIGINAL ARTICLE An End-to-end System for Automatic Characterization of Iba1 Immunopositive Microglia in Whole Slide Imaging Alexander D. Kyriazis1 · Shahriar Noroozizadeh1 · Amir Refaee1 · Woongcheol Choi1 · Lap-Tak Chu1 · Asma Bashir2 · Wai Hang Cheng2 · Rachel Zhao2 · Dhananjay R. Namjoshi2 · Septimiu E. Salcudean3 · Cheryl L. Wellington2 · Guy Nir4 Published online: 8 November 2018 © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract Traumatic brain injury (TBI) is one of the leading causes of death and disability worldwide. Detailed studies of the microglial response after TBI require high throughput quantification of changes in microglial count and morphology in histological sections throughout the brain. In this paper, we present a fully automated end-to-end system that is capable of assessing microglial activation in white matter regions on whole slide images of Iba1 stained sections. Our approach involves the division of the full brain slides into smaller image patches that are subsequently automatically classified into white and grey matter sections. On the patches classified as white matter, we jointly apply functional minimization methods and deep learning classification to identify Iba1-immunopositive microglia. Detected cells are then automatically traced to preserve their complex branching structure after which fractal analysis is applied to determine the activation states of the cells. The resulting system detects white matter regions with 84% accuracy, detects microglia with a performance level of 0.70 (F1 score, the harmonic mean of precision and sensitivity) and performs binary microglia morphology classification with a 70% accuracy.
    [Show full text]
  • Generalizing Sampling Theory for Time-Varying Nyquist Rates Using Self-Adjoint Extensions of Symmetric Operators with Deficiency Indices (1,1) in Hilbert Spaces
    Generalizing Sampling Theory for Time-Varying Nyquist Rates using Self-Adjoint Extensions of Symmetric Operators with Deficiency Indices (1,1) in Hilbert Spaces by Yufang Hao A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Applied Mathematics Waterloo, Ontario, Canada, 2011 c Yufang Hao 2011 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Sampling theory studies the equivalence between continuous and discrete representa- tions of information. This equivalence is ubiquitously used in communication engineering and signal processing. For example, it allows engineers to store continuous signals as discrete data on digital media. The classical sampling theorem, also known as the theorem of Whittaker-Shannon- Kotel'nikov, enables one to perfectly and stably reconstruct continuous signals with a con- stant bandwidth from their discrete samples at a constant Nyquist rate. The Nyquist rate depends on the bandwidth of the signals, namely, the frequency upper bound. Intuitively, a signal's `information density' and ‘effective bandwidth' should vary in time. Adjusting the sampling rate accordingly should improve the sampling efficiency and information storage. While this old idea has been pursued in numerous publications, fundamental problems have remained: How can a reliable concept of time-varying bandwidth been defined? How can samples taken at a time-varying Nyquist rate lead to perfect and stable reconstruction of the continuous signals? This thesis develops a new non-Fourier generalized sampling theory which takes samples only as often as necessary at a time-varying Nyquist rate and maintains the ability to perfectly reconstruct the signals.
    [Show full text]
  • Fourier Analysis and Sampling Theory
    Reading Required: Shirley, Ch. 9 Recommended: Ron Bracewell, The Fourier Transform and Its Applications, McGraw-Hill. Fourier analysis and Don P. Mitchell and Arun N. Netravali, “Reconstruction Filters in Computer Computer sampling theory Graphics ,” Computer Graphics, (Proceedings of SIGGRAPH 88). 22 (4), pp. 221-228, 1988. Brian Curless CSE 557 Fall 2009 1 2 What is an image? Images as functions We can think of an image as a function, f, from R2 to R: f(x,y) gives the intensity of a channel at position (x,y) Realistically, we expect the image only to be defined over a rectangle, with a finite range: • f: [a,b]x[c,d] Æ [0,1] A color image is just three functions pasted together. We can write this as a “vector-valued” function: ⎡⎤rxy(, ) f (,xy )= ⎢⎥ gxy (, ) ⎢⎥ ⎣⎦⎢⎥bxy(, ) We’ll focus in grayscale (scalar-valued) images for now. 3 4 Digital images Motivation: filtering and resizing In computer graphics, we usually create or operate What if we now want to: on digital (discrete)images: smooth an image? Sample the space on a regular grid sharpen an image? Quantize each sample (round to nearest enlarge an image? integer) shrink an image? If our samples are Δ apart, we can write this as: In this lecture, we will explore the mathematical underpinnings of these operations. f [n ,m] = Quantize{ f (n Δ, m Δ) } 5 6 Convolution Convolution in 2D One of the most common methods for filtering a In two dimensions, convolution becomes: function, e.g., for smoothing or sharpening, is called convolution.
    [Show full text]
  • Digital Image Processing
    11/11/20 DIGITAL IMAGE PROCESSING Lecture 4 Frequency domain Tammy Riklin Raviv Electrical and Computer Engineering Ben-Gurion University of the Negev Fourier Domain 1 11/11/20 2D Fourier transform and its applications Jean Baptiste Joseph Fourier (1768-1830) ...the manner in which the author arrives at these A bold idea (1807): equations is not exempt of difficulties and...his Any univariate function can analysis to integrate them still leaves something be rewritten as a weighted to be desired on the score of generality and even sum of sines and cosines of rigour. different frequencies. • Don’t believe it? – Neither did Lagrange, Laplace, Poisson and Laplace other big wigs – Not translated into English until 1878! • But it’s (mostly) true! – called Fourier Series Legendre Lagrange – there are some subtle restrictions Hays 2 11/11/20 A sum of sines and cosines Our building block: Asin(wx) + B cos(wx) Add enough of them to get any signal g(x) you want! Hays Reminder: 1D Fourier Series 3 11/11/20 Fourier Series of a Square Wave Fourier Series: Just a change of basis 4 11/11/20 Inverse FT: Just a change of basis 1D Fourier Transform 5 11/11/20 1D Fourier Transform Fourier Transform 6 11/11/20 Example: Music • We think of music in terms of frequencies at different magnitudes Slide: Hoiem Fourier Analysis of a Piano https://www.youtube.com/watch?v=6SR81Wh2cqU 7 11/11/20 Fourier Analysis of a Piano https://www.youtube.com/watch?v=6SR81Wh2cqU Discrete Fourier Transform Demo http://madebyevan.com/dft/ Evan Wallace 8 11/11/20 2D Fourier Transform
    [Show full text]
  • Filter Effects and Filter Artifacts in the Analysis of Electrophysiological Data
    GENERAL COMMENTARY published: 09 July 2012 doi: 10.3389/fpsyg.2012.00233 Filter effects and filter artifacts in the analysis of electrophysiological data Andreas Widmann* and Erich Schröger Institute of Psychology, University of Leipzig, Leipzig, Germany *Correspondence: [email protected] Edited by: Guillaume A. Rousselet, University of Glasgow, UK Reviewed by: Rufin VanRullen, Centre de Recherche Cerveau et Cognition, France Lucas C. Parra, City College of New York, USA A commentary on unity gain at DC (the step response never FILTER EFFECTS VS. FILTER ARTIFACTS returns to one). These artifacts are due to a We also recommend to distinguish between Four conceptual fallacies in mapping the known misconception in FIR filter design in filter effects, that is, the obligatory effects time course of recognition EEGLAB1. The artifacts are further ampli- any filter with equivalent properties – cutoff by VanRullen, R. (2011). Front. Psychol. fied by filtering twice, forward and back- frequency, roll-off, ripple, and attenuation 2:365. doi: 10.3389/fpsyg.2011.00365 ward, to achieve zero-phase. – would have on the data (e.g., smoothing With more appropriate filters the under- of transients as demonstrated by the filter’s Does filtering preclude us from studying estimation of signal onset latency due to step response), and filter artifacts, that is, ERP time-courses? the smoothing effect of low-pass filtering effects which can be minimized by selection by Rousselet, G. A. (2012). Front. Psychol. could be narrowed down to about 4–12 ms of filter type and parameters (e.g., ringing). 3:131. doi: 10.3389/fpsyg.2012.00131 in the simulated dataset (see Figure 1 and Appendix for a simulation), that is, about an CAUSAL FILTERING In a recent review, VanRullen (2011) con- order of magnitude smaller than assumed.
    [Show full text]
  • 9. Biomedical Imaging Informatics Daniel L
    9. Biomedical Imaging Informatics Daniel L. Rubin, Hayit Greenspan, and James F. Brinkley After reading this chapter, you should know the answers to these questions: 1. What makes images a challenging type of data to be processed by computers, as opposed to non-image clinical data? 2. Why are there many different imaging modalities, and by what major two characteristics do they differ? 3. How are visual and knowledge content in images represented computationally? How are these techniques similar to representation of non-image biomedical data? 4. What sort of applications can be developed to make use of the semantic image content made accessible using the Annotation and Image Markup model? 5. Describe four different types of image processing methods. Why are such methods assembled into a pipeline when creating imaging applications? 6. Give an example of an imaging modality with high spatial resolution. Give an example of a modality that provides functional information. Why are most imaging modalities not capable of providing both? 7. What is the goal in performing segmentation in image analysis? Why is there more than one segmentation method? 8. What are two types of quantitative information in images? What are two types of semantic information in images? How might this information be used in medical applications? 9. What is the difference between image registration and image fusion? Given an example of each. 1 9.1. Introduction Imaging plays a central role in the healthcare process. Imaging is crucial not only to health care, but also to medical communication and education, as well as in research.
    [Show full text]
  • Digital Signal Processing Tom Davinson
    First SPES School on Experimental Techniques with Radioactive Beams INFN LNS Catania – November 2011 Experimental Challenges Lecture 4: Digital Signal Processing Tom Davinson School of Physics & Astronomy N I VE R U S I E T H Y T O H F G E D R I N B U Objectives & Outline Practical introduction to DSP concepts and techniques Emphasis on nuclear physics applications I intend to keep it simple … … even if it’s not … … I don’t intend to teach you VHDL! • Sampling Theorem • Aliasing • Filtering? Shaping? What’s the difference? … and why do we do it? • Digital signal processing • Digital filters semi-gaussian, moving window deconvolution • Hardware • To DSP or not to DSP? • Summary • Further reading Sampling Sampling Periodic measurement of analogue input signal by ADC Sampling Theorem An analogue input signal limited to a bandwidth fBW can be reproduced from its samples with no loss of information if it is regularly sampled at a frequency fs 2fBW The sampling frequency fs= 2fBW is called the Nyquist frequency (rate) Note: in practice the sampling frequency is usually >5x the signal bandwidth Aliasing: the problem Continuous, sinusoidal signal frequency f sampled at frequency fs (fs < f) Aliasing misrepresents the frequency as a lower frequency f < 0.5fs Aliasing: the solution Use low-pass filter to restrict bandwidth of input signal to satisfy Nyquist criterion fs 2fBW Digital Signal Processing D…igi wtahl aSt ignneaxtl? Processing Digital signal processing is the software controlled processing of sequential data derived from a digitised analogue signal. Some of the advantages of digital signal processing are: • functionality possible to implement functions which are difficult, impractical or impossible to achieve using hardware, e.g.
    [Show full text]
  • Aliasing, Image Sampling and Reconstruction
    https://youtu.be/yr3ngmRuGUc Recall: a pixel is a point… Aliasing, Image Sampling • It is NOT a box, disc or teeny wee light and Reconstruction • It has no dimension • It occupies no area • It can have a coordinate • More than a point, it is a SAMPLE Many of the slides are taken from Thomas Funkhouser course slides and the rest from various sources over the web… Image Sampling Imaging devices area sample. • An image is a 2D rectilinear array of samples • In video camera the CCD Quantization due to limited intensity resolution array is an area integral Sampling due to limited spatial and temporal resolution over a pixel. • The eye: photoreceptors Intensity, I Pixels are infinitely small point samples J. Liang, D. R. Williams and D. Miller, "Supernormal vision and high- resolution retinal imaging through adaptive optics," J. Opt. Soc. Am. A 14, 2884- 2892 (1997) 1 Aliasing Good Old Aliasing Reconstruction artefact Sampling and Reconstruction Sampling Reconstruction Slide © Rosalee Nerheim-Wolfe 2 Sources of Error Aliasing (in general) • Intensity quantization • In general: Artifacts due to under-sampling or poor reconstruction Not enough intensity resolution • Specifically, in graphics: Spatial aliasing • Spatial aliasing Temporal aliasing Not enough spatial resolution • Temporal aliasing Not enough temporal resolution Under-sampling Figure 14.17 FvDFH Sampling & Aliasing Spatial Aliasing • Artifacts due to limited spatial resolution • Real world is continuous • The computer world is discrete • Mapping a continuous function to a
    [Show full text]
  • Recognition of Electrical & Electronics Components
    NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA Submission of project report for the evaluation of the final year project Titled Recognition of Electrical & Electronics Components Under the guidance of: Prof. S. Meher Dept. of Electronics & Communication Engineering NIT, Rourkela. Submitted by: Submitted by: Amiteshwar Kumar Abhijeet Pradeep Kumar Chachan 10307022 10307030 B.Tech IV B.Tech IV Dept. of Electronics & Communication Dept. of Electronics & Communication Engg. Engg. NIT, Rourkela NIT, Rourkela NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA Submission of project report for the evaluation of the final year project Titled Recognition of Electrical & Electronics Components Under the guidance of: Prof. S. Meher Dept. of Electronics & Communication Engineering NIT, Rourkela. Submitted by: Submitted by: Amiteshwar Kumar Abhijeet Pradeep Kumar Chachan 10307022 10307030 B.Tech IV B.Tech IV Dept. of Electronics & Communication Dept. of Electronics & Communication Engg. Engg. NIT, Rourkela NIT, Rourkela National Institute of Technology Rourkela CERTIFICATE This is to certify that the thesis entitled, “RECOGNITION OF ELECTRICAL & ELECTRONICS COMPONENTS ” submitted by Sri AMITESHWAR KUMAR ABHIJEET and Sri PRADEEP KUMAR CHACHAN in partial fulfillments for the requirements for the award of Bachelor of Technology Degree in Electronics & Instrumentation Engg. at National Institute of Technology, Rourkela (Deemed University) is an authentic work carried out by him under my supervision and guidance. To the best of my knowledge, the matter embodied in the thesis has not been submitted to any other University / Institute for the award of any Degree or Diploma. Date: Dr. S. Meher Dept. of Electronics & Communication Engg. NIT, Rourkela. ACKNOWLEDGEMENT I wish to express my deep sense of gratitude and indebtedness to Dr.S.Meher, Department of Electronics & Communication Engg.
    [Show full text]
  • Sampling Theory for Digital Video Acquisition: the Guide for the Perplexed User
    Sampling Theory for Digital Video Acquisition: The Guide for the Perplexed User Prof. Lenny Rudin1,2,3 Ping Yu1 Prof. Jean-Michel Morel2 Cognitech, Inc, Pasadena, California (1) Ecole Normale Superieure de Cachan, France(2) SMPTE Member (Hollywood Technical Section) (3) Abstract: Recently, the law enforcement community with professional interests in applications of image/video processing technology has been exposed to scientifically flawed assertions regarding the advantages and disadvantages of various hardware image acquisition devices (video digitizing cards). These assertions state a necessity of using SMPTE CCIR-601 standard when digitizing NTSC composite video signals from surveillance videotapes. In particular, it would imply that the pixel-sampling rate of 720*486 is absolutely required to capture all the available video information encoded in the composite video signal and recorded on (S)VHS videotapes. Fortunately, these statements can be directly analyzed within the strict mathematical context of Shannons Sampling Theory, and shown to be wrong. Here we apply the classical Shannon-Nyquist results to the process of digitizing composite analog video from videotapes to dispel the theoretically unfounded, wrong assertions. Introduction: The field of image processing is a mature interdisciplinary science that spans the fields of electrical engineering, applied mathematics, and computer science. Over the last sixty years, this field accumulated fundamental results from the above scientific disciplines. In particular, the field of signal processing has contributed to the basic understanding of the exact mathematical relationship between the world of continuous (analog) images and the digitized versions of these images, when collected by computer video acquisition systems. This theory is known as Sampling Theory, and is credited to Prof.
    [Show full text]
  • An Analysis of Aliasing and Image Restoration Performance for Digital Imaging Systems
    AN ANALYSIS OF ALIASING AND IMAGE RESTORATION PERFORMANCE FOR DIGITAL IMAGING SYSTEMS Thesis Submitted to The School of Engineering of the UNIVERSITY OF DAYTON In Partial Fulfillment of the Requirements for The Degree of Master of Science in Electrical Engineering By Iman Namroud UNIVERSITY OF DAYTON Dayton, Ohio May, 2014 AN ANALYSIS OF ALIASING AND IMAGE RESTORATION PERFORMANCE FOR DIGITAL IMAGING SYSTEMS Name: Namroud, Iman APPROVED BY: Russell C. Hardie, Ph.D. John S. Loomis, Ph.D. Advisor Committee Chairman Committee Member Professor, Department of Electrical Professor, Department of Electrical and Computer Engineering and Computer Engineering Eric J. Balster, Ph.D. Committee Member Assistant Professor, Department of Electrical and Computer Engineering John G. Weber, Ph.D. Tony E. Saliba, Ph.D. Associate Dean Dean, School of Engineering School of Engineering & Wilke Distinguished Professor ii c Copyright by Iman Namroud All rights reserved 2014 ABSTRACT AN ANALYSIS OF ALIASING AND IMAGE RESTORATION PERFORMANCE FOR DIGITAL IMAGING SYSTEMS Name: Namroud, Iman University of Dayton Advisor: Dr. Russell C. Hardie It is desirable to obtain a high image quality when designing an imaging system. The design depends on many factors such as the optics, the pitch, and the cost. The effort to enhance one aspect of the image may reduce the chances of enhancing another one, due to some tradeoffs. There is no imaging system capable of producing an ideal image, since that the system itself presents distortion in the image. When designing an imaging system, some tradeoffs favor aliasing, such as the desire for a wide field of view (FOV) and a high signal to noise ratio (SNR).
    [Show full text]
  • Analyze Bus Goals & Constraints
    16: Windowed-Sinc Filters * Acknowledgment: This material is derived and adapted from “The Scientist and Engineer's Guide to Digital Signal processing”, Steven W. Smith WOO-CCI504-SCI-UoN 1 Windowed-sinc filter . Windowed-sinc filters are used to separate one band of frequencies from another. For this, they are very stable, consistent, and can deliver high performance levels. The exceptional frequency domain characteristics are obtained, however, at the expense of poor performance in the time domain, including excessive ripple and overshoot in the step response. When carried out by standard convolution, windowed-sinc filters are easy to program, but slow to execute. the FFT can be used to dramatically improve the computational speed of these filters. WOO-CCI504-SCI-UoN 2 Strategy of the Windowed-Sinc WOO-CCI504-SCI-UoN 3 Strategy of the Windowed-Sinc . the idea behind the windowed-sinc filter. [see Figure 16-1] . The frequency response of the ideal low-pass filter: . All frequencies below the cutoff frequency, fC, are passed with unity amplitude, while all higher frequencies are blocked. The passband is perfectly flat, the attenuation in the stopband is infinite, and the transition between the two is infinitesimally small. Taking the Inverse Fourier Transform of this ideal frequency response produces the ideal filter kernel (impulse response) which is the sinc function, given by: WOO-CCI504-SCI-UoN 4 Strategy of the Windowed-Sinc Figure 16-1 WOO-CCI504-SCI-UoN 5 Strategy of the Windowed-Sinc . Convolving an input signal with this (sinc) filter kernel should provides a perfect low-pass filter. Problem: the sinc function continues to both negative and positive infinity without dropping to zero amplitude.
    [Show full text]