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 2011

Books and proceedings

1. Zhigou Cao, Aaron Fenster, Laszlo G. Nyul, and Chao Cai, editors. MIPPR 2011: Multispectral Image Acquisition, Processing, and Analysis, volume 8002 of SPIE Proceedings. SPIE, GuiLin, China, November 2011. [WWW] [doi:10.1117/12.910237]
   
   @BOOK{Cao_et_al2011,
   PUBLISHER = {SPIE},
   TITLE = {MIPPR 2011: Multispectral Image Acquisition, Processing, and Analysis},
   YEAR = {2011},
   EDITOR = {Zhigou Cao and Aaron Fenster and Laszlo G. Nyul and Chao Cai},
   ADDRESS = {GuiLin, China},
   MONTH = {November},
   SERIES = {SPIE Proceedings},
   VOLUME = {8002},
   URL = {http://spiedigitallibrary.org/proceedings/resource/2/psisdg/8002/1/800201_1},
   DOI = {10.1117/12.910237},
   }

Articles in journal or book chapters

1. Peter Kardos. Sufficient conditions for order-independency in sequential thinning. Acta Cybernetica, 20:87-100, 2011. [PDF]
   Abstract: The main issue of this paper is to introduce some conditions for template-based sequential thinning that are capable of producing the same skeleton for a given binary image, independent of the visiting order of object points. As an example, we introduce two order-independent thinning algorithms for 2D binary images that satisfy these conditions.
   
   @ARTICLE{K_ACTA2011,
   AUTHOR = {Peter Kardos},
   JOURNAL = {Acta Cybernetica},
   TITLE = {Sufficient conditions for order-independency in sequential thinning},
   YEAR = {2011},
   PAGES = {87-100},
   VOLUME = {20},
   }


2. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. 2D parallel thinning and shrinking based on sufficient conditions for topology preservation. Acta Cybernetica, 20:125-144, 2011. [PDF]
   Abstract: Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient conditions for topology preserving parallel reductions and fifty-four new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints.
   
   @ARTICLE{NKP_ACTA2011,
   AUTHOR = {Gabor Nemeth and Peter Kardos and Kalman Palagyi},
   JOURNAL = {Acta Cybernetica},
   TITLE = {2D parallel thinning and shrinking based on sufficient conditions for topology preservation},
   YEAR = {2011},
   PAGES = {125-144},
   VOLUME = {20},
   }


3. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. Thinning combined with iteration-by-iteration smoothing for 3D binary images. Graphical Models, 73:335-345, November 2011. [PDF]
   Abstract: In this work we present a new thinning scheme for reducing the noise sensitivity of 3D thinning algorithms. It uses iteration-by-iteration smoothing that removes some border points that are considered as extremities. The proposed smoothing algorithm is composed of two parallel topology preserving reduction operators. An efficient implementation of our algorithm is sketched and its topological correctness for (26,6) pictures is proved.
   
   @ARTICLE{NemethKardosPalagyi2011GMOD,
   AUTHOR = {Gabor Nemeth and Peter Kardos and Kalman Palagyi},
   JOURNAL = {Graphical Models},
   TITLE = {Thinning combined with iteration-by-iteration smoothing for 3D binary images},
   YEAR = {2011},
   MONTH = {November},
   PAGES = {335-345},
   VOLUME = {73},
   ADDRESS = {San Diego, CA, USA},
   }


4. Gabor Nemeth and Kalman Palagyi. Topology preserving parallel thinning algorithms. International Journal of Imaging Systems and Technology, 21:37-44, 2011. [PDF] [doi:DOI 10.1002/ima.20272]
   Abstract: Thinning is an iterative object reduction technique for extracting medial curves from binary objects. During a thinning process, some border points that satisfy certain topological and geometric constraints are deleted in iteration steps. Parallel thinning algorithms are composed of parallel reduction operators that delete a set of object points simultaneously. This article presents 21 parallel thinning algorithms for (8,4) binary pictures that are derived from the sufficient conditions for topology preservation accommodated to the three parallel thinning approaches.
   
   @ARTICLE{NP_IJIST2011,
   AUTHOR = {Gabor Nemeth and Kalman Palagyi},
   JOURNAL = {International Journal of Imaging Systems and Technology},
   TITLE = {Topology preserving parallel thinning algorithms},
   YEAR = {2011},
   PAGES = {37-44},
   VOLUME = {21},
   DOI = {DOI 10.1002/ima.20272},
   }


5. Laszlo Varga, Peter Balazs, and Antal Nagy. Direction-dependency of binary tomographic reconstruction algorithms. Graphical Models, 73:365-375, November 2011. [PDF]
   Abstract: In this work we study the relation between the quality of a binary tomographic reconstruction and the choice of angles of the projections. We conduct experiments on a set of software phantoms by reconstructing them from different projection sets using three different discrete tomography reconstruction algorithms, and compare the accuracy of the corresponding reconstructions with suitable approaches. To validate our results for possible real-world applications, we conduct the experiments by adding random noise of different characteristics to the simulated projection data, and by applying small topological changes on the phantom images as well. In addition, we also discuss some consequences of the angle-selection dependency and possible practical applications arising from the field of non-destructive testing, too.
   
   @ARTICLE{VargaBalazsNagy2011GM,
   AUTHOR = {Laszlo Varga and Peter Balazs and Antal Nagy},
   JOURNAL = {Graphical Models},
   TITLE = {Direction-dependency of binary tomographic reconstruction algorithms},
   YEAR = {2011},
   MONTH = {November},
   PAGES = {365-375},
   VOLUME = {73},
   PUBLISHER = {Academic Press Professional, Inc.},
   }


6. Laszlo Varga, Peter Balazs, and Antal Nagy. Projection selection dependency in binary tomography. Acta Cybernetica, 20:167-187, 2011. [PDF]
   Abstract: It has already been shown that the choice of projection angles can significantly influence the quality of reconstructions in discrete tomography. In this contribution we summarize and extend the previous results by explaining and demonstrating the effects of projection selection dependency, in a set of experimental software tests. We perform reconstructions of software phantoms, by using different binary tomography reconstruction algorithms, from different equiangular and non-equiangular projections sets, under various conditions (i.e., when the objects to be reconstructed undergo slight topological changes, or the projection data is affected by noise) and compare the results with suitable approaches. Based on our observations, we reveal regularities in the resulting data and discuss possible consequences of such projection selection dependency in binary tomography.
   
   @ARTICLE{VargaBalazsNagy2011Acta,
   AUTHOR = {Laszlo Varga and Peter Balazs and Antal Nagy},
   JOURNAL = {Acta Cybernetica},
   TITLE = {Projection selection dependency in binary tomography},
   YEAR = {2011},
   PAGES = {167-187},
   VOLUME = {20},
   }

Conference articles

1. Peter Kardos and Kalman Palagyi. On topology preservation for hexagonal parallel thinning algorithms. In J.K. Aggarwal, R.P. Barneva, V.E. Brimkov, K.N. Koroutchev, and E.R. Korutcheva, editors, Proceedings of the International Workshop on Combinatorial Image Analysis, volume 6636 of Lecture Notes in Computer Science, Madrid, Spain, pages 31-42, May 2011. Springer Verlag. [PDF]
   Abstract: Thinning is an iterative layer-by-layer erosion until only the skeleton-like shape features of the objects are left. This paper presents a family of new 3D parallel thinning algorithms that are based on our new sufficient conditions for 3D parallel reduction operators to preserve topology. The strategy which is used is called subiteration-based: each iteration step is composed of six parallel reduction operators according to the six main directions in 3D. The major contributions of this paper are: 1) Some new sufficient conditions for topology preserving parallel reductions are introduced. 2) A new 6-subiteration thinning scheme is proposed. Its topological correctness is guaranteed, since its deletion rules are derived from our sufficient conditions for topology preservation. 3) The proposed thinning scheme with different characterizations of endpoints yields various new algorithms for extracting centerlines and medial surfaces from 3D binary pictures.
   
   @INPROCEEDINGS{KP_IWCIA2011,
   AUTHOR = {Peter Kardos and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Workshop on Combinatorial Image Analysis},
   TITLE = {On topology preservation for hexagonal parallel thinning algorithms},
   YEAR = {2011},
   ADDRESS = {Madrid, Spain},
   EDITOR = {J.K. Aggarwal and R.P. Barneva and V.E. Brimkov and K.N. Koroutchev and E.R. Korutcheva},
   MONTH = {May},
   PAGES = {31-42},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6636},
   }


2. Peter Kardos and Kalman Palagyi. Order-independent sequential thinning in arbitrary dimensions. In Proceedings of the IASTED International Conference on Signal and Image Processing and Applications, Crete, Greece, pages 129-134, June 2011. IASTED. [PDF] [doi:DOI: 10.2316/P.2011.738-021]
   Abstract: Skeletons are region based shape descriptors that play important role in shape representation. This paper introduces a novel sequential thinning approach for n-dimensional binary objects (n=1,2,3,...). Its main strength lies in its order-independency, i.e., it can produce the same skeletons for any visiting orders of border points. Furthermore, this is the first scheme in this field that is also applicable for higher dimensions.
   
   @INPROCEEDINGS{KP_SIPA2011,
   AUTHOR = {Peter Kardos and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the IASTED International Conference on Signal and Image Processing and Applications},
   TITLE = {Order-independent sequential thinning in arbitrary dimensions},
   YEAR = {2011},
   ADDRESS = {Crete, Greece},
   MONTH = {June},
   PAGES = {129-134},
   PUBLISHER = {IASTED},
   DOI = {DOI: 10.2316/P.2011.738-021},
   }


3. Jhimli Mitra, Zoltan Kato, Robert Marti, Arnau Oliver, Xavier Llado, Soumya Ghose, Joan C. Vilanova, and Fabrice Meriaudeau. A Non-linear Diffeomorphic Framework for Prostate Multimodal Registration. In Proceedings of International Conference on Digital Image Computing: Techniques and Applications, Noosa, Queensland, Australia, pages 31-36, December 2011. IEEE. [PDF]
   Abstract: This paper presents a novel method for non-rigid registration of prostate multimodal images based on a nonlinear framework. The parametric estimation of the non-linear diffeomorphism between the 2D fixed and moving images has its basis in solving a set of non-linear equations of thin-plate splines. The regularized bending energy of the thin-plate splines along with the localization error of established correspondences is jointly minimized with the fixed and transformed image difference; where, the transformed image is represented by the set of non-linear equations defined over the moving image. The traditional thin-plate splines with established correspondences may provide good registration of the anatomical targets inside the prostate but may fail to provide improved contour registration. On the contrary, the proposed framework maintains the accuracy of registration in terms of overlap due to the non-linear thinplate spline functions while also producing smooth deformations of the anatomical structures inside the prostate as a result of established corrspondences. The registration accuracies of the proposed method are evaluated in 20 pairs of prostate midgland ultrasound and magnetic resonance images in terms of Dice similarity coefficient with an average of 0.982 ± 0.004, average 95% Hausdorff distance of 1.54 ± 0.46 mm and mean target registration and target localization errors of 1.90±1.27 mm and 0.15 ± 0.12 mm respectively.
   
   @INPROCEEDINGS{Mitra-etal2011,
   AUTHOR = {Jhimli Mitra and Zoltan Kato and Robert Marti and Arnau Oliver and Xavier Llado and Soumya Ghose and Joan C. Vilanova and Fabrice Meriaudeau},
   BOOKTITLE = {Proceedings of International Conference on Digital Image Computing: Techniques and Applications},
   TITLE = {A Non-linear Diffeomorphic Framework for Prostate Multimodal Registration},
   YEAR = {2011},
   ADDRESS = {Noosa, Queensland, Australia},
   MONTH = {December},
   PAGES = {31--36},
   PUBLISHER = {IEEE},
   }


4. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. A family of topology-preserving 3D parallel 6-subiteration thinning algorithms. In J.K. Aggarwal, R.P. Barneva, V.E. Brimkov, K.N. Koroutchev, and E.R. Korutcheva, editors, Proceedings of the International Workshop on Combinatorial Image Analysis, volume 6636 of Lecture Notes in Computer Science, Madrid, Spain, pages 17-30, May 2011. Springer Verlag. [PDF]
   Abstract: Topology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient conditions, we propose a new parallel thinning algorithm and prove its topological correctness.
   
   @INPROCEEDINGS{NKP_IWCIA2011,
   AUTHOR = {Gabor Nemeth and Peter Kardos and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Workshop on Combinatorial Image Analysis},
   TITLE = {A family of topology-preserving 3D parallel 6-subiteration thinning algorithms},
   YEAR = {2011},
   ADDRESS = {Madrid, Spain},
   EDITOR = {J.K. Aggarwal and R.P. Barneva and V.E. Brimkov and K.N. Koroutchev and E.R. Korutcheva},
   MONTH = {May},
   PAGES = {17-30},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6636},
   }


5. Jozsef Nemeth, Zoltan Kato, and Ian Jermyn. A Multi-Layer 'Gas of Circles' Markov Random Field Model for the Extraction of Overlapping Near-Circular Objects. In Jacques Blanc-Talon, Wilfried Philips, Dan Popescu, Paul Scheunders, and Richard Kleihorst, editors, Proceedings of the Advanced Concepts for Intelligent Vision Systems, volume 6915 of Lecture Notes in Computer Science, Ghent, Belgium, pages 171-182, August 2011. Springer Verlag. [PDF]
   Abstract: We propose a multi-layer binary Markov random field (MRF) model that assigns high probability to object configurations in the image domain consisting of an unknown number of possibly touching or overlapping near-circular objects of approximately a given size. Each layer has an associated binary field that specifies a region corresponding to objects. Overlapping objects are represented by regions in different layers. Within each layer, long-range interactions favor connected components of approximately circular shape, while regions in different layers that overlap are penalized. Used as a prior coupled with a suitable data likelihood, the model can be used for object extraction from images, e.g. cells in biological images or densely-packed tree crowns in remote sensing images. We present a theoretical and experimental analysis of the model, and demonstrate its performance on various synthetic and biomedical images.
   
   @INPROCEEDINGS{Nemeth-etal2011,
   AUTHOR = {Jozsef Nemeth and Zoltan Kato and Ian Jermyn},
   BOOKTITLE = {Proceedings of the Advanced Concepts for Intelligent Vision Systems},
   TITLE = {A Multi-Layer 'Gas of Circles' Markov Random Field Model for the Extraction of Overlapping Near-Circular Objects},
   YEAR = {2011},
   ADDRESS = {Ghent, Belgium},
   EDITOR = {Jacques Blanc-Talon and Wilfried Philips and Dan Popescu and Paul Scheunders and Richard Kleihorst},
   MONTH = {August},
   PAGES = {171--182},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {6915},
   }


6. Gabor Nemeth and Kalman Palagyi. 2D parallel thinning algorithms based on isthmus-preservation. In S. Loncaric, G. Ramponi, and D. Sersic, editors, Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA), Dubrovnik, Croatia, pages 585-590, September 2011. IEEE. [PDF]
   Abstract: Skeletons are widely used shape descriptors which summarize the general form of binary objects. A technique to obtain skeletons is the thinning, that is an iterative layer-by-layer erosion in a topology-preserving way. Conventional thinning algorithms preserve line endpoints to provide important geometric information relative to the object to be represented. Bertrand and Couprie proposed an alternative strategy by accumulating isthmus points that are line interior points. In this paper we present six new 2D parallel thinning algorithms that are derived from some sufficient conditions for topology preserving reductions and based on isthmus-preservation.
   
   @INPROCEEDINGS{NemethPalagyiISPA2011,
   AUTHOR = {Gabor Nemeth and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)},
   TITLE = {2D parallel thinning algorithms based on isthmus-preservation},
   YEAR = {2011},
   ADDRESS = {Dubrovnik, Croatia},
   EDITOR = {S. Loncaric and G. Ramponi and D. Sersic},
   MONTH = {September},
   PAGES = {585-590},
   PUBLISHER = {IEEE},
   }


7. Attila Tanacs and Zoltan Kato. Fast linear registration of 3D objects segmented from medical images. In Proceedings of the International Conference on BioMedical Engineering and Informatics (BMEI), Shanghai, China, pages 299-303, October 2011. IEEE. [PDF]
   Abstract: In this paper a linear registration framework is used for medical image registration using segmented binary objects. The method is best suited for problems where the segmentation is available, but we also propose a general bone segmentation approach for CT images.We focus on the case when the objects to be registered differ considerably because of segmentation errors. We check the applicability of the method to bone segmentation of pelvic and thoracic CT images. Comparison is also made against a classical mutual information-based registration method.
   
   @INPROCEEDINGS{TanacsKatoBMEI2011,
   AUTHOR = {Attila Tanacs and Zoltan Kato},
   BOOKTITLE = {Proceedings of the International Conference on BioMedical Engineering and Informatics (BMEI)},
   TITLE = {Fast linear registration of 3D objects segmented from medical images},
   YEAR = {2011},
   ADDRESS = {Shanghai, China},
   MONTH = {October},
   PAGES = {299-303},
   PUBLISHER = {IEEE},
   }

  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