Eduardo Gomez-Ramirez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Eduardo Gomez-Ramirez has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Enso Ikonen
University of Oulu
5 shared publications Giovanni E. Pazienza
5 shared publicationsAntonio Arista-Jalife
Astalan Ltd. Mexico City, Mexico
3 shared publicationsFrancisco J. Rivero-Angeles
SEISMIC Ingeniería y Construcción SA de CV, Allende #80, Primer Piso, Col. Centro, 06010, Mexico, D. F., Mexico
3 shared publicationsK. Najim
Process Control Laboratory, ENSIACET, 118 route de Narbonne, 31077 Toulouse Cedex 4, France
3 shared publicationsA.S. Poznyak
Dept. de Control Autom., CINVESTAV-IPN, Mexico City, Mexico
2 shared publications
Latest Publications
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
One-shot Training of Polynomial Cellular Neural Networks and applications in image processing
The Polynomial Cellular Neural Network (PCNN) is a fully parallel, scalable, non-linear processor that uses polynomial terms to solve non-linear problems in a lattice fashion. The parallel nature of such processor allows every neuron (or cell) to gather information from the nearby neurons and independently process the retrieved values by employing non-linear functions and synaptic weights. Nonetheless, one of the main challenges of the PCNN is the determination of the synaptic weights in order to achieve the desired behavior. In this paper, a new training method is presented, based on two fundamental concepts: the root location training method and the polynomial surfaces. The proposed training method is able to straightforwardly determine the requested synaptic weights for any outer-totallistic cellular automata behavior. In order to deliver a proof of the potential of such proposition, several image processing tasks are performed with a single layered PCNN.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
One-shot Training of Polynomial Cellular Neural Networks and applications in image processing
The Polynomial Cellular Neural Network (PCNN) is a fully parallel, scalable, non-linear processor that uses polynomial terms to solve non-linear problems in a lattice fashion. The parallel nature of such processor allows every neuron (or cell) to gather information from the nearby neurons and independently process the retrieved values by employing non-linear functions and synaptic weights. Nonetheless, one of the main challenges of the PCNN is the determination of the synaptic weights in order to achieve the desired behavior. In this paper, a new training method is presented, based on two fundamental concepts: the root location training method and the polynomial surfaces. The proposed training method is able to straightforwardly determine the requested synaptic weights for any outer-totallistic cellular automata behavior. In order to deliver a proof of the potential of such proposition, several image processing tasks are performed with a single layered PCNN.
- 1 October 2014
- Published by Elsevier in Applied Soft Computing
- Vol. 23, 270-285
Optimal design of interval type 2 fuzzy controllers based on a simple tuning algorithm
- 1 October 2014
- Published by Elsevier in Applied Soft Computing
- Vol. 23, 270-285
Optimal design of interval type 2 fuzzy controllers based on a simple tuning algorithm
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A root location training method for polynomial cellular neural networks that implements totalistic cellular automata
The Polynomial Cellular Neural Network (PCNN) is a powerful non-linear processor that is capable of classifying non-linearly separable data points with a single neuron. Despite the capabilities of this model, the determination of the synaptic weights is not a trivial task. In this paper we present the root location training method as an effective, straightforward and high-speed procedure. Such method obtains the synaptic weights of a PCNN that implements any totalistic cellular automata behavior, dispensing the usage of heuristic methods such as genetic algorithms or numerical approaches such as quadratic programming procedures.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A root location training method for polynomial cellular neural networks that implements totalistic cellular automata
The Polynomial Cellular Neural Network (PCNN) is a powerful non-linear processor that is capable of classifying non-linearly separable data points with a single neuron. Despite the capabilities of this model, the determination of the synaptic weights is not a trivial task. In this paper we present the root location training method as an effective, straightforward and high-speed procedure. Such method obtains the synaptic weights of a PCNN that implements any totalistic cellular automata behavior, dispensing the usage of heuristic methods such as genetic algorithms or numerical approaches such as quadratic programming procedures.
- 23 April 2013
- Published by World Scientific Pub Co Pte Ltd in International Journal of Structural Stability and Dynamics
- Vol. 13 (03)
APPLICATION OF THE BASELINE STIFFNESS METHOD FOR DAMAGE DETECTION OF AN RC BUILDING WITHOUT BASELINE MODAL PARAMETERS UTILIZING THE INDEPENDENT COMPONENT ANALYSIS FOR MODAL EXTRACTION
In this paper, a damage detection study is presented for a seven-story concrete building. This structure was affected by the 1994 Northridge earthquake. Acceleration signals of the damaged system are processed utilizing both the Independent Component Analysis and the Frequency Domain Decomposition Method to extract modal parameters. Utilizing solely these parameters from the damaged structure and the approximate undamaged lateral stiffness of the first storey, a pre-damage state is determined. Damage assessment is achieved by the Baseline Stiffness Method and comparing the computed undamaged state of the building and the damaged one to detect loss of stiffness on each element of the structure. Advantages of the proposed methods are discussed to demonstrate the feasibility of the methodology to extract modal parameters and to identify structural damage in buildings without baseline modal information.
- 23 April 2013
- Published by World Scientific Pub Co Pte Ltd in International Journal of Structural Stability and Dynamics
- Vol. 13 (03)
APPLICATION OF THE BASELINE STIFFNESS METHOD FOR DAMAGE DETECTION OF AN RC BUILDING WITHOUT BASELINE MODAL PARAMETERS UTILIZING THE INDEPENDENT COMPONENT ANALYSIS FOR MODAL EXTRACTION
In this paper, a damage detection study is presented for a seven-story concrete building. This structure was affected by the 1994 Northridge earthquake. Acceleration signals of the damaged system are processed utilizing both the Independent Component Analysis and the Frequency Domain Decomposition Method to extract modal parameters. Utilizing solely these parameters from the damaged structure and the approximate undamaged lateral stiffness of the first storey, a pre-damage state is determined. Damage assessment is achieved by the Baseline Stiffness Method and comparing the computed undamaged state of the building and the damaged one to detect loss of stiffness on each element of the structure. Advantages of the proposed methods are discussed to demonstrate the feasibility of the methodology to extract modal parameters and to identify structural damage in buildings without baseline modal information.
- 1 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 19-26
Automatic implementation of totalistic cellular automata through polynomial cellular neural networks
The learning procedures of cellular automata and cellular neural networks are not trivial tasks. They have been addressed previously with several techniques such as genetic algorithms, although they are computationally costly. As a contribution in the area of polynomial cellular neural networks, in this paper we present a novel method to determine automatically the optimum order of the polynomial term, and the generalized system of equations for a polynomial cellular neural network that implements any totalistic cellular automata behavior. Such advances can be coupled with a quadratic programming algorithm in order to radically boost training performance and dispense human intervention.
- 1 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 19-26
Automatic implementation of totalistic cellular automata through polynomial cellular neural networks
The learning procedures of cellular automata and cellular neural networks are not trivial tasks. They have been addressed previously with several techniques such as genetic algorithms, although they are computationally costly. As a contribution in the area of polynomial cellular neural networks, in this paper we present a novel method to determine automatically the optimum order of the polynomial term, and the generalized system of equations for a polynomial cellular neural network that implements any totalistic cellular automata behavior. Such advances can be coupled with a quadratic programming algorithm in order to radically boost training performance and dispense human intervention.
- 1 January 2012
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 22 (01)
COMPLEXITY INDEX OF OUTER-TOTALISTIC BINARY CELLULAR AUTOMATA WITH ARBITRARY DIMENSION AND NEIGHBORHOOD
- 1 January 2012
- Published by World Scientific Pub Co Pte Ltd in International Journal of Bifurcation and Chaos
- Vol. 22 (01)
COMPLEXITY INDEX OF OUTER-TOTALISTIC BINARY CELLULAR AUTOMATA WITH ARBITRARY DIMENSION AND NEIGHBORHOOD
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2725-2732
Forecasting time series with a logarithmic model for the Polynomial Artificial Neural Networks
The adaptation made for the Polynomial Artificial Neural Networks (PANN) using not only integer exponentials but also fractional exponentials, have shown evidence of its better performance, especially, when it works with non-linear and chaotic time series. In this paper we show the comparison of the PANN improved model of fractional exponentials with a new logarithmic model. We show that this new model have even better performance than the last PANN improved model.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2725-2732
Forecasting time series with a logarithmic model for the Polynomial Artificial Neural Networks
The adaptation made for the Polynomial Artificial Neural Networks (PANN) using not only integer exponentials but also fractional exponentials, have shown evidence of its better performance, especially, when it works with non-linear and chaotic time series. In this paper we show the comparison of the PANN improved model of fractional exponentials with a new logarithmic model. We show that this new model have even better performance than the last PANN improved model.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Learning in Polynomial Cellular neural networks using quadratic programming
Finding the weights of a Polynomial Cellular Neural/Nonlinear Network performing a given task is not straightforward. Several approaches have been proposed so far, but they are often computationally expensive. Here, we prove that quadratic programming can solve this problem efficiently and effectively in the particular case of a totalistic network. Besides the theoretical treatment, we present several examples in which our method is employed successfully for any complexity index.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Learning in Polynomial Cellular neural networks using quadratic programming
Finding the weights of a Polynomial Cellular Neural/Nonlinear Network performing a given task is not straightforward. Several approaches have been proposed so far, but they are often computationally expensive. Here, we prove that quadratic programming can solve this problem efficiently and effectively in the particular case of a totalistic network. Besides the theoretical treatment, we present several examples in which our method is employed successfully for any complexity index.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Simple Tuning Algorithm improvements for fuzzy logic controllers
Simple Tuning Algorithm is a methodology designed to improve the desired response of a fuzzy controller in an intuitive way. In this paper several new changes to this methodology are included, to reduce the effects of the overshot of the previous version and redesign the rules to apply in dynamical systems with different damping factors. In this version, the simplicity is maintained, to reach a broader universe of readers without automatic control or fuzzy logic knowledge. Some experiments with different dynamics confirm the performance of the new methodology.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Simple Tuning Algorithm improvements for fuzzy logic controllers
Simple Tuning Algorithm is a methodology designed to improve the desired response of a fuzzy controller in an intuitive way. In this paper several new changes to this methodology are included, to reduce the effects of the overshot of the previous version and redesign the rules to apply in dynamical systems with different damping factors. In this version, the simplicity is maintained, to reach a broader universe of readers without automatic control or fuzzy logic knowledge. Some experiments with different dynamics confirm the performance of the new methodology.
- 1 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21650144,p. 1-5
Threshold of complexity in 2D binary Cellular Automata found through Polynomial CNNs
The theoretical studies about the relationship between Cellular Nonlinear Networks (CNNs) and Cellular Automata (CA) have led to the definition of new concepts, such as the complexity index and the threshold of complexity, for 1D CA. However, their interpretation in 2D CA has not been investigated yet. In this paper, we show that Polynomial CNNs can provide a deep insight into 2D binary CA and allow us to introduce a rigorous definition of complexity index. Among other results, we prove that the threshold of complexity in 2D CA is the same as in 1D CA and that the well-known Game of Life is the simplest universal 2D binary Cellular Automaton.
- 1 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21650144,p. 1-5
Threshold of complexity in 2D binary Cellular Automata found through Polynomial CNNs
The theoretical studies about the relationship between Cellular Nonlinear Networks (CNNs) and Cellular Automata (CA) have led to the definition of new concepts, such as the complexity index and the threshold of complexity, for 1D CA. However, their interpretation in 2D CA has not been investigated yet. In this paper, we show that Polynomial CNNs can provide a deep insight into 2D binary CA and allow us to introduce a rigorous definition of complexity index. Among other results, we prove that the threshold of complexity in 2D CA is the same as in 1D CA and that the well-known Game of Life is the simplest universal 2D binary Cellular Automaton.