{"title":"局部基函数用于计算机断层扫描重建表示的一些结果","authors":"G. W. Wecksung, K. Hanson","doi":"10.1364/iact.1984.tuc5","DOIUrl":null,"url":null,"abstract":"In computed tomography (CT) as well as other areas of digital image processing, a discrete representation of a function of two variables on a continuous domain is needed. One approach is to specify the values of the function on an equally spaced grid and interpolate for intermediate values. A more general approach Is to represent the function as a linear combination of basis functions [1,2]. Iterative CT algorithms, e.g., ART, require repeated evaluation of line or strip projection integrals over a trial object function (reconstruction). If the first representation is selected, then we must get interpolated values in order to perform the integration. The interpolation can be performed in a variety of ways; each way makes implicit use of a set of basis functions. If nearest-neighbor interpolation is chosen, the resulting set of basis functions are square pixels centered on the sample points. For bilinear interpolation we get a bilinear tent function and for band-limited interpolation we get a product of separable sine functions with zeros at all sample points but one.","PeriodicalId":133192,"journal":{"name":"Topical Meeting on Industrial Applications of Computed Tomography and NMR Imaging","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some results on the use of local basis functions for reconstruction representation in computed tomography\",\"authors\":\"G. W. Wecksung, K. Hanson\",\"doi\":\"10.1364/iact.1984.tuc5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In computed tomography (CT) as well as other areas of digital image processing, a discrete representation of a function of two variables on a continuous domain is needed. One approach is to specify the values of the function on an equally spaced grid and interpolate for intermediate values. A more general approach Is to represent the function as a linear combination of basis functions [1,2]. Iterative CT algorithms, e.g., ART, require repeated evaluation of line or strip projection integrals over a trial object function (reconstruction). If the first representation is selected, then we must get interpolated values in order to perform the integration. The interpolation can be performed in a variety of ways; each way makes implicit use of a set of basis functions. If nearest-neighbor interpolation is chosen, the resulting set of basis functions are square pixels centered on the sample points. For bilinear interpolation we get a bilinear tent function and for band-limited interpolation we get a product of separable sine functions with zeros at all sample points but one.\",\"PeriodicalId\":133192,\"journal\":{\"name\":\"Topical Meeting on Industrial Applications of Computed Tomography and NMR Imaging\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Topical Meeting on Industrial Applications of Computed Tomography and NMR Imaging\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1364/iact.1984.tuc5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Topical Meeting on Industrial Applications of Computed Tomography and NMR Imaging","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/iact.1984.tuc5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some results on the use of local basis functions for reconstruction representation in computed tomography
In computed tomography (CT) as well as other areas of digital image processing, a discrete representation of a function of two variables on a continuous domain is needed. One approach is to specify the values of the function on an equally spaced grid and interpolate for intermediate values. A more general approach Is to represent the function as a linear combination of basis functions [1,2]. Iterative CT algorithms, e.g., ART, require repeated evaluation of line or strip projection integrals over a trial object function (reconstruction). If the first representation is selected, then we must get interpolated values in order to perform the integration. The interpolation can be performed in a variety of ways; each way makes implicit use of a set of basis functions. If nearest-neighbor interpolation is chosen, the resulting set of basis functions are square pixels centered on the sample points. For bilinear interpolation we get a bilinear tent function and for band-limited interpolation we get a product of separable sine functions with zeros at all sample points but one.