BEAMLET CODER: A TREE-BASED, mERARCmCAL CONTOUR REPRESENTATION
Jihong Chen, Xiaoming Buo, Golam Sorwar, Manzur Murshed, Laurence S. Dooley · 2002
dependent thresholds. The performance of the MFS algorithm is analyzed and quantitativel y compared with both the traditional and exhaustive full-searc h (FS) technique, and the computationally faster, non-exhaustive three-step-searc h (TSS) algorithm. Experimental results show that by applying an appropriate threshold function, the MFS algorithm not only matches the speed of the TSS algorithm, but both retains a block distortion error compa rable to the global minimum produced by the FS algorithm, and avoids the problem of identifying large numbers of spurious motion vectors in the search process. A novel perceptual image coder of grey level images is presented. This coder is an improved version of the coder by Tan et al with better optimised parameters fea turing a local contrast sensitivity function, intra-frequenc y masking and inter-orientation masking functions for perceptual error modelling. The architecture of the proposed coder follows that of the state-of-the-art EBCOT by Taubman and adopted by the JPEG2000 standard as the core coding structure. The overall perceptual performance improvement of the proposed coder is noticeable compared with the EBCOT coder with the MSE and CVIS error measures.