Ming-Ting Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ming-Ting Sun has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Jian Lou
Department of Electrical Engineering, University of Washington, Seattle, WA, USA
3 shared publications - Ligang Lu
Department of Multimedia Technologies, IBM T.J. Watson Research Center, Yorktown, NY, USA
3 shared publications - Ashish Jagmohan
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
2 shared publications - Da-Ke He
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
2 shared publications Aaron Drake
T Mobile USA, Bellevue, WA USA
1 shared publicationAshish Jagmohan
Department of Multimedia Technologies, IBM T. J. Watson Research Center, Yorktown Heights, NY
1 shared publication
Latest Publications
- Open Access
- 22 September 2015
- Published by Emerald Publishing in APSIPA Transactions on Signal and Information Processing
- Vol. 4 (1)
Robust power line detection with particle-filter-based tracking in radar video
In this paper, we propose a tracking algorithm to detect power lines from millimeter-wave radar video. We propose a general framework of cascaded particle filters which can naturally capture the temporal correlation of the power line objects, and the power-line-specific feature is embedded into the conditional likelihood measurement process of the particle filter. Because of the fusion of multiple information sources, power line detection is more effective than the previous approach. Both the accuracy and the recall of power line detection are improved from around 68% to over 92%.
- 22 September 2015
- Published by Emerald Publishing in APSIPA Transactions on Signal and Information Processing
- Vol. 4 (1)
Open AccessRobust power line detection with particle-filter-based tracking in radar video
In this paper, we propose a tracking algorithm to detect power lines from millimeter-wave radar video. We propose a general framework of cascaded particle filters which can naturally capture the temporal correlation of the power line objects, and the power-line-specific feature is embedded into the conditional likelihood measurement process of the particle filter. Because of the fusion of multiple information sources, power line detection is more effective than the previous approach. Both the accuracy and the recall of power line detection are improved from around 68% to over 92%.
- 1 August 2015
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 31, 294-304
Adaptive intra-refresh for low-delay error-resilient video coding
- 1 August 2015
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 31, 294-304
Adaptive intra-refresh for low-delay error-resilient video coding
- 20 October 2010
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 22 (2) , 107-116
Rate-distortion optimized rate-allocation for motion-compensated predictive video codecs using PixelRank
- 20 October 2010
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 22 (2) , 107-116
Rate-distortion optimized rate-allocation for motion-compensated predictive video codecs using PixelRank
- 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 August 2006
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 17 (4) , 830-841
FGS enhancement layer truncation with reduced intra-frame quality variation
- 1 August 2006
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 17 (4) , 830-841
FGS enhancement layer truncation with reduced intra-frame quality variation
- 1 May 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (5) , 794-800
A network condition classification scheme for supporting video delivery over wireless Internet
Real-time video transport over wireless Internet faces many challenges due to the heterogeneous environment including wireline and wireless networks. A robust network condition classification algorithm using multiple end-to-end metrics and Support Vector Machine (SVM) is proposed to classify different network events and model the transition pattern of network conditions. End-to-end Quality-of-Service (QoS) mechanisms like congestion control, error control, and power control can benefit from the network condition information and react to different network situations appropriately. The proposed network condition classification algorithm uses SVM as a classifier to cluster different end-to-end metrics such as end-to-end delay, delay jitter, throughput and packet loss-rate for the UDP traffic with TCP-friendly Rate Control (TFRC), which is used for video transport. The algorithm is also flexible for classifying different numbers of states representing different levels of network events such as wireline congestion and wireless channel loss. Simulation results using network simulator 2 (ns2) showed the effectiveness of the proposed scheme.
- 1 May 2006
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (5) , 794-800
A network condition classification scheme for supporting video delivery over wireless Internet
Real-time video transport over wireless Internet faces many challenges due to the heterogeneous environment including wireline and wireless networks. A robust network condition classification algorithm using multiple end-to-end metrics and Support Vector Machine (SVM) is proposed to classify different network events and model the transition pattern of network conditions. End-to-end Quality-of-Service (QoS) mechanisms like congestion control, error control, and power control can benefit from the network condition information and react to different network situations appropriately. The proposed network condition classification algorithm uses SVM as a classifier to cluster different end-to-end metrics such as end-to-end delay, delay jitter, throughput and packet loss-rate for the UDP traffic with TCP-friendly Rate Control (TFRC), which is used for video transport. The algorithm is also flexible for classifying different numbers of states representing different levels of network events such as wireline congestion and wireless channel loss. Simulation results using network simulator 2 (ns2) showed the effectiveness of the proposed scheme.
- 20 April 2006
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 559-563
Modeling Evolutionary Behaviors for Community-based Dynamic Recommendation
- 20 April 2006
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 559-563
Modeling Evolutionary Behaviors for Community-based Dynamic Recommendation
- 1 December 2000
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 11 (4) , 385-403
Video Transcoding with H.263 Bit-Streams
- 1 December 2000
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 11 (4) , 385-403
Video Transcoding with H.263 Bit-Streams