Jia Qian, Xiao Jin-Sheng, Yi Ben-Shun, Gan Liang-Cai. A Multi-stage Motion Estimation Algorithm Based on 3-D Recursive Search for Frame Rate up Conversion[J]. Journal of Electronics & Information Technology, 2012, 34(10): 2336-2341. doi: 10.3724/SP.J.1146.2012.00507
Citation:
Jia Qian, Xiao Jin-Sheng, Yi Ben-Shun, Gan Liang-Cai. A Multi-stage Motion Estimation Algorithm Based on 3-D Recursive Search for Frame Rate up Conversion[J]. Journal of Electronics & Information Technology, 2012, 34(10): 2336-2341. doi: 10.3724/SP.J.1146.2012.00507
Jia Qian, Xiao Jin-Sheng, Yi Ben-Shun, Gan Liang-Cai. A Multi-stage Motion Estimation Algorithm Based on 3-D Recursive Search for Frame Rate up Conversion[J]. Journal of Electronics & Information Technology, 2012, 34(10): 2336-2341. doi: 10.3724/SP.J.1146.2012.00507
Citation:
Jia Qian, Xiao Jin-Sheng, Yi Ben-Shun, Gan Liang-Cai. A Multi-stage Motion Estimation Algorithm Based on 3-D Recursive Search for Frame Rate up Conversion[J]. Journal of Electronics & Information Technology, 2012, 34(10): 2336-2341. doi: 10.3724/SP.J.1146.2012.00507
Motion-Compensated Frame Interpolation (MCFI) is a primary method for frame rate up conversion. A multi-stage block-matching motion estimation algorithm based on 3-D Recursive Search (3-D RS) is proposed in this paper to decrease the block artifact in the interpolated frame and to reduce the computational complexity for real-time high-definition video applications. In the proposed algorithm, combining 3-D RS with the bi-directional motion estimation, three-stage motion estimation for successive frames of the video sequence is firstly implemented step by step, and then the motion vector field is smoothened by using a simplified median filter. After that, the interpolated frame is produced via linear interpolation compensation. Compared with the existing algorithms of MCFI, the experimental results show that both objective and visual quality of the interpolated frame produced by the proposed algorithm is improved. It is feasible as well since its low complexity.