Ligang Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ligang Lu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ashish Jagmohan
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
3 shared publications - Da-Ke He
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
3 shared publications - Jian Lou
Department of Electrical Engineering, University of Washington, Seattle, WA, USA
3 shared publications - Ming-Ting Sun
Department of Electrical Engineering, University of Washington, Seattle, WA, USA
3 shared publications Ashish Jagmohan
Department of Multimedia Technologies, IBM T. J. Watson Research Center, Yorktown Heights, NY
1 shared publicationDake He
Research In Motion, SlipStream, Waterloo, ON, Canada and Department of Multimedia Technologies, IBM T. J. Watson Research Center, Yorktown Heights, NY
1 shared publication
Latest Publications
- 7 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 19 (8) , 1178-1182
H.264 Deblocking Speedup
This letter tackles the problem of reducing the complexity of H.264 decoding. Since deblocking accounts for a significant percentage of H.264 decoding time, our focus is on the H.264 in-loop deblocking filter. Observing that branch operations are costly and that in the deblocking process there are events with significantly high probability of occurrence, we regroup and simplify the branch operations. We apply the idea of Huffman tree optimization to speed up the boundary strength derivation and the true-edge detection by taking advantage of the biased statistical distribution. Our analyses and experiments show that the proposed techniques can reduce the deblocking computation time typically by a factor of more than seven times, while maintaining the bit-exact output.
- 7 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 19 (8) , 1178-1182
H.264 Deblocking Speedup
This letter tackles the problem of reducing the complexity of H.264 decoding. Since deblocking accounts for a significant percentage of H.264 decoding time, our focus is on the H.264 in-loop deblocking filter. Observing that branch operations are costly and that in the deblocking process there are events with significantly high probability of occurrence, we regroup and simplify the branch operations. We apply the idea of Huffman tree optimization to speed up the boundary strength derivation and the true-edge detection by taking advantage of the biased statistical distribution. Our analyses and experiments show that the proposed techniques can reduce the deblocking computation time typically by a factor of more than seven times, while maintaining the bit-exact output.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19457871,p. 1918-1921
High Speed H.264 High Profile Deblocking using Statistical Analysis and Logic Optimization
In-loop deblocking filter is identified as the most time consuming part for H.264 high profile decoders. This paper proposes an improved platform and encoder independent deblocking scheme for H.264 high profile codec speedup. Two key techniques are introduced in the proposed algorithm: a statistical analysis based hybrid boundary strength derivation scheme and a more efficient logic expression for the B-slice boundary strength derivation. Compared to previously proposed algorithms, significant computation can be saved, while maintaining the bit-exact output. The proposed techniques can be used in both standard conforming encoders and decoders.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19457871,p. 1918-1921
High Speed H.264 High Profile Deblocking using Statistical Analysis and Logic Optimization
In-loop deblocking filter is identified as the most time consuming part for H.264 high profile decoders. This paper proposes an improved platform and encoder independent deblocking scheme for H.264 high profile codec speedup. Two key techniques are introduced in the proposed algorithm: a statistical analysis based hybrid boundary strength derivation scheme and a more efficient logic expression for the B-slice boundary strength derivation. Compared to previously proposed algorithms, significant computation can be saved, while maintaining the bit-exact output. The proposed techniques can be used in both standard conforming encoders and decoders.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 3143-3146
Statistical Analysis Based H.264 High Profile Deblocking Speedup
This paper proposes a novel scheme to achieve deblocking speedup for H.264 high profile decoders. The proposed approach is to use statistics dependent decoding which takes advantage of the biased statistical distribution in video streams. Specifically, in the proposed scheme, Huffman tree structures are introduced for boundary strength derivation, and hierarchical true edge detection is applied in the boundary filtering process to reduce the computation. As a result, significant computation can be saved in the deblocking process, while bit-exact output is maintained. This platform and encoder independent scheme can be incorporated into both standard conforming encoders and decoders. Since deblocking accounts for a significant percentage of decoding time, the scheme is especially important for decoder implementations. The analyses and experiments show that the proposed scheme could reduce the deblocking computational load by a factor of more than three times.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 3143-3146
Statistical Analysis Based H.264 High Profile Deblocking Speedup
This paper proposes a novel scheme to achieve deblocking speedup for H.264 high profile decoders. The proposed approach is to use statistics dependent decoding which takes advantage of the biased statistical distribution in video streams. Specifically, in the proposed scheme, Huffman tree structures are introduced for boundary strength derivation, and hierarchical true edge detection is applied in the boundary filtering process to reduce the computation. As a result, significant computation can be saved in the deblocking process, while bit-exact output is maintained. This platform and encoder independent scheme can be incorporated into both standard conforming encoders and decoders. Since deblocking accounts for a significant percentage of decoding time, the scheme is especially important for decoder implementations. The analyses and experiments show that the proposed scheme could reduce the deblocking computational load by a factor of more than three times.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, II - 13-II - 16
Side Information Generation for Distributed Video Coding
Side information (SI) generation is one of the key components of a Wyner-Ziv coder. In this paper we present a novel multi-frame SI generation approach which uses adaptive temporal filtering to estimate the pixel values for SI and motion vector filtering for refinement. For temporal filtering, we derive the optimal mean squared error temporal filter when the noise can be evaluated, and propose a similarity weighted temporal filter when the knowledge of the noise is not available. The temporal filter adapts on the quality of the motion estimation. The quality of SI generation is further improved by using motion vector filtering to reduce the noise effect from motion estimation. Experimental results indicate that the proposed SI generation approach yields good performance in terms of SI quality and conditional entropy.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, II - 13-II - 16
Side Information Generation for Distributed Video Coding
Side information (SI) generation is one of the key components of a Wyner-Ziv coder. In this paper we present a novel multi-frame SI generation approach which uses adaptive temporal filtering to estimate the pixel values for SI and motion vector filtering for refinement. For temporal filtering, we derive the optimal mean squared error temporal filter when the noise can be evaluated, and propose a similarity weighted temporal filter when the knowledge of the noise is not available. The temporal filter adapts on the quality of the motion estimation. The quality of SI generation is further improved by using motion vector filtering to reduce the noise effect from motion estimation. Experimental results indicate that the proposed SI generation approach yields good performance in terms of SI quality and conditional entropy.