F. Noo, M. Defrise, R. Clackdoyle, E. J. Roney, T. White, S. Galbraith
{"title":"锥束CT中圆加线轨道稳定高效的移位变算法","authors":"F. Noo, M. Defrise, R. Clackdoyle, E. J. Roney, T. White, S. Galbraith","doi":"10.1109/ICIP.1996.560551","DOIUrl":null,"url":null,"abstract":"Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Stable and efficient shift-variant algorithm for circle-plus-lines orbits in cone-beam CT\",\"authors\":\"F. Noo, M. Defrise, R. Clackdoyle, E. J. Roney, T. White, S. Galbraith\",\"doi\":\"10.1109/ICIP.1996.560551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers.\",\"PeriodicalId\":192947,\"journal\":{\"name\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.1996.560551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd IEEE International Conference on Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1996.560551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Stable and efficient shift-variant algorithm for circle-plus-lines orbits in cone-beam CT
Defrise and Clack (see IEEE Trans. Med. Imag., vol.13, p.186-95, 1994) , and also Kudo and Saito (see IEEE Trans. Med. Imag., vol.13, p.196-211, 1994), have derived an exact algorithm suited to accurately reconstruct cone-beam data acquired from any complete orbit. These algorithms are written in the form of a shift-variant filtered backprojection. Their main characteristic is their capability to handle in many different ways the redundancy inherent to cone-beam data sets. We investigate the interplay between the redundancy handling and the stability and efficiency of the algorithm. Specifically, we show how to handle the redundancy to turn shift-variant filtering of some projections into shift-invariant filtering. Invoking this result, we define then a new algorithm suited to accurately and efficiently reconstruct data acquired from circle-plus-lines orbits. The new algorithm is tested on simulated data and real data from industrial imaging of waste containers.