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 1989

Articles in journal or book chapters

1. Dietrich Kolzow, Attila Kuba, and A. Volcic. An algorithm for reconstructing convex bodies from their projections. Discrete and Computational Geometry, 4(1):205-237, December 1989. [doi:10.1007/BF02187723]
   Abstract: An algorithm is described for the approximative reconstruction of a plane convex body from its projections in a finite number of directions.A priori anda posteriori error estimates are given, and the convergence of certain sequences of an approximative solution of the reconstruction problem to the exact solution is proven. Finally, it is shown that, after small modifications, the algorithm can be applied to reconstruct convex bodies from discrete projectional data. The algorithm consists in an approximation of the convex body, to be reconstructed, by recursively defined cores and envelopes, following the ideas of Kuba [6] for the reconstruction of binary patterns. This paper was started at the University of Erlangen-Nurnberg in 1983-1984, when the second author was a fellow of the Alexander von Humboldt Foundation, while the last author was supported by the German Research Council (DFG, Contract Ko-506/8-1).
   @ARTICLE{KolzowKuba,
   AUTHOR = {Dietrich Kolzow and Attila Kuba and A. Volcic},
   JOURNAL = {Discrete and Computational Geometry},
   TITLE = {An algorithm for reconstructing convex bodies from their projections},
   YEAR = {1989},
   MONTH = {December},
   NUMBER = {1},
   PAGES = {205-237},
   VOLUME = {4},
   DOI = {10.1007/BF02187723},
   }
   


2. Attila Kuba. Determination of the structure of the class A(R,S) of (0,1)-matrices. Acta Cybernetica, 9(2):121-132, 1989. [WWW] [PDF]
   @ARTICLE{Kuba248942,
   AUTHOR = {Attila Kuba},
   JOURNAL = {Acta Cybernetica},
   TITLE = {Determination of the structure of the class A(R,S) of (0,1)-matrices},
   YEAR = {1989},
   NUMBER = {2},
   PAGES = {121-132},
   VOLUME = {9},
   URL = {http://portal.acm.org/citation.cfm?id=71777.71780},
   }
   

Conference articles

1. Endre Katona. A Transitive Closure Algorithm for a 16-state Cellprocessor. In Tamas Legendi Gottfried Wolf and Udo Schendel, editors, Proceedings of PARCELLA, volume 342 of Lecture Notes in Computer Science, Berlin, GDR, pages 285-290, 1989. Springer Verlag. [PDF]
   Abstract: Cellprocessors can be considered as microprogrammed Boolean array machines, thus they can process Boolean matrices with very high efficiency. It will be shown that transitive closure of a relation, represented by an nxn Boolean matrix, can be computed in 5n steps using an (n+1)xn array of 16-state cells. If there are several relations, the transitive closure of which should be computed, then a continuous pipeline processing is possible where the processing cost of one matrix is only n steps. The transitive closure algorithm can be partitioned so that arbitrary size relations can be handled with a fixed size cellular array.
   @INPROCEEDINGS{Katona1989,
   AUTHOR = {Endre Katona},
   BOOKTITLE = {Proceedings of PARCELLA},
   TITLE = {A Transitive Closure Algorithm for a 16-state Cellprocessor},
   YEAR = {1989},
   ADDRESS = {Berlin, GDR},
   EDITOR = {Gottfried Wolf, Tamas Legendi and Udo Schendel},
   PAGES = {285-290},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {342},
   }
   

  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