Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Rosin, Paul L. (2006)
Publisher: Institute of Electrical & Electronic Engineers
Languages: English
Types: Article

Classified by OpenAIRE into

ACM Ref: GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries)
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. von Neumann, Theory of Self-Reproducing Automata. University of Illinois Press, 1966.
    • [2] J. Holland, “Logical theory of adaptive systems,” in Essays in Cellular Automata, A. Burks, Ed. University of Illinois Press, 1970.
    • [3] S. Wolfram, Cellular Automata and Complexity Collected Papers. Addison-Wesley, 1994.
    • [4] M. Gardner, “The fantastic combinations of John Conway's new solitaire game “life”,” Scientific American, pp. 120-123, 1970.
    • [5] K. Preston and M. Duff, Modern Cellular Automata-Theory and Applications. Plenum Press, 1984.
    • [6] A. Rosenfeld and J. Pfaltz, “Digital distance functions on digital pictures,” Pattern Recognition, vol. 1, no. 1, pp. 33-61, 1968.
    • [7] C. Dyer and A. Rosenfeld, “Parallel image processing by memoryaugmented cellular automata,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 1, pp. 29-41, 1981.
    • [8] T. de Saint Pierre and M. Milgram, “New and efficient cellular algorithms for image processing,” CVGIP: Image Understanding, vol. 55, no. 3, pp. 261-274, 1992.
    • [9] G. Hernandez and H. Herrmann, “Cellular automata for elementary image enhancement,” Graphical Models and Image Processing, vol. 58, no. 1, pp. 82-89, 1996.
    • [10] I. Karafyllidis, A. Ioannidis, A. Thanailakis, and P. Tsalides, “Geometrical shape recognition using a cellular automaton architecture and its VLSI implementation,” Real-Time Imaging, vol. 3, pp. 243-254, 1997.
    • [11] L. Chua and L. Yang, “Cellular neural networks: applications,” IEEE Trans. Circuits and Systems, vol. 35, no. 10, pp. 1273-1290, 1988.
    • [12] H. Harrer and J. Nossek, “Discrete-time cellular neural networks,” Int. J. of Circ. Th. Appl., vol. 20, pp. 453-467, 1992.
    • [13] C. Reynolds, “Flocks herds and schools a distributed behavioral model,” in Proc. SIGGRAPH, 1987, pp. 25-34.
    • [14] B. Viher, A. Dobnikar, and D. Zazula, “Cellular automata and follicle recognition problem and possibilities of using cellular automata for image recognition purposes,” Int. J. of Medical Informatics, vol. 49, no. 2, pp. 231-241, 1998.
    • [15] M. Sipper, “The evolution of parallel cellular machines toward evolware,” BioSystems, vol. 42, pp. 29-43, 1997.
    • [16] G. Adorni, F. Bergenti, and S. Cagnoni, “A cellular-programming approach to pattern classification,” in Lecture Notes in Computer Sciences, 1998, vol. 1391, pp. 142-150.
    • [17] T. Toffoli and N. Margolus, Cellular Automata Machines. MIT Press, 1987.
    • [18] M. Halbach and R. Hoffmann, “Implementing cellular automata in fpga logic,” in Proc. 18th Int. Parallel and Distributed Processing Symp., 2004, p. 258a.
    • [19] N. Ganguly, B. Sikdar, A. Deutsch, G. Canright, and P. Chaudhuri, “A survey on cellular automata,” Centre for High Performance Computing, Dresden University of Technology, Tech. Rep. 9, 2003.
    • [20] P. Somol, P. Pudil, and J. Kittler, “Fast branch and bound algorithms for optimal feature selection,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 26, no. 7, pp. 900-912, 2004.
    • [21] T. Cover and J. V. Campenhout, “On the possible orderings in the measurement selection problem,” IEEE Trans. on Systems, Man and Cybernetics, vol. 7, no. 9, pp. 657-661, 1977.
    • [22] M. Mitchell, P. Hraber, and J. Crutchfield, “Evolving cellular automata to perform computation: Mechanisms and impedients,” Physica D, vol. 75, pp. 361-391, 1994.
    • [23] H. Juille´ and J. Pollack, “Coevolving the ideal trainer: Application to the discovery of cellular automata rules,” in Proc. 3rd Conf. on Genetic Programming. Morgan Kaufmann, 1998, pp. 519-527.
    • [24] D. Andre, F. B. III, and J. Koza, “Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem,” in Proc. 1st Conf. on Genetic Programming. MIT Press, 1996, pp. 3-11.
    • [25] F. J. Morales, J. Crutchfield, and M. Mitchell, “Evolving twodimensional cellular automata to perform density classification: a report on work in progress,” Parallel Computing, vol. 27, pp. 571-585, 2001.
    • [26] P. Pudil, J. Novovicova, and J. Kittler, “Floating search methods in feature-selection,” Pattern Recognition Letters, vol. 15, no. 11, pp. 1119- 1125, 1994.
    • [27] A. Jain and D. Zongker, “Feature-selection: Evaluation, application, and small sample performance,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 19, no. 2, pp. 153-158, 1997.
    • [28] H. Hao, C. Liu, and H. Sako, “Comparison of genetic algorithm and sequential search methods for classifier subset selection,” in Proc. 7th Int. Conf. on Document Analysis and Recognition, 2003, pp. 765-769.
    • [29] M. Raymer, W. Punch, E. Goodman, L. Kuhn, and A. Jain, “Dimensionality reduction using genetic algorithms,” IEEE Trans. on Evolutionary Computation, vol. 4, no. 2, pp. 164-171, 2000.
    • [30] R. Roy, A Primer on the Taguchi Method. Society of Manufacturing Engineers, 1990.
    • [31] D. Yu, C. Ho, X. Yu, and S. Mori, “On the application of cellular automata to image thinning with cellular neural network,” in Cellular Neural Networks and their Applications, 1992, pp. 210-215.
    • [32] T. Chen and H. Wu, “Application of partition-based median type filters for suppressing noise in images,” IEEE Trans. on Image Processing, vol. 10, no. 6, pp. 829-836, 2001.
    • [33] A. ben Hamza, P. Luque-Escamilla, J. Mart´ınez-Aroza, and R. Roma´nRolda´n, “Removing noise and preserving details with relaxed median filters,” J. Math. Imaging and Vision, vol. 11, no. 2, pp. 161-177, 1999.
    • [34] L. Khriji and M. Gabbouj, “Median-rational hybrid filters for image restoration,” Electronic Letters, vol. 34, no. 10, pp. 977-979, 1998.
    • [35] J. Romberg, H. Choi, and R. Baraniuk, “Bayesian tree-structured image modeling using wavelet domain hidden markov models,” IEEE Trans. on Image Processing, vol. 10, no. 7, pp. 1056-1068, 2001.
    • [36] M. Crouse, R. Nowak, and R. Baraniuk, “Wavelet-based statistical signal-processing using hidden markov-models,” IEEE Trans. on Signal Processing, vol. 46, no. 4, pp. 886-902, 1998.
    • [37] T. Zhang and C. Suen, “A fast parallel algorithm for thinning digital patterns,” Comm. ACM, vol. 27, no. 3, pp. 236-240, 1984.
    • [38] L. Lam and C. Suen, “An evaluation of parallel thinning algorithms for character-recognition,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 914-919, 1995.
    • [39] G. Borgefors and G. Sanniti di Baja, “Analysing nonconvex 2D and 3D patterns,” Computer Vision and Image Understanding, vol. 63, no. 1, pp. 145-157, 1996.
    • [40] T. Yang, Cellular Image Processing. Nova Science, 2001.
    • [41] L. Kitchen and A. Rosenfeld, “Edge evaluation using local edge coherence,” IEEE Trans. on Systems, Man and Cybernetics, vol. 11, pp. 597-605, 1981.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article