We propose to demonstrate a fine-grained partitioning framework that reorganizes the data tuples into small blocks at data loading time. The goal is to enable queries to maximally skip scanning data blocks. The partition framework consists of four steps: (1) workload analysis, which extracts features from a query workload, (2) augmentation, which augments each data tuple with a feature vector, ...

Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of regions and region-specific models. This paper proposes novel convex region-specific linear models, which we refer to as partition-wise linear models. Our key id...

Image compression is achieved by removing data redundancy while preserving information content. SPIHT is computationally very fast and among the best image compression algorithms known today. According to statistic analysis of the output binary stream of SPIHT encoding, propose a simple and effective method combined with Entropy for further compression that saves a lot of bits in the image data...

A new embedded lossless wavelet-based image coding algorithm called Successive Partition Zero Coder (SPZC) which use both horizontal and vertical bit scanning is proposed. Experimental results show that SPZC outperforms other state-of-the-art coders such as LJEG, SPIHT and CREW etc. in term of coding efficiency by successive partition the wavelet coefficients in the space-frequency domain and n...

A video transmission system is presented based on the 3-D SPIHT algorithm for video compression and turbo codes for channel error protection. The channel considered is a binary symmetric channel with packet erasures, used for modeling the concatenation of a congested wired link followed by a noisy wireless hop. Unequal error protection with turbo codes is used for providing strong channel prote...

A vector enhancement of Said and Pearlman’s Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image compression. A major advantage of vector based embedded coding with fixed length VQs over scalar embedded coding, is its superior robustness to noise. In this work we show that vector set partitioning can effectively alter th...

The concepts of symbolic dynamics and data set partitioning have been used for feature extraction and anomaly detection in time series data. Although modeling of state machines from symbol sequences has been widely reported, similar efforts have not been expended to investigate partitioning of time series data to optimally generate symbol sequences for anomaly detection. This paper addresses th...

We present a preliminary investigation of compression of segmented 3D seismic volumes for the rendering purposes. Promising results are obtained on the base of 3D discrete cosine transforms followed by the SPIHT coding scheme. An accelerated version of the algorithm combines 1D discrete cosine transform in vertical direction with the 2D wavelet transform of horizontal slices. In this case the S...

This paper presents an efficient switching method among non-scalable bit-streams in a multirate-based video streaming system. This method not only takes advantage of the high coding efficiency of non-scalable coding schemes (compared with scalable ones), but also allows a high flexibility in streaming services to accommodate the heterogeneity of real-world networks. One unique feature of our me...

The impact of using different lossy compression algorithms on the matching accuracy of iris recognition systems is investigated relating rate-distortion performance to the matching scores obtained by a concrete recognition system. JPEG2000 and SPIHT are found to be well suited for the compression task, followed by PRVQ, JPEG, and finally FRAC. Overall, applying compression algorithms is found t...