S. Abdulhussain, A. Ramli, A. Hussain, Basheera M. Mahmmod, Wissam A. Jassim
{"title":"Orthogonal polynomial embedded image kernel","authors":"S. Abdulhussain, A. Ramli, A. Hussain, Basheera M. Mahmmod, Wissam A. Jassim","doi":"10.1145/3321289.3321310","DOIUrl":null,"url":null,"abstract":"Preprocessing operations of images and video frame sequences are beneficial in computer vision algorithms. For example, smoothing frames is used to eliminate noise; while computing frame gradient in x-direction and y-direction is used for frame feature extraction or for finding frame edges. Such operations involve convolving operators (image kernels) with an image precomputing moments will add extra computation cost to computer vision algorithm. In case of video, the computational time accumulatively increased because of the convolution operation for each frame is performed. To overcome this problem, a mathematical model is established for computing preprocessed frame moments via embedding the operator (image kernel) in the orthogonal polynomial (OP) functions. The experimental results show that the computation time for feature extraction using the proposed method is noticeably reduced in the both trends: image size and moment selection order. The average speed up ratio of the proposed method to traditional method is 3x, 5x, 8x, and 40x for moment selection ratio 100%, 25%, 10%, and 5%, respectively. In addition, the percentage reduction in processing time for small image size is ~ 99% and for large image size is ~ 40%.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3321289.3321310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
Preprocessing operations of images and video frame sequences are beneficial in computer vision algorithms. For example, smoothing frames is used to eliminate noise; while computing frame gradient in x-direction and y-direction is used for frame feature extraction or for finding frame edges. Such operations involve convolving operators (image kernels) with an image precomputing moments will add extra computation cost to computer vision algorithm. In case of video, the computational time accumulatively increased because of the convolution operation for each frame is performed. To overcome this problem, a mathematical model is established for computing preprocessed frame moments via embedding the operator (image kernel) in the orthogonal polynomial (OP) functions. The experimental results show that the computation time for feature extraction using the proposed method is noticeably reduced in the both trends: image size and moment selection order. The average speed up ratio of the proposed method to traditional method is 3x, 5x, 8x, and 40x for moment selection ratio 100%, 25%, 10%, and 5%, respectively. In addition, the percentage reduction in processing time for small image size is ~ 99% and for large image size is ~ 40%.