Stephen R. Tate. Band ordering in lossless compression of multispectral images. In Proc. of Data Compression Conference, Snowbird, Utah, pages 311--320, 1994. 2  Home/Search   Document Details and Download   Summary   Related Articles   Check

....file. Second, for large collections the quadratic time becomes unacceptable, particularly the cost of computing the appropriate weights of the edges of the directed graph. If we impose an upper bound on the length of the reference chains, then finding the optimum solution becomes NP Complete [43]. If we allow each file to be compressed using more than one reference file, then this problem can be reduced to a generalization of optimum branching to hypergraphs, and has been shown NP Complete even with no bound on the length of chains [2] Some experiments on small web page collections ....

S. Tate. Band ordering in lossless compression of multispectral images. IEEE Transactions on Computers, 46(45):211--320, 1997.

....over a communication link. Fast algorithms for the optimum branching problem are described in [4, 22] While we are not aware of previous work that uses optimum branchings to compress collections of files, there are two previous applications that are quite similar. In particular, Tate [23] uses optimum branchings to find an optimal scheme for compressing multispectral images, while Adler and Mitzenmacher [1] use it to compress the graph structure of the World Wide Web. Adler and Mitzenmacher [1] also show that a natural extension of the branching problem to hypergraphs that can be ....

S. Tate. Band ordering in lossless compression of multispectral images. IEEE Transactions on Computers, 46(45):211--320, 1997.

....over a communication link. Fast algorithms for the optimum branching problem are described in [4, 22] While we are not aware of previous work that uses optimum branchings to compress collections of files, there are two previous applications that are quite similar. In particular, Tate [23] uses optimum branchings to find an optimal scheme for compressing multispectral images, while Adler and Mitzenmacher [1] use it to compress the graph structure of the World Wide Web. Adler and Mitzenmacher [1] also show that a natural extension of the branching problem to hypergraphs that can be ....

S. Tate. Band ordering in lossless compression of multispectral images. IEEE Transactions on Computers, 46(45):211--320, 1997. 17

....by finding its minimum cost spanning tree. Plane 0 will be a node of the spanning tree, and we can always assume the tree to be rooted at 0. Any topological ordering of the spanning tree rooted at 0 is clearly compatible with a sequential encoding and decoding (a similar approach is proposed in [8] for multispectral images) Figure 3 depicts a cost matrix, a minimum spanning tree, and a compatible plane ordering for the LRGB PTM image trilobite.ptm . Transforms Inter plane prediction is based on a simple difference between the plane being predicted and a reference plane. In order to ....

S. Tate, "Band Ordering in Lossless Compression of Multispectral Images", IEEE Transactions on Computers, Vol. 46, No. 4, April 1997.

....on the same host [17] Our reference approach, in contrast, is designed for links between pages on distinct hosts, and thus is better suited to the simple Web models we examine here. Directed minimum spanning trees have been used previously in other scenarios to provide good compression. Tate [18] uses such trees to obtain a reordering of the bands of a multispectral image that allows for the optimal compression. More recently, a similar idea is alluded to in [6] in the context of compressing tables of data. There, the authors use one column to compress another, and mention that the ....

S. R. Tate. Band Ordering in Lossless Compression of Multispectral Images. IEEE Transactions on Computers, Vol. 46, No. 4, 1997, pp. 477-483.

....pixels in band 5 as well as those in bands 2, 4, and 6. Finally, bands 1, 3, and 7 are coded using pixels in the local neighborhood as well as selected pixels from bands 2, 4, 5, and 6. If we restrict the number of reference bands that can be used to predict pixels in any given band, then Tate [23] showed that the problem of computing an optimal ordering can be formulated in graph theoretic terms, admitting an O(N 2 ) solution for an N band image. He also observed that using a single reference band is su#cient in practice as compression performance does not improve significantly with ....

....and determine the optimal Rice Golomb code by an exhaustive search over the parameter set. In the second technique they compute the variance of prediction errors for each row and based on this utilize one of eight pre designed Hu#man codes. An example of the second approach is provided by Tate [23] who quantizes the prediction error in the corresponding location in the reference band and uses this as a conditioning state for arithmetic coding. Since this involves estimating the pmf in each conditioning state, only a small number of states (4 to 8) are used. An example of a hybrid approach ....

S. R. Tate. Band ordering in lossless compression of multispectral images. In Proceedings of the Data Compression Conference, pages 311--320. IEEE Computer Society, 1994.

....7 bands and the AVIRIS ( Airborne Visible Infrared Imaging Spectrometer ) have 224 bands. The measurements are done with 10, 8 and 12 bit resolution respectively. Spatial dimensions of the images are roughly 10 3 Theta 10 3 , which means that each image requires tens of megabytes of memory [1]. During 90 s the use of spectral imaging has increased also in many fields of industry. Wavelets have been successfully used to compress binary images [2] 3] gray scale images [4] 5] and standard RGB color images [6] 7] but for multispectral images other methods have been used. Some of ....

....use of spectral imaging has increased also in many fields of industry. Wavelets have been successfully used to compress binary images [2] 3] gray scale images [4] 5] and standard RGB color images [6] 7] but for multispectral images other methods have been used. Some of these are lossless [1], 8] 9] some near lossless [10] and many use lossy schemes [11] 12] 13] Highdimensional wavelets have been used to compress seismic data [14] This paper shows advantages of different wavelet compression methods for multispectral images and we develop a 3D wavelet to compress ....

S. R. Tate, Band Ordering in Lossless Compression of Multispectral Images, IEEE Transactions on Computers, 46(4), 1997, 477-483.

No context found.

Stephen R. Tate. Band ordering in lossless compression of multispectral images. In Proc. of Data Compression Conference, Snowbird, Utah, pages 311--320, 1994. 2

No context found.

S.R. Tate. #Band ordering in lossless compression of multispectral images". In Proceedings of Data Compression Conference, pp. 311#320, Snowbird, Utah, March 1994.

No context found.

S.R. Tate. "Band ordering in lossless compression of multispectral images". In Proceedings of Data Compression Conference, pp. 311--320, Snowbird, Utah, March 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC