Institute of Informatics>>> Department of Image Processing and Computer Graphics>>>

Magyarul

Selected Publications of the Department of Image Processing and Computer Graphics of the year 2005

Books and proceedings

1. Vito Di Gesu and Attila Kuba, editors. IWCIA 2003-Ninth International Workshop on Combinatorial Image Analysis, volume 151 of Discrete Applied Mathematics. Elsevier, October 2005. [WWW]
   
   @BOOK{Gesu2005,
   PUBLISHER = {Elsevier},
   TITLE = {IWCIA 2003-Ninth International Workshop on Combinatorial Image Analysis},
   YEAR = {2005},
   EDITOR = {Vito Di Gesu and Attila Kuba},
   MONTH = {October},
   NUMBER = {1-3},
   SERIES = {Discrete Applied Mathematics},
   VOLUME = {151},
   PAGES = {1-246},
   URL = {http://www.sciencedirect.com/science/journal/0166218X},
   }


2. Gabor T. Herman and Attila Kuba, editors. Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics. Elsevier, July 2005. [WWW]
   
   @BOOK{Herman2005,
   PUBLISHER = {Elsevier},
   TITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
   YEAR = {2005},
   EDITOR = {Gabor T. Herman and Attila Kuba},
   MONTH = {July},
   SERIES = {Electronic Notes in Discrete Mathematics},
   VOLUME = {20},
   PAGES = {1-622},
   URL = {http://www.sciencedirect.com/science/journal/15710653},
   }

Articles in journal or book chapters

1. Peter Balazs, Emese Balogh, and Attila Kuba. Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. Discrete Applied Mathematics, 147:149-168, 2005. [PDF]
   Abstract: The reconstruction of 8-connected but not 4-connected $hv$-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of $O(mn\cdot\min\{ m,n\} )$ to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of $O(mn)$ and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.
   
   @ARTICLE{Peter2005,
   AUTHOR = {Peter Balazs and Emese Balogh and Attila Kuba},
   JOURNAL = {Discrete Applied Mathematics},
   TITLE = {Reconstruction of 8-connected but not 4-connected hv-convex discrete sets},
   YEAR = {2005},
   PAGES = {149-168},
   VOLUME = {147},
   }


2. Attila Kuba and Maurice Nivat. A sufficient condition for non-uniqueness in binary tomography with absorption. Theoretical Computer Science, 346:335-357, November 2005. [PDF] [doi:10.1016/j.tcs.2005.08.024]
   Abstract: A new kind of discrete tomography problem is introduced: the reconstruction of discrete sets from their absorbed projections. A special case of this problem is discussed, namely, the uniqueness of the binary matrices with respect to their absorbed row and column sums when the absorption coefficient is n=log((1+5^0.5)/2). It is proved that if a binary matrix contains a special structure of 0s and 1s, called alternatively corner-connected component, then this binary matrix is non-unique with respect to its absorbed row and column sums. Since it has been proved in another paper [A. Kuba, M. Nivat, Reconstruction of discrete sets with absorption, Linear Algebra Appl. 339 (2001) 171–194] that this condition is also necessary, the existence of alternatively corner-connected component in a binary matrix gives a characterization of the non-uniqueness in this case of absorbed projections.
   
   @ARTICLE{Kuba2005,
   AUTHOR = {Attila Kuba and Maurice Nivat},
   JOURNAL = {Theoretical Computer Science},
   TITLE = {A sufficient condition for non-uniqueness in binary tomography with absorption},
   YEAR = {2005},
   MONTH = {November},
   PAGES = {335-357},
   VOLUME = {346},
   DOI = {10.1016/j.tcs.2005.08.024},
   }


3. Attila Kuba, Laszlo Rusko, Lajos Rodek, and Zoltan Kiss. Preliminary studies of discrete tomography in neutron imaging. IEEE Transactions on Nuclear Science, 52(1):380-385, February 2005. [doi:10.1109/TNS.2005.843657]
   Abstract: Discrete tomography (DT) is a new technique to reconstruct discrete images from their projections (like neutron images). The reconstruction methods in DT are different from the conventional ones, because the created images may contain only a few numbers of given discrete values. One of the main reasons to apply DT is that hopefully we need only a few numbers of projections. In many applications we have a situation where we know the material components of the object to be studied, that is, we know the discrete values of the image to be reconstructed. Using discreteness and some a priori information we can apply several DT methods in neutron imaging. Most of the DT reconstruction methods are reducing the problem to an optimization task. We tried two such methods on software and physical phantoms. In these experiments we investigated the effects of the following parameters: number of projections, noise levels, and complexity of the object to be reconstructed. We also developed a software system, called DIRECT, for testing different DT methods, to compare them and to present the reconstructed objects.
   
   @ARTICLE{KubaRusko200552,
   AUTHOR = {Attila Kuba and Laszlo Rusko and Lajos Rodek and Zoltan Kiss},
   JOURNAL = {IEEE Transactions on Nuclear Science},
   TITLE = {Preliminary studies of discrete tomography in neutron imaging},
   YEAR = {2005},
   MONTH = {February},
   NUMBER = {1},
   PAGES = {380-385},
   VOLUME = {52},
   DOI = {10.1109/TNS.2005.843657},
   }


4. Antal Nagy and Attila Kuba. Reconstruction of binary matrices from fan-beam projections. Acta Cybernetica, 17(2):359-385, 2005. [PDF]
   Abstract: The problem of the reconstruction of binary matrices from their fan-beam projections is investigated here. A fan-beam projection model is implemented and afterwards employed in systematic experiments to determine the optimal parameter values for a data acquisition and reconstruction algorithm. The fan-beam model, the reconstruction algorithm which uses the optimization method of Simulated Annealing, the simulation experiments, and the results are then discussed in turn.
   
   @ARTICLE{NagyKuba:2005:RecFanBeam,
   AUTHOR = {Antal Nagy and Attila Kuba},
   JOURNAL = {Acta Cybernetica},
   TITLE = {Reconstruction of binary matrices from fan-beam projections},
   YEAR = {2005},
   NUMBER = {2},
   PAGES = {359--385},
   VOLUME = {17},
   }


5. Juerg Tschirren, Geoffrey McLennan, Kalman Palagyi, Eric A. Hoffman, and Milan Sonka. Matching and anatomical labeling of human airway tree. IEEE Transactions on Medical Imaging, 24:1540-1547, 2005. [PDF]
   Abstract: Matching of corresponding branchpoints between two human airway trees, as well as assigning anatomical names to the segments and branchpoints of the human airway tree, are of significant interest for clinical applications and physiological studies. In the past, these tasks were often performed manually due to the lack of automated algorithms that can tolerate false branches and anatomical variability typical for in vivo trees. In this paper, we present algorithms that perform both matching of branchpoints and anatomical labeling of in vivo trees without any human intervention and within a short computing time. No hand-pruning of false branches is required. The results from the automated methods show a high degree of accuracy when validated against reference data provided by human experts. 92.9% of the verifiable branchpoint matches found by the computer agree with experts’ results. For anatomical labeling, 97.1% of the automatically assigned segment labels were found to be correct.
   
   @ARTICLE{TschirrenEtalTMI2005,
   AUTHOR = {Juerg Tschirren and Geoffrey McLennan and Kalman Palagyi and Eric A. Hoffman and Milan Sonka},
   JOURNAL = {IEEE Transactions on Medical Imaging},
   TITLE = {Matching and anatomical labeling of human airway tree},
   YEAR = {2005},
   PAGES = {1540-1547},
   VOLUME = {24},
   }

Conference articles

1. Marton Balasko, Attila Kuba, Antal Nagy, Zoltan Kiss, Lajos Rodek, and Laszlo Rusko. Neutron-, gamma- and X-ray three-dimensional computed tomography at the Budapest research reactor site. In Proceedings of the International Topical Meeting on Neutron Radiography, volume 542 of Nuclear Instruments and Methods in Physics Research, Garching, Germany, pages 22-27, April 2005. [PDF] [doi:10.1016/j.nima.2005.01.006]
   Abstract: A new complex, neutron-, gamma- and X-ray three-dimensional computer tomography system suitable for experimental and industrial applications has been built at the 10-MW Budapest research reactor site. After the system was installed, a number of objects were investigated and tomographic projections were made. The evaluation relied on two reconstruction approaches. One of these is the classical, filtered back-projection method using 180 projected pictures, while the other is based on discrete tomography optimization algorithms where fewer projections were needed.
   
   @INPROCEEDINGS{Balasko2005,
   AUTHOR = {Marton Balasko and Attila Kuba and Antal Nagy and Zoltan Kiss and Lajos Rodek and Laszlo Rusko},
   BOOKTITLE = {Proceedings of the International Topical Meeting on Neutron Radiography},
   TITLE = {Neutron-, gamma- and X-ray three-dimensional computed tomography at the Budapest research reactor site},
   YEAR = {2005},
   ADDRESS = {Garching, Germany},
   MONTH = {April},
   PAGES = {22-27},
   SERIES = {Nuclear Instruments and Methods in Physics Research},
   VOLUME = {542},
   DOI = {10.1016/j.nima.2005.01.006},
   }


2. Marton Balasko, Erzsebet Svab, Attila Kuba, Zoltan Kiss, Lajos Rodek, and Antal Nagy. Pipe corrosion and deposit study using neutron- and gamma- radiation sources. In Proceedings of the International Topical Meeting on Neutron Radiography, volume 542 of Nuclear Instruments and Methods in Physics Research, Garching, Germany, pages 302-308, April 2005. [PDF] [doi:10.1016/j.nima.2005.01.153]
   Abstract: The problems of corrosion and deposit are crucial issues in the pipelines of the chemical, nuclear and petrochemical industries. Radiography (neutron, gamma, X-ray) has long been used as a technique for pipe inspection and corrosion monitoring. The 10 MW Budapest research reactor site is a source of various energy neutron (thermal and epithermal) and gamma radiation. The detector system was a Peltier-cooled LLL CCD camera controlled by a PC with Image ProLite software and imaging plate equipment with a BAS 2500 scanner that used AIDA software. The objects inspected were corroded tubes and various kinds of test specimens with a large wall thickness (25 mm) inside and outside steps. In the evaluation part we used tomographic algorithms. A software simulation study was made as well. Fan-beam projections were computed of the given software phantoms and a new discrete tomography method was used to reconstruct the unknown objects from these projections.
   
   @INPROCEEDINGS{Balasko2005a,
   AUTHOR = {Marton Balasko and Erzsebet Svab and Attila Kuba and Zoltan Kiss and Lajos Rodek and Antal Nagy},
   BOOKTITLE = {Proceedings of the International Topical Meeting on Neutron Radiography},
   TITLE = {Pipe corrosion and deposit study using neutron- and gamma- radiation sources},
   YEAR = {2005},
   ADDRESS = {Garching, Germany},
   MONTH = {April},
   PAGES = {302-308},
   SERIES = {Nuclear Instruments and Methods in Physics Research},
   VOLUME = {542},
   DOI = {10.1016/j.nima.2005.01.153},
   }


3. Peter Balazs. Reconstruction of decomposable discrete sets from four projections. In Eric Andres, Guillaume Damiand, and Pascal Lienhardt, editors, Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 3429 of Lecture Notes in Computer Science, Poitiers, France, pages 104-114, April 2005. Springer Verlag. [PDF]
   Abstract: In this paper we introduce the class of decomposable discrete sets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class $\mathcal S'_8$ of $hv$-convex 8- but not 4-connected discrete sets which was. As a consequence we also get that the reconstruction from four projections in ${\mathcal S}'_8$ can be solved in $O(mn)$ time.
   
   @INPROCEEDINGS{Balazs2005,
   AUTHOR = {Peter Balazs},
   BOOKTITLE = {Proceedings of the International Conference on Discrete Geometry for Computer Imagery},
   TITLE = {Reconstruction of decomposable discrete sets from four projections},
   YEAR = {2005},
   ADDRESS = {Poitiers, France},
   EDITOR = {Eric Andres and Guillaume Damiand and Pascal Lienhardt},
   MONTH = {April},
   PAGES = {104-114},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {3429},
   }


4. Peter Balazs. Reconstruction of discrete sets from four projections: strong decomposability. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 329-345, June 2005. Elsevier. [PDF]
   Abstract: In this paper we introduce the class of strongly decomposable discrete sets and give an efficient algorithm for reconstructing discrete sets of this class from four projections. It is also shown that every Q-convex set (along the set of directions $\{ x,y\}$) consisting of several components is strongly decomposable. As a consequence of strong decomposability we get that in a subclass of $hv$-convex discrete sets the reconstruction from four projections can be solved in polynomial time.
   
   @INPROCEEDINGS{Balazs2005a,
   AUTHOR = {Peter Balazs},
   BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
   TITLE = {Reconstruction of discrete sets from four projections: strong decomposability},
   YEAR = {2005},
   ADDRESS = {New York City, USA},
   MONTH = {June},
   PAGES = {329-345},
   PUBLISHER = {Elsevier},
   SERIES = {Electronic Notes in Discrete Mathematics},
   VOLUME = {20},
   }


5. Reinhard Beichel, Thomas Pock, Christian Janko, Roman Zotter, Bernhard Reitinger, Alexander Bornik, Kalman Palagyi, Erich Sorantin, Georg Werkgartner, Horst Bischof, and Milan Sonka. Liver segment approximation in CT data for surgical resection planning. In Fitzpatrick J. M. and Sonka M., editors, Proceedings of Medical Imaging 2004: Image Processing, volume 5370 of SPIE Proceedings, San Diego, USA, pages 1435-1446, May 2005. [PDF]
   Abstract: Surgical planning of liver tumor resections requires detailed three-dimensional (3D) understanding of the complex arrangement of vasculature, liver segments and tumors. Knowledge about location and sizes of liver segments is important for choosing an optimal surgical resection approach and predicting postoperative residual liver capacity. The aim of this work is to facilitate such surgical planning process by developing a robust method for portal vein tree segmentation. The work also investigates the impact of vessel segmentation on the approximation of liver segment volumes. For segment approximation, smaller portal vein branches are of importance. Small branches, however, are difficult to segment due to noise and partial volume effects. Our vessel segmentation is based on the original gray-values and on the result of a vessel enhancement filter. Validation of the developed portal vein segmentation method in computer generated phantoms shows that, compared to a conventional approach, more vessel branches can be segmented. Experiments with in vivo acquired liver CT data sets confirmed this result. The outcome of a Nearest Neighbor liver segment approximation method applied to phantom data demonstrates, that the proposed vessel segmentation approach translates into a more accurate segment partitioning.
   
   @INPROCEEDINGS{BeichelEtalSPIE2005,
   AUTHOR = {Reinhard Beichel and Thomas Pock and Christian Janko and Roman Zotter and Bernhard Reitinger and Alexander Bornik and Kalman Palagyi and Erich Sorantin and Georg Werkgartner and Horst Bischof and Milan Sonka},
   BOOKTITLE = {Proceedings of Medical Imaging 2004: Image Processing},
   TITLE = {Liver segment approximation in CT data for surgical resection planning},
   YEAR = {2005},
   ADDRESS = {San Diego, USA},
   EDITOR = {Fitzpatrick J. M. and Sonka M.},
   MONTH = {May},
   PAGES = {1435-1446},
   SERIES = {SPIE Proceedings},
   VOLUME = {5370},
   }


6. Andrea Frosini, Simone Rinaldi, Elena Barcucci, and Attila Kuba. An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 347-363, June 2005. [PDF] [doi:10.1016/j.endm.2005.05.073]
   Abstract: This paper studies the classical tomographical problem of the reconstruction of a binary matrix from projections in presence of absorption. In particular, we consider two projections along the horizontal and vertical directions and the mathematically interesting case of the absorption coefficient B0=(1+sqrt(5))/2. After proving some theoretical results on the switching components, we furnish a fast algorithm for solving the reconstruction problem from the horizontal and vertical absorbed projections. As a significative remark, we obtain also the solution of the related uniqueness problem.
   
   @INPROCEEDINGS{Frosini2005,
   AUTHOR = {Andrea Frosini and Simone Rinaldi and Elena Barcucci and Attila Kuba},
   BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
   TITLE = {An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections},
   YEAR = {2005},
   ADDRESS = {New York City, USA},
   MONTH = {June},
   PAGES = {347-363},
   SERIES = {Electronic Notes in Discrete Mathematics},
   VOLUME = {20},
   DOI = {10.1016/j.endm.2005.05.073},
   }


7. Zoltan Kiss, Lajos Rodek, Antal Nagy, Attila Kuba, and Marton Balasko. Reconstruction of pixel-based and geometric objects by discrete tomography. Simulation and physical experiments. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 475-491, June 2005. [PDF] [doi:10.1016/j.endm.2005.05.080]
   Abstract: Tomography is an imaging technique to reconstruct cross-sections of objects from projection images in a non-destructive way. We have implemented two discrete tomographic (DT) reconstruction methods. The first method is general in the sense that the objects to be reconstructed are represented by pixels, and in this way the method can be used for reconstructing any shape. The second one is able to reconstruct objects consisting of cylinders and spheres made of homogeneous materials only. Simulation and physical experiments connected with non-destructive testing by X-rays were performed, and the results are presented.
   
   @INPROCEEDINGS{Kiss2005,
   AUTHOR = {Zoltan Kiss and Lajos Rodek and Antal Nagy and Attila Kuba and Marton Balasko},
   BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
   TITLE = {Reconstruction of pixel-based and geometric objects by discrete tomography. Simulation and physical experiments},
   YEAR = {2005},
   ADDRESS = {New York City, USA},
   MONTH = {June},
   PAGES = {475-491},
   SERIES = {Electronic Notes in Discrete Mathematics},
   VOLUME = {20},
   DOI = {10.1016/j.endm.2005.05.080},
   }


8. Sven Krimmel, Joachim Baumann, Zoltan Kiss, Attila Kuba, Antal Nagy, and Juergen Stephan. Discrete tomography for reconstruction from limited view angles in non-destructive testing. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, pages 455-474, June 2005. [PDF] [doi:10.1016/j.endm.2005.05.078]
   Abstract: We show that discrete tomography (DT) is suitable to increase the possible inspection size of single material oblong objects compared to filtered back projection (FBP) in non-destructive testing (NDT) with 2D X-ray computed tomography (CT). For such objects which are in one dimension larger than the maximum detectable material thickness limited view angles occur and FBP is not suitable for reconstruction. For evaluation of the reconstruction performance a copper phantom (strong absorber) which exhibits typical problems for NDT was manufactured. The increase of the object size with DT reconstruction compared to FBP was estimated to be above 50%.
   
   @INPROCEEDINGS{Krimmel2005,
   AUTHOR = {Sven Krimmel and Joachim Baumann and Zoltan Kiss and Attila Kuba and Antal Nagy and Juergen Stephan},
   BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
   TITLE = {Discrete tomography for reconstruction from limited view angles in non-destructive testing},
   YEAR = {2005},
   MONTH = {June},
   PAGES = {455-474},
   SERIES = {Electronic Notes in Discrete Mathematics},
   VOLUME = {20},
   DOI = {10.1016/j.endm.2005.05.078},
   }


9. Attila Kuba, Lajos Rodek, Zoltan Kiss, Laszlo Rusko, Antal Nagy, and Marton Balasko. Discrete tomography in neutron radiography. In Proceedings of the International Topical Meeting on Neutron Radiography, volume 542 of Nuclear Instruments and Methods in Physics Research, Garching, Germany, pages 376-382, April 2005. [PDF] [doi:10.1016/j.nima.2005.01.164]
   Abstract: Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT.
   
   @INPROCEEDINGS{Kuba2005a,
   AUTHOR = {Attila Kuba and Lajos Rodek and Zoltan Kiss and Laszlo Rusko and Antal Nagy and Marton Balasko},
   BOOKTITLE = {Proceedings of the International Topical Meeting on Neutron Radiography},
   TITLE = {Discrete tomography in neutron radiography},
   YEAR = {2005},
   ADDRESS = {Garching, Germany},
   MONTH = {April},
   PAGES = {376-382},
   SERIES = {Nuclear Instruments and Methods in Physics Research},
   VOLUME = {542},
   DOI = {10.1016/j.nima.2005.01.164},
   }


10. Attila Kuba, Laszlo Rusko, Zoltan Kiss, and Antal Nagy. Discrete Reconstruction Techniques. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 385-398, June 2005. [PDF] [doi:10.1016/j.endm.2005.04.005]
    Abstract: DIscrete REConstruction Techniques (DIRECT) is a program system for generating test images, for computing their projections, for performing reconstructions, for comparing reconstructed images, and for visualizing the results. Our framework supplies a solid workflow to be performed during testing DT methods. A collection of DT reconstruction methods is planned to be implemented in this system to help further comparisions and software developments in DT.
    
    @INPROCEEDINGS{Kuba2005b,
    AUTHOR = {Attila Kuba and Laszlo Rusko and Zoltan Kiss and Antal Nagy},
    BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
    TITLE = {Discrete Reconstruction Techniques},
    YEAR = {2005},
    ADDRESS = {New York City, USA},
    MONTH = {June},
    PAGES = {385-398},
    SERIES = {Electronic Notes in Discrete Mathematics},
    VOLUME = {20},
    DOI = {10.1016/j.endm.2005.04.005},
    }


11. Attila Kuba and Gerhard J. Woeginger. Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections. In Eric Andres, Guillaume Damiand, and Pascal Lienhardt, editors, Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 3429 of Lecture Notes in Computer Science, Poitiers, France, pages 148-152, April 2005. Springer Verlag. [WWW] [doi:10.1007/b135490]
    
    @INPROCEEDINGS{Kuba2005c,
    AUTHOR = {Attila Kuba and Gerhard J. Woeginger},
    BOOKTITLE = {Proceedings of the International Conference on Discrete Geometry for Computer Imagery},
    TITLE = {Two Remarks on Reconstructing Binary Vectors from Their Absorbed Projections},
    YEAR = {2005},
    ADDRESS = {Poitiers, France},
    EDITOR = {Eric Andres and Guillaume Damiand and Pascal Lienhardt},
    MONTH = {April},
    PAGES = {148-152},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    VOLUME = {3429},
    URL = {http://www.springerlink.com/content/xmlxrmq0r98aa8tk},
    DOI = {10.1007/b135490},
    }


12. Antal Nagy, Attila Kuba, and Martin Samal. Reconstruction of factor structures using discrete tomography method. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 519-534, June 2005. [PDF] [doi:10.1016/j.endm.2005.05.083]
    Abstract: Our aim was to estimate the volumes of homogeneous structures whose contrast / intensity was changing with time, using only few (here 4) projections of the structures. Each projection was recorded over a period of time and consisted of a sequence of images. The projections of the structures were first separated by factor analysis of the total projections. Then each structure was reconstructed individually from its factor projections using discrete tomography. Assumed application is the single-photon emission computed tomography (SPECT).
    
    @INPROCEEDINGS{NagyKuba:2005:Factor,
    AUTHOR = {Antal Nagy and Attila Kuba and Martin Samal},
    BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
    TITLE = {Reconstruction of factor structures using discrete tomography method},
    YEAR = {2005},
    ADDRESS = {New York City, USA},
    MONTH = {June},
    PAGES = {519--534},
    SERIES = {Electronic Notes in Discrete Mathematics},
    VOLUME = {20},
    DOI = {10.1016/j.endm.2005.05.083},
    }


13. Laszlo G. Nyul, Judit Kanyo, Eors Mate, Geza Makay, Emese Balogh, Marta Fidrich, and Attila Kuba. Method for Automatically Segmenting the Spinal Cord and Canal from 3D CT Images. In A. Gagalowicz and W. Philips, editors, Proceedings of the International Conference on Computer Analysis of Images and Patterns, volume 3691 of Lecture Notes in Computer Science, Versailles, France, pages 456-463, September 2005. Springer Verlag. [PDF]
    Abstract: We present two approaches for automatically segmenting the spinal cord/canal from native CT images of the thorax region containing the spine. Different strategies are included to handle images where only part of the spinal column is visible. The algorithms require one seed point given on a slice located in the middle region of the spine, and the rest is automatic. The spatial extent of the spinal cord/canal is determined automatically. An extended region-growing technique is suggested for segmenting the spinal canal while active contours are applied if the spinal cord is to be segmented. Both methods work in 2D and use propagated information from neighboring slices. They are also very rapid in execution, that means an efficient, user-friendly workflow. The methods were evaluated by radiologists and were found to be useful (in reducing/ eliminating contouring labor and time) and met the accuracy and repeatability requirements for the particular task.
    
    @INPROCEEDINGS{Nyul:2005:MAS_CAIP,
    AUTHOR = {Laszlo G. Nyul and Judit Kanyo and Eors Mate and Geza Makay and Emese Balogh and Marta Fidrich and Attila Kuba},
    BOOKTITLE = {Proceedings of the International Conference on Computer Analysis of Images and Patterns},
    TITLE = {Method for Automatically Segmenting the Spinal Cord and Canal from 3D CT Images},
    YEAR = {2005},
    ADDRESS = {Versailles, France},
    EDITOR = {A. Gagalowicz and W. Philips},
    MONTH = {September},
    PAGES = {456--463},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    VOLUME = {3691},
    }


14. Laszlo Rusko and Attila Kuba. Multi-resolution method for binary tomography. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 299-311, July 2005. [PDF] [doi:10.1016/j.endm.2005.05.070]
    Abstract: Multi-resolution and region-growing strategies have been successfully used in several fields of image processing. In this paper we investigate how these two strategies can be applied for binary tomography. We included these strategies into a reconstruction method using simulated annealing and tested these new methods on different images.
    
    @INPROCEEDINGS{Rusko2005,
    AUTHOR = {Laszlo Rusko and Attila Kuba},
    BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
    TITLE = {Multi-resolution method for binary tomography},
    YEAR = {2005},
    ADDRESS = {New York City, USA},
    MONTH = {July},
    PAGES = {299-311},
    SERIES = {Electronic Notes in Discrete Mathematics},
    VOLUME = {20},
    DOI = {10.1016/j.endm.2005.05.070},
    }


15. Attila Tanacs, Eors Mate, and Attila Kuba. Application of Automatic Image Registration in a Segmentation Framework for Pelvic CT Images. In Andre Gagalowicz and Wilfried Philips, editors, Proceedings of the International Conference on Computer Analysis of Images and Patterns, volume 3691 of Lecture Notes in Computer Science, Paris, France, pages 628-635, September 2005. [PDF] [doi:10.1007/11556121_77]
    Abstract: In radiation treatment (RT) planning, clinicians must trace the outline of a few critical structures on a large number of images. Using automated image segmentation could save tremendous time and effort. Segmentation of the organs near the pubic bone (prostate and bladder) is an important and challenging task: Some of the neighboring organs have similar density values in the CT images and the border between the different organs is hardly visible. In a segmentation framework, transforming a CT study to a common reference frame is used in two tasks: For statistical atlas (model) generation, and in the clinical application, establishing the voxel-to-voxel correspondence between the study and the model. In these cases precise alignment of all anatomical structures is not crucial, the focus is on proper alignment of the pubic bone area and fast execution. Our proposed method solves this by a new, two step process based on a voxel similarity-based registration algorithm.
    
    @INPROCEEDINGS{Tanacs:2005:CAIP,
    AUTHOR = {Attila Tanacs and Eors Mate and Attila Kuba},
    BOOKTITLE = {Proceedings of the International Conference on Computer Analysis of Images and Patterns},
    TITLE = {Application of Automatic Image Registration in a Segmentation Framework for Pelvic CT Images},
    YEAR = {2005},
    ADDRESS = {Paris, France},
    EDITOR = {Andre Gagalowicz and Wilfried Philips},
    MONTH = {September},
    PAGES = {628--635},
    SERIES = {Lecture Notes in Computer Science},
    VOLUME = {3691},
    DOI = {10.1007/11556121_77},
    }


16. Steffen Zopf and Attila Kuba. Reconstruction of measurable sets from two generalized projections. In Proceedings of the Workshop on Discrete Tomography and its Applications, volume 20 of Electronic Notes in Discrete Mathematics, New York City, USA, pages 47-66, June 2005. [PDF] [doi:10.1016/j.endm.2005.04.003]
    Abstract: The problem of reconstructing a measurable plane set from its two generalized projections is considered. It means that the projections contain also the effect of a known modification given in the whole plane. This is a more general case than that of a constant absorption within a given material. Via a suitable mapping, this generalized problem can be transformed into the solved case of the classical (non-absorbed and non-generalized) projections, giving a theorem about the characterization of unique, non-unique, and inconsistent projections analogous to Lorentz' theorem. The connection between uniqueness and the existence of so-called generalized switching components is discussed.
    
    @INPROCEEDINGS{Zopf2005,
    AUTHOR = {Steffen Zopf and Attila Kuba},
    BOOKTITLE = {Proceedings of the Workshop on Discrete Tomography and its Applications},
    TITLE = {Reconstruction of measurable sets from two generalized projections},
    YEAR = {2005},
    ADDRESS = {New York City, USA},
    MONTH = {June},
    PAGES = {47-66},
    SERIES = {Electronic Notes in Discrete Mathematics},
    VOLUME = {20},
    DOI = {10.1016/j.endm.2005.04.003},
    }

  This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

 This document was translated from BibTEX by bibtex2html