Digital Imaging and Multimedia. Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University

Save this PDF as:

Size: px
Start display at page:

Download "Digital Imaging and Multimedia. Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University"

Transcription

1 Digital Imaging and Multimedia Filters Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What are Filters Linear Filters Convolution operation Properties of Linear Filters Application of filters Nonlinear Filter Normalized Correlation and finding patterns in images Sources: Burger and Burge Digital Image Processing Chapter 6 Forsyth and Ponce Computer Vision a Modern approach 1

2 What is a Filter Point operations are limited (why) They cannot accomplish tasks like sharpening or smoothing Smoothing an image by averaging Replace each pixel by the average of its neighboring pixels Assume a 3x3 neighborhood: 2

3 In general a filter applies a function over the values of a small neighborhood of pixels to compute the result The size of the filter = the size of the neighborhood: 3x3, 5x5, 7x7,, 21x21,.. The shape of the filter region is not necessarily square, can be a rectangle, a circle Filters can be linear of nonlinear 3

4 Linear Filters: convolution Averaging filter 4

5 Types of Linear Filters Computing the filter operation The filter matrix H moves over the original image I to compute the convolution operation We need an intermediate image storage! We need 4 for loops! In general a scale is needed to obtain a normalized filter. Integer coefficient is preferred to avoid floating point operations 5

6 For a filter of size (2K+1) x (2L+1), if the image size is MxN, the filter is computed over the range: Another smoothing filter 6

7 Integer coefficient Ex: linear filter in Adobe photoshop 7

8 Mathematical Properties of Linear Convolution For any 2D discrete signal, convolution is defined as: Properties Commutativity Linearity (notice) Associativity 8

9 Properties Separability Types of Linear Filters 9

10 Smoothing by Averaging vs. Gaussian Flat kernel: all weights equal 1/N Smoothing with a Gaussian Smoothing with an average actually doesn t compare at all well with a defocussed lens Most obvious difference is that a single point of light viewed in a defocussed lens looks like a fuzzy blob; but the averaging process would give a little square. A Gaussian gives a good model of a fuzzy blob 10

11 An Isotropic Gaussian The picture shows a smoothing kernel proportional to (which is a reasonable model of a circularly symmetric fuzzy blob) Smoothing with a Gaussian 11

12 Gaussian smoothing Advantages of Gaussian filtering rotationally symmetric (for large filters) filter weights decrease monotonically from central peak, giving most weight to central pixels Simple and intuitive relationship between size of σ and the smoothing. The Gaussian is separable Advantage of seperability First convolve the image with a one dimensional horizontal filter Then convolve the result of the first convolution with a one dimensional vertical filter For a kxk Gaussian filter, 2D convolution requires k 2 operations per pixel But using the separable filters, we reduce this to 2k operations per pixel. 12

13 Separability x = = 11 2 = = = = = Advantages of Gaussians Convolution of a Gaussian with itself is another Gaussian so we can first smooth an image with a small Gaussian then, we convolve that smoothed image with another small Gaussian and the result is equivalent to smoother the original image with a larger Gaussian. If we smooth an image with a Gaussian having sd σ twice, then we get the same result as smoothing the image with a Gaussian having standard deviation (2σ) 13

14 Nonlinear Filters Linear filters have a disadvantage when used for smoothing or removing noise: all image structures are blurred, the quality of the image is reduced. Examples of nonlinear filters: Minimum and Maximum filters 14

15 Median Filter Much better in removing noise and keeping the structures 15

16 Weighted median filter Linear Filters: convolution 16

17 Convolution as a Dot Product Applying a filter at some point can be seen as taking a dot-product between the image and some vector Convoluting an image with a filter is equivalent to taking the dot product of the filter with each image window. Window weights Window weights Original image Filtered image Largest value when the vector representing the image is parallel to the vector representing the filter Filter responds most strongly at image windows that looks like the filter. Filter responds stronger to brighter regions! (drawback) Insight: filters look like the effects they are intended to find filters find effects they look like weights Window Ex: Derivative of Gaussian used in edge detection looks like edges 17

18 Normalized Correlation Convolution with a filter can be used to find templates in the image. Normalized correlation output is filter output, divided by root sum of squares of values over which filter lies Consider template (filter) M and image window N: Template Window Original image Filtered image (Normalized Correlation Result) Normalized Correlation This correlation measure takes on values in the range [0,1] it is 1 if and only if N = cm for some constant c so N can be uniformly brighter or darker than the template, M, and the correlation will still be high. The first term in the denominator, ΣΣM 2 depends only on the template, and can be ignored The second term in the denominator, ΣΣN 2 can be eliminated if we first normalize the grey levels of N so that their total value is the same as that of M - just scale each pixel in N by ΣΣ M/ ΣΣ N 18

19 Positive responses Zero mean image, -1:1 scale Zero mean image, -max:max scale Positive responses Zero mean image, -1:1 scale Zero mean image, -max:max scale 19

20 Figure from Computer Vision for Interactive Computer Graphics, W.Freeman et al, IEEE Computer Graphics and Applications, 1998 copyright 1998, IEEE 20

Convolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/

Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters

Computational Foundations of Cognitive Science

Computational Foundations of Cognitive Science Lecture 15: Convolutions and Kernels Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 2010 Frank Keller Computational

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition 1. Image Pre-Processing - Pixel Brightness Transformation - Geometric Transformation - Image Denoising 1 1. Image Pre-Processing

Correlation and Convolution Class Notes for CMSC 426, Fall 2005 David Jacobs

Correlation and Convolution Class otes for CMSC 46, Fall 5 David Jacobs Introduction Correlation and Convolution are basic operations that we will perform to extract information from images. They are in

Computer Vision: Filtering

Computer Vision: Filtering Raquel Urtasun TTI Chicago Jan 10, 2013 Raquel Urtasun (TTI-C) Computer Vision Jan 10, 2013 1 / 82 Today s lecture... Image formation Image Filtering Raquel Urtasun (TTI-C) Computer

Convolution, Noise and Filters

T H E U N I V E R S I T Y of T E X A S Convolution, Noise and Filters Philip Baldwin, Ph.D. Department of Biochemistry Response to an Entire Signal The response of a system with impulse response h(t) to

(Refer Slide Time: 06:10)

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 43 Digital Image Processing Welcome back to the last part of the lecture

Introduction Bilateral Filtering Results. Bilateral Filtering. Mathias Eitz. TU Berlin. November, 21st 2006

Introduction TU Berlin November, 21st 2006 About Me Introduction Student at TU Berlin since 2002 eitz@cs.tu-berlin.de Outline Introduction 1 Introduction Smoothing Filters Comparison 2 Intuition Mathematical

Outline. Random Variables. Examples. Random Variable

Outline Random Variables M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno Random variables. CDF and pdf. Joint random variables. Correlated, independent, orthogonal. Correlation,

Image Processing with. ImageJ. Biology. Imaging

Image Processing with ImageJ 1. Spatial filters Outlines background correction image denoising edges detection 2. Fourier domain filtering correction of periodic artefacts 3. Binary operations masks morphological

Module 3: Correlation and Covariance

Using Statistical Data to Make Decisions Module 3: Correlation and Covariance Tom Ilvento Dr. Mugdim Pašiƒ University of Delaware Sarajevo Graduate School of Business O ften our interest in data analysis

Moving Average Filters

CHAPTER 15 Moving Average Filters The moving average is the most common filter in DSP, mainly because it is the easiest digital filter to understand and use. In spite of its simplicity, the moving average

Probability and Statistics

CHAPTER 2: RANDOM VARIABLES AND ASSOCIATED FUNCTIONS 2b - 0 Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute - Systems and Modeling GIGA - Bioinformatics ULg kristel.vansteen@ulg.ac.be

jorge s. marques image processing

image processing images images: what are they? what is shown in this image? What is this? what is an image images describe the evolution of physical variables (intensity, color, reflectance, condutivity)

Implementation of Canny Edge Detector of color images on CELL/B.E. Architecture.

Implementation of Canny Edge Detector of color images on CELL/B.E. Architecture. Chirag Gupta,Sumod Mohan K cgupta@clemson.edu, sumodm@clemson.edu Abstract In this project we propose a method to improve

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide

Lecture 2: 2D Fourier transforms and applications

Lecture 2: 2D Fourier transforms and applications B14 Image Analysis Michaelmas 2014 A. Zisserman Fourier transforms and spatial frequencies in 2D Definition and meaning The Convolution Theorem Applications

Interactive Math Glossary Terms and Definitions

Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Additive Property of Area the process of finding an the area of a shape by totaling the areas

Today s Topics. Lecture 11: LoG and DoG Filters. Recall: First Derivative Filters. Second-Derivative Filters

Today s Topics Lecture : LoG and DoG Filters Laplacian of Gaussian (LoG) Filter - useful for finding edges - also useful for finding blobs! approimation using Difference of Gaussian (DoG) Recall: First

Image Manipulation in MATLAB Due 11/1 at 5:00 PM

Image Manipulation in MATLAB Due 11/1 at 5:00 PM 1 Introduction Digital images are just matrices of pixels, and any type of matrix operation can be applied to a matrix containing image data. In this project

Background: A CCD consists of an array of individual detector sites, as suggested by the sketch below: Array of independent detector sites

Q: Can I use PixelScope to measure the MTF of a CCD camera? Can I use PixelScope to map the actual sensitive area of a pixel? A: Yes to both. This note explains how. Approach This can be a complicated

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation

COGNITIVE TUTOR ALGEBRA

COGNITIVE TUTOR ALGEBRA Numbers and Operations Standard: Understands and applies concepts of numbers and operations Power 1: Understands numbers, ways of representing numbers, relationships among numbers,

One-Dimensional Processing for Edge Detection using Hilbert Transform P. Kiran Kumar, Sukhendu Das and B. Yegnanarayana Department of Computer Science and Engineering Indian Institute of Technology, Madras

Applications to Data Smoothing and Image Processing I

Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is

Lecture 14. Point Spread Function (PSF)

Lecture 14 Point Spread Function (PSF), Modulation Transfer Function (MTF), Signal-to-noise Ratio (SNR), Contrast-to-noise Ratio (CNR), and Receiver Operating Curves (ROC) Point Spread Function (PSF) Recollect

situation when the value of coecients (obtained by means of the transformation) corresponding to higher frequencies are either zero or near to zero. T

Dithering as a method for image data compression Pavel Slav k (slavik@cslab.felk.cvut.cz), Jan P ikryl (prikryl@sgi.felk.cvut.cz) Czech Technical University Prague Faculty of Electrical Engineering Department

Understanding and Applying Kalman Filtering

Understanding and Applying Kalman Filtering Lindsay Kleeman Department of Electrical and Computer Systems Engineering Monash University, Clayton 1 Introduction Objectives: 1. Provide a basic understanding

Trend and Seasonal Components

Chapter 2 Trend and Seasonal Components If the plot of a TS reveals an increase of the seasonal and noise fluctuations with the level of the process then some transformation may be necessary before doing

Notes on Matrix Multiplication and the Transitive Closure

ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.

Image Estimation Algorithm for Out of Focus and Blur Images to Retrieve the Barcode Value

IJSTE - International Journal of Science Technology & Engineering Volume 1 Issue 10 April 2015 ISSN (online): 2349-784X Image Estimation Algorithm for Out of Focus and Blur Images to Retrieve the Barcode

Lectures 6&7: Image Enhancement

Lectures 6&7: Image Enhancement Leena Ikonen Pattern Recognition (MVPR) Lappeenranta University of Technology (LUT) leena.ikonen@lut.fi http://www.it.lut.fi/ip/research/mvpr/ 1 Content Background Spatial

Admin stuff. 4 Image Pyramids. Spatial Domain. Projects. Fourier domain 2/26/2008. Fourier as a change of basis

Admin stuff 4 Image Pyramids Change of office hours on Wed 4 th April Mon 3 st March 9.3.3pm (right after class) Change of time/date t of last class Currently Mon 5 th May What about Thursday 8 th May?

1) Write the following as an algebraic expression using x as the variable: Triple a number subtracted from the number

1) Write the following as an algebraic expression using x as the variable: Triple a number subtracted from the number A. 3(x - x) B. x 3 x C. 3x - x D. x - 3x 2) Write the following as an algebraic expression

Deinterlacing/interpolation of TV signals. Elham Shahinfard Advisors: Prof. M. Ahmadi Prof. M. Sid-Ahmed

Deinterlacing/interpolation of TV signals Elham Shahinfard Advisors: Prof. M. Ahmadi Prof. M. Sid-Ahmed Outline A Review of some terminologies Converting from NTSC to HDTV; What changes need to be considered?

Color to Grayscale Conversion with Chrominance Contrast

Color to Grayscale Conversion with Chrominance Contrast Yuting Ye University of Virginia Figure 1: The sun in Monet s Impression Sunrise has similar luminance as the sky. It can hardly be seen when the

EMBL internal only. Digital Imaging. Data Handling Basic Image Processing. Stefan Terjung Advanced Light Microscopy Facility

Digital Imaging Data Handling Basic Image Processing Stefan Terjung Advanced Light Microscopy Facility Overview Part I: File formats (data storage) Programs for image viewing / processing / representation

Principal Component Analysis Application to images

Principal Component Analysis Application to images Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception http://cmp.felk.cvut.cz/

PERFORMANCE ANALYSIS OF HIGH RESOLUTION IMAGES USING INTERPOLATION TECHNIQUES IN MULTIMEDIA COMMUNICATION SYSTEM

PERFORMANCE ANALYSIS OF HIGH RESOLUTION IMAGES USING INTERPOLATION TECHNIQUES IN MULTIMEDIA COMMUNICATION SYSTEM Apurva Sinha 1, Mukesh kumar 2, A.K. Jaiswal 3, Rohini Saxena 4 Department of Electronics

Canny Edge Detection

Canny Edge Detection 09gr820 March 23, 2009 1 Introduction The purpose of edge detection in general is to significantly reduce the amount of data in an image, while preserving the structural properties

Extended control charts

Extended control charts The control chart types listed below are recommended as alternative and additional tools to the Shewhart control charts. When compared with classical charts, they have some advantages

AREA. AREA is the amount of surface inside a flat shape. (flat means 2 dimensional)

AREA AREA is the amount of surface inside a flat shape. (flat means 2 dimensional) Area is always measured in units 2 The most basic questions that you will see will involve calculating the area of a square

Sharpening through spatial filtering

Sharpening through spatial filtering Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione delle immagini (Image processing I) academic year 2011 2012 Sharpening The term

- What is a feature? - Image processing essentials - Edge detection (Sobel & Canny) - Hough transform - Some images

Seminar: Feature extraction by André Aichert I Feature detection - What is a feature? - Image processing essentials - Edge detection (Sobel & Canny) - Hough transform - Some images II An Entropy-based

Image Enhancement in the Frequency Domain

Image Enhancement in the Frequency Domain Jesus J. Caban Outline! Assignment #! Paper Presentation & Schedule! Frequency Domain! Mathematical Morphology %& Assignment #! Questions?! How s OpenCV?! You

Image Filtering & Edge Detection

What is imae filterin? Imae Filterin & Ede Detection Modify the pixels in an imae based on some function of a local neihborhood of the pixels. Some function Readin: Chapter 7 and 8, F&P Linear Functions

Course Name: Course Code: ALEKS Course: Instructor: Course Dates: Course Content: Textbook: Dates Objective Prerequisite Topics

Course Name: MATH 1204 Fall 2015 Course Code: N/A ALEKS Course: College Algebra Instructor: Master Templates Course Dates: Begin: 08/22/2015 End: 12/19/2015 Course Content: 271 Topics (261 goal + 10 prerequisite)

4 Sums of Random Variables

Sums of a Random Variables 47 4 Sums of Random Variables Many of the variables dealt with in physics can be expressed as a sum of other variables; often the components of the sum are statistically independent.

Joint Probability Distributions and Random Samples. Week 5, 2011 Stat 4570/5570 Material from Devore s book (Ed 8), and Cengage

5 Joint Probability Distributions and Random Samples Week 5, 2011 Stat 4570/5570 Material from Devore s book (Ed 8), and Cengage Two Discrete Random Variables The probability mass function (pmf) of a single

MATLAB-based Applications for Image Processing and Image Quality Assessment Part II: Experimental Results

154 L. KRASULA, M. KLÍMA, E. ROGARD, E. JEANBLANC, MATLAB BASED APPLICATIONS PART II: EXPERIMENTAL RESULTS MATLAB-based Applications for Image Processing and Image Quality Assessment Part II: Experimental

This document describes methods of assessing the potential for wedge sliding instability, using stereonet kinematic analysis.

Wedge Failure Kinematic analysis on a stereonet This document describes methods of assessing the potential for wedge sliding instability, using stereonet kinematic analysis. 1. The traditional approach

Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression

Social Media Mining. Network Measures

Klout Measures and Metrics 22 Why Do We Need Measures? Who are the central figures (influential individuals) in the network? What interaction patterns are common in friends? Who are the like-minded users

Classification of Fingerprints. Sarat C. Dass Department of Statistics & Probability

Classification of Fingerprints Sarat C. Dass Department of Statistics & Probability Fingerprint Classification Fingerprint classification is a coarse level partitioning of a fingerprint database into smaller

Computational Optical Imaging - Optique Numerique. -- Deconvolution --

Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method

Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent

Super-resolution method based on edge feature for high resolution imaging

Science Journal of Circuits, Systems and Signal Processing 2014; 3(6-1): 24-29 Published online December 26, 2014 (http://www.sciencepublishinggroup.com/j/cssp) doi: 10.11648/j.cssp.s.2014030601.14 ISSN:

C4 Computer Vision. 4 Lectures Michaelmas Term Tutorial Sheet Prof A. Zisserman. fundamental matrix, recovering ego-motion, applications.

C4 Computer Vision 4 Lectures Michaelmas Term 2004 1 Tutorial Sheet Prof A. Zisserman Overview Lecture 1: Stereo Reconstruction I: epipolar geometry, fundamental matrix. Lecture 2: Stereo Reconstruction

Exploratory Data Analysis

Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction

Common Core Unit Summary Grades 6 to 8

Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations

How to interpret scientific & statistical graphs

How to interpret scientific & statistical graphs Theresa A Scott, MS Department of Biostatistics theresa.scott@vanderbilt.edu http://biostat.mc.vanderbilt.edu/theresascott 1 A brief introduction Graphics:

Image Compression Using Gabor Filter

Mr.B.H.Deokate, Dr. P. M. Patil and Mr.S.S. Majgaonkar 28 Image Compression Using Gabor Filter Mr.B.H.Deokate, Dr. P. M. Patil and Mr.S.S. Majgaonkar Abstract: The data is the basic component of information.

POLES, ZEROS, and HIGHER ORDER FILTERS By John Ehlers

POLES, ZEROS, and HIGHER ORDER FILTERS By John Ehlers INTRODUCTION Smoothing filters are at the very core of what we technical analysts do. All technicians are familiar with Simple Moving Averages, Exponential

Lecture No. # 02 Prologue-Part 2

Advanced Matrix Theory and Linear Algebra for Engineers Prof. R.Vittal Rao Center for Electronics Design and Technology Indian Institute of Science, Bangalore Lecture No. # 02 Prologue-Part 2 In the last

222 The International Arab Journal of Information Technology, Vol. 1, No. 2, July 2004 particular pixels. High pass filter and low pass filter are gen

The International Arab Journal of Information Technology, Vol. 1, No. 2, July 2004 221 A New Approach for Contrast Enhancement Using Sigmoid Function Naglaa Hassan 1&2 and Norio Akamatsu 1 1 Department

PCA to Eigenfaces. CS 510 Lecture #16 March 23 th A 9 dimensional PCA example

PCA to Eigenfaces CS 510 Lecture #16 March 23 th 2015 A 9 dimensional PCA example is dark around the edges and bright in the middle. is light with dark vertical bars. is light with dark horizontal bars.

MassArt Studio Foundation: Visual Language Digital Media Cookbook, Fall 2013

INPUT OUTPUT 08 / IMAGE QUALITY & VIEWING In this section we will cover common image file formats you are likely to come across and examine image quality in terms of resolution and bit depth. We will cover

Robert Collins CSE598G. More on Mean-shift. R.Collins, CSE, PSU CSE598G Spring 2006

More on Mean-shift R.Collins, CSE, PSU Spring 2006 Recall: Kernel Density Estimation Given a set of data samples x i ; i=1...n Convolve with a kernel function H to generate a smooth function f(x) Equivalent

Algorithms for the resizing of binary and grayscale images using a logical transform

Algorithms for the resizing of binary and grayscale images using a logical transform Ethan E. Danahy* a, Sos S. Agaian b, Karen A. Panetta a a Dept. of Electrical and Computer Eng., Tufts University, 161

Machine vision systems - 2

Machine vision systems Problem definition Image acquisition Image segmentation Connected component analysis Machine vision systems - 1 Problem definition Design a vision system to see a flat world Page

Norwalk La Mirada Unified School District. Algebra Scope and Sequence of Instruction

1 Algebra Scope and Sequence of Instruction Instructional Suggestions: Instructional strategies at this level should include connections back to prior learning activities from K-7. Students must demonstrate

Signal to Noise Instrumental Excel Assignment

Signal to Noise Instrumental Excel Assignment Instrumental methods, as all techniques involved in physical measurements, are limited by both the precision and accuracy. The precision and accuracy of a

Image Denoising. Alexander Kharlamov Victor Podlozhnyuk.

Image Denoising Alexander Kharlamov akharlamov@nvidia.com Victor Podlozhnyuk vpodlozhnyuk@nvidia.com Document Change History Version Date Responsible Reason for Change 0.9 04/16/007 akharlamov Initial

Year 1 Maths Expectations

Times Tables I can count in 2 s, 5 s and 10 s from zero. Year 1 Maths Expectations Addition I know my number facts to 20. I can add in tens and ones using a structured number line. Subtraction I know all

Dimensionality Reduction: Principal Components Analysis

Dimensionality Reduction: Principal Components Analysis In data mining one often encounters situations where there are a large number of variables in the database. In such situations it is very likely

A new approach for defect detection in X-ray CT images

A new approach for defect detection in X-ray CT images Abstract. We introduce a novel method to automatically evaluate X- ray computed tomography (CT) images for the purpose of detecting material defects

Correlating Time-Domain Noise to Detect Fraudulent Credit Cards

School of Engineering and Applied Science Electrical and Systems Engineering Department ESE 498 Correlating Time-Domain Noise to Detect Fraudulent Credit Cards By Wenyuan Liu Andrew Wiens Supervisor Robert

Adding a Realistic Water Reflection to a Photo

Adding a Realistic Water Reflection to a Photo Open the photo you want to add a water reflection to. I am using the photo below: Duplicate the photo so that you have two photos of the same image open in

CHAPTER 4 4. METHODS FOR MEASURING DISTANCE IN IMAGES

50 CHAPTER 4 4. METHODS FOR MEASURING DISTANCE IN IMAGES 4.1. INTRODUCTION In image analysis, the distance transform measures the distance of each object point from the nearest boundary and is an important

Chapter 3: Data Description Numerical Methods

Chapter 3: Data Description Numerical Methods Learning Objectives Upon successful completion of Chapter 3, you will be able to: Summarize data using measures of central tendency, such as the mean, median,

Domain Essential Question Common Core Standards Resources

Middle School Math 2016-2017 Domain Essential Question Common Core Standards First Ratios and Proportional Relationships How can you use mathematics to describe change and model real world solutions? How

2.2 Creaseness operator

2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has compared

Aliasing, Image Sampling and Reconstruction

Aliasing, Image Sampling and Reconstruction Recall: a pixel is a point It is NOT a box, disc or teeny wee light It has no dimension It occupies no area It can have a coordinate More than a point, it is

Image Gradients. Given a discrete image Á Òµ, consider the smoothed continuous image Üµ defined by

Image Gradients Given a discrete image Á Òµ, consider the smoothed continuous image Üµ defined by Üµ Ü ¾ Ö µ Á Òµ Ü ¾ Ö µá µ (1) where Ü ¾ Ö Ô µ Ü ¾ Ý ¾. ½ ¾ ¾ Ö ¾ Ü ¾ ¾ Ö. Here Ü is the 2-norm for the

Lecture 5: Variants of the LMS algorithm

1 Standard LMS Algorithm FIR filters: Lecture 5: Variants of the LMS algorithm y(n) = w 0 (n)u(n)+w 1 (n)u(n 1) +...+ w M 1 (n)u(n M +1) = M 1 k=0 w k (n)u(n k) =w(n) T u(n), Error between filter output

DESCRIPTIVE STATISTICS. The purpose of statistics is to condense raw data to make it easier to answer specific questions; test hypotheses.

DESCRIPTIVE STATISTICS The purpose of statistics is to condense raw data to make it easier to answer specific questions; test hypotheses. DESCRIPTIVE VS. INFERENTIAL STATISTICS Descriptive To organize,

ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,

Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express

Chapter 3 Discrete-Time Fourier Series. by the French mathematician Jean Baptiste Joseph Fourier in the early 1800 s. The

Chapter 3 Discrete-Time Fourier Series 3.1 Introduction The Fourier series and Fourier transforms are mathematical correlations between the time and frequency domains. They are the result of the heat-transfer

Kalman Filter Applications

Kalman Filter Applications The Kalman filter (see Subject MI37) is a very powerful tool when it comes to controlling noisy systems. The basic idea of a Kalman filter is: Noisy data in hopefully less noisy

What Does the Normal Distribution Sound Like?

What Does the Normal Distribution Sound Like? Ananda Jayawardhana Pittsburg State University ananda@pittstate.edu Published: June 2013 Overview of Lesson In this activity, students conduct an investigation

Fourier Synthesis Tutorial v.2.1

Fourier Synthesis Tutorial v.2.1 This tutorial is designed for students from many different academic levels and backgrounds. It occasionally uses terms from discipline-specific fields that you may not

Multimedia Images: Vector-based vs. Bitmap Graphics

1 Multimedia Images: Vector-based vs. Bitmap Graphics Introduction Multimedia is, as described in Vaughan (2001), a combination of various elements, such as text, graphic art, animation, video, and sound.

The Not-Formula Book for C1

Not The Not-Formula Book for C1 Everything you need to know for Core 1 that won t be in the formula book Examination Board: AQA Brief This document is intended as an aid for revision. Although it includes

C19 Machine Learning

C9 Machine Learning 8 Lectures Hilary Term 25 2 Tutorial Sheets A. Zisserman Overview: Supervised classification perceptron, support vector machine, loss functions, kernels, random forests, neural networks

Scanners and How to Use Them

Written by Jonathan Sachs Copyright 1996-1999 Digital Light & Color Introduction A scanner is a device that converts images to a digital file you can use with your computer. There are many different types

Silicon Laboratories, Inc. Rev 1.0 1

Clock Division with Jitter and Phase Noise Measurements Introduction As clock speeds and communication channels run at ever higher frequencies, accurate jitter and phase noise measurements become more

FPGA. AT6000 FPGAs. Application Note AT6000 FPGAs. 3x3 Convolver with Run-Time Reconfigurable Vector Multiplier in Atmel AT6000 FPGAs.

3x3 Convolver with Run-Time Reconfigurable Vector Multiplier in Atmel AT6000 s Introduction Convolution is one of the basic and most common operations in both analog and digital domain signal processing.