{"title":"块匹配技术在视频图像运动估计中的比较研究","authors":"K. Laidi, M.A. Bailiche, M. Mehenni","doi":"10.1109/ISPA.2007.4383659","DOIUrl":null,"url":null,"abstract":"The purpose of this work consists in a comparative study between block matching search algorithms, used in video images motion estimation. Exploiting the temporal correlation between two successive sequence frames we can reduce enormously the memory space needed for image registration. In this context, we have applied and compared different algorithms of search used in block matching technique. These algorithms include full search algorithm, three steps search algorithm, new three steps search algorithm, four steps algorithm, diamond search algorithm and minimum search algorithm. The performance of an algorithm is a compromise between the pick signal to noise ratio and the computing search time of the algorithm.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Comparative Study of Block Matching Techniques Used in Video Images Motions Estimation\",\"authors\":\"K. Laidi, M.A. Bailiche, M. Mehenni\",\"doi\":\"10.1109/ISPA.2007.4383659\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this work consists in a comparative study between block matching search algorithms, used in video images motion estimation. Exploiting the temporal correlation between two successive sequence frames we can reduce enormously the memory space needed for image registration. In this context, we have applied and compared different algorithms of search used in block matching technique. These algorithms include full search algorithm, three steps search algorithm, new three steps search algorithm, four steps algorithm, diamond search algorithm and minimum search algorithm. The performance of an algorithm is a compromise between the pick signal to noise ratio and the computing search time of the algorithm.\",\"PeriodicalId\":112420,\"journal\":{\"name\":\"2007 5th International Symposium on Image and Signal Processing and Analysis\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 5th International Symposium on Image and Signal Processing and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2007.4383659\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 5th International Symposium on Image and Signal Processing and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2007.4383659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparative Study of Block Matching Techniques Used in Video Images Motions Estimation
The purpose of this work consists in a comparative study between block matching search algorithms, used in video images motion estimation. Exploiting the temporal correlation between two successive sequence frames we can reduce enormously the memory space needed for image registration. In this context, we have applied and compared different algorithms of search used in block matching technique. These algorithms include full search algorithm, three steps search algorithm, new three steps search algorithm, four steps algorithm, diamond search algorithm and minimum search algorithm. The performance of an algorithm is a compromise between the pick signal to noise ratio and the computing search time of the algorithm.