A-TDB: A self adaptive block-matching algorithm for varying motion contents

[[abstract]]An adaptive fast block-matching algorithm (FBMA), A-TDB, which is used to to solve the block matching problem for varying motions was discussed. The A-TDB adaptively switched the search patterns among the three-step search (TSS), the diamond search (DS) and the block-based gradient descent search (BBGDS) according to the motion contents, based on the predicted profit list. The predicted profit list is segmented into initial, adaptive and cleanup segment. The cleanup segment consisted of the blocks with zero motion vectors, and all blocks in this segment could be skipped.[[fileno]]2030211030019[[department]]資訊工程學