<< Chapter < Page Chapter >> Page >

What makes Hilbert spaces so useful in signal processing? In modern signal processing, we often represent a signal as a point in high-dimensional space. Hilbert spaces are spaces in which our geometry intuition from R 3 is most trustworthy. As an example, we will consider the approximation problem.

Definition 1.

A subset W of a vector space V is convex if for all x , y W and λ ( 0 , 1 ) , λ x + ( 1 - λ ) y W .

The fundamental theorem of approximation

Let A be a nonempty, closed (complete), convex set in a Hilbert space H . For any x H there is a unique point in A that is closest to x , i.e., x has a unique “best approximation” in A .

An illustration showing a convex set A and a point x that lies outside this set.  The closest point to x in A is x_hat.
The best approximation to x in convex set A .

Note that in non-Hilbert spaces, this may not be true! The proof is rather technical. See Young Chapter 3 or Moon and Stirling Chapter 2 . Also known as the “closest point property”, this is very useful in compression and denoising.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Digital signal processing. OpenStax CNX. Dec 16, 2011 Download for free at http://cnx.org/content/col11172/1.4
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Digital signal processing' conversation and receive update notifications?

Ask