scispace - formally typeset
Search or ask a question
Author

Hong Peng

Bio: Hong Peng is an academic researcher from Xihua University. The author has contributed to research in topics: Skeletonization & Digital image. The author has an hindex of 1, co-authored 1 publications receiving 40 citations.

Papers
More filters
Journal ArticleDOI
01 Mar 2019
TL;DR: Some of the open research lines in the area of membrane computing are presented, focusing on segmentation problems, skeletonization and algebraic-topological aspects of the images.
Abstract: Membrane computing is a well-known research area in computer science inspired by the organization and behavior of live cells and tissues. Their computational devices, called P systems, work in parallel and distributed mode and the information is encoded by multisets in a localized manner. All these features make P systems appropriate for dealing with digital images. In this paper, some of the open research lines in the area are presented, focusing on segmentation problems, skeletonization and algebraic-topological aspects of the images. An extensive bibliography about the application of membrane computing to the study of digital images is also provided.

64 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A new variant of neural-like P systems, dendrite P (DeP) systems, where neurons simulate the computational function of dendrites and perform a firing-storing process instead of the storing-firing process in spiking neural P (SNP) Systems are proposed.

47 citations

Journal ArticleDOI
TL;DR: It is proved that NS NP systems as number-generating/accepting devices are Turing-universal, and two small universal NSNP systems for function computing and number generator are established, containing 117 neurons and 164 Neurons, respectively.
Abstract: This paper proposes a new variant of spiking neural P systems (in short, SNP systems), nonlinear spiking neural P systems (in short, NSNP systems). In NSNP systems, the state of each neuron is deno...

45 citations

Journal ArticleDOI
TL;DR: An overview of all existing approaches of hardware implementation in the area of P systems is performed and the quantitative and qualitative attributes of FPGA-based implementations and CUDA-enabled GPU-based simulations are compared to evaluate the two methodologies.
Abstract: The model of membrane computing, also known under the name of P systems, is a bio-inspired large-scale parallel computing paradigm having a good potential for the design of massively parallel algorithms. For its implementation it is very natural to choose hardware platforms that have important inherent parallelism, such as field-programmable gate arrays (FPGAs) or compute unified device architecture (CUDA)-enabled graphic processing units (GPUs). This article performs an overview of all existing approaches of hardware implementation in the area of P systems. The quantitative and qualitative attributes of FPGA-based implementations and CUDA-enabled GPU-based simulations are compared to evaluate the two methodologies.

38 citations

Journal ArticleDOI
TL;DR: An automatic implementation method for automatically fulfilling the hard task, named membrane computing fault diagnosis (MCFD) method is developed, which is a very significant attempt in the development of FRSN P systems and even of the membrane computing applications.
Abstract: As an important variant of membrane computing models, fuzzy reasoning spiking neural P systems (FRSN P systems) were introduced to build a link between P systems and fault diagnosis applications. An FRSN P system offers an intuitive illustration based on a strictly mathematical expression, a good fault-tolerant capacity, a good description for the relationships between protective devices and faults, and an understandable diagnosis model-building process. However, the implementation of FRSN P systems is still at a manual process, which is a time-consuming and hard labor work, especially impossible to perform on large-scale complex power systems. This manual process seriously limits the use of FRSN P systems to diagnose faults in large-scale complex power systems and has always been a challenging and ongoing task for many years. In this work we develop an automatic implementation method for automatically fulfilling the hard task, named membrane computing fault diagnosis (MCFD) method. This is a very significant attempt in the development of FRSN P systems and even of the membrane computing applications. MCFD is realized by automating input and output, and diagnosis processes consists of network topology analysis, suspicious fault component analysis, construction of FRSN P systems for suspicious fault components, and fuzzy inference. Also, the feasibility of the FRSN P system is verified on the IEEE14, IEEE 39, and IEEE 118 node systems.

34 citations

Journal ArticleDOI
TL;DR: It is proved that NSN P is Turing universal as number generating devices, where the production functions in each neuron are linear functions, each involving at most one variable, and as number accepting devices,NSN P systems are proved to be universal as well, even if each neuron contains only one production function.
Abstract: Spiking neural P (SN P) systems are a class of discrete neuron-inspired computation models, where information is encoded by the numbers of spikes in neurons and the timing of spikes. However, due to the discontinuous nature of the integrate-and-fire behavior of neurons and the symbolic representation of information, SN P systems are incompatible with the gradient descent-based training algorithms, such as the backpropagation algorithm, and lack the capability of processing the numerical representation of information. In this work, motivated by the numerical nature of numerical P (NP) systems in the area of membrane computing, a novel class of SN P systems is proposed, called numerical SN P (NSN P) systems. More precisely, information is encoded by the values of variables, and the integrate-and-fire way of neurons and the distribution of produced values are described by continuous production functions. The computation power of NSN P systems is investigated. We prove that NSN P is Turing universal as number generating devices, where the production functions in each neuron are linear functions, each involving at most one variable; as number accepting devices, NSN P systems are proved to be universal as well, even if each neuron contains only one production function. These results show that even if a single neuron is simple in the sense that it contains one or two production functions and the production functions in each neuron are linear functions with one variable, a network of simple neurons are still computationally powerful. With the powerful computation power and the characteristic of continuous production functions, developing learning algorithms for NSN P systems is potentially exploitable.

28 citations