Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Article Type: Other
DOI: 10.3233/FI-2015-1266
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. i-xxi, 2015
Authors: Fiorini, Rodolfo A.
Article Type: Research Article
Abstract: In general, a theoretical Computerized Tomography (CT) imaging problem can be formulated as a system of linear equations. The discrete inverse problem of reconstructing finite subsets of the n -dimensional integer lattice 𝕫n that are only accessible via their line sums (discrete x-rays), in a finite set of lattice directions, results into an even more ill-posed problem, from noisy data. Because of background noise in the data, the reconstruction process is more difficult since the system of equations becomes inconsistent easily. Unfortunately, with every different kind of CT, as with many contemporary advanced instrumentation systems, one is always …faced with an additional experimental data noise reduction problem. By using Information Geometry (IG) and Geometric Science of Information (GSI) approach, it is possible to extend traditional statistical noise reduction concepts and to develop new algorithm to overcome many previous limitations. On the other end, in the past five decades, trend in Systems Theory, in specialized research area, has shifted from classic single domain information channel transfer function approach (Shannon’s noisy channel) to the more structured ODR Functional Sub-domain Transfer Function Approach (Observation, Description and Representation), according to computational information conservation theory (CICT) Infocentric Worldview model (theoretically, virtually noise-free data). CICT achieves to bringing classical and quantum information theory together in a single framework, by considering information not only on the statistical manifold of model states but also from empirical measures. In fact, to grasp a more reliable representation of experimental reality and to get stronger physical and biological system correlates, researchers and scientists need two intelligently articulated hands: both stochastic and combinatorial approaches synergically articulated by natural coupling. As a matter of fact, traditional rational number system ℚ properties allow to generate an irreducible co-domain for every computational operative domain used. Then, computational information usually lost by using classic LTR computational approach only, based on the traditional noise-affected data model stochastic representation (with high-level perturbation computational model under either additive or multiplicative perturbation hypothesis), can be captured and fully recovered to arbitrary precision, by a corresponding complementary co-domain, step-by-step. In previous paper, we already saw that CICT can supply us with Optimized Exponential Cyclic numeric Sequences (OECS) co-domain perfectly tuned to low-level multiplicative noise source generators, related to experimental high-level overall perturbation. Now, associated OECS co-domain polynomially structured information can be used to evaluate any computed result at arbitrary scale, and to compensate for achieving multi-scale computational information conservation. Show more
Keywords: Computerized Tomography, Noise Reduction, Computational Information Conservation Theory, Modular Arithmetic, Biomedical Cybernetics, Biomedical Engineering, Geometric Science of Information, Computational Information Geometry, Public Health
DOI: 10.3233/FI-2015-1267
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 115-134, 2015
Authors: Hantos, Norbert | Balázs, Péter
Article Type: Research Article
Abstract: Analysis of patterns in binary matrices plays a vital role in numerous applications of computer science. One of the most essential patterns of such matrices are the so called switching components, where the number and location of the components gives valuable information about the binary matrix. One way to measure the effect of switching components in a binary matrix is counting the number of 0-s which have to be replaced with 1-s in order to eliminate the switching components. However, finding the minimal number of 0-1 flips is generally an NP-complete problem. We present two novel-type heuristics for the above …problem and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time. We also show how to use those heuristics for determining the so-called nestedness level of a matrix, and how to use the flips for binary image compression. Show more
Keywords: binary matrix, image reconstruction, switching component, uniqueness, 0-1 flip, nestedness, data compression
DOI: 10.3233/FI-2015-1268
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 135-150, 2015
Authors: Balázs, Péter | Ozsvár, Zoltán | Tasi, Tamás S. | Nyúl, László G.
Article Type: Research Article
Abstract: Inspired by binary tomography, we present a measure of directional convexity of binary images combining various properties of the configuration of 0s and 1s in the binary image. The measure can be supported by proper theory, is easy to compute, and as shown in our experiments, behaves intuitively. The measure can be useful in numerous applications of digital image processing and pattern recognition, and especially in binary tomography. We show in detail an application of this latter one, by providing a novel reconstruction algorithm for almost hv-convex binary images. We also present experimental results and mention some of the possible …generalizations of the measure. Show more
Keywords: Digital Geometry, Convexity Measure, hv-Convexity, Binary Tomography, Reconstruction from Projections
DOI: 10.3233/FI-2015-1269
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 151-167, 2015
Authors: Vincze, Csaba | Nagy, Ábris
Article Type: Research Article
Abstract: Parallel X-rays are functions that measure the intersection of a given set with lines parallel to a fixed direction in ℝ2 . The reconstruction problem concerning parallel X-rays is to reconstruct the set if the parallel X-rays into some directions are given. There are several algorithms to give an approximate solution of this problem. In general we need some additional knowledge on the object to obtain a unique solution. By assuming convexity a suitable finite number of directions is enough for all convex planar bodies to be uniquely determined by their X-rays in these directions [13]. Gardner and Kiderlen [12] …presented an algorithm for reconstructing convex planar bodies from noisy X-ray measurements belonging to four directions. For a reconstruction algorithm assuming convexity we can also refer to [17]. An algorithm for the reconstruction of hv-convex planar sets by their coordinate X-rays (two directions) can be found in [18]: given the coordinate X-rays of a compact connected hv-convex planar set K the algorithm gives a sequence of polyominoes Ln all of whose accumulation points (with respect to the Hausdorff metric) have the given coordinate X-rays almost everywhere. If the set is uniquely determined by the coordinate X-rays then Ln tends to the solution of the problem. This algorithm is based on generalized conic functions measuring the average taxicab distance by integration [21]. Now we would like to give an extension of this algorithm that works in the case when only some measurements of the coordinate X-rays are given. Following the idea in [12] we extend the algorithm for noisy X-ray measurements too. Show more
DOI: 10.3233/FI-2015-1270
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 169-189, 2015
Authors: Frosini, Andrea | Battaglino, Daniela | Rinaldi, Simone | Socci, Samanta
Article Type: Research Article
Abstract: Starting from a Theorem by Hall, we define the identity transform of a permutation π as C(π) = (0 + π(0), 1 + π(1), ..., (n − 1) + π(n − 1)), and we define the set Cn = {(C (π) : π ∈ Sn }, where Sn is the set of permutations of the elements of the cyclic group ℤn . In the first part of this paper we study the set Cn : we show some closure properties of this set, and then provide some of its combinatorial …and algebraic characterizations and connections with other combinatorial structures. In the second part of the paper, we use some of the combinatorial properties we have determined to provide a different algorithm for the proof of Hall’s Theorem. Show more
DOI: 10.3233/FI-2015-1271
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 191-205, 2015
Authors: Nagy, Antal
Article Type: Research Article
Abstract: In our previous paper [10] we proposed new variants of the Discrete Algebraic Reconstruction Technique with combined filtering technique and performed experiments on binary software phantoms within a new test framework to investigate the effect of the filters. Continuing our work, in this paper we extend our study to multivalued phantoms for a deeper investigation in this field. We create a new test phantom set with different intensity levels and perform a comprehensive experimental study. The results are evaluated with Relative Mean Error which is extended to multivalued discrete phantoms. We use a ranking system to create different views to …our quantitative data. Finally, the achievements are discussed. Show more
Keywords: Tomography, Discrete Tomography, DART, Filtering, Non-Destructive Testing
DOI: 10.3233/FI-2015-1272
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 207-231, 2015
Authors: Brun, Francesco | Pacilè, Serena | Accardo, Agostino | Kourousias, George | Dreossi, Diego | Mancini, Lucia | Tromba, Giuliana | Pugliese, Roberto
Article Type: Research Article
Abstract: X-ray computed tomography (CT) experiments performed at synchrotron radiation facilities require adequate computing and storage resources due to the large amount of acquired and reconstructed data produced. To satisfy the heterogeneous needs of beamline users, flexible solutions are also required. Moreover, the growing demand of quantitative image analysis impose an easy integration between the CT reconstruction process and the subsequent feature extraction step. This paper presents some of the software solutions adopted by the SYRMEP beamline of the Italian synchrotron radiation facility Elettra. By using the enhanced version of the reconstruction software here presented as well as data reduction and …data analysis tools, beamline users can easily implement an integrated and comprehensive approach to the digital image processing and image analysis required by a tomography-oriented scientific workflow. Show more
Keywords: computed tomography, image reconstruction, image processing, image analysis, computing workflow
DOI: 10.3233/FI-2015-1273
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 233-243, 2015
Authors: Shkarin, Roman | Ametova, Evelina | Chilingaryan, Suren | Dritschler, Timo | Kopmann, Andreas | Mirone, Alessandro | Shkarin, Andrei | Vogelgesang, Matthias | Tsapko, Sergey
Article Type: Research Article
Abstract: On-line monitoring of synchrotron 3D-imaging experiments requires very fast tomographic reconstruction. Direct Fourier methods (DFM) have the potential to be faster than standard Filtered Backprojection. We have evaluated multiple DFMs using various interpolation techniques. We compared reconstruction quality and studied the parallelization potential. A method using Direct Fourier Inversion (DFI) and a sinc-based interpolation was selected and parallelized for execution on GPUs. Several optimization steps were considered to boost the performance. Finally we evaluated the achieved performance for the latest generation of GPUs from NVIDIA and AMD. The results show that tomographic reconstruction with a throughput of more than 1.5 …GB/sec on a single GPU is possible. Show more
Keywords: computed tomography, image reconstruction, parallel-beam tomography, FFT
DOI: 10.3233/FI-2015-1274
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 245-258, 2015
Authors: Shkarin, Andrei | Ametova, Evelina | Chilingaryan, Suren | Dritschler, Timo | Kopmann, Andreas | Vogelgesang, Matthias | Shkarin, Roman | Tsapko, Sergey
Article Type: Research Article
Abstract: The recent developments in detector technology made possible 4D (3D + time) X-ray microtomography with high spatial and time resolutions. The resolution and duration of such experiments is currently limited by destructive X-ray radiation. Algebraic reconstruction technique (ART) can incorporate a priori knowledge into a reconstruction model that will allow us to apply some approaches to reduce an imaging dose and keep a good enough reconstruction quality. However, these techniques are very computationally demanding. In this paper we present a framework for ART reconstruction based on OpenCL technology. Our approach treats an algebraic method as a composition of interacting …blocks which perform different tasks, such as projection selection, minimization, projecting and regularization. These tasks are realised using multiple algorithms differing in performance, the quality of reconstruction, and the area of applicability. Our framework allows to freely combine algorithms to build the reconstruction chain. All algorithms are implemented with OpenCL and are able to run on a wide range of parallel hardware. As well the framework is easily scalable to clustered environment with MPI. We will describe the architecture of ART framework and evaluate the quality and performance on latest generation of GPU hardware from NVIDIA and AMD. Show more
Keywords: computed tomography, tomographic reconstruction, parallel-beam tomography, algebraic methods
DOI: 10.3233/FI-2015-1275
Citation: Fundamenta Informaticae, vol. 141, no. 2-3, pp. 259-274, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl