Lossless wavelet-based compression of digital elevation maps for fast and efficient search and retrieval

We consider here the implementation of efficient search and retrieval of digital elevation maps (DEMs), in particular the ability to conduct elevation searches without decompressing the entire map. We utilize set partitioning in hierarchical trees (SPIHT) for the compression, and compare two wavelet-based search and retrieval systems: one utilizing nonlinear max- and min-lifted integer wavelets and the other using the standard 5/3 integer wavelet. While the coarse-scale maxima/minima preservation inherent in the max- and min-lifted wavelets may seem ideal for the implementation of efficient elevation searches, the interscale propagation of maxima/minima and the bit-plane layering of the SPIHT coder adversely affect the efficiency of such searches. The use of the standard 5/3 integer wavelet requires the addition of separate maxima and minima information but does not have the complication of coefficient propagation, providing more satisfactory results. Elevation search bitrates are presented for both systems and compared to results obtained using the Kakadu implementation of the JPEG2000 standard.