IV. CONCLUSION IN THIS PAPER, WE PROPOSE A NEW FRAME RATE UP-CONVERSION METHOD WITH HIGH PERFORMANCE, LOW COMPUTATIONAL COMPLEXITY AND LOW MEMORY BANDWIDTH. THE PROPOSED FRUC METHOD PERFORMS UMES IN BOTH FORWARD AND BACKWARD DIRECTIONS USING THE PREDICTIVE SEARCH. TO AVOID OVERLAPS AND HOLES, THE OBTAINED UNILATERAL MVFS ARE PROJECTED TO THE INTERPOLATED FRAME INSTANT. THE BILATERAL MVFS ARE FURTHER CROSS-CHECKED, REFINED AND SMOOTHED THROUGH THE PROPOSED MULTISTAGE MV POST-PROCESSING OPERATIONS TO OBTAIN DENSER MVFS. IMPLICIT AND EXPLICIT SMOOTHNESS CONSTRAINTS ARE IMPOSED IN ME AND MV POST-PROCESSING SO THAT THE BLOCKING ARTIFACTS ARE PREVENTED. IN ORDER TO FURTHER REDUCE THE COMPUTATIONAL COMPLEXITY, WE REUSE THE TEMPORAL MVF IN ALTERNATING FORWARD AND BACKWARD DIRECTIONS AND ONLY PERFORM ONE-PASS ME. THE TILE BASED SCAN ORDER AND THE DESIGN OF PIPELINING NOT ONLY SAVE THE MEMORY BANDWIDTH FRUC REQUIRES BUT ALSO IMPROVE THE EFFI- CIENCY OF THE WHOLE SYSTEM WHICH CAN RUN IN PARALLEL WITHOUT ANY ITERATION.
OBJECTIVE AND SUBJECTIVE EVALUATIONS SHOW THAT THE PROPOSED METHOD OUTPERFORMS THE BENCHMARK METHODS. THE INTERPOLATED FRAMES OF THE PROPOSED METHOD GIVE HIGHER PSNR AND SSIM OVERALL AND BETTER VISUAL QUALITY WHICH IS FREE FROM BLOCKING ARTIFACTS. IN ADDITION, THE COMPUTATIONAL COMPLEXITY OF THE PROPOSED CCRM ACHIEVES COMPUTATION REDUCTION IN ME BY ALMOST 50%, WHICH RESULTS IN MUCH LOWER COMPUTATIONAL COMPLEXITY COMPARED TO THE BENCHMARK METHOD, WHEREAS IT SUFFERS FROM QUALITY DEGRADATION FOR ABRUPT MV CHANGES. FORMULATION ANALYSIS ALSO DEMONSTRATES THAT THE MEMORY SAVING STRATEGIES WORK EFFECTIVELY.