Solving 2D-pattern matching with networks of picture processors

Mitrana, Victor and Bordihn, Henning and Bottoni, Paolo and Labella, Anna (2014). Solving 2D-pattern matching with networks of picture processors. In: "Third International Conference on the Theory and Practice of Natural Computing (TPNC 2014), 2014 Granada, Spain, December 9-11, 2014", 9-11 de diciembre de 2014, Granada, España. ISBN 978-3-319-13748-3. pp. 157-168. https://doi.org/10.1007/978-3-319-13749-0_14.

Description

Title: Solving 2D-pattern matching with networks of picture processors
Author/s:
  • Mitrana, Victor
  • Bordihn, Henning
  • Bottoni, Paolo
  • Labella, Anna
Item Type: Presentation at Congress or Conference (Article)
Event Title: Third International Conference on the Theory and Practice of Natural Computing (TPNC 2014), 2014 Granada, Spain, December 9-11, 2014
Event Dates: 9-11 de diciembre de 2014
Event Location: Granada, España
Title of Book: Theory and practice of natural computing : Third International Conference, TPNC 2014, Granada, Spain, December 9-11, 2014 : Proceedings
Título de Revista/Publicación: Lecture Notes in Computer Science
Date: November 2014
ISBN: 978-3-319-13748-3
ISSN: 0302-9743
Volume: 8890
Subjects:
Faculty: E.T.S.I. de Sistemas Informáticos (UPM)
Department: Sistemas Informáticos
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (800kB) | Preview

Abstract

We propose a solution based on networks of picture processors to the problem of picture pattern matching. The network solving the problem can be informally described as follows: it consists of two subnetworks, one of them extracts simultaneously all subpictures of the same size from the input picture and sends them to the second subnetwork. The second subnetwork checks whether any of the received pictures is identical to the pattern. We present an efficient solution based on networks with evolutionary processors only, for patterns with at most three rows or columns. Afterwards, we present a solution based on networks containing both evolutionary and hiding processors running in O(n+m+kl+k) computational (processing and communication) steps, where the input picture and the pattern are of size (n,m) and (k,l), respectively.

More information

Item ID: 40227
DC Identifier: http://oa.upm.es/40227/
OAI Identifier: oai:oa.upm.es:40227
DOI: 10.1007/978-3-319-13749-0_14
Official URL: https://link.springer.com/chapter/10.1007/978-3-319-13749-0_14
Deposited by: Memoria Investigacion
Deposited on: 12 Jun 2017 16:40
Last Modified: 12 Jun 2017 16:40
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM