|
|
|
Selected Publications of the Department of Image Processing and Computer Graphics of the year 1984
BACK TO INDEX
Articles in journal or book chapters
-
Attila Kuba.
The reconstruction of two-directionally connected binary patterns from their two orthogonal projections.
Computer Vision, Graphics, and Image Processing,
27(3):249-265,
September 1984.
[doi:10.1016/0734-189X(84)90031-8]
Abstract: A heuristic reconstruction algorithm is described, by which binary matrices can be produced from their two orthogonal projections. It is necessary for proper reconstruction that the binary pattern corresponding to the binary matrix bex- andy-directionally connected. By this method a large class of binary matrices can be reconstructed. It is proved that after a finite number of iterative steps this algorithm produces all thex- andy-directionally connected binary patterns belonging to the given two projections. Finally, some remarks on the implementation of this algorithm and results are presented.
@ARTICLE{Kuba1984,
AUTHOR = {Attila Kuba},
JOURNAL = {Computer Vision, Graphics, and Image Processing},
TITLE = {The reconstruction of two-directionally connected binary patterns from their two orthogonal projections},
YEAR = {1984},
MONTH = {September},
NUMBER = {3},
PAGES = {249-265},
VOLUME = {27},
DOI = {10.1016/0734-189X(84)90031-8},
}
-
Attila Kuba,
H. Feistel,
J. Mahlstedt,
and F. Wolf.
3D ROI techniques in SPECT.
European Journal of Nuclear Medicine and Molecular Imaging,
9:A130,
1984.
[WWW]
@ARTICLE{Kuba19849,
AUTHOR = {Attila Kuba and H. Feistel and J. Mahlstedt and F. Wolf},
JOURNAL = {European Journal of Nuclear Medicine and Molecular Imaging},
TITLE = {3D ROI techniques in SPECT},
YEAR = {1984},
PAGES = {A130},
VOLUME = {9},
URL = {http://www.springerlink.com/content/1619-7070},
}
-
Tamas Legendi and Endre Katona.
A Solution of the Early Bird Problem in an n-dimensional Cellular Space.
Acta Cybernetica,
7:81-87,
1984.
[PDF]
Abstract: The early bird problem has been originally defined and solved by Rosenstiehl
et al. (1972) and has also been solved by Vollmar (1978), Legendi
and Katona (1981). In this paper the problem is generalized for the
n-dimensional cellular space, and a real time solution is given using
O(mn) steps in an n-dimensional cellular field of edge length m.
The solution will be shown in detail in the two-dimensional case.
The basic idea of the solution is to reduce the n-dimensional early
bird problem to the (n-1)-dimensional one, using special signals
and applying the one-dimensional early bird algorithm.
@ARTICLE{Legendi1984,
AUTHOR = {Tamas Legendi and Endre Katona},
JOURNAL = {Acta Cybernetica},
TITLE = {A Solution of the Early Bird Problem in an n-dimensional Cellular Space},
YEAR = {1984},
PAGES = {81-87},
VOLUME = {7},
}
Conference articles
-
Endre Katona.
String Pattern Matching Algorithms for Cellular Processors.
In Proceedings of Parallel Computing,
Berlin, GDR,
pages 431-436,
1984.
Elsevier (North-Holland).
[PDF]
Abstract: Two pattern matching algorithms will be presented, described as software modules for a concrete cellprocessor architecture. The first one is a ``conventional cellular algorithm'' where the patterns are stored in the cellular space, but the second one is based on a special ability of the cellprocessor called ``broadcasting''. Note that our algorithms are suitable for direct hardware implementation, too. Similar VLSI algorithms have been published e.g. by Foster and Kung. However, we prefer the software realization, considering its high flexibility and its capability for interconnection with other cellular software modules.
@INPROCEEDINGS{Katona1984,
AUTHOR = {Endre Katona},
BOOKTITLE = {Proceedings of Parallel Computing},
TITLE = {String Pattern Matching Algorithms for Cellular Processors},
YEAR = {1984},
ADDRESS = {Berlin, GDR},
PAGES = {431-436},
PUBLISHER = {Elsevier (North-Holland)},
}
BACK TO INDEX
Disclaimer:
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.
Last modified: Mon Jan 9 20:17:07 2012
This document was translated from BibTEX by
bibtex2html
|
|
|