816 views

Uploaded by pi194043

The article describes how to obtain a
polynomial approximation of a 2D signal about a neighborhood about a given point using mean square estimation

- Fast 2D Separable Symmetric/Anti-Symmmetric Convolution
- Continuous Emission Hidden Markov Model for sequence classification
- Dense optical flow expansion based on polynomial basis approximation
- Adaptive Skin Color Detector
- A linear channel filter
- ARM Neon Optimization for image interleaving and deinterleaving
- Normalized convolution for image interpolation
- Modified Canny Edge Detection
- Polynomial Approximation of 1D signal
- Local Binary Pattern
- Multi Class Logistic Regression Training and Testing
- Fast Asymmetric Learning for Cascade Face Detection Training/Testing Utility
- Gaussian Multivariate Distribution -Part 1
- SubPixel Corner Localization Algorithm
- Polynomial Approximation of 2D image patch -Part 2
- Control Limited Adaptive Histogram Equalization for Image Enhancement
- Android OpenCV Simple Face Tracker
- A detailed descriptions and results for different color constancy algorithms
- OpenCL Heterogenenous program for Image Processing - ColorSpace conversion BGR-HSV,HSV-BGR,BGR-GRAY
- Uniform Local Binary Pattern and Spatial Histogram Computation

You are on page 1of 9

Pi19404

February 6, 2014

Contents

Contents

Polynomial approximation of 1D signal

0.1 Introduction . . . . . . . . . . 0.2 Polynomial Approximation 0.3 2D projection . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . of 2D signal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

3

3 3 3 8

2 | 9

0.1 Introduction

In this article we will look at the concept for polynomial expansion to approximate a neighborhood of a pixel with a polynomial.

The idea of polynomial expansion is to approximate a neighborhood of a point in a 2D function with a polynomial. Considering only a quadratic polynomial ,pixel values in a neighborhood is given by

f (x) x

Ax

+b

+c

The coefficients can be estimated by weighted least square estimate of pixel values about neighborhood. Let us consider a polynomial of order 2.The basis functions of the subspace where the local signal is being approximated are

1; x2 ; y 2 ; x; y; xy

The basis function are defined on the discrete grid of -N to N considering a window/neighborhood of (2 N + 1) ,for the present example let N=7;

0.3 2D projection

We need to project a 2D function onto these basis As in the case on 1D projection we simply,take the innerproduct of the given signal with the basis 1; x; y; x2 ; y 2 ; xy

3 | 9

4 | 9

To compute the projection parameters ,one can directly take the inner production of the signal with each of the basis. We also need to consider a weighing function ,in the present example we consider a 2D gaussian with variance of 1 along the x and y direction. We get the projection matrix as follows.

0

0 0:9959 0 0 0 0

0 0 0:9959 0 0 0

0 0 0 0 0 0:9918

3 7 7 7 7 7 7 5

(1)

res

= (G 1)

fA

W;

T =

This gives us the projection of the signal onto the basis function The inverse transformation gives us the mean square estimate of the polynomial function in the local neighborhood about the point. In the below function we are obtaining the polynomial estimate of the function 5x2 + 10x + 3 The below matlab sript computes the 2D polynomial approximation At (4; 4) of result array we get the coefficients This corresonds to result translated by 3.

[78; 40; 0; 5; 0; 0]

5 | 9

%generating the meshgrid [bx,by]=meshgrid(x,y); %gaussian weighing function ax=exp((-bx.^2-by.^2)/(2*sigma.^2)); ax=ax/sum(sum(ax)); figure(1); surf(bx,by,ax); shading interp; %the basis functions figure(2); b0=ones(N,N); b1=bx; b2=by; b3=bx.^2; b4=by.^2; b5=by.*bx; subplot(3,2,1) surf(bx,by,b0); grid on; shading interp; subplot(3,2,2) surf(bx,by,b1) grid on; shading interp; subplot(3,2,3) surf(bx,by,b2) grid on; shading interp; subplot(3,2,4) surf(bx,by,b3) grid on; shading interp; subplot(3,2,5) surf(bx,by,b4)

6 | 9

grid on; shading interp; subplot(3,2,6) surf(bx,by,b5) grid on; shading interp; %y=ones(N,N); %computing the G matrix G=B'*W*B=AA' G1=zeros(6,6); G1(1,1)=sum(sum(ax.*b0)); G1(2,2)=sum(sum(ax.*b4)); G1(4,4)=sum(sum(ax.*b4.^2)); G1(6,6)=sum(sum(ax.*bx.^2.*by.^2)); G1(3,3) =G1(2,2); G1(1,4) = G1(2,2); G1(1,5) = G1(2,2); G1(4,1) = G1(2,2); G1(5,1) = G1(2,2); G1(5,5) = G1(4,4); G1(4,5) = G1(6,6); G1(5,4)= G1(6,6);

xx=0:20; yy=0:20; [xx,yy]=meshgrid(xx,yy); S=5*xx.^2+10*xx+3; %computing the matrix A'*I for each of the basis function f0 = b0.*ax; f0 = f0(end:-1:1,end:-1:1); f1 = b1.*ax; f1 = f1(end:-1:1,end:-1:1); f2 = b2.*ax; f2 = f2(end:-1:1,end:-1:1); f3 = b3.*ax; f3 = f3(end:-1:1,end:-1:1); f4 = b4.*ax; f4 = f4(end:-1:1,end:-1:1); f5 = b5.*ax; f5 = f5(end:-1:1,end:-1:1); r1=imfilter(S,f0,'conv','replicate');

7 | 9

%computing the means square estimate using normalized convoltion res=arrayfun(@(x1,x2,x3,x4,x5,x6)inv(G1)*[x1;x2;x3;x4;x5;x6],r1,r2,r3,r4,r5,r6 %displaying the value of function at x-3 cell2mat(res(4,4))

8 | 9

Bibliography

Bibliography

[1] Kenneth Andersson and Hans Knutsson. Continuous normalized convolution. In: ICME (1). IEEE, 2002, pp. 725728.

dblp.uni-trier.de/db/conf/icmcs/icme2002-1.html#AnderssonK02.

[2]

isbn:

0-7803-7304-9.

url: http://

Kenneth Andersson, Carl-Fredrik Westin, and Hans Knutsson. Prediction from 87.3 (Mar. 22, 2007), pp. 353365. url: http://dblp.uni- trier.de/db/ journals/sigpro/sigpro87.html#AnderssonWK07. o-grid samples using continuous normalized convolution. In: Signal Processing

[3]

Gunnar Farnebck. Motion-based Segmentation of Image Sequences. LiTH-ISYEX-1596. MA thesis. SE-581 83 Linkping, Sweden: Linkping University, 1996.

[4]

Gunnar Farnebck. Polynomial Expansion for Orientation and Motion Estimation. Dissertation No 790, ISBN 91-7373-475-6. PhD thesis. SE-581 83 Linkping, Sweden: Linkping University, Sweden, 2002.

[5]

Gunnar Farneback. Two-Frame Motion Estimation Based on Polynomial Expansion. In: SCIA. LNCS 2749. Gothenburg, Sweden, 2003, pp. 363370.

9 | 9

- Fast 2D Separable Symmetric/Anti-Symmmetric ConvolutionUploaded bypi194043
- Continuous Emission Hidden Markov Model for sequence classificationUploaded bypi194043
- Dense optical flow expansion based on polynomial basis approximationUploaded bypi194043
- Adaptive Skin Color DetectorUploaded bypi194043
- A linear channel filterUploaded bypi194043
- ARM Neon Optimization for image interleaving and deinterleavingUploaded bypi194043
- Normalized convolution for image interpolationUploaded bypi194043
- Modified Canny Edge DetectionUploaded bypi194043
- Polynomial Approximation of 1D signalUploaded bypi194043
- Local Binary PatternUploaded bypi194043
- Multi Class Logistic Regression Training and TestingUploaded bypi194043
- Fast Asymmetric Learning for Cascade Face Detection Training/Testing UtilityUploaded bypi194043
- Gaussian Multivariate Distribution -Part 1Uploaded bypi194043
- SubPixel Corner Localization AlgorithmUploaded bypi194043
- Polynomial Approximation of 2D image patch -Part 2Uploaded bypi194043
- Control Limited Adaptive Histogram Equalization for Image EnhancementUploaded bypi194043
- Android OpenCV Simple Face TrackerUploaded bypi194043
- A detailed descriptions and results for different color constancy algorithmsUploaded bypi194043
- OpenCL Heterogenenous program for Image Processing - ColorSpace conversion BGR-HSV,HSV-BGR,BGR-GRAYUploaded bypi194043
- Uniform Local Binary Pattern and Spatial Histogram ComputationUploaded bypi194043
- Computing Rectangular Haar Features for Cascade Detection TrainingUploaded bypi194043
- Feature Detection - Overview of Harris Corner Feature DetectionUploaded bypi194043
- Android OpenCV Face detectionUploaded bypi194043
- OpenCL 2D Convolution Using Separable Filters -Box FilterUploaded bypi194043
- Fast 3D Extension of Fast Feature Detection for SpatioTemporal Corner DetectionUploaded bypi194043
- OpenCL Image Convolution Filter - Box FilterUploaded bypi194043
- Uniform Color QuantizationUploaded bypi194043
- Random Ferns for Patch DescriptionUploaded bypi194043
- Image enhancement using FusionUploaded bypi194043
- A simple color balance algorithmUploaded bypi194043

- ARM Neon Optimization for image interleaving and deinterleavingUploaded bypi194043
- OpenVision Library Gaussian Mixture Model ImplementationUploaded bypi194043
- Markov chain implementation in C++ using EigenUploaded bypi194043
- Implementation of discrete hidden markov model for sequence classification in C++ using EigenUploaded bypi194043
- Modified Canny Edge DetectionUploaded bypi194043
- Polynomial Approximation of 1D signalUploaded bypi194043
- Multi Class Logistic Regression Training and TestingUploaded bypi194043
- Compiling Native C/C++ library for AndroidUploaded bypi194043
- Gaussian Multivariate Distribution -Part 1Uploaded bypi194043
- Polynomial Approximation of 2D image patch -Part 2Uploaded bypi194043
- C++ static members and functionUploaded bypi194043
- C++ virtual functions and abstract classUploaded bypi194043
- Tan and Triggs Illumination normalizationUploaded bypi194043
- Normalized convolution for image interpolationUploaded bypi194043
- Mean Shift TrackingUploaded bypi194043
- Uniform Local Binary Pattern and Spatial Histogram ComputationUploaded bypi194043
- C++ Const,Volatile Type QualifiersUploaded bypi194043
- C++ InheritanceUploaded bypi194043
- Mean Shift AlgorithmUploaded bypi194043
- Local Binary PatternUploaded bypi194043
- C++ Class Members and friendsUploaded bypi194043
- Embedded Systems Programming with ARM on Linux - Blinking LEDUploaded bypi194043
- Random Ferns for Patch DescriptionUploaded bypi194043
- Integral Image for Computation of Mean And VarianceUploaded bypi194043

- p02.pdfUploaded bySrishti Sharma
- QFT.pdfUploaded byJuan Sebas Tian
- Lenear AlgebraUploaded byDe student
- Mathematics Assignment (Solved)Uploaded bytabizh
- Blind ForgeryUploaded bybalabooks
- On the Uniqueness of Discretely Complete, Infinite, Simply Hyper-Elliptic ManifoldsUploaded bySquareScared
- Succesive DifferentiationUploaded byprince Kumar
- Fourier TransformsZUploaded bygaurav_juneja_4
- practestUploaded byapi-251391936
- Lectures on Sectional-Anosov Fl - S. Batista, Carlos MoralesUploaded byjesusdark44
- MFCS-4Uploaded byTuljavamshikiran Buyakar
- 2 - 9 - Lecture 7 LimitsUploaded byRahulsinghoooo
- calculus_problems.pdfUploaded byGus Edi
- PC 12 Midterm Review 30-1Uploaded byElaine Lau
- Unit StepUploaded byLemuel C. Fernandez
- Numerical Linear.pdfUploaded byPurushotham Prasad K
- ISMT12_C04_AUploaded byUmut özdemir
- Fourier vs WaveletUploaded byarmanroshanravan
- Mth104 Lectures DiscriptionUploaded bySyed Kazim Ali
- NA-FinalExam-summer15.pdfUploaded byAnonymous jITO0qQH
- Example of Spherical Shell Cos2ThetaUploaded bygravygranules
- Z TransformUploaded byshohobi
- Separating the L-squared OperatorUploaded byJacob Bains
- A Treatise on the Theory of Bessel FunctionsUploaded bymelcaiah
- Gal Ios Modular FormsUploaded byeasonrevant
- NBHM Question Paper 2015Uploaded bysignums
- Num Exam QuestionsUploaded bySamuel Mawutor Gamor
- Rusev P.-classical Orthogonal Polynomials and Their Associated Functions in Complex Domain-Sofia (2005)Uploaded byJuan Diego Cutipa Loayza
- STEM_Basic Calculus CG.pdfUploaded byReyVirgoReyes
- Trigonometric FunctionsUploaded bydtwo17