Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.

Slides:



Advertisements
Similar presentations
CS 450: COMPUTER GRAPHICS LINEAR ALGEBRA REVIEW SPRING 2015 DR. MICHAEL J. REALE.
Advertisements

1 D. R. Wilton ECE Dept. ECE 6382 Introduction to Linear Vector Spaces Reference: D.G. Dudley, “Mathematical Foundations for Electromagnetic Theory,” IEEE.
A first look Ref: Walker (Ch.2) Jyun-Ming Chen, Spring 2001
11/11/02 IDR Workshop Dealing With Location Uncertainty in Images Hasan F. Ates Princeton University 11/11/02.
Applications in Signal and Image Processing
Signal Spaces.
MRA basic concepts Jyun-Ming Chen Spring Introduction MRA (multi- resolution analysis) –Construct a hierarchy of approximations to functions in.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Extensions of wavelets
By : L. Pour Mohammad Bagher Author : Vladimir N. Vapnik
Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
Chapter 5 Orthogonality
Chapter 7 Wavelets and Multi-resolution Processing.
Wavelet Transform A very brief look.
Wavelet Transform. What Are Wavelets? In general, a family of representations using: hierarchical (nested) basis functions finite (“compact”) support.
Introduction to Wavelets
Multiscale transforms : wavelets, ridgelets, curvelets, etc.
Quantum One: Lecture 8. Continuously Indexed Basis Sets.
University of Texas at Austin CS395T - Advanced Image Synthesis Spring 2006 Don Fussell Orthogonal Functions and Fourier Series.
ENG4BF3 Medical Image Processing
Function approximation: Fourier, Chebyshev, Lagrange
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Signal-Space Analysis ENSC 428 – Spring 2008 Reference: Lecture 10 of Gallager.
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Linear Algebra Chapter 4 Vector Spaces.
The Wavelet Tutorial: Part3 The Discrete Wavelet Transform
On the Selection of an optimal wavelet basis for texture characterization Vision lab 구경모.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Orthogonal Functions and Fourier Series.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
Lecture 2 Signals and Systems (I)
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Wavelet Packets  Shortcomings of standard orthogonal (bi-orthogonal) multi-resolution structure of DWT,  Insufficient flexibility for the analysis of.
Review Questions Jyun-Ming Chen Spring Wavelet Transform What is wavelet? How is wavelet transform different from Fourier transform? Wavelets are.
Basics Course Outline, Discussion about the course material, reference books, papers, assignments, course projects, software packages, etc.
Vector Norms and the related Matrix Norms. Properties of a Vector Norm: Euclidean Vector Norm: Riemannian metric:
AGC DSP AGC DSP Professor A G Constantinides©1 Hilbert Spaces Linear Transformations and Least Squares: Hilbert Spaces.
Elementary Linear Algebra Anton & Rorres, 9th Edition
CHEE825 Fall 2005J. McLellan1 Spectral Analysis and Input Signal Design.
MAT 2401 Linear Algebra 5.3 Orthonormal Bases
Chapter 2. Signals and Linear Systems
CHAPTER 5 SIGNAL SPACE ANALYSIS
Geometry of Shape Manifolds
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
Different types of wavelets & their properties Compact support Symmetry Number of vanishing moments Smoothness and regularity Denoising Using Wavelets.
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Mathematical Tools of Quantum Mechanics
Signal & Weight Vector Spaces
Joint Moments and Joint Characteristic Functions.
By Dr. Rajeev Srivastava CSE, IIT(BHU)
CS654: Digital Image Analysis Lecture 11: Image Transforms.
Chapter 13 Discrete Image Transforms
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Matrices, Vectors, Determinants.
Wavelets Chapter 7 Serkan ERGUN. 1.Introduction Wavelets are mathematical tools for hierarchically decomposing functions. Regardless of whether the function.
Math for CS Fourier Transforms
Singular Value Decomposition and its applications
Multi-resolution image processing & Wavelet
EEE4176 Applications of Digital Signal Processing
Wavelets : Introduction and Examples
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Signal & Weight Vector Spaces
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Linear Vector Space and Matrix Mechanics
Signals and Spectral Methods
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique spanning vectors/functions and an inner product defined in the space.

Linear Independence Linear independence is necessary for orthogonality but not sufficient Overcomplete Representation of a Function/Signal. A linear expansion of a function with a bases set which are linearly dependent

Inner product space. A function space with a functional ( linear or bilinear) defined in the space. Inner product is an assignment of a scalar to a functional described between every pair of elements in the function space. It is used to describe relation between pair of elements such as distance between two elements in a given space, length (norm) of a function, angle between two elements in the given space, etc..

Basis Set Basis set are set of functions with an inner product between every pair of the basis that is equal to zero. An example is set of orthogonal spanning vectors in a given space. Basis functions are used to describe all the elements in a given function space.

Dimension of a function space. Dimension of a given function space is the number of basis set sufficient to describe all the elements of the function space. Dimension of a function space is independent of the particular basis set chosen for the space.

Non-uniqueness of Bases Set. Bases sets are not unique since a linear combination of the set, can also be used as a bases set.

A Complete Space. A space in which every Cauchy sequence converges to a vector in the space, is a complete space. It can also be interpreted as a set by which every element of the space including the elements of space boundary can be described by the basis set

Hilbert space. An infinite or finite dimensional inner product space which is also a complete space. Hilbert space is an L 2 norm space as defined below.

An L 2 norm space. Space with a norm defined as the integral of squared signal values i.e. to be a finite value. In finite dimensional space, it corresponds to square summable functions ( finite energy of the signal ). L 2 norm is described in terms of the inner product between pair of elements defined in a given space. = =

Inner product rules( please refer to class discussion and reference material), – Definition of length of a function: 1/2, – Definition of a distance between two functions: 1/2 = [ ] 1/2

Riesz basis and concept of frame Consider an inner product space with a norm induced by the inner product defined in the space. Then a set {v i, i=1,..n } not necessarily linearly independent, is a Reisz basis if every element in the space f(t) can be expressed as a linear combination of the set {v} having non- unique coefficients of the expansion, and. Frames may be discussed in a more detail at a later stage in the course

Frames b- Such that transform of the signal and coefficients {c k } defined as orthogonal projection of f(t) on each element of the basis, are bounded, i.e. there exists positive scalors A and B such that norm of signal and coefficients of the orthogonal projection {c k } can be expressed in an inequality relation given as follows: A ≤ ∑ jk |c jk | 2 /||f(t)|| 2 ≤ B (1) A||f(t)|| 2 ≤ ∑ jk |c jk | 2 ≤ B||f(t)|| 2

Frames c jk is the projection of f(t) on the frame set φ jk (t) i.e. c jk =. Accordingly, coefficient norm when normalized to signal energy, is constrained within lower and upper bounds A and B respectively. A and B are scalars independent of f(t) and A>0 and B<∞.

Comments Comments: In representation of a signal using Riesz basis, there exists a redundancy the degree of which is determined by constants A and B. When A=B=1, we have orthogonal set ( i.e. with no redundancy since we have a unique representation). Redundant representation as stated above is obtained by decomposition of f(t) by set of functions that may be linearly dependent and referred to as frame. Commonly used degree of redundancy is given by (A+B)/2.

Examples Examples of the spanning vectors which is a basis but not a Riesz basis is polynomial set 1. t. t 2,…( an infinite dimensional basis set). Frame structure of a basis is useful in function analysis as it allows redundancy in function expansion. An expansion of a function with a bases set which is constructed from an arbitrary translation of a basis with a finite support length, results in a redundant set.

Continuous wavelet transform Continuous wavelet transform having an arbitrary translation and scale parameters, is a redundant transform that can be described in terms of frame structure. Decomposition generates redundant coefficients in a signal representation in transform domain.

Function Expansion, Signal Decomposition Goals of Function Expansion: Representation of signal in a domain other than the given signal domain that is considered to be suitable for a given application, e.g. frequency domain for spectral analysis, transformed domain for approximation, coding, transmission, etc.

Optimal or near optimal signal description In engineering applications we search for bases that are considered suitable to meet the following objectives. – Efficient function approximation, – Reduction in computational complexity, – Effective information extraction. – We search for bases that are suitable for compression in the sense that signal information can be extracted and represented effectively using a few number of coefficients of expansion in the transformed domain. (refer to discussion in the class).

Wavelets in Function Expansion Wavelets are considered to be near optimal bases for a wide class of signals found in engineering applications Examples of non-wavelet bases used in signal analysis: Karhunen-Loeve Transform (KLT) or Principal Component Analysis, Laguerre bases, Short-time Fourier transform, Vigner- Wille Transform.

Requirements Requirements for wavelet bases to be considered as suitable in signal processing applications are as follows: – Well localized both in time and freq. – Oscillatory behavior to capture the transient signal features – Higher order of moment cancellation necessary for compression – Regularity for desirable smoothness property of wavelets and corresponding filter. – Computational efficiency for signal processing (such as Fast Wavelet Transform used in quadratic filter bank (QMF) of DWT)

Biorthogonal and Orthogonal Analysis Biorthogonal vs. Orthogonal Analysis In biorthogonal expansion, two sets of basis functions are utilized. Basis functions of each set are linearly independent of each other but are not orthogonal while the elements within the two sets are pair-wise orthogonal to each other.

Biorthogonal and Orthogonal Analysis A given signal can be represented by either one of the basis sets ( please refer to class discussion for further analysis). The selection of one wavelet for decomposition and other for reconstruction or vice versa, is determined by requirement for decomposition and reconstruction. For example, if we are looking for compression i.e. a few number of coefficients during decomposition stage, we will select wavelet which has higher moment cancellation

Decomposition of a Signal Decomposition of a signal is achieved by the projecting the signal onto one set where the coefficient of the projection in one set are used to describe the signal in terms of the dual bases set ( refer to class notes for derivations and discussions).

Biorthogonal vs. Orthogonal Analysis Advantages and Disadvantages: a) Orthogonal basis – Orthogonal expansion yields a unique expansion coefficients. It results in an efficient and non- redundant signal representation and is computationally more attractive. Non-robustness of the signal expansion to errors where the occurrence of an error in derivation of the coefficient or loss of single coefficient value, can result in inaccuracies and degradation of overall signal representation

Biorthogonal basis In biorthogonal expansion there exists an added degree of freedom for function expansion i.e., one can choose either set for a suitable signal representation – In wavelet analysis, dual basis provides possibility of choosing two different bases: one for analysis and another for synthesis stage and thus an additional degree of freedom is available to design wavelet filters.

Frame and Redundancy In frames redundancies are accepted, – Signal representation is not unique, – Robustness property. Loss of a single coefficients may be recovered from other coefficients and have minor effect in the overall results – We can have different order of redundancy in a given expansion determined by the requirement of a signal expansion and computational efficiency requirements. Higher redundancy has lower computational efficiency but higher robustness against errors

Parseval Relation In an orthogonal expansion, Parseval relation plays an important and useful role in providing information about the distribution of signal energy along each basis ( refer to class discussion for further discussion). However, this is not true if biorthogonal expansion is utilized. In wavelet analysis, absolute value of wavelet coefficients also contain information about the signal. As such they are used for function approximation and information extraction. Wavelet bases are referred as unconditional bases set ( refer to class discussion and chap.2 of course text book)