Deni Librado Torres-Roman

Dr. Deni Librado Torres-Roman

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2018 in Sensors
Verified
Journal Article
Open access
PDF file
RVRoxana Velazquez-Pupo
Roxana Velazquez-Pupo
ARAlberto Sierra Romero
Alberto Sierra Romero
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
YSYuriy V. Shkvarko
Yuriy V. Shkvarko
JSJayro Santiago
Jayro Santiago
MRMisael Romero-Delgado
Misael Romero-Delgado
This paper presents a high performance vision-based system with a single static camera for traffic surveillance, for moving vehicle detection with occlusion handling, tracking, counting, and One Class Support Vector Machine (OC-SVM) classification. In this approach, moving objects are first segmented from the background using the adaptive Gaussian Mixture Model (GMM). After that, several geometric features are extracted, such as vehicle area, height, width, centroid, and bounding box. As occlusion is present, an algorithm was implemented to reduce it. The tracking is performed with adaptive Kalman filter. Finally, the selected geometric features: estimated area, height, and width are used by different classifiers in order to sort vehicles into three classes: small, midsize, and large. Extensive experimental results in eight real traffic videos with more than 4000 ground truth vehicles have shown that the improved system can run in real time under an occlusion index of 0.312 and classify vehicles with a global detection rate or recall, precision, and F-measure of up to 98.190%, and an F-measure of up to 99.051% for midsize vehicles.

5 February 2020 in Remote Sensing
Verified
Journal Article
Open access
PDF file
JLJosué López
Josué López
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
SSStewart Santos
Stewart Santos
Clement ATZBERGERClement ATZBERGER
Clement ATZBERGER
This work aims at addressing two issues simultaneously: data compression at input space and semantic segmentation. Semantic segmentation of remotely sensed multi- or hyperspectral images through deep learning (DL) artificial neural networks (ANN) delivers as output the corresponding matrix of pixels classified elementwise, achieving competitive performance metrics. With technological progress, current remote sensing (RS) sensors have more spectral bands and higher spatial resolution than before, which means a greater number of pixels in the same area. Nevertheless, the more spectral bands and the greater number of pixels, the higher the computational complexity and the longer the processing times. Therefore, without dimensionality reduction, the classification task is challenging, particularly if large areas have to be processed. To solve this problem, our approach maps an RS-image or third-order tensor into a core tensor, representative of our input image, with the same spatial domain but with a lower number of new tensor bands using a Tucker decomposition (TKD). Then, a new input space with reduced dimensionality is built. To find the core tensor, the higher-order orthogonal iteration (HOOI) algorithm is used. A fully convolutional network (FCN) is employed afterwards to classify at the pixel domain, each core tensor. The whole framework, called here HOOI-FCN, achieves high performance metrics competitive with some RS-multispectral images (MSI) semantic segmentation state-of-the-art methods, while significantly reducing computational complexity, and thereby, processing time. We used a Sentinel-2 image data set from Central Europe as a case study, for which our framework outperformed other methods (included the FCN itself) with average pixel accuracy (PA) of 90% (computational time ∼90s) and nine spectral bands, achieving a higher average PA of 91.97% (computational time ∼36.5s), and average PA of 91.56% (computational time ∼9.5s) for seven and five new tensor bands, respectively.

8 September 2015 in Entropy
Verified
Journal Article
Open access
PDF file
JSJayro Santiago
Jayro Santiago
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
AFAngel Figueroa-Ypiña
Angel Figueroa-Ypiña
JAJesus Argaez
Jesus Argaez
Network anomaly detection and classification is an important open issue in network security. Several approaches and systems based on different mathematical tools have been studied and developed, among them, the Anomaly-Network Intrusion Detection System (A-NIDS), which monitors network traffic and compares it against an established baseline of a “normal” traffic profile. Then, it is necessary to characterize the “normal” Internet traffic. This paper presents an approach for anomaly detection and classification based on Shannon, Rényi and Tsallis entropies of selected features, and the construction of regions from entropy data employing the Mahalanobis distance (MD), and One Class Support Vector Machine (OC-SVM) with different kernels (Radial Basis Function (RBF) and Mahalanobis Kernel (MK)) for “normal” and abnormal traffic. Regular and non-regular regions built from “normal” traffic profiles allow anomaly detection, while the classification is performed under the assumption that regions corresponding to the attack classes have been previously characterized. Although this approach allows the use of as many features as required, only four well-known significant features were selected in our case. In order to evaluate our approach, two different data sets were used: one set of real traffic obtained from an Academic Local Area Network (LAN), and the other a subset of the 1998 MIT-DARPA set. For these data sets, a True positive rate up to 99.35%, a True negative rate up to 99.83% and a False negative rate at about 0.16% were yielded. Experimental results show that certain q-values of the generalized entropies and the use of OC-SVM with RBF kernel improve the detection rate in the detection stage, while the novel inclusion of MK kernel in OC-SVM and k-temporal nearest neighbors improve accuracy in classification. In addition, the results show that using the Box-Cox transformation, the Mahalanobis distance yielded high detection rates with an efficient computation time, while OC-SVM achieved detection rates slightly higher, but is more computationally expensive.

6 September 2011 in Entropy
Verified
Journal Article
Open access
PDF file
JRJulio-César Ramirez-Pacheco
Julio-César Ramirez-Pacheco
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
LRLuis Rizo-Dominguez
Luis Rizo-Dominguez
JTJoel Antonio Trejo-Sanchez
Joel Antonio Trejo-Sanchez
FMFrancisco Manzano-Pinzón
Francisco Manzano-Pinzón
This article defines the concept of wavelet-based Fisher’s information measure (wavelet FIM) and develops a closed-form expression of this measure for 1=f α signals. Wavelet Fisher’s information measure characterizes the complexities associated to 1=f α signals and provides a powerful tool for their analysis. Theoretical and experimental studies demonstrate that this quantity is exponentially increasing for α > 1 (non-stationary signals) and almost constant for α < 1 (stationary signals). Potential applications of wavelet FIM are discussed in some detail and its power and robustness for the detection of structural breaks in the mean embedded in stationary fractional Gaussian noise signals studied.

1 March 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Efraín Alberto Padilla-ZepedaEfraín Alberto Padilla-Zepeda
Efraín Alberto Padilla-Zepeda
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
AMAndres Mendez-Vazquez
Andres Mendez-Vazquez
The present work, unlike others, does not try to reduce the noise in hyperspectral images to increase the semantic segmentation performance metrics; rather, we present a classification framework for noisy Hyperspectral Images (HSI), studying the classification performance metrics for different SNR levels and where the inputs are compressed. This framework consists of a 3D Convolutional Neural Network (3DCNN) that uses as input data a spectrally compressed version of the HSI, obtained from the Tucker Decomposition (TKD). The advantage of this classifier is the ability to handle spatial and spectral features from the core tensor, exploiting the spatial correlation of remotely sensed images of the earth surface. To test the performance of this framework, signal-independent thermal noise and signal-dependent photonic noise generators are implemented to simulate an extensive collection of tests, from 60 dB to −20 dB of Signal-to-Noise Ratio (SNR) over three datasets: Indian Pines (IP), University of Pavia (UP), and Salinas (SAL). For comparison purposes, we have included tests with Support Vector Machine (SVM), Random Forest (RF), 1DCNN, and 2DCNN. For the test cases, the datasets were compressed to only 40 tensor bands for a relative reconstruction error less than 1%. This framework allows us to classify the noisy data with better accuracy and significantly reduces the computational complexity of the Deep Learning (DL) model. The framework exhibits an excellent performance from 60 dB to 0 dB of SNR for 2DCNN and 3DCNN, achieving a Kappa coefficient from 0.90 to 1.0 in all the noisy data scenarios for a representative set of labeled samples of each class for training, from 5% to 10% for the datasets used in this work. The source code and log files of the experiments used for this paper are publicly available for research purposes.

1 February 2021 in Journal of Systems Architecture
Verified
Journal Article
Closed access
RAR.I. Acosta-Quiñonez
R.I. Acosta-Quiñonez
DTDeni Librado Torres-Roman
Deni Librado Torres-Roman
RRR. Rodriguez-Avila
R. Rodriguez-Avila