|
|
|
|
|
|
|
Figure 6.12
The user interface and the diagram of a data compression algorithm based on affine transforms. The mathematics employed
can be taken directly from the diagram. |
|
|
|
|
|
|
|
|
a 90-minute film is available as sequences of images. For simplicity's sake, pretend that it's a black-and-white film with a resolution of 4000 × 4000 individual points per image. Assume that a supercomputer has coded the film's individual images in the sense discussed previously. We want each image to have 100 transformations, meaning that we'll need to store perhaps 2 Kbytes. By contrast, the total content of an image is 16,000,000 bits or about 2 Mbytes. This is a 1000-to-1 compression of the original. |
|
|
|
|
|
|
|
|
Shortest Paths in the Graph |
|
|
|
|
|
|
|
|
Looking at a generalized directed grapha structure of nodes and edgesyou'll notice that several pairs of nodes are connected by edges, while others are not. The edges themselves are directional, and are also |
|
|
|
|
|
