{"title":"Optimal sampling in array-based image formation","authors":"Yun Gao, S. Reeves","doi":"10.1109/ICIP.2000.901063","DOIUrl":null,"url":null,"abstract":"In some types of imaging, the signal is strictly limited in one domain while sampling takes places in another. If sampling is done in a rectangular array pattern at sub-Nyquist density, the array must be dithered to sample the image at the Nyquist density in each dimension. However, the Nyquist density oversamples the image due to the nonrectangular support in the transform domain. We present an efficient algorithm for optimizing the dithering pattern so that the image can be reconstructed as reliably as possible from a periodic nonuniform set of samples, which can be obtained from a dithered rectangular-grid array. Taking into account the transform support of the image, we sequentially eliminate the least informative array recursively until the minimal number of arrays remain.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2000.901063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In some types of imaging, the signal is strictly limited in one domain while sampling takes places in another. If sampling is done in a rectangular array pattern at sub-Nyquist density, the array must be dithered to sample the image at the Nyquist density in each dimension. However, the Nyquist density oversamples the image due to the nonrectangular support in the transform domain. We present an efficient algorithm for optimizing the dithering pattern so that the image can be reconstructed as reliably as possible from a periodic nonuniform set of samples, which can be obtained from a dithered rectangular-grid array. Taking into account the transform support of the image, we sequentially eliminate the least informative array recursively until the minimal number of arrays remain.