{"title":"A new class of feature-orientated motion estimation for motion pictures","authors":"Wan-Chi Sui, Yui-Lam Chan, W. Hui","doi":"10.1109/ICOSP.1998.770806","DOIUrl":null,"url":null,"abstract":"The key to high-performance video coding lies in an efficient reduction of the temporal redundancies. For this purpose, motion estimation and compensation techniques have been successfully applied. We have a discussion on the drawbacks of some fast algorithms and also problems that are related to the full-search algorithm in block motion estimation. Much attention has been given to fast algorithms using criteria such as the mean absolute difference (MAD). However problems arise from using both fast algorithms and even the full search algorithm. These problems cause poor motion-compensated prediction along some desirable feature, to which the human visual system is very sensitive. We propose a generalized class of algorithms to resolve the problems. In general, our algorithms are adaptive, which includes consideration of the characteristics of block motions for typical image sequences, and an intelligent classifier to separate blocks containing different features. The motion vectors of these blocks are computed using feature frames and a masking factor, so that the motion-compensated frames are tied more closely to physical features. Experimental results show that this approach gives a significant improvement in accuracy for motion-compensated frames and computational complexity, in comparison with traditional intensity-based block motion estimation methods. More importantly, it gives far better images under subjective tests as compared to all other algorithms, including the full search algorithm. Finally, we illustrate our approach by giving some details of specific sample algorithms.","PeriodicalId":145700,"journal":{"name":"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.1998.770806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The key to high-performance video coding lies in an efficient reduction of the temporal redundancies. For this purpose, motion estimation and compensation techniques have been successfully applied. We have a discussion on the drawbacks of some fast algorithms and also problems that are related to the full-search algorithm in block motion estimation. Much attention has been given to fast algorithms using criteria such as the mean absolute difference (MAD). However problems arise from using both fast algorithms and even the full search algorithm. These problems cause poor motion-compensated prediction along some desirable feature, to which the human visual system is very sensitive. We propose a generalized class of algorithms to resolve the problems. In general, our algorithms are adaptive, which includes consideration of the characteristics of block motions for typical image sequences, and an intelligent classifier to separate blocks containing different features. The motion vectors of these blocks are computed using feature frames and a masking factor, so that the motion-compensated frames are tied more closely to physical features. Experimental results show that this approach gives a significant improvement in accuracy for motion-compensated frames and computational complexity, in comparison with traditional intensity-based block motion estimation methods. More importantly, it gives far better images under subjective tests as compared to all other algorithms, including the full search algorithm. Finally, we illustrate our approach by giving some details of specific sample algorithms.