QUADTREE-STRUCTURED WALSH TRANSFORM VIDEO/IMAGE CODING

Abstract: Two-dimensional data structures are represented by quadtree codes with embedded Walsh transform coefficients. The quadtree code permits both variable block size inherent in quadtrees, and the calculational simplicity of Walsh transform descriptions of nearly uniform blocks of data. Construction of the quadtree is calculationally simple for implementation in a digital system which does a bottom-up determination of the quadtree because Walsh transform coefficients and a measure of the distortion can be recursively calculated using only Walsh transform coefficients from the previous level in the quadtree. Uniform step size quantization, which is optimal for variable length coding and generalized gaussian distributions, permits fast encoding and decoding of quadtree code.

Description: QUADTREE-STRUCTURED WALSH TRANSFORM VIDEO/IMAGE CODING BACKGROUND OF THE INVENTION Field of the Invention This invention relates to methods and circuits for transmitting and storing information that is two dimensionally related and in particular relates to transmitting and storing digital information using a quadtree code with embedded Walsh transform coefficients. Description of Related Art Many two dimensional data structures are used in digital systems. A common _xample is a pixel map. Pixel maps are commonly used in video displays and in printer to describe a imare being generated. With a pixel map, the color or intensity of each pixel is indicated by a corresponding datum in the pixel map. Pixel maps have rows and columns of data corresponding to the rows and columns of pixels on a video display and can include thousands or millions of data. For example, a standard VGA video display is 640 pixels wide and 480 pixels high and contains 307,200 pixels. A pixel map representing a two color image which fills a VGA display contains at least 307,200 bits of data, one bit for each pixel. For 256 colors or shades or grey, eight bits of data are required per pixel, and the pixel map contains at least 307,200 bytes. Because of the large number of pixels in a video image, pixel maps can require long times to transmit and large amounts of memory to store. Encoding techniques exist for efficiently transmitting or storing two dimensional data structures without using pixel maps. One such technique uses quadtrees to describe images. A quadtree is a collection of nodes organized in levels and connected by branches. Each node in a quadtree structure has four branches connecting the node to four higher level nodes unless the node is a leaf node. Leaf nodes have no branches to higher levels. For a two color image, each leaf node in the quadtree has a value which describes the color a particular area in the image. The level 0 node represents a block containing the entire image and is 1 if the image contains a foreground color and 0 if the image only contains a background color. A level 0 quadtree accurately represents only single color images. Nodes in higher levels of a quadtree correspond to sub-blocks of blocks described in preceding levels, and typically, more levels provide a more accurate quadtree representation of the image. Fig. IA shows a two color image having a foreground color region 100. Fig. IB shows a quadtree which describes an approximation of the image of Fig. IA. Fig. IC shows blocks corresponding to the nodes of the quadtree of Fig. IB. Level 1 of the quadtree corresponds to a partition which divides the image into four blocks 110, 120, 130, and 140. Block 120 contains only the background color and has node value zero. Blocks 110, 130, and 140 have node value one indicating at least a portion of blocks 110, 130, and 140 contains the foreground color. In Fig. IB, level 1 nodes are 1011 using the convention that the top left block is the left-most branch, the top right block is the second branch from the left, bottom left block is the third, and bottom right block is the furthest right. A level 1 quadtree description of Fig. IA replaces block 120 with the background color and each of blocks 110, 130, and 140 with the foreground color. For level 2 , blocks 110, 130, and 140 are divided into three sets of four sub-blocks 111-114, 131-13 . 4, and 141-144. Block 120 is not further divided because the level 1 description of block 120 accurately represents the constant background color of block 120. At level 2, blocks 113, 114, 131, 132, and 141 contain the foreground color and have node value one. Blocks 111, 112, 133, 134, and 142-144 contain only the background color and have 5 node value zero. The quadtree of Fig. IB is expanded to level 2 by adding four new nodes and four new branches to each non¬ zero node of level 1. The level 2 quadtree of Fig. IB approximates the image by filing blocks 113, 114, 131, 10 132, and 141 with the foreground color and filing blocks 111, 112, 120, 133, 134, and 142-144 with the background color. The level 2 quadtree is more accurate than either level 0 or 1 because smaller blocks are represented. Each block 113, 114, 131, 132, and 141 which contain 15 the foreground color, is partitioned into four sub-blocks to generate level 3. Higher levels are determined by recursive partitioning of blocks which contain the foreground color until the smallest blocks contain a single pixel. 20 A quadtree code is generated from a quadtree by ordering node values from the quadtree according to a predefined format. One format orders node values as read from left to right and from the top down. For the quadtree of Fig. IB, a quadtree code is 25 1110111001111001000. (The symbol | is shown to separate quadtree code into levels for the reader's convenience and is not part of the quadtree code.) Quadtree codes often require less memory to store than do pixel maps and can be transmitted faster than a pixel map. 30 One disadvantage of the described quadtree code is that each block is restricted to a single color. A method that permits an efficient description of variation in of data values over the area of each block would be desirable. SUMMARY OF THE INVENTION In accordance with an embodiment of the present invention, a method is provided for generating quadtree codes with embedded Walsh transform coefficients. The method uses a bottom-up recursive process for pruning a quadtree and typically starts by partitioning a two dimensional data structure into a level N uniform partition which has 4 N blocks corresponding to the leaf nodes of a balanced quadtree. Each block in the level N partition comprises a matrix of pixel values. The matrices of pixel values are Walsh transformed, and a preselected subset of the Walsh transform coefficients are kept to approximate each block. The kept Walsh transform coefficients are referred to as a Walsh transform description. A level N-l uniform partition of the two dimensional data structure contains 4 N" ' disjoint blocks, each block being the union of four blocks from the level N partition. From the kept Walsh transform coefficients for the level N blocks, Walsh transform coefficients for blocks in the level N-l uniform partition are calculated. Also calculated is a measure of the distortion per block caused by replacing Walsh transform description of four blocks in the level N partition with a Walsh transform description of one block in level N-l partition. When the measure of the distortion is less than a predefined threshold T m , nodes corresponding to the four level N blocks are pruned from the quadtree, so that a node corresponding to the union of the four blocks is made a leaf node. Only a preselected subset of the Walsh transform coefficients for the leaf nodes are kept. The pruning of the quadtree continues recursively through all the quadtree's levels. A quadtree code constructed from the pruned quadtree contains, in a predefined order, values for every node in the pruned quadtree, each value indicating whether a corresponding node is a leaf node. The kept Walsh transform coefficients are embedded into the quadtree code following corresponding leaf nodes. Often the Walsh transform coefficients are quantized using uniform step size and then variable length coded for transmission. In accordance with another embodiment of the invention, the values in a quadtree code follow a walking- the-tree order, wherein the node values follow an order defined by a succession of branches, each branch ending with a leaf node. In the quadtree code, after the value representing a leaf node, information such as Walsh transform coefficient is embedded to describe the data in the block corresponding to the leaf node. The walking- the-tree order permits the beginning of coding and transmission of a quadtree code to be before the entire quadtree is known and permits decoding of the quadtree code when the first branch is complete. Another embodiment of the present invention comprises a video/image coder which converts a pixel map representing a still image or difference image into a quadtree code with embedded Walsh transform coefficients. Still another embodiment in accordance with the present invention is a decoder which converts a quadtree code with embedded Walsh transform coefficients into a pixel map. BRIEF DESCRIPTION OF THE DRAWINGS Fig. IA shows a two color image that can be represented by a pixel map. Fig. IB shows a level 2 quadtree representing the image of Fig. IA. Fig. IC shows blocks corresponding to leaf nodes of level 1, level 2, and level 3 quadtrees representing the image of Fig. IA. Fig. 2 shows a partition corresponding to leaf nodes of a balanced quadtree and partitions which correspond to a quadtree after two levels of pruning. Fig. 3 shows level 1 and level 2 uniform partitions of the image of Fig. IA. Fig. 4 shows a walking-the-tree order for the nodes of a quadtree code corresponding to the image of Fig. IA. Figs. 5 and 6 show the priority of branches and blocks during a bottom-up testing and pruning of a quadtree. Fig. 7 shows a representation of a four color image which is pruned to determine a quadtree. Fig. 8 shows two by two, four by four, and eight by eight Walsh transformation matrices. Fig. 9 shows a factorization of an eight by eight Walsh transformation matrix into three sparse matrices. Fig. 10 shows a level 3 balanced quadtree structure. Fig. 11 shows a block diagram of a video/image codec in accordance with an embodiment of the present invention. Fig. 12 shows an order for transmission of a four by four matrix of Walsh transform coefficients. Similar or identical items in different figures have the same reference numerals or characters. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Quadtrees can be constructed from the bottom up starting with a balanced quadtree structure that has leaf nodes corresponding a level N uniform partition which divides a two dimensional data structure into 4 N blocks of data. Nodes can be removed (or pruned) from the quadtree by testing and merging sets of four blocks. In Fig. 2, a level 3 uniform partition divides a two color video image into sixty four (4 3 ) blocks of pixels. For simplicity, the blocks in Fig. 2 are all the same size. However, unequal blocks can be used, if blocks represented by a quadtree code can be identified. Generally, the choice of initial partition determines the accuracy of the quadtree representation of a two color image. When each block holds only a single pixel the quadtree representation provides an exact representation of the image. If more than one pixel is in the initial blocks of the partition then the quadtree representation is exact only for special images such as two color images where every block of the initial partition of the image contains only a single color. Blocks 311-314 in the initial uniform partition can be tested to determine if blocks 311-314 should be merged into a single block 310. For a two color image, a test can determine if any of the blocks 311-314 contains the foreground color. If any do, the blocks are not merged. If none do, the blocks are merged, and the four nodes which correspond to the blocks are pruned from the quadtree. For grey scale or multicolor images, one type of test determines whether four adjacent blocks have the same color or intensity, and if the blocks all do, the blocks are merge into a larger block having a single uniform color or intensity. Other tests for merging are disclosed below. When four blocks are merged, they form a block which is part of a coarser uniform partition that corresponds to a lower level of the quadtree. Accordingly, each level of the quadtree has a corresponding uniform partition from a series of uniform partitions. A rule or look-up table which identifies the blocks in the uniform partitions is necessary for decoding a two dimensional data structure from a quadtree code. For example, when a quadtree code indicates that a block has a uniform color, the size and location of the block must be known before the quadtree code can be decoded. One of the simplest series of uniform partitions corresponding to the levels of a quadtree is formed by repeated equal quartering of the image. The level 3 uniform partition of Fig. 2 and level 1 and 2 uniform partitions of Fig. 3 illustrate a series of uniform partitions formed by equal quartering. Using equal quartering, an image which is 512-by-512 pixels and has a level 0 uniform partition that is one 512-by-512 pixel block, a level 1 uniform partition that is four 256-by-256 pixel blocks, a level 2 uniform partition that is sixteen 128-by-128 pixel blocks, and so on to a level 9 uniform partition which is 262,144 blocks each containing a single pixel. In a bottom up construction of a quadtree, pruning the initial balanced quadtree creates a quadtree with leaf nodes corresponding to an intermediate partition. Blocks in the intermediate partition are then tested and merged if the blocks meet the appropriate conditions. In Fig. 2, blocks 351-354 contain only the background color and are merged to form block 350 which is one of the blocks in the level 1 uniform partition. Blocks 310 and 320 cannot be merged because neither block 330 nor block 340 is in the intermediate partition. Generally mergers and pruning of the quadtree continue recursively through one or more intermediate partitions until no further mergers are possible. At that point, the quadtree partition obtained contains only the blocks which correspond to leaf nodes of the pruned quadtree. A quadtree code can be determined by providing a binary value for each node in the pruned quadtree, for example a zero for leaf nodes and a ones otherwise, then ordering the binary values in a predefined order. For example, as described above, all the values for level 0 of the pruned quadtree, then level 1, then level 2, and so on to the highest level of the quadtree. In accordance with the present invention, another ordering of the values, referred to as walking-the-tree order, can be used. According to the walking-the-tree order, the quadtree code starts with a lowest level value, typically level 0 value, and proceeds down a branch until a leaf node is reached. The order then returns up the branch to the highest node which has one or more branches that have not been described, then follows the nodes down a not yet described branch until a next leaf node is reach. The order of values continues in this fashion branch by branch until all the values in the quadtree are given. Fig. 4 shows the quadtree of in Fig. IB and illustrates one example of a walking-the-tree order. The walking-the-tree order illustrated in Fig. 4 describes node values on each branch in order from lower level to higher level until a leaf node is reached. The branches are selected according to a predefined priority for each node. When a node has multiple branches which have not been described, the branch to a higher priority node is followed. The priority for the nodes is given by the location of the corresponding block as indicated in Fig. 5. The node corresponding to the top-left block has highest priority, the top-right block is second, the bottom-left block is third, and the bottom-right block has lowest priority. Once a leaf node is reached, the branch is traced back down to the highest level node which has a branch containing node values not given, then the highest priority branch having values not given is followed. Branch after branch is followed in this manner until all of the node values in the quadtree are given by the quadtree code. Using the above disclosed conventions, the first branch in Fig. 4 runs from node Nl to node N2 to leaf node N3. Node N2, the next highest node, has three branches with node values not given. The three branches from N2 contain only leaf nodes N4, N5, and N6 which are given in that order. After the last branch from N2 is completed, the next branch is from node Nl and contains only the leaf node N7. The following branch is also from node Nl and contains node N8 and N9, then the three branches from N8, each containing only node N10, Nil, or N12. The walking- the-tree order continues in the same manner until all the branches of the quadtree are described giving the quadtree code 11001101110011000. With a walking-the-tree order, initial values of a quadtree code can be transmitted as soon as the first branch is known, and bottom-up determination of a quadtree can proceed branch by branch. Transmission of a quadtree code need not be delayed while the entire quadtree is determined. For example, in the level 2 uniform partition of Fig. 3, block 310 corresponds to node N3 , block 360 corresponds to node N2, and the entire image corresponds to node Nl. Testing blocks 341, 342, 343, and 344 (Fig. 2) indicates that blocks 341, 342, 343, and 344 cannot be merged. Therefore, blocks 310, 320, 330, and 340 can not be merged, and nodes Nl and N2 have value one. Since block 310 is uniformly the background color, N3 is zero, the first branch of the quadtree is known, and the branch N1-N2-N3 can be transmitted without determining any other nodes or any complete levels. Prior art quadtree codes describe a complete lower level before describing any values in the next higher level, so with a bottom-up determination of the quadtree, the entire quadtree must be determined before the initial values of the prior art quadtree code are provided. Accordingly, transmission of a quadtree code according to the prior art order must be delayed until the entire quadtree is determined. Fig. 6 shows the order in which blocks of a level 3 uniform partition should be tested to determine node values on branches in the sequence defined by walking-the- tree order disclosed above. The order of Fig. 6 permits transmission of a quadtree code while determining the remainder of the quadtree. Many other walking-the-tree orders could be employed which would change the sequence of the branches quadtree code and the order in which blocks are tested. The quadtree code described above does not provide color or intensity information for multicolor or grayscale images. Ones and zeros from the quadtree code indicate only the quadtree structure. In accordance with the present invention, color or intensity information can be embedded into the quadtree code. Fig. 7 shows a level 3 uniform partition of a four color image where a number in each bl „ck indicates the color of the block. To generate a quadtree, a set of four blocks corresponding to level 3 nodes can be tested to determine whether all four blocks have the same color. If the four blocks have the same color, the blocks are merged and the corresponding nodes are pruned from the quadtree leaving the node corresponding to the union of the four blocks as a level 2 leaf node. The merger of the blocks in the uniform partition forms an intermediate partition, also shown in Fig. 7, which represents the leaf nodes of a partly pruned quadtree. In the intermediate partition, blocks corresponding to level 2 leaf nodes are tested for possible further merger and pruning. After the level 2 leaf nodes are pruned, the level 1 leaf nodes are tested, but for the example image shown in Fig. 7 no merger of level 1 nodes is possible. Instead of testing in complete levels, the color image can also be pruned according to a walking-the-tree order as described above. Either pruning method provides a quadtree partition representing the leaf nodes of a quadtree representation of the image. A quadtree code for the color image can be formed by embedding in the code color information following every leaf node. For example, a conventional quadtree code for the quadtree partition of Fig. 7 is 1 | I0ll| 011110011010 where the branch convention shown in Fig. 5 is used. Color information can be provided immediately after every zero value leaf node and following the highest level leaf nodes having node value one. According to this convention, a quadtree code describing the image in Fig. 7 is 1110(2) 1110(0) 1(1211) 1(0111) 1(1211) 1(1122) 0(1) 0(3)1 4349 - 12 - (2123)1(2213)0(3)1(2333)0(3) where the parentheses and the symbols | are not part of the quadtree code but are added for the reader's convenience to separate color information and levels respectively. This quadtree code requires 85 bits, 34 two-bit numbers for color information and 17 bits for quadtree structure. An uncompressed pixel map would require 128 bits, two bits for each block. Color or intensity information can also be embedded into the quadtree code at the end of each level for example 1(1011(2) |011110011010(01333) | (121101111211112221232213233 3) . Other embedding conventions are possible and are not limited to four color images but can be used with any multicolored or grayscale image. Embedding the color information in the quadtree code has advantages over providing a quadtree code separate from color information, for example following the quadtree code with all color information. For quadtree codes that follow a walking-the-tree order such as disclosed above, embedded color information in the quadtree code after each leaf node allows immediate construction of a block of the image before the complete quadtree code is known. Instead of embedding a single number for each leaf node to indicate a color or grayscale intensity for the block corresponding to the node, several coefficients can be embedded into the quadtree code to describe variation of pixel values over the corresponding block. For example, coefficients for a polynomial or other function which describes the variation of color or intensity over the area of a block can be embedded to the quadtree code. In one embodiment of the invention, one or more Walsh transform coefficients, as defined below, describe the color or intensity of a block. For simplicity, the following embodiments deal with grayscale images which have a pixel map describing a two- dimensional grid of pixels where the intensity of each pixel is described by a single number in the pixel map. Generalizing to other two dimensional data structures such as pixel maps which use three numbers to indicate color components will be apparent from the embodiments disclosed. A pixel map of a grayscale image has rows and columns of intensity values and can be manipulated as a matrix using well known linear algebra and matrix notation. Similarly, when a pixel map is partitioned into blocks, each block can be manipulated as a matrix. In accordance with the present invention, a quadtree is chosen with leaf nodes that correspond to different size blocks, but the same predetermined number of Walsh transform coefficients describes each block regardless of the size of the block. The number of pixels in each block which corresponds to a leaf node is restricted by the requirement that the predetermined number of Walsh transform coefficients provide a sufficiently accurate approximation pixel variation over the block. Discrete Walsh transformations can be performed using matrix multiplication and N-by-N transformation matrices as shown in Fig. 8 for N equal to 2, 4, and 8. In Fig. 8, the symbol "-" stands for -1. Every value in a Walsh transformation matrix is either 1 or -1. Accordingly multiplication by a Walsh transformation matrix is performed by addition (or subtraction) of components. No multiplication (other than multiplication by one) is required. Accordingly, Walsh transformations can be calculated quickly by digital systems. For any N by M matrix x where N and M equal 2' and 2 j respectively for any positive integers i and j, the Walsh transform X of the matrix x is defined to be ^-x-* 1 where N W and M W are respectively N-by-N and M-by-M Walsh transformation matrices. The components of the Walsh transformed matrix X are referred to as Walsh transform coefficients. Since the matrix product of Walsh transformation matrices ti V- N W equals N- I where I is the identity matrix, x equals CW-X W)/(_NM) N-by-N Walsh transformation matrices can be factored into sparse matrices N A 1? ..., N A Z where Z = lθg 2 N. The factorization of the 8 by 8 Walsh transformation matrix into three sparse matrices 8 A 3 • 8 A 2 • 8 A [ is shown in Fig. 9. It can be shown that for any 2N by 2N Walsh transformation matrix that I N A Z 0 I I N A, 0 2N W = 2N A Z+1 - I I • ... • I j 0 N A Z j J O N A, It can also be shown that 2N A Z+1 equals δ (i2)j + (-l) (i/2)~ δ (N+i/2)j for even i and equals δ (i/2+1/2)j + (-1) (,"1)2 δ (N+i/2+1/2)j for odd i, where i and j are row and column indexes respectively and take values between 1 and 2N, and δ^ is a kronecker delta which is 1 if a equals b and 0 otherwise. The Walsh transformation matrices shown in Fig. 8 are referred to as being in sequency order meaning that each row (or column) starting from the top (or left) has one more change in sign than does the preceding row (or column) . With sequency order, a Walsh transform of a uniform matrix, i.e. a matrix where all the components are equal, has one non-zero Walsh transform coefficient, the top left coefficient. For a nearly uniform matrix, only the Walsh transform coefficients near the top left of the transformed matrix are significant. Accordingly, a subset of Walsh transform coefficients are sufficient to provide a good approximation of a uniform or nearly uniform matrix. A balanced quadtree that exactly describes an image can be constructed for any square image having height and width equal to 2' pixels for some positive integer i. Other size images can be constructed from a collection of - 14 / 1 - such square images. Fig. 10 shows a balanced quadtree having 64 leaf nodes. If each leaf node corresponds to a block containing a single pixel, the quadtree of Fig. 10 - 15 - combined with intensity information or a single Walsh transform coefficient exactly describes the image. If each block in the level 3 of Fig. 10 is a two-by-two matrix, four Walsh transform coefficients per leaf node are sufficient to guarantee an exact representation of the image, because the Walsh transform of two-by-two block only has four coefficients. Similarly, if a level 3 partition has N t by N t pixels per blocks, N t 2 Walsh transform coefficient guarantee an exact representation. In accordance with one embodiment of the present invention, an exact quadtree is pruned to generate leaf nodes corresponding to blocks that are approximately uniform so that the top-left Walsh transform coefficients describe the block to a desired accuracy. As the quadtree is pruned any Walsh transform coefficients not needed to describe a block are dropped. Walsh transform coefficients are determined recursively. The recursive relation of the Walsh transform coefficients can be expressed in matrix notation as follows. If four N-by-N matrices X,, X 2 , X 3 , and X 4 can be merged into a 2N-by-2N matrix x then X, X 2 I X 3 X 4 I The Walsh transforms of matrices X- , X 2 , X 3 , X 4 , and X are matrices X t , X 2 , X 3 , X 4 , and X respectively. Only the top- left N t 2 Walsh transform coefficients are kept during pruning, so that the Walsh transformation matrices X l5 X 2 , X 3 , X, j , and X are approximated by matrices X',, X' 2 , X' 3 , X' 4 , and X' which have the form a o X' = - 15/ 1 - where a is a N t by N t matrix and 0 represents appropriately sized matrices with all components equal to zero. It can be shown that - 16 - I x. 2 I x = 2N A Z+ 1 • I I - 2N A Z+1 T , I χ 3 χ 4 I where 2N A z+] is the sparse matrix described above and 2N A Z+1 T is the transpose of matrix 2N A Z+1 . From the form of matrix 2N A Z+1 , it can be shown that only the top-left coefficients of the matrices X,, X 2 , X 3 , and ^,, i.e. only X'u X' 2 , X' 3 , X' 4 , are required to determine X', the top-left N t 2 of X. Accordingly, after each pruning of the quadtree (or merger of blocks) , the Walsh transform coefficients of new leaf node block can be calculated using only the kept Walsh transform coefficients. There is no need to calculate from the pixel level or to temporarily store more than the N t 2 Walsh transform coefficient values which are kept to describe the higher level blocks. Each time the quadtree is pruned, four blocks X_, X 2 , X 3 , and X 4 are merged into one block X, and if every block X l5 X, X 3 , X 4 , and X is described by the same number N t 2 of Walsh transform coefficients, the total number of coefficients describing the image is decreased by 3 times N t 2 . Typically, this increases distortion of a reconstructed image. One measure of the distortion is the square-error which provides a distortion per block. The square-error compares the original image with an image reconstructed from the quadtree code. From the top-left N t 2 Walsh transform coefficients kept in the quadtree code, a decoded image has four pixel matrices x',, x' 2 , x' 3 , and x' 4 or, if the four are merged, one pixel matrix x'. The pixel matrices x' l5 x' 2 , x' 3 , x' 4 , and x' are inverse Walsh - 16 / 1 - transformations of matrices X' 1} X' 2 , X' 3 , X' 4 , and X' described above. The square-error distortion caused by describing the block x with N t Walsh transform coefficients is || x-x , |, the sum of the squares of all components of the matrix x- x'. It can be shown using standarc linear algebra - 17 - techniques that || x-x ' || equals | X 'i l + || ∑ -X^ ll + II 3-X' 3 || + || X 4 -X' 4 || + trBB τ /(2N) 2 , where for Z = lθg 2 N - 2N A Z+1 T - X'. The square-error resulting from using the block x as a leaf node is the sum of the square-error caused of blocks x'i, x' 2 , x' 3 , and x' 4 plus an additional error caused by merging. Because matrix B is completely determined by the Walsh transform coefficients X',, X' 2 , X' 3 , and X' , the additional square-error can be determined recursively from the saved Walsh transform coefficients, and there is no need to return to a pixel level calculation or to save extra Walsh transform coefficient values for calculation of the additional square-error. Another measure of the additional distortion is the sum of the absolute values of the matrix B which is requires fewer multiplications to calculate because the components of B do not need to be squared. Still another measure of the additional distortion is the maximum of the absolute values of coefficients in the matrix B. Determining which measure is the best for images is subjective because for images the goal is to have decoded images which are the least changed from the original according to a human view. Both the sum and the maximum absolute value of the coefficients in B have been experimentally found to provide a decoded image which appears close to the original. Pruning of a quadtree can be done recursively by merging only the sets of four blocks which cause the smallest additional error. A pruning threshold T m can be set such that if the additional error caused by pruning is less than the pruning threshold then nodes are pruned. - 17/1 - The value of the pruning threshold T m and the type of measure for the error determine the accuracy of the quadtree description. For the square-error, the - 18 - additional error is the trace of BB T /(2N) 2 . For absolute sum error, the additional error is the sum of the absolute values of the coefficients of B divided by (2N) 2 . For absolute maximum error, the additional error is the maximum absolute value of the coefficients of B and can be determined without division. Typically, Walsh transform coefficients are determined to more significant bits than are embedded in a quadtree code, and the Walsh transform coefficients are quantized to a desired number of possible values. The quantization causes distortion because the quantized values only approximate the correct coefficient values. As is well known in the art, for a fixed bit rate transmission, the optimal quantization technique for minimizing distortion caused by quantization depends on the distribution of values to be quantized and on the method of coding quantized values. For a generalized gaussian distribution and variable length coding of the Walsh transform coefficients, quantization with uniform step size minimizes the distortion for a fixed bit rate transfer. Uniform step size divides the Walsh transform coefficients by a fixed quantization step sizes q, and then rounds the result to the nearest integer. A different step size q can be chosen for each coefficient so that the largest anticipated Walsh transform coefficient falls within the desired range of values. As disclosed below, for a particular embodiment of the invention, the same quantization step size can be used for all coefficients in a block. Different step sizes q N can be used for different size blocks. Typically, Walsh transform coefficient magnitudes are proportional to N 2 where N-by-N is the block size. Step sizes q N equal to q 0 - N 2 compensate for the increased in coefficient size for larger blocks. Quantization can be improved by taking into account that - 19 - error caused by quantization of the coefficients of a large block disturbs more pixels than quantization for a small block. An estimate of the variance of the quantization error, assuming uniform distribution, is proportional to N 2 -q 2 . Accordingly, a better quantization method uses step size q^ equal to q 0 -N for blocks of size N. A further restriction of the step size is that the resultant quantization distortion should maintain the image accuracy of the pruning threshold T m . Accordingly, the number of possible values after quantization should be minimized to reduce the number of bits required to express the quantized values, but enough possible values should be provided so that the distortion caused by quantization does not outweigh the distortion caused by pruning. Tables 1 and 2 show values for the pruning threshold T m and quantization constant q which provide compatible amounts of distortion. T m is a limit for the square-error (trBB 7 / (2N) 2 ) divided by four, and the step size of the quantized coefficients is 2'N-q. TABLE 1 TABLE 2 - 20 - After the coefficients are quantized, they are variable length coded. Variable length coding such as Huffman coding requires fewer bits for the most frequent values and more bits for the least frequent values so that the average size of the quadtree code is reduced by variable length coding. A decoder which receives the quadtree code typically uses a look-up table to decode the Huffman coding and then multiplies quantized Walsh transform coefficients by the step size q N to restore approximate Walsh transform coefficients. The decoder determines the block size and the appropriate step size q^ from the quadtree structure. Fig. 11 shows a block diagram including a video/image codec in accordance with an embodiment of the invention. The video/image codec may be used, for example, in applications such as a video telephone communications or an image archive system for storing compressed images. As shown in Fig. 11, the coder side of the codec connects to a camera 1105 or some other source which provides video signals that represent a series of images or frames which create the appearance of a moving image. Any known or yet to be developed video format for video signals may be used, and can be converted from one format to another by a converter 1110 if desired. Most current video signal formats provide each frame as a series of horizontal lines which can be captured in a camera buffer 1115 to created a two dimensional data structure such as a pixel map for a frame. A frame memory 1120 receives a pixel map for the frame from camera buffer 1115. Typically, two consecutive frames in a moving image are closely related to each other. By comparing two consecutive frames, the amount of information in the second frame can be reduced by subtracting the information already transmitted with a previous frame. - 21 - Many techniques are known for reducing the amount of information per frame of a series of frames. In the embodiment of Fig. 11, a motion estimator 1125 compares the frame in frame memory 1120 image to previous frame stored in a frame buffer 1130 and determines an average offset of information between frames and generates motion vector which are transmitted to a decoder. A shifted previous frame is then subtracted 1135 from the frame in frame memory 1120 to provide a difference image. Motion estimator 1125 and subtraction 1135 are not necessary for still images such as found in an image archive system. Accordingly, a still image codec can be made by eliminating motion estimator 1125 and subtraction 1135, so that a still image instead of on a difference frame is coded. A quadtree Walsh transform (QTWT) processor 1140 creates a quadtree code and quantizes the Walsh transform coefficients for the difference frame using the methods disclosed above. Such processors may be implemented in hardware or in software (as in the Appendix.) In one embodiment, processor 1140 breaks the difference frame in the a series of square sub-images such as series of 16 by 16 pixel sub-^images and provides a quadtree code for each separate sub-image. Processor 1140 also quantizes the Walsh transform coefficients. It has been experimentally determined that difference frames for a wide variety of moving images have Walsh transform coefficients that, with the exception of the top-left (or DC) coefficient, have values that approximately follow a Lapacian distribution where the probability of a coefficient having a value x is approximately proportional to exp{-|x|}. In the embodiment where a frame is divided into sub-images, the difference between the DC coefficient for neighboring sub- images is also approximately Lapacian. A bit rate distortion function can be used to determine bit rates and step sizes for every Walsh - 22 - transform coefficient in an N-by-N block. Experiments show that step size assignment which minimize the quantization distortion subject to the constraint of a constant bit rate are almost the same for every kept coefficient in an N-by-N block, even though the absolute magnitudes of coefficients vary. The quadtree codes are combined with the previous frame in buffer 1130 for internal use and transmitted through a source encoder 1145, a channel encoder 1150, and a channel buffer 1155 to a channel. Decoding the quadtree code and combining the decoded difference image to the previous frame in buffer 1130 provides a decoded frame which the same as the frame generated by a decoder. Source encoder 1145 variable length codes the Walsh transform coefficients in quadtree code. In accordance with one embodiment of the present invention, after quantization according to block size, the Walsh transform coefficients for a difference image range from -255 to 255, (511 possible values) with the most likely value being 0. To create Huffman codes for this embodiments, the possible values can be divided into eight classes Co-Cg as shown in Table 3. BINARY REPRESENTATION 0 1 1* 1** 1*** (24) **** 2**** __***** j****** The Huffman codes used for each class depends on the number of Walsh transform coefficient which describe each block. The Huffman codes for classes C 0 -C 8 shown in Tables 4, 5, and 6 are for one, four, and sixteen Walsh transform - 23 - coefficients per block respectively. (25) (26) (27) - 24 - In Tables 4, 5, and 6, the Huffman code for any value within a class is represented by the class code combined with a sign bit and a fixed length select value when necessary. In Tables 5 and 6, EOB (end of block) indicates all the remaining Walsh transform coefficients for a block are zero. In Table 6, R(2) to R(15) indicate two to fifteen consecutive zeros respectively. Fig. 12 shows a zigzag order for a four-by-four block of Walsh transform coefficients. With the pruning techniques described above and the order shown in Fig. 12, the last coefficients have the highest probability of being zero. Channel encoder 1150 adds error checking codes. Channel buffer 1155 temporarily stores portions of the quadtree code so the rate of transmission does not exceed the capabilities of an output channel carrying the quadtree code. - 25 - Fig. 11 also shows a decoder portion which decodes quadtree codes which are received on an input channel. Channel buffer 1160 stores input quadtree codes so that data is not lost when the transmission rate on the input channel temporarily exceeds the processing rate of the decoder. A channel decoder 1165 removes the transmission error encoding and checks for transmission errors. A source decoder 1170 decodes the Huffman coding of Walsh transform coefficients in the quadtree code and provides the decoded values to a QTWT decoder 1175. QTWT decoder 1175 identifies the blocks corresponding to the leaf nodes of the quadtree code, and performs an inverse Walsh transformation on the Walsh transform coefficients corresponding to the leaf nodes. The identified blocks are then filled with the values provided by the inverse Walsh transformations to form a difference image. Adder 1185 combines the difference image with a shifted pixel map according to a received motion vector of a previous frame stored in frame buffer 1180 to generate a pixel map for a new frame. The new frame is then stored in frame buffer 1180 for use with the next difference image. The pixel map for the new frame also passes through a filter 1190 which can, for example, smooth discontinuities in the new frame. After filtering, the new frame is then displayed on display 1195. Alternatively, the new frame can be displayed without filtering. The appendix contains listings of C language subroutines which encode and decode quadtree codes with embedded Walsh transform coefficients. For encoding, subroutine qtwt_quan_enco2D.c is the top level subroutine which calls the subroutines necessary for creating a quadtree code, quantizing, and variable length coding. Subroutine qtwt_grow_costt.c generates a balance quadtree. Subroutine qtwt_prune_costt.c prunes the quadtree. Subroutine output bits.c forms and outputs the quadtree - 26 - code. For decoding, subroutine qtwt_quan_deco2D. c is the top level subroutine which calls the subroutines necessary for variable length decoding and reconstruction of a frame. Subroutine input_bits2D.c decodes a block from the Walsh code. Subroutines bits_to_matrix2D.c, input_bits2D.c, and input_bits.c variable length decode an input quadtree code. The other subroutines are general purpose and can be used both during coding and decoding. Subroutine one_d_wt.c one_d_iwt.c performs a recursive one dimensional Walsh transformation and inverse Walsh transformation. Subroutine one_d_wt_rc.c performs a single step one dimensional Walsh transform. Subroutine two_d_iw.c and two_d_iwt.c perform a two dimensional (or matrix) Walsh transformation and inverse Walsh transform respectively. Although the present invention has been described with reference to particular embodiments, the description is only an example of the invention's application and should not be taken as a limitation. In particular, even though much of preceding discussion was aimed at processing of video images and in particular pixel maps, present invention can be more generally applied to description of any array of two dimensional data structure. APPENDIX /* bits_to_matrix2D.c: subroutine to input bits and to decode them into blocks; for Nt = 2; Copyright by Xiaonong Ran */ #include "input_bits2D.c" void bits_to_matrix2D( temp_2d, init_v, flagl, fp_in, code, length, step_size, nn4 , trunc, buffer_input, bits to input, treeh ) - 27 - float **temp_2d, **init_v, nn4; int *flagl; short *code, *length; FILE *fp_in; float step_size; /* quantization step size. */ int *buffer_input, *bits_to_input; struct entry *treeh; { int k6, i6, j6, itemp, run_l, il; /* zigzag scaning */ k6 = 0; i6 = 0; j6 = 0; - 28 - il— ) { 0 trunc*trunc-l ) buffer_input treeh, bits_to_input, code, length, &itemp, &run_l ) ; } 5 else{ temp_2d[i6] [j6] = itemp*step_size*nn4; if( k6 < trunc*trunc-l ) buffer_input, input_bits2D( fp_in, treeh, bits_to_input, 0 } code, length, &itemp, &run_l ) ; } trunc-l ) { trunc*trunc-l ) buffer_input, input_bits2D( fp_in, treeh, bits_to_input, } code, length, &itemp, &run_l ) ; else{ temp_2d[i6] [ 6] = itemp*step_size*nn4; if( k6 < trunc*trunc-l ) buffer_input, input_bits2D( fp_in, treeh, bits_to_input, buffer_input , code, length, Sitemp, &run_l ) ; } else{ temp_2d[i6] [j6] = itemp*step_size*nn4 ; - 29 - if( k6 < trunc*trunc-l ) input_bits2D( fp_in, treeh, bits_to_input, buffer input, code, length, &itemp, &run 1 ); buffer_i buffer_i , buffer_i , buffer_i trunc*trunc-l ) treeh, bits_tσ_input, - 30 - code, length, &itemp, &run_l ) ; } else{ temp_2d[i6] [j6] = itemp*step_size*nn4 ; if( k6 < trunc*trunc-l ) input_bits2D( fp_in, treeh, bits_to_input, buffer_input, code, length, &itemp, &run_l ) ; } for( il = i6+l; il < trunc; il++ ){ i6++; j6—; k6++; if( run_l > 0 ) { temp_2d[i6] [j6] = 0.0; run_l—; if( run_l == 0 && k6 < trunc*trunc-l ) input_bits2D( fp_in, treeh, bits_to_input, buffer_input, code, length, &itemp, &run_l ); } else{ temp_2d[i6] [j6] = itemp*step_size*nn4; if( k6 < trunc*trunc-l ) input_bits2D( fp_in, treeh, bits_to_input, buffer input, code, length, &itemp, &run_l ) } } /* end of zigzag scaning */ } /*input_bits.c: subroutine to input bits and to variable length decode them into indices. Copyright by Xiaonong Ran */ void input_bits( fp_in, hufftree, bits_to_input, buffer_input, code, length, index_out ) FILE *fp_in; struct entry *hufftree; int *bits_to_input, *buffer_input, *code, *length, *index_out; { struct entry *tree pointer; - 3 1 - tree_pointer = hufftree; while( tree_pointer->flag_node == 0 ) { if( *bits_to_input == 0 ) { /* Read the next byte if*/ *buffer_input = getc( fp_in ) ; /* bits are left in buffer*/ *bits_to_input = 8; } if( *buffer_input & 1 ) tree_pointer = tree_pointer->leaf1; else tree_pointer = tree_pointer->leaf0; *buffer_input »= 1; *bits_to_input -= 1; } *index__out = tree_pointer->index; } /*input_bits2D.c: subroutine to input bits and to decode them into quantized values, run-lengths and EOBs; for Nt=2. #include "input_bits.c" Copyright by Xiaonong Ran */ void input_bits2D( fp_in, hufftree, bits_to_input, buffer_input, code, length, index, run_len ) FILE *fp_in; struct entry *hufftree; int *bits_to_input, *buffer_input, *code, *length, *index, *run_len; { int itemp, index_out, sign_i, i2; input_bits( fp_in, hufftree, bits_to_input, buffer_input, code, length, &index_out ) ; *run_len = 0; if( index_out == 0 ) { *run_len = 4; /* for EOB */ } else if( index_out == 1 ) { itemp = index_out-l; *index = itemp; } else if( index_out < 7 ){ - 32 - itemp = index_out-l; if( *bits_to_input == 0 ) { *buffer_input = getc( fp_in ) ; *bits_to_input = 8; } if( *buffer_input & 1 ) sign_i = 1; else sign_i = -1; *buffer_input »= 1; *bits_to_input -= 1; itemp *= (-l)*sign_i; ♦index = itemp; } else if( index_out < 10 ) { itemp = index out-4; if( *bits_to_Tnput == 0 ) { *buffer_input = getc( fp_in ); *bits_to_input = 8; } if( *buffer_input & 1 ) sign_i = 1; else sign_i = -1; *buffer_input >>= 1; *bits_to_input -= 1; for( i2 = 0; i2 < 1; i2++ ){ if( *bits_to_input == 0 ) { *buffer_input = getc( fp_in ); *bits_to_input = 8; } itemp «= 1; if( *buffer_input & 1 ) itemp += 1; *buffer_input >>= 1; *bits_to_input -= 1; } itemp *= (-l)*sign_i; ♦index = itemp; } else if( index_out < 15 ) { itemp = index out-7; if( *bits_to Tnput == 0 ) { *buffer_Tnput = getc( fp_in ) ; *bits_to_input = 8; } if( *buffer_input & 1 ) sign_i = 1; else sign_i = -1; *buffer_input >>= 1; *bits to_input -= 1; for( T2 = 0; i2 < 2; i2++ ){ if( *bits_to_input == 0 ) { *buffer_input = getc( fp_in ) ; *bits_to_input = 8; } itemp <<= 1; if( *buffer_input & 1 ) itemp += 1; ♦buffer input »= 1; - 33 - *bits_to_input -= 1; } itemp *= (-l)*sign_i; *index = itemp; } else{ itemp — 1; if( *bits_to input == 0 ) { *buffer_Tnput = getc( fp_in ); *bits_to_input = 8; } if( *buffer_input & 1 ) sign_i = 1; else sign_i = -1; *buffer_input »= 1; *bits to_input -- 1; for( 12 = 0; i2 < index_out-10; i2++ ){ if( *bits_to_input == 0 ) { *buffer_input = getc( fp_in ) ; *bits_to_input = 8; } itemp «= 1; if( *buffer_input & 1 ) itemp += 1; *buffer_input »== l; *bits_to_input -= 1; } itemp *= (-l)*sign_i; *index = itemp; } /*one_d_iwt.c: subroutine to perform complete fast recursive l-D inverse Walsh Transform. Copyright by Xiaonong Ran */ void one_d_iwt_2 ( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[2]; if( trunc_l >= 2 ) { temp[0] = trans_in[0] + trans_in[1] ; - 34 - temp[l] = trans_in[0] - trans_in[l] ; data_out[0] = temp[0]; data_out[1] = temp[1] ; } else if( trunc_l == 1 ) { data_out[0] = trans_in[0] ; data_out[l] = trans_in[0] ; } else { data_out[0] = 0.0; data_out[1] = 0.0; return; } if( flag == 1 ){ data_out[0] /= 2.0; data_out[l] /= 2.0; } } void one_d_iwt_4 ( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[4] ; if( trunc 1 >= 4 ) { one_d_Twt_2 ( trans_in, 2, trans_in, 0 ) ; one_d_iwt_2 ( trans_in+2, 2, trans_in+2, 0 ) ; temp[0] = trans_in[0] + trans_in[2] temp[1] = trans_in[0] - trans_in[2] temp[2] = trans_in[l] - trans_in[3] temp[3] = trans in l] + trans_in[3] } else if( trunc_l == 3 ){ one_d_iwt_2( trans in, 2, trans_in, 0 ) one d iwt 2( trans in+2, 1, trans in+2 , temp[0] = trans_in[0] + trans_in[2]; tempfl] = trans_in[0] - trans_in[2]; temp[2] = trans_in[l] - trans_in(3]; temp[3] = trans_in[l + trans_in[3]; } else if( trunc_l == 2 ) { one_d_iwt_2 ( trans_in, 2, trans_in, 0 ); temp[0] = trans in[0] - 35 - temp[l] = trans_in[0]; temp[2] = trans_in[l]; temp[3] = trans_in[l]; } else if( trunc_l == l ) { one_d_iwt_2 ( trans_in, 1, trans_in, 0 ); temp[0] = trans_in[0] ; temp[1] = trans_in[0] ; temp[2] = trans_in[1] ; temp[3] = trans_in[1] ; } else { data_out[0] = 0.0; data_out[1] = 0.0; data_out[2] = 0.0; data_out[3] = 0.0; return; } if( flag == 1 ){ data_out[0] = temp[0]/4.0; data_out[l] = temp[l]/4.0; data_out[2] = temp[2]/4.0; data_out[3] = temp[3]/4.0; > else { data_out[0] = temp[0] ; data_out[1] = tempf1] ; data_out[2] = temp[2] ; άata_out[3] = temp[3] ; } } void one_d_iwt_8( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[8] ; int i, j, sign; if( trunc_l == 0 ) { for( i = 0; i < 8; i++ ) data_out[i] = 0.0; return; } i = trunc_l - 4; if( i >= 0 ) j = 4; - 36 - else { j = trunc_l; i = 0; } one_d_iwt_4 ( trans_in, j, trans_in, 0 ); one_d_iwt_4 ( (trans_in+4) , i, (trans_in+4) , 0 ); if( i = o ) or( i = 0; i < 8; i++ ) { j = i/2; temp[i] = trans_in[j] ; } else for( i = 0; i < 8; i++ ) { j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = trans_in[j] + sign*trans_in[j+4] ; } if( flag == 1 ) for( i = 0; i < 8; i++ ) data_out[i] = temp[i]/8.0; else for( i = 0; i < 8; i++ ) data_out[i] = temp[i]; } void one_d_iwt_16( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[16]; int i, j, sign; if( trunc ^ l == 0 ) { for( T = 0; i < 16; i++ ) data_out[i] = 0.0; return; } i = trunc_l - 8; if( i >= 0 ) j = 8; else { j = trunc_l; i = 0; } one_d_iwt_8 ( trans_in, j, trans_in, 0 ); one_d_iwt_8 ( (trans_in+8) , i, (trans_in+8) , 0 ); - 37 - if( i == o ) for( i = 0; i < 16; i++ ){ j = i/2; temp[i] .= trans_in[j] ; } else for( i = 0; i < 16; i++ ){ j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = trans_in[j] + sign*trans_in[j+8] ; } if( flag == 1 ) for( i = 0; i < 16; i++ ) data_out[i] = temp[i]/16.0; else for( i = 0; i < 16; i++ ) data_out[i] = temp[i]; } void one_d_iwt_32 ( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[32] ; int i, j, sign; if( trunc 1 == 0 ) { for( T = 0; i < 32; i++ ) data_out[i] = 0.0; return; } i = trunc_l - 16; if( i >= 0 ) j = 16; else { j = trunc_l; i = 0; } one_d_iwt_l6 ( trans_in, j, trans_in, 0 ) ; one_d_iwt_16 ( (trans_in+16) , i, (trans_in+16) , 0 ); if( i = 0 ) for( i = 0; i < 32; i++ ){ j = i/2; temp[i] = trans_in[j ] ; } else for( i = 0; i < 32; i++ ){ - 38 - j = i/2; if( (((int) ((i+i)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = trans_in[j] + sign*trans_in[j+16] ; } if( flag == 1 ) for( i = 0; i < 32; i++ ) data_out[i] = temp[i]/32.0; else for( i = 0; i < 32; i++ ) data_out[i] = temp[i]; } void one_d_iwt_64 ( trans_in, trunc_l, data_out, flag ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ int flag; /* flag=l: the last recursive stage with the factor 1/2*/ { float temp[64]; int i, j, sign; if( trunc ^ l == 0 ) { for( T = 0; i < 64; i++ ) data_out[i] = 0.0; return; } i = trunc_l - 32; if( i >= 0 ) j = 32; else { j = trunc_l; i = 0; } one_d_iwt_32 ( trans_in, j, trans_in, 0 ); one_d_iwt_32 ( (trans_in+32) , i, (trans_in+32) , 0 ); if( i == 0 ) for( i = 0; i < 64; i++ ){ j = i/2; temp[i] = trans_in[j]; } else for( i = 0; i < 64; i++ ){ j = i/2; if( (( (int) ((i+i)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = trans_in[j] + sign*trans_in[j+32] ; } if( flag == 1 ) - 39 - for( i = 0; i < 64; i++ ) data_out[i] = temp[i]/64.0; else for( i = 0; i < 64; i++ ) data_out[i] = temp[i]; } void one_d_iwt( trans_in, size, trunc_l, data_out ) float *trans_in; /* trans_in: l-D trans, coeff. array in.*/ int size; /* size: size of the l-D trans, coeff. array.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *data_out; /* data_out: l-D data array out.*/ { switch (size) { case 2: one_d_iwt_2 ( trans_in, trunc_l, data_out, 1 ) ; break; case 4: one_d_iwt_4 ( trans_in, trunc_l, data_out, 1 ) ; break; case 8: one_d_iwt_8 ( trans_in, trunc_l, data_out, 1 ); break; case 16: one_d_iwt_16( trans_in, trunc_l, data_out, 1 ); break; case 32: one_d_iwt_32 ( trans_in, trunc_l, data_out, 1 ) ; break; case 64 : one_d_iwt_64 ( trans_in, trunc_l, data_out, 1 ) ; break; default: printf ("Walsh Transform uses size 2, 4, 8, 16, 32 or 64 here\n") ; break; } } /*one_d_wt.c: subroutine to perform complete fast recursive l-D Walsh Transform. Copyright by Xiaonong Ran */ void one_d_wt_2 ( data_in, trunc_l, trans_out ) float *data_in; /* data_in: l-D data array in.*/ - 40 - int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[2] ; if( trunc_l >= 2 ) { temp[0] = data_in[0] + data_in[1] ; temp[1] = data_in[0] - data_in[1] ; trans_out[0] = temp[0]; trans_out[l] = temp[l]; } else if( trunc_l == 1 ) { trans_out[0] = data_in[0] + data_in[1] ; } void one_d_wt_4 ( data_in, trunc_l, trans_out ) float *data_in; /* data_in: l-D data array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[4] ; int trunc 10; trunc_10 = (trunc_l-l) / 2 + 1; one_d_wt_2 ( data_in, trunc_lθ, data_in ); one_d_wt_2 ( data_in+2, trunc_10, data_in+2 ) if( trunc 1 >= 4 ) { temp[0 ] = data_ in[0 + data_in[2] ; temp[1] = data_ in[0 - data_in[2] ; temp[2] = data " in[l - data_in[3] ; temp[3] = data in[l + data_in[3] ; trans out[0] = " temp 0]; trans out[l] = temp i]; trans out[2] = temp 2]; trans out[3] = temp 3]; } else if( trunc_l = == 3 { temp[0] = data in[0 + data_in[2] ; temp[1] = data " " in[0 - data_in[2]; temp[2] = data " n[l - data_in[3]; trans out[0] = " temp 0]; trans out[l] = temp i]; trans out[2] = temp 2]; } else if( trunc_l = ~ 2 { temp[0] = data in[0 + data in[2] ; - 41 - temp[l] = data_in[0] - data_in[2]; trans_out[0] = temp[0] ; trans_out[1] = temp[1] ; } else if ( trunc_l == 1 ) { temp [ 0] = datε_in[0] + data_in [2 ] ; trans_out[ 0] = temp[ 0] ; } } void one_d_wt_8 ( data_in, trunc_l, trans_out ) float *data_in; /* data_in: l-D data array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[8] ; int trunc_10, i, j, sign; trunc_10 = (trunc_l-l) / 2 + 1; one_d_wt_4 ( data_in, trunc_10, data_in ); one_d_wt_4 ( (data_in+4), trunc_10, (data_in+4) ); if( trunc_l > 8 ) trunc_l = 8; for( i = 0; i < trunc_l; i++ ){ j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = data_in[j] + sign*data_in[j+4] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i ] η » temp[i] ; } void one_d_wt_16( data_in, trunc 1, trans_out ) float *data_in; /* data_Tn: l-D data array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[16]; int trunc_10, i, j, sign; trunc_10 = (trunc_l-l) / 2 + 1; one_d_wt_8 ( data_in, trunc_10, data_in ); one_d_wt_8 ( (data_in+8) , trunc_10, (data_in+8) ); if( trunc_l > 16 ) trunc_l = 16; for( i = 0; i < trunc_l; i++ ){ - 42 - j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; tempfi] = data_in[j] + sign*data_in[j+8] ; } for( i = 0; i < trunc_l; i++ ) trans out[i] = tempfi]; } void one_d_wt_32( data_in, trunc 1, tranε_out ) float *data_in; /* data_Tn: l-D data array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[32] ; int trunc_10, i, j, sign; trunc_10 = (trunc_l-l) / 2 + 1; one_d_wt_16( data_in, trunc_10, data_in ); one_d_wt_16( (data_in+16) , trunc_10, (data_in+16) ); if( trunc_l > 32 ) trunc_l = 32; for( i = 0; i < trunc_l; i++ ) { j = i/2; if( (((int)((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; tempfi] = data_in[j] + sign*data_in[j+16] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = temp[i] ; } void one_d_wt_64( data_in, trunc 1, trans_out ) float *data_in; /* data_Tn: l-D data array in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[64] ; int trunc_10, i, j, sign; trunc_10 = (trunc_l-l) / 2 + 1; one_d_wt_32( data_in, trunc_10, data_in ); one_d_wt_32( (data_in+32) , trunc_10, (data_in+32) ); if( trunc_l > 64 ) trunc_l = 64; for( i = 0; i < trunc_l; i++ ) { j = i/2; - 43 - if( (( (int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = data_in[j] + sign*data_in[ +32] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = tempfi]; } void one_d_wt( data_in, size, trunc_l, trans_out ) float *data_in; /* data_in: l-D data array in.*/ int size; /* size: size of the l-D data array.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { switch (size) { case 2: one_d_wt_2 ( data_in, trunc_l, trans_out ) ; break; case 4: one_d_wt_4 ( data_in, trunc_l, trans_out ) ; break; case 8: one_d_wt_8 ( data_in, trunc_l, trans_out ); break; case 16: orie_d_wt_16( data_in, trunc_l, trans_out ); break; case 32: one_d_wt_32( data_in, trunc_l, trans_out ); break; case 64: one_d_wt_64( data_in, trunc_l, trans_out ); break; default: printf("Walsh Transform uses size 2, 4, 8, 16, 32 or 64 here\n"); break; } } /*one_d_wt_rc.c: subroutine to perform single step fast l-D RECURSIVE Walsh Transform. Copyright by Xiaonong Ran */ void one d wt 2 rc( data inl, data in2 , trunc 1, trans out - 44 - ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[2] ; if( trunc_l >= 2 ) { temp[0] = data_inl[0] + data_in2[0]; temp[l] = data_inl[0] - data_in2[0]; trans_out[0] = temp[0] ; trans_out[1] = temp[1] ; } else if( trunc_l == 1 ) { trans_out[0] = data_inl[0] + data_in2[0]; } } void one_d_wt_4_rc( data_inl, data_in2, trunc 1, trans out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[4] ; if( trunc_l >= 4 ) { temp[0] = data_inl[0] + data_in2[0]; temp[l] = data_inl[0] - data_in2[0]; temp[2] = data_inl[l] - data_in2[1] ; temp[3] = data_inl[l] + data_in2[l]; trans_out[0] = temp[0] ; trans_out[1] = temp[1] ; trans_out[2] = temp[2] ; trans_out[3] = temp[3] ; } else if( trunc_l == 3 ) { temp[0] = data_inl[0] + data_in2[0]; tempfl] = data_inl[0] - data_in2[0]; temp[2] = data_inl[l] - data_in2[l]; trans_out[0] = temp[0] ; trans_out[1] = temp[1] ; trans_out[2] = temp[2] ; } else if( trunc_l == 2 ) { temp[0] = data_inl[0] + data_in2[0]; tempfl] = data_inl[0] - data_in2[0]; - 45 - trans_out[0] = temp[0] ; trans_out[l] = temp[l]; } else if ( trunc_l == 1 ) { temp[0] = data_inl[0] + data_in2[0]; trans_out[0] = temp[0] ; } } void one_d_wt_8_rc( data_inl, data_in2, trunc_l, trans_out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in. */ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[8] ; int i, j, sign; if( trunc_l > 8 ) trunc_l = 8; for( i = 0; i < trunc_l; i++ ){ j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = data_inl[j] + sign*data_in2[j ] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = temp[i] ; } void one_d_wt_l6_rc( data_inl, data_in2, trunc_l, trans_out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int trunc__l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[16] ; int i, j, sign; if( trunc_l > 16 ) trunc_l = 16; for( i = 0; i < trunc_l; i++ ) { j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; te pfi] = data_inl[j] + sign*data_in2[j ] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = temp[i]; - 46 - } void one_d_wt_32_rc( data_inl, data_in2, trunc_l, trans_out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[32] ; int i, j, sign; if( trunc_l > 32 ) trunc_l = 32; for( i = 0; i < trunc_l; i++ ) { j = i/2; if( (((int) ((i+l)/2)) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = data_inl[j] + sign*data_in2 [j] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = temp[i] ; } void one__d_wt_64_rc( data_inl, data_in2, trunc_l, trans_out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { float temp[64] ; int i, j, sign; if( trunc_l > 64 ) trunc_l = 64; for( i = 0; i < trunc_l; i++ ){ j = i/2; if( ( ( (int) ( (i+l) /2) ) & 1) > 0 ) sign = -1; else sign = 1; temp[i] = data_inl[j] + sign*data_in2 [j] ; } for( i = 0; i < trunc_l; i++ ) trans_out[i] = temp[i] ; } void one_d_wt_rc( data_inl, data_in2, size, trunc_l, trans_out ) float *data_inl, *data_in2; /* Two l-D data sub-arrays in.*/ int size; /* size: size of the l-D data array.*/ - 47 - int trunc_l; /* traunc_l: size of transform coefficients to be computed.*/ float *trans_out; /* trans_out: l-D transform coefficient array out.*/ { switch (size) { case 2: one_d_wt_2_rc( data_inl, data_in2 , trunc_l, trans_out ) ; break; case 4: one_d_wt_4_rc( data_inl, data_in2, trunc_l, trans_out ) ; break; case 8: one_d_wt_8_rc( data_inl, data_in2 , trunc_l, trans_out ) ; break; case 16: one_d_wt_16_rc( data_inl, data_in2, trunc_l, trans_out ) ; break; case 32: one_d_wt_32_rc( data_inl, data_in2, trunc_l, trans_out ) ; break; case 64 : one_d_wt_64_rc( data_inl, data_in2, trunc_l, trans_out ) ; break; default: printf("Walsh Transform uses size 2, 4, 8, 16, 32 or 64 here\n") ; break; } } /*output_bits. c: subroutine to output binary bits. Copyright by Xiaonong Ran */ void output_bits( fp_out, buffer_output, bits_to_out, code, length ) FILE *fp_out; int *buffer_output, *bits_to_out, code, length; { int i, itemp, out_temp; - 48 - itemp = code; itemp <<= (32-length) ; for( i = 0; i < length; i++ ){ (*buffer_output) »= 1; if( (itemp & 0x80000000) ) (*buffer_output) j= 0x80; (*bits_to_out) -= 1; itemp «= 1; if( *bits_to_out == 0 ){ out_temp = *buffer_output; /*Output buffer if it is*/ putc(out_temp,fp_out) ; /* now full. */ *bits_to_out = 8; } } } /*qtwt_grow_costt.c: subroutine to generate the balanced quadtree in performing Walsh Transform Quadtree decomposition for all Nt. Copyright by Xiaonong Ran */ void qtwt_grow_costt( frame,row,column,nn,mm,trunc,costt,wtt ) short **frame; /* the current (MCP) frame. */ float ****costt; /* tree of merging-cost: index 1,2: root-blocks; index 3: levels of quad-trees, bottom-up; index 4: nodes */ float ******wtt; /* tree of Walsh transform coefficients: index 1,2: root-blocks; index 3: levels of quad-trees, bottom-up; index 4: nodes index 5,6: coefficient block */ int row, column; /* frame sizes */ int mm, nn; /* mm (nn) : the size of the smallest leaf (root) block. mm must be larger than size of truncated transform blocks*/ int trunc; /* trunc: the size of truncated transform blocks.*/ { int r_nn, c_nn, ii, jj; int i, j, jl, j2, k, 11, 12, ll_log, mm2, mro.3 ; int al, a2 , bl, b2, cl, c2 , cv, cq, trunc2 ; - 49 - float temp, **temp_2d; short *qt_codet; /* temperary memory for qt_code '/ r_nn = row / nn; c_nn = column / nn; 11 = nn/mm; ll_log = (int) ( log2 ( (double) 11) + 0.5 ); /* number of stages after root for the quadtree*/ 12 = 11*11; /*number of possible leaf nodes and the size of tran__v*/ k = (12-1) /3; /*size of the quadtree code*/ trunc2 = 2*trunc; if( k > 0 ) if( (qt_codet = (short *) calloc( k, sizeof(short) ) )==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (temp_2d = (float **) calloc( 2*mm, sizeof(float *)))==NULL ){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < 2*mm; i++ ) if( (temp_2d[i] = (float *) calloc( 2*mm, sizeof(float )))==NULL){ fprintf( stderr, "wc: no more memor \n" ) ; exit( 0 ) ; } for( ii = 0; ii < r_nn; ii++ ) for( jj = 0; jj < c_nn; jj++ ){ /* put transf. block of the basic blocks in an l-D array in Z-scan order. */ for( i = 0; i < 12; i++ ){ jl = 0; j2 = 0; for( j = 0; j <= ll_log; j++ ){ jl += ( (i»(2*j+l))&l )«j; j2 += ( (i»(2*j))&l )«j; > for( al = 0; al < mm; al++ ) for( a2 = 0; a2 < mm; a2++ ) temp_2d[al] [a2] = frame[ii*nn+jl*mm+al] [jj*nn+j2*mm+a2] ; two d wt( temp 2d, mm, mm, trunc, trunc, - 50 - wtt[ii][jj][0][i] ); } /* construct the second last level of the quadtree, (the last level are all leafs).*/ mm2 = mm*mm*mm*mm*16; mm.3 = mm*2; for( j = 0; j < 12/4; j++ ){ for( al = 0; al < trunc2; al++ ) for( a2 = 0; a2 < trunc2; a2++ ) temp_2d[al] [a2] = 0.0; two_d_wt_rc_li(wtt[ii] [jj ] [0] [j*4] ,wtt[ii] [jj] [0] [j*4+l] , Wtt[ii][jj][0][j*4+2], wtt[ii][jj][0][j*4+3], mm3, mm3, trunc2, trunc2 , temp_2d ); temp = 0.0; for( al = 0; al < trunc2; al++ ) for( a2 = 0; a2 < trunc2 ; a2++ ) if( al >= trunc | | a2 >= trunc ) temp += temp_2d[al] [a2]*temp_2d[al] [a2] ; temp /= ( loat)mm2;/* divide by 4*(2*mm)**2 (2nd stage) */ costt[ii][jj][0][j] = temp; if( 0 ==0 ){ qt_codet[j] = 0; for( al = 0; al < trunc; al++ ) for( a2 = 0; a2 < trunc; a2++ ) vtt[ii][jj][l][j][al][a2] = temp_2d[al] [a2] ; } } bl = 0; /* store the starting and ending points of this level*/ b2 = j; /* of quadtree code. */ /* construct all the upper levels of the quadtree. */ cl = 16; for( i = ll_log-2; i >= 0; i— ){ c2 = cl/4; mm2 *= 16; mm3 *= 2; for( j = 0; j < 12/cl; j++ ){ if( qt__codet[j*4+bl] == 0 && qt_codet[j*4+bl+l] == 0 && qt_codet[j*4+bl+2] == 0 && qt_codet[j*4+bl+3] == 0 ) { for( al = 0; al < trunc2; al++ ) for( a2 = 0; a2 < trunc2; a2++ ) temp_2d[al] [a2] = 0.0; two_d_wt_rc_li( wtt[ii][jj] [li_log-l-i] [j*4] , - 51 - wtt[ii][jj][ll_log-l-i][j*4+l],wtt[ii][jj][ll_log-l-i][j*4 +2], wtt[ii] [jj ] [ll_log-l-i] [j*4+3] , m3, m3,trunc2,trunc2,temp_ 2d); temp = 0.0; for( al = 0; al < trunc2; al++ ) for( a2 = 0; a2 < trunc2; a2++ ) if( al >= trunc 11 a2 >= trunc ) temp += temp_2d[al] [a2]*temp_2d[al] [a2] ; temp /= (float)mm.2; costtfii] [jj] [ll__log-l-i] [j] = temp*cl/4.0; /♦divide by 4*(4*mm)**2 for 3rd stage*/ /♦divide by 4*(8*mm)**2 for 4th stage*/ /*divide by 4*(16*mm)**2 for 5th stage*/ if( 0==0 ){ qt_codet[b2+j] = 0; for( al = 0; al < trunc; al++ ) for( a2 = 0; a2 < trunc; a2++ ) tt[ii] [jj] [ll_log-i] [j] [al] [a2] temp_2d[al] [a2] ; } } } bl = b2; b2 += j; el *= 4; } } if( k > 0 ) free( qt_codet ) ; for( i = 0; i < 2*mm; i++ ) free(temp_2d[i] ) ; free(temp 2d) ; } /*qtwt_prune_costt.c: subroutine to prune the balanced quadtree in performing Walsh Transform Quadtree decomposition for all Nt. Copyright by Xiaonong Ran */ void qtwt_prune_costt( row,column,nn,mm,costt,Inn,mse,step size,threshold ) - 52 - float ****costt; /* tree of merging-cost: index 1,2: root-blocks; index 3: levels of quad-trees, bottom-up; index 4: nodes */ int row, column; /* frame sizes */ int mm, nn; /* mm (nn) : the size of the smallest leaf (root) block. mm must be larger than size of truncated transform blocks*/ int Inn; /* the target number of leaf-nodes.*/ double *mse; /* mean-squared-error of pruning. */ float step_size; /* quantization step size for compute threshold. */ float threshold; /* threshold for pruning cost. */ { int r_nn, c_nn, ii, jj, nf, nff; int i, j, i3, j3, k3, jj3, jl, j2, k, 11, 12, ll_log; int al, a2, b3; float temp, tempi, factor; factor = 4*mm*mm; r_nn = row / nn; c_nn = column / nn; 11 = nn/ m; 12 = 11*11; / ♦ number of possible leaf nodes and the size of tran_v*/ ll_log = (int) ( log2 ( (double) 11) + 0.5 ); /♦ number of stages after root for the quadtree*/ ♦mse = 0.0; for( i = 0; i < row/nn; ++i ){ for( j = 0; j < column/nn; ++j ){ ii - 12 / 4; for( k = 0; k < ll_log; ++k ){ for( jj = 0; jj < ii; ++jj ){ if( k == 0 && costt[i] [j] [k] [jj]<threshold ){ ♦mse += costt[i] [j] [k] [jj] ; costt[i][j][k][jj] = -costt[i][j][k][jj]-l.θ; } else if( k > 0 && ( costt[i] [j] [k-1] [jj*4] < 0 && costtfi] [j] [k-1] [jj*4+l]<0 && costtfi] [j] [k-1] [jj*4+2]<0 && costt[i][j][k-l][jj*4+3]<0 ) ){ temp = costtfi] [j][k][jj] ; if( temp < threshold ){ *mse += costtfi] fj] [k] [jj ] ; costt[i][j][k][jj] = -costt[i][j][k][jj]-1.0; } } } ii /= 4; - 53 - } } *mse *= (4 . 0*mm*mm/ ( f loat) (row*column) ) ; } /*qtwt_quan_deco2D.c: subroutine to input bits, to variable length decode them and to reconstruction frame; for Nt = 2; Copyright by Xiaonong Ran */ /include "bits_to_matrix2D.c" void qtwt_quan_deco2D( frame,step_size,row,column,nn,mm,trunc,fp_in,seq_to_2d ) short **frame, **seq_to_2d; /* the current (MCP) frame */ int row, column; /* frame sizes */ int mm, nn; /* mm (nn) : the size of the smallest leaf (root) block. mm must be larger than size of truncated transform blocks*/ int trunc; /* trunc: the size of truncated transform blocks.*/ float step_size; /* quantization step size. */ FILE *fp_in; { float **temp_2d; short *length, *code; int i, j, k, ikk, ik, r_nn, c_nn, 11, ll_log, 12, ii, jj, flagl; int buffer_input, bits_to_input, itemp, i2, ii3, jj3, al, a2, nn2; struct entry *treeh, *tree_builder; float nn4, **init_v; /*initial value of DPCM of (0,0)th coef. ; may extended to other coef.s */ float **costt; /* index 1: levels of quad-trees, bottom-up; index 2: nodes */ double sz_factor; /*sz_factor: step size factor. */ /********* temp. 2D array for blocks if( (temp_2d = (float **) calloc( nn, sizeof(float *) ) )==NULL ) { fprintf( stderr, "wc: no more memory\n" ); - 54 exit( 0 ) ; } for( i = 0; i < nn; i++ ) if( (temp_2dfi] = (float *) calloc( nn, sizeof(float)) )==NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } ****♦**♦**♦**♦*/ /********* codes and lengths for trunc=2 if( (code = (short *) calloc( 18, sizeof(short) ) )==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (length = (short *) calloc( 18, sizeof(short) ) )==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; - 55 - code[15]=1640; length[15]=13 ; /♦ +-32 ... +-63 lxxxxx ♦/ code[16]=6567; length[16]=15; /♦ +-64 ... +-127 lxxxxxx ♦/ code[17]=6566; length[17]=15; /♦ +-128 ... +-255 lxxxxxxx ♦/ /********************************************************* ***************/ /********************* building the huffman tree **************************/ if( (treeh=(struct entry ♦) calloc( 1, sizeof(struct entry) ))==NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < 18; i++ ){ tree_builder = treeh; ikk = code[i] ; ikk <<= (32-length[i] ) ; for( ik = 0; ik < length[i] ; ik++ ) { if( (ikk & 0x80000000) ){ if( tree_builder->leafl == 0 ) if( (tree_builder->leafl=(struct entry ♦) calloc(1,sizeof(struct entry) ) )==NULL) { fprintf ( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } tree_builder = tree_builder->leaf1; } else { if( tree_builder->leaf0 == 0 ) if( (tree_builder->leafθ=(struct entry ♦) calloc(1,sizeof(struct entry)) )==NULL){ fprintf ( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } tree_builder = tree_builder->leaf0; } ikk «= l; } tree_builder->flag_node = 1; tree_builder->index = i; } /********************* end of building the huffman tree *******************/ /***********♦♦♦♦*♦♦ some size-parameters *********************************/ - 56 - r_nn = row / nn; c_nn = column / nn; 11 = nn/mm; 12 = 11*11; /*number of possible leaf nodes and the size of tran_v*/ ll_log = (int) ( log2 ( (double) 11) + 0.5 ) ; /* number of stages after root for the quadtree.*/ bits_to_input = 0; /********************************************************* *****************/ /******************* one single—tree ************************************** if( (costt=(float **)calloc(ll_log,sizeof(float *)))==NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } ii = 12 / 4; for( k = 0; k < ll_log; ++k ){ if( (costt[k]=(float *)calloc(ii,sizeof(float) ) )==NULL) { fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } ϋ /= 4; } /********************************************************* **♦♦**♦♦******♦*/ for( i = 0; i < r_nn; ++i ){ for( j = 0; j < c_nn; ++j ){ ii = 1; for( k = ll_log-l; k >-l; k~ ){ /♦ input quadtree structure ♦/ for( jj = 0; jj < ii; ++jj ){ if( k == ll_log-l jj costt[k+l] [ (int) (jj/4) ] > 0 ){ if( bits_to_input == 0 ) { /♦ Read the next byte if buffer_input = getc( fp_in ) ; /♦ bits are left in buffer^/ bits_to_input = 8; } if( (buffer_input & 1) ) costt[k][jj] = 1.0; else costt[k] [jj] = -1.0; buffer_input »= 1; bits_to_input -= 1; } 49 - 57 - else costt[k][jj] = -1; } ii ♦= 4; > /♦ end of outputing quadtree ♦/ ii = 12; /♦ input codes of WT coefficients * / nn4 = mm*mm; nn2 = mm; sz_factor = 1.0; for( k = 0; k <= 11 log; ++k ){ for( jj = 0; jj < Ti; ++jj ) { if( (k == 0 || costt[k-l] [jj]< 0) && ( k== 11 log I I I I costt[k][(int)(jj/4)] >= 0 ) ){ if( flagl == 0 ) { itemp = 0; for( i2 = 0; i2 < 24; i2++ ){ if( bits_to input == 0 ) { buffer_Tnput = getc( fp_in ) ; bits_to_input = 8; } itemp «= 1; if( buffer_input & 1 ) itemp += 1; buffer_input >>= 1; bits_to_input -= l; } temp_2d[0] [0] = itemp; init_v[0] [0] = itemp/nn4; } bits_to_matrix2D( temp_2d, init__v, fcflagl, fp_in, code, length, (step_size/sz_factor) , nn4, trunc, &buffer_input, &bits_to_input, treeh ) ; two_d_iwt( temp_2d, nn2, nn2, trunc, trunc, temp_2d ) ; ii3 = i*nn + seq_to_2d[jj] [0]*nn2; jj3 = j*nn + seq_to_2d[jj] [l]*nn2; for( al = 0; al < nn2; al++ ) for( a2 = 0; a2 < nn2; a2++ ) frame[ii3+al] [jj3+a2] = temp_2d[al] [a2] ; } } ii /= 4; nn4 *= 4; nn2 ♦= 2; sz_factor *= 2.0; if( step_size/sz_factor < 1.0 ) sz_factor = step_size; } } - 58 - } for( i = 0; i < nn; i++ ) free( temp_2d[i] ); free( temp_2d) ; for( k = 0; k < ll_log; ++k ) free( costt[k] ); free( costt ) ; /*qtwt_quan_enco2D.c: subroutine to perform quantization and variable length encoding; for Nt = 2; include "output_bits.c" Copyright by Xiaonong Ran */ /include "output_index2D.c" void qtwt_quan_enco2D( step_size,row,column,nn,mm,trunc,costt,wtt,fp_out ) int row, column; /* frame sizes */ int mm, nn; /* mm (nn) : the size of the smallest leaf (root) block. mm must be larger than size of truncated transform blocks^/ int trunc; /♦ trunc: the size of truncated transform blocks. ♦/ float step_size; /♦ quantization step size. ♦/ float ♦ ♦♦♦costt; /♦ tree of merging-cost: index 1,2: root-blocks; index 3: levels of quad-trees, bottom-up; index 4: nodes ♦/ ffllooaatt ♦♦♦♦♦♦♦♦♦♦wtt; /* tree of Walsh transform coefficients index 1,2: root-blocks; index 3: levels of quad-trees, bottom-up; index 4: nodes index 5,6: coefficient block */ FILE ♦fp^ut; { short ♦length, ♦code; int buffer_output, bits_to_out, ♦♦indexx; float nn4, ♦ ♦ init_v; /♦initial value of DPCM of (0, 0)th coef. ; may extended to other coef.s ♦ / int i, j, k, r_nn, c_nn, 11, 12, ll_log, ii, jj, itemp, flagl; int al, a2, kk, fO, i6, j6, k6, il, i7; double temp, sz_factor; /♦sz_factor: step size - 59 - factor. ♦ / float bits_tree, leaf_num, quan_freq[514] , entropy; FILE ♦ fp_fq_out, ♦fopen(); /**** initiate counter and memory for computing entropy, etc. ♦♦♦♦♦♦♦♦♦♦♦/ bits_tree = 0; leaf_num = 0; for( i = 0; i < 514; i++ ) quan_freq[i] = 0; /*♦***♦**♦♦♦*♦**♦♦♦*♦♦*♦♦********************************* ***************/ /********* initiate output buffer and counter ***************************/ buffer_output = 0; bits_to_out = 8; /********************************************************* ***************/ /********* codes and lengths for trunc=2 ********************************/ if( (code = (short ♦) calloc( 18, sizeof(short) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (length = (short ♦) calloc( 18, sizeof(short) ))==NULL ){ fprintf( stderr, "wc: no more memor \n" ) ; exit( 0 ) ; } code(0]=l length[0]=2;/* EOB*/ code[1]=0 length[l]=3;/*0*/ code[2]=l length[2]=1; /*+-!*/ code[3]=2 length[3]=4;/* +-2*/ code[4]=7 length[4]=5;/*+-3*/ code[5]=24; length[5]=7;/*+-4*/ code[6]=50; length[6]=8;/*+-5*/ code[7]=26; length[7]=7;/*+-6,+-7 llx */ code[8]=54; length[8]=8;/*+-8,+-9 100x*/ code[9]=103; length[9]=9;/* +-10,+-11 lOlx */ code[10]=55; length[10]=8;/* +-12 ... +-15 llxx */ code[ll]=204; length[ll]=10;/* +-16 ... +-19 lOOxx */ code[12]=411; length[12]=11;/* +-20 ... +-23 lOlxx */ code[13]=821; length[13]=12;/* +-24 ... +-27 110XX */ code[14]=3282; length[14]=14;/* +-28 ... +-31 lllxx */ - 60 - code[15]=1640; length[15]=13;/* +-32 ... +-63 lxxxxx */ code[16]=6567; length[16]=15;/* +-64 ... +-127 lxxxxxx */ code[17]=6566; length[17]=15;/* +-128 ... +-255 lxxxxxxx */ /********************************************************* ***************/ /********* array memory for matrix of code-index ************************/ if( (indexx = (int **) calloc( trunc, sizeof(int *)))==NULL ) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < trunc; i++ ){ if( (indexxfi] = (int *) calloc( trunc, sizeof(int) ) )==NULL) { fprintf( stderr, "wc: no more memor \n" ); exit( 0 ) ; } } /********************************************************* ***************/ /♦♦♦♦♦♦♦♦♦♦♦♦♦♦♦♦♦♦ some size—parameters *********************************/ r_nn = row / nn; c_nn = column / nn; 11 = nn/mm; 12 = 11*11; /*number of possible leaf nodes and the size of tran_v*/ ll_log = (int) ( log2 ( (double) 11) + 0.5 ); /* number of stages after root for the quadtree.*/ /********************************************************* *****************/ for( i = 0; i < r_nn; ++i ){ for( j = 0; j < c_nn; ++j ){ ii = l; for( k = ll_log-l; k >-l; k— ){ /* output quadtree structure */ for( jj = 0; jj < ii; ++jj ) { if( k== ll_log-l && costtfi] [j] [k] [jj] < 0 ){ output_bits(fp_out,&buffer_output,&bits_to_out,0, 1) ; bits_tree += 1; } else if( costt[i] [j ] [k] [jj ] >= 0 ){ - 61 - output_bits(fp_out,&buffer_output, &bits_to_out, 1,1) ; bits_tree += 1; } else if( costt[i] [j] [k] [jj] < 0 && costt[i][j][k+l][(int)(jj/4)]>=0 ){ output_bits(fp_out,&buffer_output,&bits_to_out, 0,1); bits_tree += 1; } } ii *= 4; } /* end of outputing quadtree ♦/ ii = 12; /♦ quantizing of WT coefficients */ nn4 = mm*mm; sz_factor = 1.0; for( k = 0; k <= 11 log; ++k ){ for( jj = 0; jj < Ii; ++jj ){ if( (k == 0 || costt[i][j][k-l][jj]< 0) && ( k== ll_log j I costt[i][j][k][(int)(jj/4)] >= 0 ) ){ for( al = 0; al < trunc; al++ ){ for( a2 = 0; a2 < trunc; a2++ ) if( step_size > 0 ){ temp = (wtt[i][j][k][jj][al][a2]/nn4+ (step_size/sz_factor) /2.0) / (step_size/sz_factor) ; if( temp >= 0 ) kk = (int) (temp) ; else kk = -(int) (-temp) -1; indexxfal] fa2] = kk; quan_freq[indexx[al] [a2]+256] += 1; } else printf("1 ! 1 step_size==0 ! ! !\n") ; } /**************** zigzag scaning and encoding ♦♦♦♦♦♦♦♦♦♦♦♦♦♦/ k6 = 0; i6 = 0; j6 = 0; fO = 0; if( indexx[i6] [j6] == 0 ) fO = 1; else output_index2D( indexxfi6] [j6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; while( i6 != trunc-l |j j6 != trunc-1 ){ if( i6 == 0 ) { j6++; k6++; if( indexxfiδ] [j6] == 0 ) fO += 1; else { if( fO == 1 ){ fO = 0; - 62 - output_bits(fp_out,&buffer_output,&bits_to_out, code[l],length[l]) ; } else if( fO > 1 ) { for( i7=0; i7<f0; i7++ ) output_bits(fp_out,&buffer_output ,&bits_to_out, code[1] ,length[1] ) ; fO = 0; } output_index2D( index [i6] [j6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; } for( il = J6-1; il > -1; il— ){ J6—; i6++; k6++; if( indexx[i6] [j6] == 0 ) fO += i; else { if( fO == 1 ){ fO = 0; output_bits(fp_out,&buffer_output,&bits_to_out, code[1],length[1] ) ; } else if( f0 > 1 ) { for( i7=0; i7<f0; i7++ ) output_bits(fp_out,&buffer_output,&bits_to_ou , code[1] ,length[1] ) ; fO = 0; } output_index2D( indexx[i6] [j6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; } } } else if( j6 == 0 && i6 < trunc-1 ) { i6++; k6++; if( indexx[i6] [j6] == 0 ) fO += 1; else { if( fO == 1 ){ fO = 0; output_bits (fp_out,&buffer_output,&bits_to_out, code[1] ,length[1] ) ; } else if( f0 > 1 ) { for( i7=0; i7<f0; i7++ ) output_bits(fp_out,&buffer_output,&bits_to_out. - 63 - output_bits (fp_out,&buffer_output,&bits_to_out , code[l],length[l]) ; } else if( fO > 1 ){ for( i7=0; i7<f0; i7++ ) output_bits (fp_out,&buffer_output,&bits_to_out, output_bits(fp_out,&buffer_output,&bits_to_out, codefl] ,length[l]) ; } else if( f0 > 1 ) { for( i7=0; i7<fθ; i7++ ) output_bits(fp_out, &buffer_output,&bits_to_out, code[l] ,length[1] ) ; fO = 0; } output_index2D( indexx[i6] [j6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; } for( il = J6+1; il < trunc; il++ ){ - 64 - i6—; J6++; k6++; if( indexxfiδ] [j6] == 0 ) fo += i; else { if( f0 == 1 ) { fO = 0; output_bits(f _out,&buffer_output,&bitε_to_out, codefl] ,length[1]) ; } else if( fO > 1 ){ for( i7=0; i7<f0; i7++ ) output_bits(fp_out,&buffer_output,&bits_to_out, codefl] ,length[l]) ; fO = 0; } output_index2D( indexxfi6] fj6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; } } } else if( j6 == trunc-1 ){ i6++; k6++; if( indexxfiβ] fj6] == 0 ) fO += 1; else { if( f0 == 1 ) { fO = 0; output_bits(fp_out,&buffer_output,&bits_to_out, codefl] ,length[l]) ; } else if( f0 > 1 ) { for( i7=0; i7<fθ; i7++ ) output_bits(fp_out, &buffer_output, &bits_to_out, codef1] ,length[1]) ; fO = 0; } output_index2D( indexx[i6] fj6] , fp_out, code, length, &buffer__output, &bits_to_out ) ; } for( il = i6+l; il < trunc; il++ ){ i6++; j6—; k6++; if( index [i6] fj6] == 0 ) fO += i; else { if( fO == 1 ) { fO = 0; output_bits(fp_out,&buffer_output, &bits_to_out, - 65 - codefl] ,lengthf1]) ; } else if( f0 > 1 ) { for( i7=0; i7<f0; i7++ ) output_bits(fp_out,&buffer_output,&bits_to_out, codefl] ,length[l]) ; fO = 0; } output_index2D( indexx(i6] [j6] , fp_out, code, length, &buffer_output, &bits_to_out ) ; } } } } if( fO > 0 && trunc > 1 ){ output_bits(fp_out,&buffer__output, &bits_to_out, codef0] ,length[0]) ; quan_freqf0+256] -= fO; /♦ substract the counts for 0's in EOBs ♦/ quan_freqf0] += 1; } ********** end of zigzag scaning and encoding ***************/ } } ii /= 4; nn4 *= 4; sz_factor ♦= 2.0; if( step_size/sz_factor < 1.0 ) sz_factor = step_size; } } } if( bits_to_out < 8 ){ buffer_output >>= bits_to_out; i = buffer_output; /♦Output the last byte, * / putc(i,fp_out) ; } for( i = 0; i < 514; i++ ) leaf_num += quan_freqfi] ; entropy = 0.0; for( i = 0; i < 514; i++ ){ if( quan_freqfi] > 0 ){ quan_freqfi] /= leaf_num; entropy -= quan_freqfi]^log2 ( (double)quan_freq(i]) ; - 66 - } } printf("entropy bytes= %f\n", (entropy^leaf_num+bits_tree) /8.0 ) ; for( i = 0; i < trunc; i++ ) free( indexx[i] ) ; free(indexx) ; free( code ) ; free( length ) ; /♦two_d_wt.c: subroutine to perform complete fast recursive 2-D Walsh Transform. Copyright by Xiaonong Ran ♦/ void two_d_wt( data_in, row_size, col_size, trunc_r, trunc_c, trans_out ) float ♦♦data_in; /♦ 2-D data array in.*/ int row_size, col_size; /* row ≠ and column # of the 2-D data array.*/ int trunc_r, trunc_c; /* row / and column # of trans. coeff. to be computed.♦/ float ♦♦transput; /♦ 2-D transform coefficient array out.^/ { float ♦temp; int i, j; if( row_size == 1 && col_size == 1 ) { trans_out[0] [0] = data_inf0] f0] ; return; } if( (temp = (float ♦) calloc( col_size, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < row_size; i++ ){ for( j = 0; j < col_size; j++ ) tempfj] = data_infi] fj ] ; one_d_wt( temp, col_size, trunc_c, temp ); for( j = 0; j < trunc_c; j++ ) data_infi] [j] = tempfj] ; } free( temp ) ; - 67 - if( (temp = (float ♦) calloc( row_size, sizeof(float)) )==NULL ){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < trunc_c; i++ ){ for( j = 0; j < row_size; j++ ) tempfj] = data_in[j] [i] ; one_d_wt( temp, row_size, trunc_r, temp ); for( j = 0; j < trunc_r; j++ ) trans_outfj] fi] = temp[j] ; } free( temp ) ; /♦two_d_wt.c: subroutine to perform complete fast recursive 2-D Walsh Transform. Copyright by Xiaonong Ran ♦/ void two_d_wt( data_in, row_size, col_size, trunc_r, trunc_c, trans_out ) float ♦*data_in; /* 2-D data array in.*/ int row_size, col_size; /* row ≠ and column # of the 2-D data array.*/ int trunc_r, trunc_c; /* row / and column # of trans. coeff. to be computed.*/ float **trans_out; /* 2-D transform coefficient array out.*/ { float *temp; int i, j ; if ( row_size == 1 && col_size == 1 ) { trans_out f 0 ] [ 0 ] = data_in [ 0 ] f 0 ] ; return ; } if( (temp = (float *) calloc( col_size, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < row_size; i++ ){ for( j = 0; j < col_size; j++ ) tempfj] = data_infi] [j] ; one_d_wt( temp, col_size, trunc_c, temp ); for( j = 0; j < trunc_c; j++ ) data_in[i] [j ] = - 68 - tempfj] ; } free( temp ) ; if ( (temp = (float *) calloc( row_size, sizeof(float) ))==NULL ){ fprintf ( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < trunc_c; i++ ) { for( j = 0; j < row_size; j++ ) tempfj] = data_infj] [i] ; one_d wt( temp, row_size, trunc_r, temp ); for( 3 " = 0; j < trunc_r; j++ ) trans_outfj ] fi] = temp[j ] ; } free( temp ) ; /*two_d_wt_rc.c: subroutine to perform single step fast 2-D RECURSIVE Walsh Transform. Copyright by Xiaonong Ran */ void two_d_wt_rc_li( data_inl_l, data_inl_2, data_in2_l, data_in2_2, row_size, col_size, trunc_r, trunc_c, trans_out ) float **data_inl_l, **data_inl_2, **data_in2_l, **data_in2_2; /♦ Four 2-D data sub-arrays in.*/ int row_size, col_size; /♦ row # and column # of the 2-D data array.♦/ int trunc_r, trunc_c; /♦ row / and column # of trans. coeff. to be computed. ♦/ float ♦♦trans_out; /♦ 2-D transform coefficient array out.*/ { float ♦tempi, ♦temp2 , *temp_out, ♦♦temp_outl, **temp_out2; int i, j, trunc_r0, trunc_c0; trunc_r0 = (trunc_r-l) /2+1; trunc_c0 = (trunc_c-l) /2+1; if( trunc_r == 0 ) trunc_r0 = 0; if( trunc c == 0 ) trunc cO = 0; - 69 - if( (tempi = (float *) calloc( trunc_cO, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (temp2 = (float *) calloc( trunc_cθ, sizeof(float) ) )==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (temp_outl = (float **) calloc( trunc_r0, sizeof(float *)))=NULL ){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < trunc_r0; i++ ) < if( (temp_outlfi]=(float *)calloc( trunc_c, sizeof(float) ) )==NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; for( i = 0; i < trunc_r0; i++ ){ for( j = 0; j < trunc_c0; j++ ) { te plfj] = data_inl_l[i] [j] ; temp2[j] = data_inl_2 [i] [j] ; } one_d_wt_rc( tempi, temp2, col_size, trunc_c, temp_outl[i] ) ; for( j = 0; j < trunc_c0; j++ ) { tempi[j] = data_in2_l[i] fj] ; temp2[ j = data_in2_2fi] [j] ; } one_d_wt_rc( tempi, temp2, col_size, trunc_c, temp_out2 [i] ) ; } free( tempi ) ; free( temp2 ) ; - 70 - if( (tempi = (float *) calloc( trunc_rO, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (temp2 = (float ♦) calloc( trunc_rθ, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } if( (temp_out = (float ♦) calloc( trunc_r, sizeof(float) ))==NULL ){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < trunc_c; i++ ){ for( j = 0; j < trunc_r0; j++ ) { te plfj] = temp_outl[j ] [i] ; temp2[j] = temp_out2[j] [i] ; } one_d_wt_rc( tempi, temp2, row_size, trunc_r, temp_out ) ; for( j = 0; j < trunc_r; j++ ) trans_out[j] [i] = temp_outfj]; } free( tempi ) ; free( temp2 ) ; free( temp_out ) ; for( i = 0; i < trunc_r0; i++ ) free( temp_outl[i] ); free( temp_outl ) ; for( i = 0; i < trunc_r0; i++ ) free( temp_out2[i] ); free( temp_out2 ) ; } void two_d_wt_rc( data_in, row_size, col_size, trunc_r, trunc_c, trans_out ) float ♦*data_in; /* 2-D data array in.*/ int row_size, col_size; /* row # and column # of the 2-D data array.♦/ int trunc_r, trunc_c; /♦ row / and column # of trans. coeff. to be computed. ♦/ float ♦*trans_out; /* 2-D transform coefficient array out.*/ { int row_size0, col_size0, trunc_r0, trunc_c0; float **datal_l, **datal_2 , **data2_l, **data2_2; int i, j; row_size0 = row_size/2; col sizeO = col size/2; - 71 - trunc_rO = (trunc_r-l) /2+1; trunc_cO = (trunc_c-l) /2+1; if( trunc_r == 0 ) trunc_rO = 0; if( trunc_c == 0 ) trunc_c0 = 0; if( row_size >= 2 && col_εize >= 2 ) { if((datal_l = (float **)calloc( row_sizeθ, sizeof(float *)))==NULL){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < row_size0; i++ ){ if( (datal_lfi]=(float *)calloc(col_size0,sizeof(float) ) )=NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ); } } if((datal_2 = (float **)calloc( row_size0, sizeof(float *)))==NULL){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < row_size0; i++ ){ if( (datal_2[i]=(float *)calloc(col_size0,sizeof(float) ) )==NULL) { fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; > } if((data2_l = (float **)calloc( row_size0, sizeof(float *)))=NULL){ fprintf( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } for( i = 0; i < row_size0; i++ ){ if((data2_l[i]=(float *)calloc(col_size0,sizeof(float) ) )==NULL) { fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } } if((data2_2 = (float ♦ ♦ )calloc( row_size0, sizeof(float *)))==NULL){ fprintf( stderr, "wc: no more memory\n" ); exit( 0 ) ; } for( i = 0; i < row_sizeθ; i++ ){ if( (data2_2 fi]=(float *)calloc(col_sizeO,sizeof(float) ) )==NULL) { fprintf ( stderr, "wc: no more memory\n" ) ; exit( 0 ) ; } - 72 - i++ ) ; j++ ){ i] [j] ; i] [j+col_size0] ; i+row_size0] fj] ; two_d_wt_rc(datal_l,row_sizeθ,col_size0,trunc_rO,trunc_cθ , datal_l) ; two_d_wt_rc(datal_2,row_size0,col_size0,trunc_r0,trunc_cθ, datal_2) ; two_d_wt_rc(data2_l,row_sizeθ,col_size0,trunc_r0,trunc_c0, data2_l) ; two_d_wt_rc(data2_2,row_sizeθ,col_size0,trunc_rO,trunc_c0, data2_2) ; two_d_wt_rc_li( datal_l, datal_2, data2_l, data2_2, row_size, col_size, trunc_r, trunc_c, trans_out ) ; } else return; }

Claims: - 73 - We claim: 1. A video coder comprising: a first frame buffer for holding a first pixel map describing a first video image; a second frame buffer for holding a second pixel map describing a second video image; means for generating a difference map representing the difference between the first and the second video image; means for creating a quadtree code with embedded Walsh transform coefficients; means for quantizing the Walsh transform coefficients embedded in the quadtree code; and means for variable length coding the quantized Walsh transform coefficients. 2. The video coder of claim 1, wherein the means for generating a difference map comprises: a motion estimation block which determines an average shift between values in the first pixel map and values in the second pixel map; and means for subtracting the first pixel map from the first pixel map, wherein the first pixel map and the second pixel are shifted relative to each other by an amount determine by the motion estimation block.

Inventors: RAN XIAONONG, VAN SCHERRENBURG MICHAEL, RAN, XIAONONG, VAN SCHERRENBURG, MICHAEL
Applicants: NAT SEMICONDUCTOR CORP, NATIONAL SEMICONDUCTOR CORPORATION
Application year: 1994
Main classification: H04N7
IPC codes: G06T1, G06T9, G09G5, H03M7, H04N1, H04N7, H04N11