%0 Conference Paper %1 DBLP:conf/icmcs/JiangZ04 %A Jiang, Wenbin %A Zhou, Manli %B Proceedings of the 2004 IEEE International Conference on Multimedia and Expo, ICME 2004, %C Tapei, China %D 2004 %I IEEE %K imported %P 1115-1118 %T A fast BMA based on combining search candidate subsampling and APDS %X A new faster block-matching algorithm (BMA) named SSC-APDS is presented by subsampling search candidates in adjustable partial distortion search (APDS). Firstly APDS is modified to visit about half points of all search candidates by taking subsampling on them, using a spiral-scanning path with one skip. Two selected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one, while at most 8 more candidates were required. Experimental results show that the SSC-APDS can maintain its MSE performance very close to that of the APDS with higher speedup ratio. Moreover, the wider the search window is, the better SSC-APDS performs.

@inproceedings{DBLP:conf/icmcs/JiangZ04, abstract = {A new faster block-matching algorithm (BMA) named SSC-APDS is presented by subsampling search candidates in adjustable partial distortion search (APDS). Firstly APDS is modified to visit about half points of all search candidates by taking subsampling on them, using a spiral-scanning path with one skip. Two selected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one, while at most 8 more candidates were required. Experimental results show that the SSC-APDS can maintain its MSE performance very close to that of the APDS with higher speedup ratio. Moreover, the wider the search window is, the better SSC-APDS performs.}, added-at = {2011-05-05T10:16:43.000+0200}, address = {Tapei, China}, author = {Jiang, Wenbin and Zhou, Manli}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/2939ffc30afd88d07397cd030b0bd5567/xwk}, booktitle = {Proceedings of the 2004 IEEE International Conference on Multimedia and Expo, ICME 2004, }, crossref = {DBLP:conf/icmcs/2004}, interhash = {e6e2691abfdf076dbeae5ec2ec3fe19e}, intrahash = {939ffc30afd88d07397cd030b0bd5567}, keywords = {imported}, month = {June}, pages = {1115-1118}, publisher = {IEEE}, timestamp = {2011-05-05T10:30:38.000+0200}, title = {A fast BMA based on combining search candidate subsampling and APDS}, year = 2004 }