Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Intel Community
- Software Development SDKs and Libraries
- Intel® Distribution of OpenVINO™ Toolkit
- Low computational cost wavelets

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

Highlighted
##

Sean_O_

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

03-10-2018
10:27 PM

23 Views

Low computational cost wavelets

The intermediate calculations of the Walsh Hadamard transform are wavelets. And also pooled sums of wavelets etc. So a n=integer power of 2 input vector gets mapped to n* log base 2 (n) set of wavelets, or twice that if you include the (self) inverse WHT wavlets. That's not too much of a dimensional increase and it seems to me it is very like a convolutional neural network scheme.

In 1d the out of place algorithm is super simple to do. You go through the input data pairwise. Placing the sum in the lower half of a new array. The difference in the upper half sequentially. Then scaling by one over the square root of 2. Repeat log base 2(n) times. The 2d version for images is hardly more difficult.

The pairwise sums are low pass filters, the pairwise differences are high pass filters.

The out of place WHT is one of the simplest algorithms in computer science!

http://randomprojectionai.blogspot.com/

There is also a wavelet compression scheme you can do with that. Look at the input and all the calculations of the WHT and select the highest magnitude (energy) value,note its location and value and set then set it to zero . Make the rest of the values consistent with that by doing partial transforms forward and back (inverse.) Then repeat that process n times. The total cost is quite high being n WHTs. For a large image you would need a GPU. Decoding is cheap. You just need to put the n values back and complete the transform and inverse transform for each of them. Cost 1 or 2 WHTs depending on exactly how you do things. There are some minor technical things you can do to improve the algorithm.

0 Replies

For more complete information about compiler optimizations, see our Optimization Notice.