PubMed Health⌕ Search

Biomedical subjects

Wan-Chi Siu

Publications and source records attributed to Wan-Chi Siu.

3 recordsLinked to original sources

DCT-based video downscaling transcoder using split and merge technique.

For a conventional downscaling video transcoder, a video server has firstly to decompress the video, perform downscaling operations in the pixel domain, and then recompress it. This is computationally intensive. However, it is difficult to perform video downscaling in the discrete cosine transform (DCT)- domain since the prediction errors of each frame are computed from its immediate past higher resolution frames. Recently, a fast algorithm for DCT domain image downsampling has been proposed to obtain the downsampled version of DCT coefficients with low computational complexity. However, there is a mismatch between the downsampled version of DCT coefficients and the resampled motion vectors. In other words, significant quality degradation is introduced when the derivation of the original motion vectors and the resampled motion vector is large. In this paper, we propose a new architecture to obtain resampled DCT coefficients in the DCT domain by using the split and merge technique. Using our proposed video transcoder architecture, a macroblock is splitted into two regions: dominant region and the boundary region. The dominant region of the macroblock can be transcoded in the DCT domain with low computational complexity and re-encoding error can be avoided. By transcoding the boundary region adaptively, low computational complexity can also be achieved. More importantly, the re-encoding error introduced in the boundary region can be controlled more dynamically. Experimental results show that our proposed video downscaling transcoder can lead to significant computational savings as well as videos with high quality as compared with the conventional approach. The proposed video transcoder is useful for video servers that provide quality service in real-time for heterogeneous clients.

Algorithms↗

New adaptive partial distortion search using clustered pixel matching error characteristic.

In order to reduce the computation load, many conventional fast block-matching algorithms have been developed to reduce the set of possible searching points in the search window. All of these algorithms produce some quality degradation of a predicted image. Alternatively, another kind of fast block-matching algorithms which do not introduce any prediction error as compared with the full-search algorithm is to reduce the number of necessary matching evaluations for every searching point in the search window. The partial distortion search (PDS) is a well-known technique of the second kind of algorithms. In the literature, many researches tried to improve both lossy and lossless block-matching algorithms by making use of an assumption that pixels with larger gradient magnitudes have larger matching errors on average. Based on a simple analysis, it is found that, on average, pixel matching errors with similar magnitudes tend to appear in clusters for natural video sequences. By using this clustering characteristic, we propose an adaptive PDS algorithm which significantly improves the computation efficiency of the original PDS. This approach is much better than other algorithms which make use of the pixel gradients. Furthermore, the proposed algorithm is most suitable for motion estimation of both opaque and boundary macroblocks of an arbitrary-shaped object in MPEG-4 coding.

Algorithms↗

Generalized linear least squares algorithms for modeling glucose metabolism in the human brain with corrections for vascular effects.

The generalized linear least squares (GLLS) algorithm has been found useful in image-wide parameter estimation for the generation of parametric images with positron emission tomography (PET) as it is computationally efficient and statistically reliable. However, the original algorithm was designed for parameter estimation with non-uniformly sampled instantaneous measurements. When dynamic PET data are sampled with the optimal image sampling schedule (OISS) to reduce memory and storage space, only a few temporal image frames are recorded. As a result, the direct application of GLLS is no longer appropriate. In this paper, we extend the GLLS algorithm to a five parameter model for the study of human brain metabolism, which accounts for the effect of cerebral blood volume (CBV), using OISS sampled data, with as few as five temporal samples. The formulation for this new GLLS algorithm is developed, and its computational efficiency and statistical reliability are investigated and validated using computer simulations and clinical PET [18F]-2-fluoro-2-deoxy-D-glucose (FDG) data.

Algorithms↗