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 2010

Articles in journal or book chapters

1. Rudiger Bock, Jorg Meier, Laszlo G. Nyul, Joachim Hornegger, and Georg Michelson. Glaucoma Risk Index: Automated glaucoma detection from color fundus images. Medical Image Analysis, 14(3):471-481, 2010. [PDF] [doi:10.1016/j.media.2009.12.006]
   Abstract: Glaucoma as a neurodegeneration of the optic nerve is one of the most common causes of blindness. Because revitalization of the degenerated nerve fibers of the optic nerve is impossible early detection of the disease is essential. This can be supported by a robust and automated mass-screening. We propose a novel automated glaucoma detection system that operates on inexpensive to acquire and widely used digital color fundus images. After a glaucoma specific preprocessing, different generic feature types are compressed by an appearance-based dimension reduction technique. Subsequently, a probabilistic two-stage classification scheme combines these features types to extract the novel Glaucoma Risk Index (GRI) that shows a reasonable glaucoma detection performance. On a sample set of 575 fundus images a classification accuracy of 80% has been achieved in a 5-fold cross-validation setup. The GRI gains a competitive area under ROC (AUC) of 88% compared to the established topography-based glaucoma probability score of scanning laser tomography with AUC of 87%. The proposed color fundus image-based GRI achieves a competitive and reliable detection performance on a low-priced modality by the statistical analysis of entire images of the optic nerve head.
   
   @ARTICLE{Bock:2010:AGD,
   AUTHOR = {Rudiger Bock and Jorg Meier and Laszlo G. Nyul and Joachim Hornegger and Georg Michelson},
   JOURNAL = {Medical Image Analysis},
   TITLE = {Glaucoma Risk Index: Automated glaucoma detection from color fundus images},
   YEAR = {2010},
   NUMBER = {3},
   PAGES = {471--481},
   VOLUME = {14},
   DOI = {10.1016/j.media.2009.12.006},
   }


2. Csaba Domokos and Zoltan Kato. Parametric Estimation of Affine Deformations of Planar Shapes. Pattern Recognition, 43(3):569-578, March 2010. [PDF] [doi:10.1016/j.patcog.2009.08.013]
   Abstract: We consider the estimation of affine transformations aligning a known 2D shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the shapes and then compute the transformation parameters from these landmarks. Here we propose a novel approach where the exact transformation is obtained as the solution of a polynomial system of equations. The method has been tested on synthetic as well as on real images and its robustness in the presence of segmentation errors and additive geometric noise has also been demonstrated. We have successfully applied the method for the registration of hip prosthesis X-ray images. The advantage of the proposed solution is that it is fast, easy to implement, has linear time complexity, works without established correspondences and provides an exact solution regardless of the magnitude of transformation.
   
   @ARTICLE{Domokos-Kato2009a,
   AUTHOR = {Csaba Domokos and Zoltan Kato},
   JOURNAL = {Pattern Recognition},
   TITLE = {Parametric Estimation of Affine Deformations of Planar Shapes},
   YEAR = {2010},
   MONTH = {March},
   NUMBER = {3},
   PAGES = {569--578},
   VOLUME = {43},
   PUBLISHER = {Elsevier},
   DOI = {10.1016/j.patcog.2009.08.013},
   }


3. Endre Varga and Balazs Erdohelyi. Severe Pelvic Bleeding: The Role of Primary Internal Fixation. European Journal of Trauma and Emergency Surgery, 36(2):107-116, 2010. [PDF] [doi:10.1007/s00068-010-1003-7]
   Abstract: Pelvic ring injuries form part of the spectrum of polytrauma and must be considered a potentially lethal injury with mortality rates of 10-20%. The stabilization of the unstable pelvic ring in acute resuscitation of multiply injured patients is now conventional wisdom. We aimed: (1) to design a new iliosacral (IS) screw, (2) to prove the clinical advantages of this new implant, and (3) to work out the optimal surgical strategy using this implant. Taking the demands of the above mentioned data into account, a 10 mm 2.8 mm-cannulated iliosacral screw seemed to be optimal for the special requirements. Before industrial production, finite element analysis (FEA) was performed to find out whether these screws would be enough to stabilize the posterior pelvic ring alone or not. Clinical experience led to the modification of the set of instruments, which finally yielded handy tools and implants. Building further on the surgical skills and experiences gained (by the surgeons and the O.R. personnel), we increased our capacity to perform more and more immediate pelvic fixations. Emergency pelvic stabilizationswere performed in patientswith pelvic injuries who had hemodynamic instability, despite immediate shockmanagement during the diagnostic period. During thelast eleven years, 244 patientswith Tile B3 and Cpelvic injuries have been stabilized with 10-mm diameter cannulated IS screws percutaneously posteriorly. Fortyeight hemodynamically unstable patientswere stabilized in the first 2 h with iliosacral screw fixation. The percutaneous pelvic ring stabilization with 10-mm cannulated screws provedstrongenoughin bothersome casesaswell.
   
   @ARTICLE{VargaEJTES2010,
   AUTHOR = {Endre Varga and Balazs Erdohelyi},
   JOURNAL = {European Journal of Trauma and Emergency Surgery},
   TITLE = {Severe Pelvic Bleeding: The Role of Primary Internal Fixation},
   YEAR = {2010},
   NUMBER = {2},
   PAGES = {107-116},
   VOLUME = {36},
   PUBLISHER = {Urban & Vogel},
   DOI = {10.1007/s00068-010-1003-7},
   }

Conference articles

1. Csaba Domokos and Zoltan Kato. Affine puzzle: Realigning deformed object fragments without correspondences. In Kostas Daniilidis, Petros Maragos, and Nikos Paragios, editors, Proceedings of the European Conference on Computer Vision, volume 6312 of Lecture Notes in Computer Science, Crete, Greece, pages 777-790, September 2010. Springer Verlag. [PDF]
   Abstract: This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method through 2D and 3D affine transformations. The basic idea is to construct and solve a polynomial system of equations which provides the unknown parameters of the alignment. We have quantitatively evaluated the proposed algorithm on a large synthetic dataset containing 2D and 3D images. The results show that the method performs well and robust against segmentation errors. We also present experiments on 2D real images as well as on volumetric medical images applied to surgical planning.
   
   @INPROCEEDINGS{Domokos-Kato2010,
   AUTHOR = {Csaba Domokos and Zoltan Kato},
   BOOKTITLE = {Proceedings of the European Conference on Computer Vision},
   TITLE = {Affine puzzle: Realigning deformed object fragments without correspondences},
   YEAR = {2010},
   ADDRESS = {Crete, Greece},
   EDITOR = {Kostas Daniilidis and Petros Maragos and Nikos Paragios},
   MONTH = {September},
   PAGES = {777--790},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6312},
   }


2. Norbert Hantos and Peter Balazs. Image Enhancement by Median Filters in Algebraic Reconstruction Methods: An Experimental Study. In R. Boyle, B. Parvin, D. Koracin, R. Chung, M. Hammoud; Hussain, K.-H. Tan, R. Crawfis, D. Thalmann, D. Kao, and L. Avila, editors, Proceedings of the International Symposium on Visual Computing, volume 6455 of Lecture Notes in Computer Science, Las Vegas, USA, pages 339-348, nov--dec 2010. Springer Verlag. [PDF]
   Abstract: Algebraic methods for image reconstruction provide good solutions even if only few projections are available. However, they can create noisy images if the number of iterations or the computational time is limited. In this paper, we show how to decrease the effect of noise by using median filters during the iterations. We present an extensive study by applying filters of different sizes and in various times of the reconstruction process. Also, our test images are of different structural complexity. Our study concentrates on the ART and its discrete variant DART reconstruction methods.
   
   @INPROCEEDINGS{HantosBalazs2010,
   AUTHOR = {Norbert Hantos and Peter Balazs},
   BOOKTITLE = {Proceedings of the International Symposium on Visual Computing},
   TITLE = {Image Enhancement by Median Filters in Algebraic Reconstruction Methods: An Experimental Study},
   YEAR = {2010},
   ADDRESS = {Las Vegas, USA},
   EDITOR = {R. Boyle and B. Parvin and D. Koracin and R. Chung and Hammoud; Hussain, M. and K.-H. Tan and R. Crawfis and D. Thalmann and D. Kao and L. Avila},
   MONTH = {nov--dec},
   PAGES = {339-348},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6455},
   }


3. Peter Kardos, Gabor Nemeth, and Kalman Palagyi. Topology Preserving Parallel Smoothing for 3D Binary Images. In R.P. Barneva, V.E. Brimkov, H.A. Hauptman, R.M. Natal Jorge, and J.M.R.S. Tavares, editors, Proceedings of the International Symposium on Computational Modeling of Objects Represented in Images, volume 6026 of Lecture Notes in Computer Science, Buffalo, USA, pages 287-298, May 2010. Springer Verlag. [PDF] [doi:10.1007/978-3-642-12712-0_26]
   Abstract: This paper presents a new algorithm for smoothing 3D binary images in a topology preserving way. Our algorithm is a reduction operator: some border points that are considered as extremities are removed. The proposed method is composed of two parallel reduction operators. We are to apply our smoothing algorithm as an iteration-by-iteration pruning for reducing the noise sensitivity of 3D parallel surface-thinning algorithms. An efficient implementation of our algorithm is sketched and its topological correctness for (26,6) pictures is proved.
   
   @INPROCEEDINGS{NKP_CompIMAGE2010,
   AUTHOR = {Peter Kardos and Gabor Nemeth and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Symposium on Computational Modeling of Objects Represented in Images},
   TITLE = {Topology Preserving Parallel Smoothing for 3D Binary Images},
   YEAR = {2010},
   ADDRESS = {Buffalo, USA},
   EDITOR = {R.P. Barneva and V.E. Brimkov and H.A. Hauptman and Natal Jorge, R.M. and J.M.R.S. Tavares},
   MONTH = {May},
   PAGES = {287-298},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6026},
   DOI = {10.1007/978-3-642-12712-0_26},
   }


4. Milan Lesko, Zoltan Kato, Antal Nagy, Imre Gombos, Zsolt Torok, Laszlo Jr Vigh, and Laszlo Vigh. Live Cell Segmentation in Fluorescence Microscopy via Graph Cut. In Proceedings of the International Conference on Pattern Recognition, Istambul, Turkey, pages 1485-1488, August 2010. IAPR, IEEE. [PDF]
   Abstract: We propose a novel Markovian segmentation model which takes into account edge information. By construction, the model uses only pairwise interactions and its energy is submodular. Thus the exact energy minima is obtained via a max-flow/min-cut algorithm. The method has been quantitatively evaluated on synthetic images as well as on fluorescence microscopic images of live cells.
   
   @INPROCEEDINGS{Lesko-etal2010,
   AUTHOR = {Milan Lesko and Zoltan Kato and Antal Nagy and Imre Gombos and Zsolt Torok and Laszlo Jr Vigh and Laszlo Vigh},
   BOOKTITLE = {Proceedings of the International Conference on Pattern Recognition},
   TITLE = {Live Cell Segmentation in Fluorescence Microscopy via Graph Cut},
   YEAR = {2010},
   ADDRESS = {Istambul, Turkey},
   MONTH = {August},
   ORGANIZATION = {IAPR},
   PAGES = {1485--1488},
   PUBLISHER = {IEEE},
   }


5. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. Topology Preserving 2-Subfield 3D Thinning Algorithms. In Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, Innsbruck, Austria, pages 310-316, February 2010. IASTED. [PDF]
   Abstract: This paper presents a new family of 3D thinning algorithms for extracting skeleton-like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied: all points in a 3D picture are partitioned into two subsets which are alternatively activated. At each iteration, a parallel operator is applied for deleting some border points in the active subfield. The proposed algorithms are derived from Ma's sufficient conditions for topology preservation, and they use various endpoint characterizations.
   
   @INPROCEEDINGS{NKP_SPPRA_2010,
   AUTHOR = {Gabor Nemeth and Peter Kardos and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications},
   TITLE = {Topology Preserving 2-Subfield 3D Thinning Algorithms},
   YEAR = {2010},
   ADDRESS = {Innsbruck, Austria},
   MONTH = {February},
   PAGES = {310-316},
   PUBLISHER = {IASTED},
   }


6. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. Topology Preserving 3D Thinning Algorithms Using Four and Eight Subfields. In Aurelio Campilho and Mohamed Kamel, editors, Proceedings of the International Conference on Image Analysis and Recognition, volume 6111 of Lecture Notes in Computer Science, Povoa de Varzim, Portugal, pages 316-325, June 2010. Springer Verlag. [PDF] [doi:10.1007/978-3-642-13772-3_32]
   Abstract: Thinning is a frequently applied technique for extracting skeleton-like shape features (i.e., centerline, medial surface, and topological kernel) from volumetric binary images. Subfield-based thinning algorithms partition the image into some subsets which are alternatively activated, and some points in the active subfield are deleted. This paper presents a set of new 3D parallel subfield-based thinning algorithms that use four and eight subfields. The three major contributions of this paper are: 1) The deletion rules of the presented algorithms are derived from some sufficient conditions for topology preservation. 2) A novel thinning scheme is proposed that uses iteration-level endpoint checking. 3) Various characterizations of endpoints yield different algorithms.
   
   @INPROCEEDINGS{NKP_ICIAR_2010,
   AUTHOR = {Gabor Nemeth and Peter Kardos and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Conference on Image Analysis and Recognition},
   TITLE = {Topology Preserving 3D Thinning Algorithms Using Four and Eight Subfields},
   YEAR = {2010},
   ADDRESS = {Povoa de Varzim, Portugal},
   EDITOR = {Aurelio Campilho and Mohamed Kamel},
   MONTH = {June},
   PAGES = {316-325},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6111},
   DOI = {10.1007/978-3-642-13772-3_32},
   }


7. Attila Tanacs, Natasa Sladoje, Joakim Lindblad, and Zoltan Kato. Estimation of linear deformations of 3D objects. In Proceedings of the International Conference on Image Processing, Hong Kong, China, pages 153-156, September 2010. IEEE, IEEE. [PDF]
   Abstract: We propose a registration method to find affine transformations between 3D objects by constructing and solving an overdetermined system of polynomial equations. We utilize voxel coverage information for more precise object boundary description. An iterative solution enables us to easily adjust the method to recover \eg rigid-body and similarity transformations. Synthetic tests show the advantage of the voxel coverage representation, and reveal the robustness properties of our method against different types of segmentation errors. The method is tested on a real medical CT volume..
   
   @INPROCEEDINGS{Tanacs-etal2010,
   AUTHOR = {Attila Tanacs and Natasa Sladoje and Joakim Lindblad and Zoltan Kato},
   BOOKTITLE = {Proceedings of the International Conference on Image Processing},
   TITLE = {Estimation of linear deformations of 3D objects},
   YEAR = {2010},
   ADDRESS = {Hong Kong, China},
   MONTH = {September},
   ORGANIZATION = {IEEE},
   PAGES = {153--156},
   PUBLISHER = {IEEE},
   }


8. Laszlo Varga, Peter Balazs, and Antal Nagy. Direction-dependency of a binary tomographic reconstruction algorithm. In R.P. Barneva, V.E. Brimkov, H.A. Hauptman, R.M. Natal Jorge, and J.M.R.S. Tavares, editors, Proceedings of the International Symposium on Computational Modeling of Objects Represented in Images, volume 6026 of Lecture Notes in Computer Science, Buffalo, USA, pages 242-253, May 2010. Springer Verlag. [PDF] [doi:10.1007/978-3-642-12712-0_22]
   Abstract: We study how the quality of an image reconstructed by a binary tomographic algorithm depends on the direction of the observed object in the scanner, if only a few projections are available. To do so we conduct experiments on a set of software phantoms by reconstructing them form different projection sets using an algorithm based on D.C. programming (a method for minimizing the difference of convex functions), and compare the accuracy of the corresponding reconstructions by two suitable approaches. Based on the experiments, we discuss consequences on applications arising from the field of non-destructive testing, as well.
   
   @INPROCEEDINGS{VargaBalazsNagy2010,
   AUTHOR = {Laszlo Varga and Peter Balazs and Antal Nagy},
   BOOKTITLE = {Proceedings of the International Symposium on Computational Modeling of Objects Represented in Images},
   TITLE = {Direction-dependency of a binary tomographic reconstruction algorithm},
   YEAR = {2010},
   ADDRESS = {Buffalo, USA},
   EDITOR = {R.P. Barneva and V.E. Brimkov and H.A. Hauptman and Natal Jorge, R.M. and J.M.R.S. Tavares},
   MONTH = {May},
   PAGES = {242-253},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6026},
   DOI = {10.1007/978-3-642-12712-0_22},
   }


9. Laszlo Varga, Peter Balazs, and Antal Nagy. Projection Selection Algorithms for Discrete Tomography. In J. Blanc-Talon, D. Bone, W. Philips, D. Popescu, and P. Scheunders, editors, Proceedings of the Advanced Concepts for Intelligent Vision Systems, volume 6474 of Lecture Notes in Computer Science, Sydney, Australia, pages 390-401, December 2010. Springer Verlag. [PDF]
   Abstract: In this paper we study how the choice of projection angles affect the quality of the discrete tomographic reconstruction of an object. We supply four different strategies for selecting projection angle sets and compare them by conducting experiments on a set of software phantoms. We also discuss some consequences of our observations. Furthermore, we introduce a possible application of the proposed angle selection algorithms as well.
   
   @INPROCEEDINGS{ACIVS2010:Varga,
   AUTHOR = {Laszlo Varga and Peter Balazs and Antal Nagy},
   BOOKTITLE = {Proceedings of the Advanced Concepts for Intelligent Vision Systems},
   TITLE = {Projection Selection Algorithms for Discrete Tomography},
   YEAR = {2010},
   ADDRESS = {Sydney, Australia},
   EDITOR = {J. Blanc-Talon and D. Bone and W. Philips and D. Popescu and P. Scheunders},
   MONTH = {December},
   PAGES = {390-401},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6474},
   }

  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