Authors
Makoto Sakamoto, Makoto Nagatomo, Tuo Zhang, Xiaoyang Feng, Tatsuma Kurogi,
Satoshi Ikeda, Masahiro Yokomichi, Hiroshi Furutani, Takao Ito, Yasuo Uchida,
Tsunehiro Yoshinaga
Corresponding Author
Makoto Sakamoto
Available Online 30 June 2014.
DOI
https://doi.org/10.2991/jrnal.2014.1.1.16
Keywords
cellular acceptor, computational complexity, configuration-reader, converter,
four-dimension, neighbor
Abstract
Recently, due to the advance in dynamic image processing, computer animation,
augmented reality (AR), and so forth, it has become increasingly apparent
that the study of four-dimensional pattern processing (three-dimensional
pattern processing with time axis) should be very important. Thus, the
study of four-dimensional automata as the computational model of four-dimensional
pattern processing has been meaningful. From this point of view, we first
introduced a four-dimensional automaton in 2002. In the multi-dimensional
pattern processing, designers often use a strategy whereby features are
extracted by projecting high-dimensional space on low-dimensional space.
In this paper, from this viewpoint, we introduce a new computational model,
k-neighborhood template A-type three-dimensional bounded cellular acceptor
(abbreviated as A -3BCA(k)) on four-dimensional input tapes, and discuss
hierarchy based on neighborhood template about A-3BCA(k).
Copyright
© 2013, the Authors. Published by ALife Robotics Corp. Ltd..
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).