Tomography is an imaging procedure to examine the internal structure of objects. The crosssection

images are constructed with the aid of the object’s projections. It is often necessary to

minimize the number of those projections to avoid the damage or destruction of the examined

object, since in most cases the projections are made by destructive rays.

Sometimes the number of available projections are so small that conventional methods cannot

provide satisfactory results. In these cases Discrete Tomograpy can provide acceptable solutions,

but it can only be used with the assumption the object is made of only a few materials,

thus only a small number of intensity values appear in the reconstructed cross-section image.

Although there are a lot of discrete tomographic reconstruction algorithms, only a few papers

deal with the determination of intensity values of the image, in advance. In our work we

try to fill this gap by using different learning methods. During the learning and classification

we used the projection values as input arguments.

In the second part of our talk we concentrate on Binary Tomography (a special kind of Discrete

Tomography)where it is supposed that the object is composed of onematerial. Thus, there

can be only two intensities on the cross-section image - one for the object points and one for

the background. Here, we compared our earlier presented binary tomographic evolutionary

reconstruction algorithm to two others. We present the details of the above-mentioned reconstruction

method and our experimental results. This paper is based on our previous works.

In this paper we investigate for two well-known machine learning methods, decision trees and neural networks, how they classify discrete images from their projections. As an example, we present classification results when the task is to guess the number of intensity values of the discrete image. Machine learning can be used in Discrete Tomography as a preprocessing step in order to choose the proper reconstruction algorithm or - with the aid of the knowledge acquired - to improve its accuracy. We also show how to design new evolutionary reconstruction methods that can exploit the information gained by machine learning classifiers. © 2012 Springer-Verlag.

JF - Applications of Discrete Geometry and Mathematical Morphology (WADGMM) T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo N1 - ScopusID: 84865454250doi: 10.1007/978-3-642-32313-3_8 JO - LNCS ER - TY - CONF T1 - Bináris tomográfiai rekonstrukció objektum alapú evolúciós algoritmussal T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Mihály Gara A1 - Péter Balázs 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 ER - TY - CONF T1 - Binary tomographic reconstruction with an object-based evolutionary algorithm T2 - Conference of PhD Students in Computer Science. Volume of Extended Abstracts Y1 - 2010 A1 - Mihály Gara A1 - Péter Balázs JF - Conference of PhD Students in Computer Science. Volume of Extended Abstracts PB - University of Szeged CY - Szeged ER - TY - CHAP T1 - Machine learning for supporting binary tomographic reconstruction T2 - Workshop on Applications of Discrete Geometry in Mathematical Morphology Y1 - 2010 A1 - Péter Balázs A1 - Mihály Gara A1 - Tamás Sámuel Tasi ED - Ullrich Köthe ED - Annick Montanvert ED - Pierre Soille JF - Workshop on Applications of Discrete Geometry in Mathematical Morphology T3 - Lecture Notes in Computer Science PB - Springer CY - Istambul, Turkey JO - LNCS ER - TY - CONF T1 - Döntési fákon alapuló előfeldolgozás a bináris tomográfiában T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2009 Y1 - 2009 A1 - Mihály Gara A1 - Péter Balázs 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 N1 - 8 pages ER - TY - CHAP T1 - An evolutionary approach for object-based image reconstruction using learnt priors T2 - Image Analysis Y1 - 2009 A1 - Péter Balázs A1 - Mihály Gara ED - Arnt-Borre Salberg ED - Jon Yngve Hardeberg ED - Robert Jenssen AB -In this paper we present a novel algorithm for reconstructingbinary 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. © 2009 Springer Berlin Heidelberg.

JF - Image Analysis T3 - Lecture Notes in Computer Science PB - Springer-Verlag CY - Oslo, Norway SN - 978-3-642-02229-6 N1 - UT: 000268661000053ScopusID: 70350650400doi: 10.1007/978-3-642-02230-2_53 JO - LNCS ER - TY - JOUR T1 - Learning connectedness and convexity of binary images from their projections JF - PURE MATHEMATICS AND APPLICATIONS Y1 - 2009 A1 - Mihály Gara A1 - Tamás Sámuel Tasi A1 - Péter Balázs VL - 20 SN - 1218-4586 IS - 1-2 JO - PU.M.A PURE MATH APPL ER - TY - ABST T1 - Supervised Color Image Segmentation in a Markovian Framework Y1 - 2009 A1 - Mihály Gara A1 - Zoltan Kato AB -This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chung Mong Lee. Color Image Segmentation and Parameter Estimation in a Markovian Framework. Pattern Recognition Letters, 22(3-4):309--321, March 2001. Note that the current demo program implements only a supervised version of the segmentation method described in the above paper (i.e. parameter values are learned interactively from representative regions selected by the user). Otherwise, the program implements exactly the color MRF model proposed in the paper. Images are automatically converted from RGB to the perceptually uniform CIE-L*u*v* color space before segmentation.

UR - http://www.inf.u-szeged.hu/~kato/software/colormrfdemo.html ER - TY - CONF T1 - Determination of geometric features of binary images from their projections by using decision trees T2 - Conference of PhD Students in Computer Science. Volume of Extended Abstracts Y1 - 2008 A1 - Mihály Gara A1 - Péter Balázs ED - Kálmán Palágyi ED - Balázs Bánhelyi ED - Tamás Gergely ED - István Matievics JF - Conference of PhD Students in Computer Science. Volume of Extended Abstracts PB - University of Szeged CY - Szeged, Hungary ER -