Compressed domain image retargeting in hierarchical wavelet trees

Abstract

This paper presents an efficient algorithm with content aware spatial scalability for effective displaying on various screens of different sizes. It combines the set partitioning in hierarchical trees (SPIHT) algorithm and the multiscale seam carving (MSC) algorithm in the compressed domain. As seams of insignificant wavelet trees can be discarded as early as possible, the burden of unnecessary computation and memory space is alleviated. Experimental results show that the proposed algorithm is preferable to other existing pixel‐domain algorithms.