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 2009

Books and proceedings

1. Jayaram K. Udupa, Nong Sang, Laszlo G. Nyul, and Hengqing Tong, editors. MIPPR 2009: Multispectral Image Acquisition and Processing, volume 7494 of SPIE Proceedings. SPIE, Yichang, China, November 2009. [WWW] [doi:10.1117/12.839775]
   @BOOK{spie:7494,
   PUBLISHER = {SPIE},
   TITLE = {MIPPR 2009: Multispectral Image Acquisition and Processing},
   YEAR = {2009},
   EDITOR = {Jayaram K. Udupa and Nong Sang and Laszlo G. Nyul and Hengqing Tong},
   ADDRESS = {Yichang, China},
   MONTH = {November},
   SERIES = {SPIE Proceedings},
   VOLUME = {7494},
   URL = {http://link.aip.org/link/?PSI/7494/749401/1},
   DOI = {10.1117/12.839775},
   }
   

Articles in journal or book chapters

1. Gabor Nemeth and Kalman Palagyi. Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation. In Progress in Combinatorial Image Analysis, pages 183-194. Research Publishing, 2009. [PDF]
   Abstract: Thinning is a widely used pre?processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents three thinning algorithms according to three kinds of endpoint criteria. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. The proposed algorithms are based on Ronse?s sufficient conditions for topology preservation.
   @INCOLLECTION{NemethPalagyi09,
   AUTHOR = {Gabor Nemeth and Kalman Palagyi},
   BOOKTITLE = {Progress in Combinatorial Image Analysis},
   PUBLISHER = {Research Publishing},
   TITLE = {Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation},
   YEAR = {2009},
   PAGES = {183-194},
   }
   


2. Peter Balazs. A benchmark set for the reconstruction of hv-convex discrete sets. Discrete Applied Mathematics, 157(16):3446-3456, 2009. Note: Combinatorial Approach to Image Analysis. [WWW] [PDF] [doi:10.1016/j.dam.2009.02.019]
   Abstract: In this paper we summarize the most important generation methods developed for the subclasses of hv-convex discrete sets. We also present some new generation techniques to complement the former ones thus making it possible to design a complete benchmark set for testing the performance of reconstruction algorithms on the class of hv-convex discrete sets and its subclasses. By using this benchmark set the paper also collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kinds of discrete sets.
   @ARTICLE{Balazs2009dam,
   AUTHOR = {Peter Balazs},
   JOURNAL = {Discrete Applied Mathematics},
   TITLE = {A benchmark set for the reconstruction of hv-convex discrete sets},
   YEAR = {2009},
   NOTE = {Combinatorial Approach to Image Analysis},
   NUMBER = {16},
   PAGES = {3446-3456},
   VOLUME = {157},
   PUBLISHER = {Elsevier},
   URL = {http://www.sciencedirect.com/science/article/B6TYW-4W0343M-1/2/bc07c7880c7b73ebe317cdf4327b9030},
   DOI = {10.1016/j.dam.2009.02.019},
   }
   


3. Csaba Benedek, Tamas Sziranyi, Zoltan Kato, and Josiane Zerubia. Detection of Object Motion Regions in Aerial Image Pairs with a Multilayer Markovian Model. IEEE Transactions on Image Processing, 18(10):2303-2315, October 2009. [PDF] [doi:10.1109/TIP.2009.2025808]
   Abstract: We propose a new Bayesian method for detecting the regions of object displacements in aerial image pairs. We use a robust but coarse 2D image registration algorithm. Our main challenge is to eliminate the registration errors from the extracted change map. We introduce a three-layer Markov random field (L^3MRF) model which integrates information from two different features, and ensures connected homogenous regions in the segmented images. Validation is given on real aerial photos.
   @ARTICLE{Benedek-etal2009,
   AUTHOR = {Csaba Benedek and Tamas Sziranyi and Zoltan Kato and Josiane Zerubia},
   JOURNAL = {IEEE Transactions on Image Processing},
   TITLE = {Detection of Object Motion Regions in Aerial Image Pairs with a Multilayer Markovian Model},
   YEAR = {2009},
   MONTH = {October},
   NUMBER = {10},
   PAGES = {2303--2315},
   VOLUME = {18},
   PUBLISHER = {IEEE},
   DOI = {10.1109/TIP.2009.2025808},
   }
   


4. Mihaly Gara, Tamas Samuel Tasi, and Peter Balazs. Learning connectedness and convexity of binary images from their projections. Pure Mathematics and Applications, 20:1-2:27-48, 2009. [PDF]
   Abstract: In this paper we investigate the retrieval of geometrical information (especially, convexity and connectedness) of binary images from their projections which can be useful in binary tomography to facilitate the task of reconstruction. Supposing that the projections are the features of the images, we study how decision trees, neural networks, and nearest neighbor learning algorithms perform in classifying binary images with different connectedness and convexity properties.
   @ARTICLE{GaraTasiBalazs2009,
   AUTHOR = {Mihaly Gara and Tamas Samuel Tasi and Peter Balazs},
   JOURNAL = {Pure Mathematics and Applications},
   TITLE = {Learning connectedness and convexity of binary images from their projections},
   YEAR = {2009},
   PAGES = {27-48},
   VOLUME = {20:1-2},
   }
   


5. Peter Horvath, Ian Jermyn, Zoltan Kato, and Josiane Zerubia. A higher-order active contour model of a `gas of circles' and its application to tree crown extraction. Pattern Recognition, 42(5):699-709, May 2009. [PDF] [doi:10.1016/j.patcog.2008.09.008]
   Abstract: We present a model of a `gas of circles': regions in the image domain composed of a unknown number of circles of approximately the same radius. The model has applications to medical, biological, nanotechnological, and remote sensing imaging. The model is constructed using higher-order active contours (HOACs) in order to include non-trivial prior knowledge about region shape without constraining topology. The main theoretical contribution is an analysis of the local minima of the HOAC energy that allows us to guarantee stable circles, fix one of the model parameters, and constrain the rest. We apply the model to tree crown extraction from aerial images of plantations. Numerical experiments both confirm the theoretical analysis and show the empirical importance of the prior shape information.
   @ARTICLE{Horvath-etal2009,
   AUTHOR = {Peter Horvath and Ian Jermyn and Zoltan Kato and Josiane Zerubia},
   JOURNAL = {Pattern Recognition},
   TITLE = {A higher-order active contour model of a `gas of circles' and its application to tree crown extraction},
   YEAR = {2009},
   MONTH = {May},
   NUMBER = {5},
   PAGES = {699--709},
   VOLUME = {42},
   PUBLISHER = {Elsevier},
   DOI = {10.1016/j.patcog.2008.09.008},
   }
   


6. Antal Nagy. Emisszios Diszkret Tomografiai Modszerek Alkalmazasa Faktorstrukturakra. Alkalmazott Matematikai Lapok, 26:329-350, 2009. [PDF]
   Abstract: Az utobbi evekben egy uj fajta diszkret tomografiai problema kutatasa kezdodott el [3], amit emisszios diszkret tomografianak, roviden EDT-nek nevezunk. Ebben a modellben a teljes ter valamilyen homogen abszorbens anyaggal van kitoltve es a rekonstrualando fuggveny egy targyat reprezent al, aminek a pontjai (radioaktiv) sugarzast bocsatanak ki a kornyezo terbe. A targy egy pontjabol kibocsatott kezdeti aktivitas egy resze az abszorbens anyagban elnyelodik a pont es a detektor tavolsagatol fuggoen. A rekonstrukcio kiindulasara szolgalo vetuletek tehat nem tisztan az emissziora vonatkozo adatokat tartalmazzak, hanem az abszorpcio hatasat is. A fo celunk az volt, hogy olyan strukturak terfogatat becsuljuk meg nehany (jelen esetben 4) vetuletbol, melyeknek intenzitasa az idoben valtozik. Mindegyik vetulet adott ido alatt lett elkeszitve, melyek az adott pillanatban felvett kepek sorozatabol allt. A strukturak vetuletei eloszor faktoranalizissel lettek elkulonitve a teljes vetuleti adatsorozatot felhasznalva. Mivel a faktoranalizis a strukturak vetuleteit csak egy szorzo konstans [4] erejeig kepes meghatarozni, ezert a korabbi heurisztikus modszer mellett egy uj modszert is bemutatunk, mely az abszorpcios vetuletek konzisztencia feltetelen [2, 8] alapszik. Ezek utan a mindegyik strukturat kulon-kulon rekonstrualtuk az adott szorzo konstansokkal modositott faktor vetuletekbŽl diszkret tomografiai modszerrel. Az igy kapott terfogatokat az adott strukturak eseten osszehasonlitottuk a cikkben az adott szorzo konstansokat meghatarozo modszerek eseten.
   @ARTICLE{NagyA_AlkmatLapok2009,
   AUTHOR = {Antal Nagy},
   JOURNAL = {Alkalmazott Matematikai Lapok},
   TITLE = {Emisszios Diszkret Tomografiai Modszerek Alkalmazasa Faktorstrukturakra},
   YEAR = {2009},
   PAGES = {329--350},
   VOLUME = {26},
   }
   

Conference articles

1. Peter Balazs. Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections. In Petra Wiederhold and Reneta P. Barneva, editors, Proceedings of the International Workshop on Combinatorial Image Analysis, volume 5852 of Lecture Notes in Computer Science, Playa del Carmen, Mexico, pages 280-288, November 2009. Springer Verlag. [PDF] [doi:10.1007/978-3-642-10210-3]
   Abstract: The problem of reconstructing some special hv-convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class - the class of hv-convex canonical discrete sets - and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well.
   @INPROCEEDINGS{Balazs2009iwcia,
   AUTHOR = {Peter Balazs},
   BOOKTITLE = {Proceedings of the International Workshop on Combinatorial Image Analysis},
   TITLE = {Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections},
   YEAR = {2009},
   ADDRESS = {Playa del Carmen, Mexico},
   EDITOR = {Petra Wiederhold and Reneta P. Barneva},
   MONTH = {November},
   PAGES = {280-288},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {5852},
   DOI = {10.1007/978-3-642-10210-3},
   }
   


2. Peter Balazs and Mihaly Gara. An Evolutionary Approach for Object-Based Image Reconstruction Using Learnt Priors. In Arnt-Borre Salberg, Jon Yngve Hardeberg, and Robert Jenssen, editors, Proceedings of the Scandinavian Conference on Image Analysis, volume 5575 of Lecture Notes in Computer Science, Oslo, Norway, pages 520-529, June 2009. Springer Verlag. [PDF]
   Abstract: In this paper we present a novel algorithm for reconstructing binary images containing objects which can be described by some parameters. In particular, we investigate the problem of reconstructing binary images representing disks from four projections. We develop a genetic algorithm for this and similar problems. We also discuss how prior information on the number of disks can be incorporated into the reconstruction in order to obtain more accurate images. In addition, we present a method to exploit such kind of knowledge from the projections themselves. Experiments on artificial data are also conducted.
   @INPROCEEDINGS{BalazsGara2009,
   AUTHOR = {Peter Balazs and Mihaly Gara},
   BOOKTITLE = {Proceedings of the Scandinavian Conference on Image Analysis},
   TITLE = {An Evolutionary Approach for Object-Based Image Reconstruction Using Learnt Priors},
   YEAR = {2009},
   ADDRESS = {Oslo, Norway},
   EDITOR = {Arnt-Borre Salberg and Jon Yngve Hardeberg and Robert Jenssen},
   MONTH = {June},
   PAGES = {520-529},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {5575},
   }
   


3. Tamas Blaskovics, Zoltan Kato, and Ian Jermyn. A Markov Random Field Model for Extracting Near-Circular Shapes. In Proceedings of the International Conference on Image Processing, Cairo, Egypt, pages 1073-1076, November 2009. IEEE, IEEE. [PDF]
   Abstract: We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We construct the model by discretizing the 'gas of circles' phase field model in a principled way, thereby creating an 'equivalent' MRF. The behaviour of the resulting MRF model is analyzed, and the performance of the new model is demonstrated on various synthetic images as well as on the problem of tree crown detection in aerial images.
   @INPROCEEDINGS{Blaskovics-etal2009a,
   AUTHOR = {Tamas Blaskovics and Zoltan Kato and Ian Jermyn},
   BOOKTITLE = {Proceedings of the International Conference on Image Processing},
   TITLE = {A Markov Random Field Model for Extracting Near-Circular Shapes},
   YEAR = {2009},
   ADDRESS = {Cairo, Egypt},
   MONTH = {November},
   ORGANIZATION = {IEEE},
   PAGES = {1073--1076},
   PUBLISHER = {IEEE},
   }
   


4. Csaba Domokos and Zoltan Kato. Affine Alignment of Compound Objects: A Direct Approach. In Proceedings of the International Conference on Image Processing, Cairo, Egypt, pages 169-172, November 2009. IEEE, IEEE. [PDF]
   Abstract: A direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of equations. The basic idea is to fit Gaussian densities over the objects yielding covariant functions, which preserves the effect of the unknown transformation. Based on these functions, linear equations are constructed by integrating nonlinear functions over appropriate domains. The main advantages are: linear complexity, easy implementation, works without any time consuming optimization or established correspondences. Comparative tests show that it outperforms state-ofthe- art methods both in terms of precision, robustness and complexity.
   @INPROCEEDINGS{Domokos-Kato2009b,
   AUTHOR = {Csaba Domokos and Zoltan Kato},
   BOOKTITLE = {Proceedings of the International Conference on Image Processing},
   TITLE = {Affine Alignment of Compound Objects: A Direct Approach},
   YEAR = {2009},
   ADDRESS = {Cairo, Egypt},
   MONTH = {November},
   ORGANIZATION = {IEEE},
   PAGES = {169--172},
   PUBLISHER = {IEEE},
   }
   


5. Balazs Erdohelyi and Endre Varga. Semi-automatic bone fracture reduction in surgical planning. In Proceedings of the International Conference on Computer Assisted Radiology and Surgery (CARS), volume 4 of International Journal of Computer Assisted Radiology and Surgery, Berlin, Germany, pages S98-S99, June 2009. Springer Verlag. [PDF] [doi:10.1007/s11548-009-0314-1]
   Abstract: The surgical intervention of complex bone fractures has to be planned very carefully, especially for such a complex region as the pelvic ring. The computer aided surgical planning is done before the actual surgery takes place and its main purpose is to gather more information about the dislocation of the bone fragments and to arrange the surgical implants to be inserted. With the help of finite element analysis even the biomechanical stability of the whole plan can be predicted. To create such a plan the following steps are performed. First, the CT dataset of the patient is segmented [1], which enables us to treat the different bones and broken fragments separately. Next the surface of this volumetric dataset is determined [2] and presented in a 3D environment. Since the fragments may have moved during the fracture, it is essential to move and rotate them back to their original anatomic position. Without this reduction, no implants can be inserted, since the final locations of the fragments are unknown. Previous solutions to the fracture reduction problem included moving the fragments with the mouse, or a special 3D haptic device. The former is not intuitive to use since the mouse is only 2D, and the later is expensive and still requires learning.
   @INPROCEEDINGS{ErdohelyiCARS2009,
   AUTHOR = {Balazs Erdohelyi and Endre Varga},
   BOOKTITLE = {Proceedings of the International Conference on Computer Assisted Radiology and Surgery (CARS)},
   TITLE = {Semi-automatic bone fracture reduction in surgical planning},
   YEAR = {2009},
   ADDRESS = {Berlin, Germany},
   MONTH = {June},
   NUMBER = {Suppl. 1},
   PAGES = {S98-S99},
   PUBLISHER = {Springer Verlag},
   SERIES = {International Journal of Computer Assisted Radiology and Surgery},
   VOLUME = {4},
   DOI = {10.1007/s11548-009-0314-1},
   }
   


6. Peter Kardos, Gabor Nemeth, and Kalman Palagyi. An Order-Independent Sequential Thinning Algorithm. In Petra Wiederhold and Reneta P. Barneva, editors, Proceedings of the International Workshop on Combinatorial Image Analysis, volume 5852 of Lecture Notes in Computer Science, Playa del Carmen, Mexico, pages 162-175, November 2009. Springer Verlag. [PDF]
   Abstract: Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting orders and it is capable of extracting maximally thinned skeletons.
   @INPROCEEDINGS{KardosNemethPalagyi09,
   AUTHOR = {Peter Kardos and Gabor Nemeth and Kalman Palagyi},
   BOOKTITLE = {Proceedings of the International Workshop on Combinatorial Image Analysis},
   TITLE = {An Order-Independent Sequential Thinning Algorithm},
   YEAR = {2009},
   ADDRESS = {Playa del Carmen, Mexico},
   EDITOR = {Petra Wiederhold and Reneta P. Barneva},
   MONTH = {November},
   PAGES = {162-175},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {5852},
   }
   


7. Endre Katona. A Graph Based Data Model for Graphics Interpretation. In Andrea Torsello, Francisco Escolano Ruiz, and Luc Brun, editors, Proceedings of Graph-Based Representations in Pattern Recognition, volume 5534 of Lecture Notes in Computer Science, Venice, Italy, pages 355-364, October 2009. Springer Verlag. [WWW] [PDF]
   Abstract: A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as higher level processing. To improve algorithmic efficiency, spatial indexing can be applied. Implementation aspects are discussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives examples of map interpretation, our concept can be extended to other fields of graphics recognition.
   @INPROCEEDINGS{KatonaGBR2009,
   AUTHOR = {Endre Katona},
   BOOKTITLE = {Proceedings of Graph-Based Representations in Pattern Recognition},
   TITLE = {A Graph Based Data Model for Graphics Interpretation},
   YEAR = {2009},
   ADDRESS = {Venice, Italy},
   EDITOR = {Andrea Torsello and Escolano Ruiz, Francisco and Luc Brun},
   MONTH = {October},
   PAGES = {355--364},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {5534},
   URL = {http://www.springer.com/computer/computer+imaging/book/978-3-642-02123-7},
   }
   


8. Jozsef Nemeth, Csaba Domokos, and Zoltan Kato. Nonlinear Registration of Binary Shapes. In Proceedings of the International Conference on Image Processing, Cairo, Egypt, pages 1001-1004, November 2009. IEEE, IEEE. [PDF]
   Abstract: A novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarity metric and then find the solution via optimization. Herein, we trace back the problem to the solution of a system of nonlinear equations which directly provides the parameters of the aligning transformation. The proposed method works without any time consuming optimization step or established correspondences. The advantage of our algorithm is that it is easy to implement, less sensitive to the strength of the deformation, and robust against segmentation errors. The efficiency of the proposed approach has been demonstrated on a large synthetic dataset as well as in the context of an industrial application.
   @INPROCEEDINGS{Nemeth-etal2009b,
   AUTHOR = {Jozsef Nemeth and Csaba Domokos and Zoltan Kato},
   BOOKTITLE = {Proceedings of the International Conference on Image Processing},
   TITLE = {Nonlinear Registration of Binary Shapes},
   YEAR = {2009},
   ADDRESS = {Cairo, Egypt},
   MONTH = {November},
   ORGANIZATION = {IEEE},
   PAGES = {1001--1004},
   PUBLISHER = {IEEE},
   }
   


9. Jozsef Nemeth, Csaba Domokos, and Zoltan Kato. Recovering Planar Homographies between 2D Shapes. In Proceedings of the International Conference on Computer Vision, Kyoto, Japan, pages 2170-2176, September 2009. IEEE, IEEE. [PDF]
   Abstract: Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vision with various applications. This paper proposes a novel method to estimate the parameters of a homography that aligns two binary images. It is obtained by solving a system of nonlinear equations generated by integrating linearly independent functions over the domains determined by the shapes. The advantage of the proposed solution is that it is easy to implement, less sensitive to the strength of the deformation, works without established correspondences and robust against segmentation errors. The method has been tested on synthetic as well as on real images and its efficiency has been demonstrated in the context of two different applications: alignment of hip prosthesis X-ray images and matching of traffic signs.
   @INPROCEEDINGS{Nemeth-etal2009a,
   AUTHOR = {Jozsef Nemeth and Csaba Domokos and Zoltan Kato},
   BOOKTITLE = {Proceedings of the International Conference on Computer Vision},
   TITLE = {Recovering Planar Homographies between 2D Shapes},
   YEAR = {2009},
   ADDRESS = {Kyoto, Japan},
   MONTH = {September},
   ORGANIZATION = {IEEE},
   PAGES = {2170--2176},
   PUBLISHER = {IEEE},
   }
   


10. Laszlo G. Nyul. Retinal image analysis for automated glaucoma risk evaluation. In Jianguo Liu, Kunio Doi, Aaron Fenster, and S. C. Chan, editors, Proceedings of MIPPR 2009: Medical Imaging, Parallel Processing of Images, and Optimization Techniques, volume 7497 of SPIE Proceedings, Yichang, China, pages 74971C1-9, October 2009. SPIE. [WWW] [PDF] [doi:10.1117/12.851179]
    Abstract: Images of the eye ground not only provide an insight to important parts of the visual system but also reflect the general state of health of the entire human body. Automatic retina image analysis is becoming an important screening tool for early detection of certain risks and diseases. Glaucoma is one of the most common causes of blindness and is becoming even more important considering the ageing society. Robust mass-screening may help to extend the symptom-free life of affected patients. Our research is focused on a novel automated classification system for glaucoma, based on image features from fundus photographs. Our new data-driven approach requires no manual assistance and does not depend on explicit structure segmentation and measurements. First, disease independent variations, such as nonuniform illumination, size differences, and blood vessels are eliminated from the images. Then, the extracted high-dimensional feature vectors are compressed via PCA and combined before classification with SVMs takes place. The technique achieves an accuracy of detecting glaucomatous retina fundus images comparable to that of human experts. The "vessel-free" images and intermediate output of the methods are novel representations of the data for the physicians that may provide new insight into and help to better understand glaucoma.
    @INPROCEEDINGS{nyul:74971C,
    AUTHOR = {Laszlo G. Nyul},
    BOOKTITLE = {Proceedings of MIPPR 2009: Medical Imaging, Parallel Processing of Images, and Optimization Techniques},
    TITLE = {Retinal image analysis for automated glaucoma risk evaluation},
    YEAR = {2009},
    ADDRESS = {Yichang, China},
    EDITOR = {Jianguo Liu and Kunio Doi and Aaron Fenster and S. C. Chan},
    MONTH = {October},
    NUMBER = {1},
    PAGES = {74971C1--9},
    PUBLISHER = {SPIE},
    SERIES = {SPIE Proceedings},
    VOLUME = {7497},
    URL = {http://link.aip.org/link/?PSI/7497/74971C/1},
    DOI = {10.1117/12.851179},
    }
    


11. Kalman Palagyi and Gabor Nemeth. Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation. In Srecko Brlek, Christophe Reutenauer, and Xavier Provencal, editors, Proceedings of the International Conference on Discrete Geometry for Computer Imagery, volume 5810 of Lecture Notes in Computer Science, Montreal, Quebec, Canada, pages 481-492, sep--oct 2009. Springer Verlag. [PDF]
    Abstract: This paper presents a family of parallel thinning algorithms for extracting medial surfaces from 3D binary pictures. The proposed algorithms are based on sufficient conditions for 3D parallel reduction operators to preserve topology for (26,6) pictures. Hence it is self-evident that our algorithms are topology preserving. Their efficient implementation on conventional sequential computers is also presented.
    @INPROCEEDINGS{PalagyiNemeth09,
    AUTHOR = {Kalman Palagyi and Gabor Nemeth},
    BOOKTITLE = {Proceedings of the International Conference on Discrete Geometry for Computer Imagery},
    TITLE = {Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation},
    YEAR = {2009},
    ADDRESS = {Montreal, Quebec, Canada},
    EDITOR = {Srecko Brlek and Christophe Reutenauer and Xavier Provencal},
    MONTH = {sep--oct},
    PAGES = {481-492},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    VOLUME = {5810},
    }
    


12. Attila Tanacs, Csaba Domokos, Natasa Sladoje, Joakim Lindblad, and Zoltan Kato. Recovering affine deformations of fuzzy shapes. In Arnt-Borre Salberg, Jon Yngve Hardeberg, and Robert Jenssen, editors, Proceedings of the Scandinavian Conference on Image Analysis, volume 5575 of Lecture Notes in Computer Science, Oslo, Norway, pages 735-744, June 2009. Springer Verlag. [PDF]
    Abstract: Fuzzy sets and fuzzy techniques are attracting increasing attention nowadays in the field of image processing and analysis. It has been shown that the information preserved by using fuzzy representation based on area coverage may be successfully utilized to improve precision and accuracy of several shape descriptors; geometric moments of a shape are among them. We propose to extend an existing binary shape matching method to take advantage of fuzzy object representation. The result of a synthetic test show that fuzzy representation yields smaller registration errors in average. A segmentation method is also presented to generate fuzzy segmentations of real images. The applicability of the proposed methods is demonstrated on real X-ray images of hip replacement implants.
    @INPROCEEDINGS{Tanacs:2009:SCIA,
    AUTHOR = {Attila Tanacs and Csaba Domokos and Natasa Sladoje and Joakim Lindblad and Zoltan Kato},
    BOOKTITLE = {Proceedings of the Scandinavian Conference on Image Analysis},
    TITLE = {Recovering affine deformations of fuzzy shapes},
    YEAR = {2009},
    ADDRESS = {Oslo, Norway},
    EDITOR = {Arnt-Borre Salberg and Jon Yngve Hardeberg and Robert Jenssen},
    MONTH = {June},
    PAGES = {735--744},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    VOLUME = {5575},
    }
    

  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