Implementation on CUDA of the Smoothing Problem with Tissue-Like P Systems

Implementation on CUDA of the Smoothing Problem with Tissue-Like P Systems

Francisco Peña-Cantillana, Daniel Díaz-Pernil, Hepzibah A. Christinal, Miguel A. Gutiérrez-Naranjo
Copyright: © 2011 |Pages: 10
DOI: 10.4018/jncr.2011070103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Smoothing is often used in Digital Imagery for improving the quality of an image by reducing its level of noise. This paper presents a parallel implementation of an algorithm for smoothing 2D images in the framework of Membrane Computing. The chosen formal framework has been tissue-like P systems. The algorithm has been implemented by using a novel device architecture called CUDA (Compute Unified Device Architecture) which allows the parallel NVIDIA Graphics Processors Units (GPUs) to solve many complex computational problems. Some examples are presented and compared; research lines for the future are also discussed.
Article Preview
Top

2. Preliminaries

In this section we provide some basics on the used P system model, tissue-like P systems, and on the foundation of Digital Imagery.

Tissue-like P systems (Martín-Vide, Păun, Pazos, & Rodríguez-Patón, 2003) have two biological inspirations: intercellular communication and cooperation between neurons. The common mathematical model of these two mechanisms is a network of processors dealing with symbols and communicating these symbols along channels specified in advance.

Formally, a tissue-like P system with input of degree q≥1 is a tuple∏=(Γ, Σ, E, w1,…,wq, R, iΠ, oΠ)where

Complete Article List

Search this Journal:
Reset
Volume 12: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 11: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 10: 4 Issues (2021)
Volume 9: 4 Issues (2020)
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing