<< Chapter < Page Chapter >> Page >

As an application of Parseval's Theorem, say v k k = 1 is an orthobasis for an inner product space of V .

Let A be the subspace spanned by the first 10 elements of v k , i.e., A = span v 1 , . . . , v 10

  1. Given x v , what is the closest point in A (call it x ^ ) to x ? We have seen that it is x ^ = k = 1 10 x , v k v k
  2. How good of an approximation is x ^ to x ? Measured with · V :
    x - x ^ V 2 = k > 10 x , v k v k V 2 = k > 10 | x , v k | 2

Since we also have that x V 2 = k = 1 | x , v k | 2 , the approximation x ^ will be “good” if the first 10 transform coefficients contain “most” of the total energy.Constructing these types of approximations is exactly what is done in image compression.

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