ADMVR Merge Candidate Reordering for Video Coding Efficiency

The patent applies preliminary action by reordering ADMVR merge candidates before they are used in the coding process. The candidates are sorted based on their costs (DMVR cost and/or ADMVR cost) in advance, so that when the coding process executes, the most promising candidates are already positioned for optimal evaluation, improving coding efficiency without adding complex runtime decision logic

The patent changes the parameter of candidate ordering from conventional spatial or temporal sequencing to cost-based sequencing. By evaluating and reordering candidates according to their DMVR and ADMVR costs, the system transforms the candidate list into an optimally ordered sequence that prioritizes candidates with lower costs, thereby improving coding efficiency through parameter optimization

The patent changes the ordering parameter of ADMVR merge candidates from conventional sequencing to cost-based sequencing. By calculating and comparing DMVR costs and/or ADMVR costs of different candidates, the system reorders them to prioritize lower-cost options, improving coding effectiveness while the computational overhead is managed through efficient cost calculation algorithms

The patent substitutes brute-force evaluation of all candidates in conventional order with a cost-based filtering and reordering mechanism. Instead of mechanically processing candidates in fixed spatial or temporal sequences, the system uses cost metrics to intelligently prioritize candidates, replacing mechanical processing with optimized computational selection