Dept. of Electr. Eng., National Taiwan Univ.Huang, Y.W.Y.W.HuangCHIA-LIN LEEChen, C.Y.C.Y.ChenLIANG-GEE CHEN2018-09-102018-09-10200502714310https://www.scopus.com/inward/record.uri?eid=2-s2.0-33846315848&doi=10.1109%2fISCAS.2005.1465874&partnerID=40&md5=5c0e7715772e589c7a6d59641981db01http://scholars.lib.ntu.edu.tw/handle/123456789/313900A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant environment. Our new features are one-pass flow and adaptive search strategies. The prior scheme allocates more computation to the macroblock with the highest distortion in the entire frame step by step. This implies that random access of macroblocks is inevitable, and the search pattern must be determined in advance. The random access flow requires a huge size of memory for all macroblocks to store the up-to-date minimum distortions, best motion vectors, and searching steps. On the contrary, the one-pass flow can not only significantly reduce the memory size but also effectively use the context information of neighboring macroblocks to achieve faster convergence and better quality. Moreover, to improve video quality when computation resource is still sufficient, the search strategy is allowed to adaptively change from diamond search to three step search, and then to full search. Last but not least, traditional block matching speedup methods are combined to provide much better computationdistortion curves. © 2005 IEEE.application/pdf330511 bytesapplication/pdfAdaptive search; Block Matching; Computation resources; Context information; Diamond search; Faster convergence; Full search; Macro block; Memory size; Motion estimation algorithm; Motion Vectors; One-pass; Random access; Search patterns; Search strategies; Speed-up method; Step-by-step; Three-step search; Video quality; Error correction; Image quality; Motion compensation; Motion estimationconference paper10.1109/ISCAS.2005.14658742-s2.0-33846315848