Vibration Analysis Tests (VAT) and Acoustic Emission tests (AE) are used in several industrial applications. Many of them perform analysis in the frequency domain. Peaks in the power density spectrum hold relevant information about acoustic events. In this paper we propose a novel method for feature extraction of vibration samples by analyzing the shape of their auto power spectrum density function. The approach uses skeletonization techniques in order to find the hierarchical structure of the spectral peaks. The proposed method can be applied as a preprocessing step for spectrum analysis of vibration signals. ` `

A widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26, 6) binary pictures. The reported algorithms are derived from some sufficient conditions for topology preserving parallel reduction operations, hence their topological correctness is guaranteed. ` `

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.

JF - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Dubrovnik, Croatia SN - 978-1-4577-0841-1 N1 - ScopusID: 83455172782 ER - TY - JOUR T1 - 2D parallel thinning and shrinking based on sufficient conditions for topology preservation JF - ACTA CYBERNETICA-SZEGED Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi AB -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 fiftyfour new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints.

PB - University of Szeged, Institute of Informatics CY - Szeged VL - 20 SN - 0324-721X IS - 1 N1 - ScopusID: 79960666919 JO - ACTA CYBERN-SZEGED ER - TY - CHAP T1 - A family of topology-preserving 3d parallel 6-subiteration thinning algorithms T2 - Combinatorial Image Analysis (IWCIA) Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Jake K Aggarwal ED - Reneta P Barneva ED - Valentin E Brimkov ED - Kostadin N Koroutchev ED - Elka R Korutcheva AB -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. © 2011 Springer-Verlag Berlin Heidelberg.

JF - Combinatorial Image Analysis (IWCIA) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Madrid, Spain SN - 978-3-642-21072-3 N1 - ScopusID: 79957651399doi: 10.1007/978-3-642-21073-0_5 JO - LNCS ER - TY - CONF T1 - Iterációnkénti simítással kombinált vékonyítás T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_01.pdf ER - TY - JOUR T1 - Thinning combined with iteration-by-iteration smoothing for 3D binary images JF - GRAPHICAL MODELS Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi AB -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. © 2011 Elsevier Inc. All rights reserved.

VL - 73 SN - 1524-0703 IS - 6 N1 - ScopusID: 79952613010doi: 10.1016/j.gmod.2011.02.001 JO - GRAPH MODELS ER - TY - CONF T1 - A topológia-megőrzés elegendő feltételein alapuló 3D párhuzamos vékonyító algoritmusok T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged UR - http://www.inf.u-szeged.hu/kepaf2011/pdfs/S05_02.pdf ER - TY - JOUR T1 - Topology Preserving Parallel Thinning Algorithms JF - INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY Y1 - 2011 A1 - Gábor Németh A1 - Kálmán Palágyi AB -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. © 2011 Wiley Periodicals, Inc.

PB - Wiley Periodicals, Inc. VL - 21 SN - 0899-9457 IS - 1 N1 - UT: 000287789100005ScopusID: 79951782238doi: 10.1002/ima.20272 JO - INT J IMAG SYST TECH ER - TY - JOUR T1 - Bejárásfüggetlen szekvenciális vékonyítás JF - ALKALMAZOTT MATEMATIKAI LAPOK Y1 - 2010 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi VL - 27 SN - 0133-3399 IS - 1 JO - ALKALMAZOTT MATEMATIKAI LAPOK ER - TY - CONF T1 - Topology preserving 2-subfield 3D thinning algorithms T2 - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - B Zagar ED - A Kuijper ED - H Sahbi AB -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.

JF - Proceedings of the International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA) PB - IASTED ACTA Press CY - Innsbruck, Austria N1 - ScopusID: 77954590365 ER - TY - CHAP T1 - Topology Preserving 3D Thinning Algorithms using Four and Eight Subfields T2 - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Aurélio Campilho ED - Mohamed Kamel AB -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. © 2010 Springer-Verlag.

JF - Proceedings of the International Conference on Image Analysis and Recognition (ICIAR) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Póvoa de Varzim, Portugal VL - 6111 N1 - ScopusID: 77955432947doi: 10.1007/978-3-642-13772-3_32 JO - LNCS ER - TY - CHAP T1 - Topology Preserving Parallel Smoothing for 3D Binary Images T2 - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) Y1 - 2010 A1 - Gábor Németh A1 - Péter Kardos A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Herbert A Hauptman ED - Renato M Natal Jorge ED - João Manuel R S Tavares AB -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. © 2010 Springer-Verlag.

JF - Proceedings of the Computational Modeling of Objects Represented in Images (CMORI) PB - Springer Verlag CY - Buffalo, USA VL - 6026 N1 - ScopusID: 77952401887doi: 10.1007/978-3-642-12712-0_26 ER - TY - JOUR T1 - Comparison and evaluation of methods for liver segmentation from CT datasets JF - IEEE TRANSACTIONS ON MEDICAL IMAGING Y1 - 2009 A1 - Tobias Heimann A1 - Brahm Van Ginneken A1 - Martin A Styner A1 - Yulia Arzhaeva A1 - Volker Aurich A1 - Christian Bauer A1 - Andreas Beck A1 - Christoph Becker A1 - Reinhardt Beichel A1 - György Bekes A1 - Fernando Bello A1 - Gerd Binnig A1 - Horst Bischof A1 - Alexander Bornik A1 - Peter MM Cashman A1 - Ying Chi A1 - Andres Córdova A1 - Benoit M Dawant A1 - Márta Fidrich A1 - Jacob D Furst A1 - Daisuke Furukawa A1 - Lars Grenacher A1 - Joachim Hornegger A1 - Dagmar Kainmüller A1 - Richard I Kitney A1 - Hidefumi Kobatake A1 - Hans Lamecker A1 - Thomas Lange A1 - Jeongjin Lee A1 - Brian Lennon A1 - Rui Li A1 - Senhu Li A1 - Hans-Peter Meinzer A1 - Gábor Németh A1 - Daniela S Raicu A1 - Anne-Mareike Rau A1 - Eva M Van Rikxoort A1 - Mikael Rousson A1 - László Ruskó A1 - Kinda A Saddi A1 - Günter Schmidt A1 - Dieter Seghers A1 - Akinobi Shimizu A1 - Pieter Slagmolen A1 - Erich Sorantin A1 - Grzegorz Soza A1 - Ruchaneewan Susomboon A1 - Jonathan M Waite A1 - Andreas Wimmer A1 - Ivo Wolf AB -This paper presents a comparison study between 10 automatic and six interactive methods for liver segmentation from contrast-enhanced CT images. It is based on results from the "MICCAI 2007 Grand Challenge" workshop, where 16 teams evaluated their algorithms on a common database. A collection of 20 clinical images with reference segmentations was provided to train and tune algorithms in advance. Participants were also allowed to use additional proprietary training data for that purpose. All teams then had to apply their methods to 10 test datasets and submit the obtained results. Employed algorithms include statistical shape models, atlas registration, level-sets, graph-cuts and rule-based systems. All results were compared to reference segmentations five error measures that highlight different aspects of segmentation accuracy. All measures were combined according to a specific scoring system relating the obtained values to human expert variability. In general, interactive methods reached higher average scores than automatic approaches and featured a better consistency of segmentation quality. However, the best automatic methods (mainly based on statistical shape models with some additional free deformation) could compete well on the majority of test images. The study provides an insight in performance of different segmentation approaches under real-world conditions and highlights achievements and limitations of current image analysis techniques. © 2009 IEEE.

CY - Price, K., Anything you can do, I can do better (no you can't) (1986) Comput. Vis. Graph. Image Process, 36 (2-3), pp. 387-391;S. G. Armato, G. McLennan, M. F. McNitt-Gray, C. R. Meyer, D. Yankelevitz, D. R. Aberle, C. I. Henschke, E. A. Hoffman, E. A. Ka VL - 28 SN - 0278-0062 IS - 8 N1 - ScopusID: 68249121543doi: 10.1109/TMI.2009.2013851 JO - IEEE T MED IMAGING ER - TY - CHAP T1 - Fully Parallel 3D Thinning Algorithms based on Sufficient Conditions for Topology Preservation T2 - Proceedings of Discrete Geometry for Computer Imagery (DGCI) Y1 - 2009 A1 - Kálmán Palágyi A1 - Gábor Németh ED - Srecko Brlek ED - Christophe Reutenauer ED - Xavier Provençal AB -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. © 2009 Springer Berlin Heidelberg.

JF - Proceedings of Discrete Geometry for Computer Imagery (DGCI) PB - Springer Verlag CY - Montreal, Quebec, Canada SN - 978-3-642-04396-3 N1 - ScopusID: 77952414581doi: 10.1007/978-3-642-04397-0_41 ER - TY - CONF T1 - Kritikus párokat vizsgáló bejárásfüggetlen szekvenciális vékonyító algoritmus T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Dmitrij Chetverikov ED - Tamas Sziranyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 PB - Akaprint CY - Budapest ER - TY - CONF T1 - A morfológiai váz általánosítása szomszédsági szekvenciákkal T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 A1 - Gábor Németh A1 - György Kovács A1 - Kálmán Palágyi A1 - Attila Fazekas ED - Dmitrij Chetverikov ED - Tamas Sziranyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 PB - Akaprint CY - Budapest ER - TY - CHAP T1 - An order-independent sequential thinning algorithm T2 - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) Y1 - 2009 A1 - Péter Kardos A1 - Gábor Németh A1 - Kálmán Palágyi ED - Petra Wiederhold ED - Reneta P Barneva AB -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. © Springer-Verlag Berlin Heidelberg 2009.

JF - Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA) PB - Springer Verlag CY - Playa del Carmen, Mexico SN - 978-3-642-10208-0 UR - http://link.springer.com/chapter/10.1007/978-3-642-10210-3_13 N1 - ScopusID: 78650496028doi: 10.1007/978-3-642-10210-3_13 ER - TY - CHAP T1 - Skeletonization based on metrical neighborhood sequences T2 - Computer Vision Systems Y1 - 2008 A1 - Attila Fazekas A1 - Kálmán Palágyi A1 - György Kovács A1 - Gábor Németh ED - Antonios Gasteratos ED - Markus Vincze ED - John K Tsotsos AB -Skeleton is a shape descriptor which summarizes the general formof objects. It can be expressed in terms of the fundamental morphological operations. The limitation of that characterization is that its construction based on digital disks such that cannot provide good approximation to the Euclidean disks. In this paper we define a new type of skeleton based on neighborhood sequences that is much closer to the Euclidean skeleton. A novel method for quantitative comparison of skeletonization algorithms is also proposed. © 2008 Springer- Verlag Berlin Heidelberg.

JF - Computer Vision Systems PB - Springer Verlag CY - Santorini, Greece SN - 978-3-540-79546-9 N1 - ScopusID: 44649159529doi: 10.1007/978-3-540-79547-6 ER -