Adaptive Search Range Selection Algorithm Based on Block Complexity in Frame Rate Up-Conversion
Author(s) -
Kangjun Lee,
Jechang Jeong
Publication year - 2015
Publication title -
smart comput. rev.
Language(s) - English
DOI - 10.6029/smartcr.2015.03.005
A frame rate up-conversion algorithm based on block texture complexity is proposed. The motion estimation process for frame interpolation uses an adaptive search range selection algorithm that considers the block texture complexity. Since the information of texture complexity is extracted from the motion estimation prediction size of the original frame, additional computational complexity is not required. In the experimental results, the objective and subjective image quality of the interpolated frames is found to be improved, and the computational complexity is reduced, when compared to bilateral motion estimation with a full search.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom