Table of Contents
CSE 589Applied AlgorithmsSpring 1999
Wavelet Coding
Significance
Coding Ideas
SPIHT Coding
SPIHT Zero Trees
R Tree Example (1)
R Tree Example (2)
RC Tree Example
Initialization of SPIHT
Pass of SPIHT
Decomposition of R
Decomposition of RC
SPIHT Coding Example: Initialization
SPIHT Coding Example: Pass 1, Sorting Step (1)
SPIHT Coding Example: Pass 1, Sorting Step (2)
SPIHT Coding Example: Pass 1, Sorting Step (3)
SPIHT Coding Example: Pass 1, Sorting Step (4)
SPIHT Coding Example: Pass 1, Sorting Step (5)
SPIHT Coding Example: Pass 1, Sorting Step (6)
SPIHT Coding Example: Pass 1, Sorting Step (7)
SPIHT Coding Example: Pass 1, Sorting Step (8)
SPIHT Coding Example: Pass 1, Sorting Step (9)
SPIHT Coding Example: Pass 1, Refinement Step
SPIHT Decoding
Wavelet Compression Scheme
Notes on Wavelet Compression
DNA
Approximate Matching
Applications of Approximate Matching
Scoring an Approximate Matching
Scoring Example
Approximate String Matching Problem
|
Author: Richard E. Ladner
Email: ladner@cs.washington.edu
Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/
Other information: CSE 589: Applied Algorithms
Download presentation source
|