Mei-Yin Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mei-Yin Shen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Chung-Chieh Jay Kuo
University of Southern California
4 shared publications C.-C. Jay Kuo
Univ. of Southern California, Los Angeles, CA
2 shared publications- Do-Kyoung Kwon
Department of Electrical Engineering and Integrated Media Systems Center, University of Southern California, Los Angeles, CA 90089-2564
2 shared publications Akio Yoneyama
1 shared publication- Chih-Hung Kuo
Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan
1 shared publication - Do-Kyoung Kwon
Texas Instruments, 12500 TI Blvd., Dallas, TX 75243
1 shared publication
Latest Publications
- 15 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 45 (1) , 61-67
Techniques for flexible image/video resolution conversion with heterogeneous terminals
Multimedia capturing and display devices of different resolutions and aspect ratios can be easily connected by networks and, thus, there is a great need to develop techniques that facilitate flexible image/video format conversion and content adaptation among these heterogeneous terminals. Quality degradation due to downsampling, up-sampling, coding/decoding, and some content adaptation mechanism (say, image mosaicking) in the transmission process is inevitable. It is desirable that multimedia contents can be easily captured, displayed, and seamlessly composed. Challenges and techniques to achieve this goal are reviewed first. Then, two specific topics, i.e., image/video mosaicking and super resolution (SR) conversion, are highlighted. As compared with previous work developed for these problems, the challenge under the current context is to strike a balance between low computational complexity and high quality of resultant image/video. Several new developments along this line are discussed
- 15 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 45 (1) , 61-67
Techniques for flexible image/video resolution conversion with heterogeneous terminals
Multimedia capturing and display devices of different resolutions and aspect ratios can be easily connected by networks and, thus, there is a great need to develop techniques that facilitate flexible image/video format conversion and content adaptation among these heterogeneous terminals. Quality degradation due to downsampling, up-sampling, coding/decoding, and some content adaptation mechanism (say, image mosaicking) in the transmission process is inevitable. It is desirable that multimedia contents can be easily captured, displayed, and seamlessly composed. Challenges and techniques to achieve this goal are reviewed first. Then, two specific topics, i.e., image/video mosaicking and super resolution (SR) conversion, are highlighted. As compared with previous work developed for these problems, the challenge under the current context is to strike a balance between low computational complexity and high quality of resultant image/video. Several new developments along this line are discussed
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2457-2460
Model-Based Frame-Layer Bit Allocation for Non-Conversational H.264 Video
The frame-layer bit allocation problem for non-conversational H.264 video rate control is studied in this work. For non-conversational applications, we first impose a GOP (group of pictures) structure on the underlying H.264 video. Then, under the assumption of frame's independence, a one-pass algorithm is developed using the Lagrange optimization framework and GOP-based rate modeling. Instead of estimating the R-D data of future frames to determine the Lagrange multiplier, we estimate the Lagrange multiplier directly from GOP rate models that specify the number of bits consumed in a GOP. It is shown by experimental results that the proposed bit allocation algorithm achieves higher picture quality than that used in the H.264 JM8.1a reference code.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2457-2460
Model-Based Frame-Layer Bit Allocation for Non-Conversational H.264 Video
The frame-layer bit allocation problem for non-conversational H.264 video rate control is studied in this work. For non-conversational applications, we first impose a GOP (group of pictures) structure on the underlying H.264 video. Then, under the assumption of frame's independence, a one-pass algorithm is developed using the Lagrange optimization framework and GOP-based rate modeling. Instead of estimating the R-D data of future frames to determine the Lagrange multiplier, we estimate the Lagrange multiplier directly from GOP rate models that specify the number of bits consumed in a GOP. It is shown by experimental results that the proposed bit allocation algorithm achieves higher picture quality than that used in the H.264 JM8.1a reference code.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 673-676
A Novel Two-Stage Rate Control Scheme for H.264
A new rate control algorithm for the H.264 encoder is developed in this work. There are several unique features in the proposed rate control scheme. First, a two-stage encoding mechanism is used to resolve the problem of inter-dependency between R-D optimization (RDO) and rate control (RC) in H.264. Second, it is emphasized that the bits of the header information may occupy a larger portion of the total bit budget especially when encoding at low bit rates in H.264. To address this issue, a rate model for the header information is established so as to estimate header bits more accurately. Third, a new source rate model is proposed to estimate the quantization parameter (QP) from the residual signal. Built upon the above ideas, a rate control algorithm is developed for the H.264 baseline-profile encoder under the constant-bit-rate (CBR) constraint. It is shown by experimental results that the proposed scheme can control bit rates accurately with the R-D performance better than that of the rate control algorithm implemented in H.264 JM8.1a
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 673-676
A Novel Two-Stage Rate Control Scheme for H.264
A new rate control algorithm for the H.264 encoder is developed in this work. There are several unique features in the proposed rate control scheme. First, a two-stage encoding mechanism is used to resolve the problem of inter-dependency between R-D optimization (RDO) and rate control (RC) in H.264. Second, it is emphasized that the bits of the header information may occupy a larger portion of the total bit budget especially when encoding at low bit rates in H.264. To address this issue, a rate model for the header information is established so as to estimate header bits more accurately. Third, a new source rate model is proposed to estimate the quantization parameter (QP) from the residual signal. Built upon the above ideas, a rate control algorithm is developed for the H.264 baseline-profile encoder under the constant-bit-rate (CBR) constraint. It is shown by experimental results that the proposed scheme can control bit rates accurately with the R-D performance better than that of the rate control algorithm implemented in H.264 JM8.1a
- 1 October 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A DCT-Domain Video Alignment Technique for MPEG Sequences
An image/video registration technique for multiple compressed video inputs such as MPEG sequences is investigated. The proposed technique is based on the matching of discrete cosine transform (DCT) coefficients and motion vectors. First, the I frame of each input sequence is separated into the background and moving objects. For the background, coarse edge features are extracted by applying edge detectors of different characteristics to the luminance DC coefficients. Each detector generates a difference map for a single background. A threshold is determined for each difference map to produce a binary map. Then, alignment parameters are determined using the binary maps of input images generated by the same detector. For the moving object, alignment parameters can be finetuned by the motion information of all frames in the same group of pictures (GOP). Finally, the actual displacement in the pixel domain is estimated by the weighted average of alignment parameters from all background detectors and refinement parameters from motion information. It is shown by experimental results that the proposed method reduces the computational cost of image/video registration significantly in comparison with the traditional pixel domain registration techniques while achieving certain quality of composition
- 1 October 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A DCT-Domain Video Alignment Technique for MPEG Sequences
An image/video registration technique for multiple compressed video inputs such as MPEG sequences is investigated. The proposed technique is based on the matching of discrete cosine transform (DCT) coefficients and motion vectors. First, the I frame of each input sequence is separated into the background and moving objects. For the background, coarse edge features are extracted by applying edge detectors of different characteristics to the luminance DC coefficients. Each detector generates a difference map for a single background. A threshold is determined for each difference map to produce a binary map. Then, alignment parameters are determined using the binary maps of input images generated by the same detector. For the moving object, alignment parameters can be finetuned by the motion information of all frames in the same group of pictures (GOP). Finally, the actual displacement in the pixel domain is estimated by the weighted average of alignment parameters from all background detectors and refinement parameters from motion information. It is shown by experimental results that the proposed method reduces the computational cost of image/video registration significantly in comparison with the traditional pixel domain registration techniques while achieving certain quality of composition
- 6 July 2005
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 17 (2) , 217-242
Fast motion search with efficient inter-prediction mode decision for H.264
- 6 July 2005
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 17 (2) , 217-242
Fast motion search with efficient inter-prediction mode decision for H.264
- 14 March 2005
- Published by SPIE-Intl Soc Optical Eng
- Vol. 5685, 702-713
An improved adaptive deblocking filter for MPEG video decoder
A highly adaptive de-blocking algorithm is proposed for MPEG video, which is improved in three ways compared to previous algorithms. First of all, the proposed algorithm is adaptive to quantization parameter (QP) change. Since blocking artifacts between two blocks encoded with different QPs tend to be more visible due to quality difference, filters should be able to dynamically adapt to QP change between blocks. Secondly, the proposed algorithm classifies block boundary into three different region modes based on local region characteristics. The three region modes include active, smooth and dormant region. By applying different filters of different smoothing strengths to each region mode, the proposed algorithm can minimize undesirable blur so that both subjective and objective qualities improve for various type of sequences at a wide range of bitrates. Finally, the proposed algorithm also provides threshold determination methods. Adaptive de-blocking algorithms require several thresholds for mode decision as well as filtering decision. Since quality of video sequences after filtering depends largely on them, each threshold should be determined carefully. In the proposed algorithm, thresholds are determined adaptively to strength of blocking artifact, therefore adaptively to various encoding parameters such as QP, absolute difference between QPs, and block coding type, which are closely related to strength of blocking artifact. The experimental results show the proposed algorithm can achieve 0.2-0.4 dB gain for I- and P-frames, and 0.1-0.3 dB gain for the B-frames when bitstreams are encoded by using the TM5 rate control algorithm.
- 14 March 2005
- Published by SPIE-Intl Soc Optical Eng
- Vol. 5685, 702-713
An improved adaptive deblocking filter for MPEG video decoder
A highly adaptive de-blocking algorithm is proposed for MPEG video, which is improved in three ways compared to previous algorithms. First of all, the proposed algorithm is adaptive to quantization parameter (QP) change. Since blocking artifacts between two blocks encoded with different QPs tend to be more visible due to quality difference, filters should be able to dynamically adapt to QP change between blocks. Secondly, the proposed algorithm classifies block boundary into three different region modes based on local region characteristics. The three region modes include active, smooth and dormant region. By applying different filters of different smoothing strengths to each region mode, the proposed algorithm can minimize undesirable blur so that both subjective and objective qualities improve for various type of sequences at a wide range of bitrates. Finally, the proposed algorithm also provides threshold determination methods. Adaptive de-blocking algorithms require several thresholds for mode decision as well as filtering decision. Since quality of video sequences after filtering depends largely on them, each threshold should be determined carefully. In the proposed algorithm, thresholds are determined adaptively to strength of blocking artifact, therefore adaptively to various encoding parameters such as QP, absolute difference between QPs, and block coding type, which are closely related to strength of blocking artifact. The experimental results show the proposed algorithm can achieve 0.2-0.4 dB gain for I- and P-frames, and 0.1-0.3 dB gain for the B-frames when bitstreams are encoded by using the TM5 rate control algorithm.