Andrés Romero-Arellano
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrés Romero-Arellano has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ernesto Moya-Albor
Facultad de Ingeniería, Universidad Panamericana, Augusto Rodin 498, Ciudad de México 03920, Mexico
4 shared publications - Jorge Brieva
Facultad de Ingeniería, Universidad Panamericana, Augusto Rodin 498, Ciudad de México 03920, Mexico
4 shared publications - Sandra Luz Gomez Coronel
Instituto Politécnico Nacional, UPIITA, Departamento de Ingeniería, Av. IPN No. 2580, Col. La Laguna Ticomán, Ciudad de México 07340, Mexico
3 shared publications Alexia E. Pérez-Echeverría
Universidad Panamericana,Facultad de Ingeniera,Augusto Rodin 498, Ciudad de Mxico,Mxico,03920
1 shared publication- Ivan Cruz-Aceves
Centro de Investigación en Matemáticas (CIMAT), A.C., Secretaría de Ciencia, Humanidades, Tecnología e Innovación (SECIHTI), Jalisco S/N, Col. Valenciana, Valenciana 36023, Mexico
1 shared publication - Juan Gabriel Avina-Cervantes
Telematics and Digital Signal Processing Research Groups (CAs), Engineering Division, Campus Irapuato-Salamanca, University of Guanajuato, Salamanca 36885, Mexico
1 shared publication
Latest Publications
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A Photoplethysmography Signal Encryption Approach Based on the Modular Derivative and Langton’s Ant
In this work, a photoplethysmography signal encryption/decryption approach is presented. The modular discrete derivative and Langton’s Ant encrypt signals obtained from a contact-less heart rate estimation method. On the one hand, the modular discrete derivative efficiently hides the information of the signals. On the other hand, the Langton’s Ant, a cellular automaton, incorporates a high key space. Thus, through statistical tests, performance against attacks analysis, and security tests, a secure and trustworthy encryption method applied to photoplethysmography signals is evaluated.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A Photoplethysmography Signal Encryption Approach Based on the Modular Derivative and Langton’s Ant
In this work, a photoplethysmography signal encryption/decryption approach is presented. The modular discrete derivative and Langton’s Ant encrypt signals obtained from a contact-less heart rate estimation method. On the one hand, the modular discrete derivative efficiently hides the information of the signals. On the other hand, the Langton’s Ant, a cellular automaton, incorporates a high key space. Thus, through statistical tests, performance against attacks analysis, and security tests, a secure and trustworthy encryption method applied to photoplethysmography signals is evaluated.
- Open Access
- 21 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8430
A Robust and Secure Watermarking Approach Based on Hermite Transform and SVD-DCT
Currently, algorithms to embed watermarks into digital images are increasing exponentially, for example in image copyright protection. However, when a watermarking algorithm is applied, the preservation of the image’s quality is of utmost importance, for example in medical images, where improper embedding of the watermark could change the patient’s diagnosis. On the other hand, in digital images distributed over the Internet, the owner of the images must also be protected. In this work, an imperceptible, robust, secure, and hybrid watermarking algorithm is presented for copyright protection. It is based on the Hermite Transform (HT) and the Discrete Cosine Transform (DCT) as a spatial–frequency representation of a grayscale image. Besides, it uses a block-based strategy and a perfectibility analysis of the best embedding regions inspired by the Human Vision System (HVS), giving the imperceptibility of the watermark, and a Singular-Value Decomposition (SVD) approach improved robustness against attacks. In addition, the proposed method can embed two watermarks, a digital binary image (LOGO) and information about the owner and the technical data of the original image in text format (MetaData). To secure both watermarks, the proposed method uses the Jigsaw Transform (JST) and the Elementary Cellular Automaton (ECA) to encrypt the image LOGO and a random sequence generator and the XOR operation to encrypt the image MetaData. On the other hand, the proposed method was tested using a public dataset of 49 grayscale images to assess the effectiveness of the watermark embedding and extraction procedures. Furthermore, the proposed watermarking algorithm was evaluated under several processing and geometric algorithms to demonstrate its robustness to the majority, intentional or unintentional, attacks, and a comparison was made with several state-of-the-art techniques. The proposed method obtained average values of PSNR = 40.2051 dB, NCC = 0.9987, SSIM = 0.9999, and MSSIM = 0.9994 for the watermarked image. In the case of the extraction of the LOGO, the proposal gave MSE = 0, PSNR ≫ 60 dB, NCC = 1, SSIM = 1, and MSSIM = 1, whereas, for the image MetaData extracted, it gave BER = 0% and . Finally, the proposed encryption method presented a large key space () for the LOGO image.- 21 July 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (14) , 8430
Open AccessA Robust and Secure Watermarking Approach Based on Hermite Transform and SVD-DCT
Currently, algorithms to embed watermarks into digital images are increasing exponentially, for example in image copyright protection. However, when a watermarking algorithm is applied, the preservation of the image’s quality is of utmost importance, for example in medical images, where improper embedding of the watermark could change the patient’s diagnosis. On the other hand, in digital images distributed over the Internet, the owner of the images must also be protected. In this work, an imperceptible, robust, secure, and hybrid watermarking algorithm is presented for copyright protection. It is based on the Hermite Transform (HT) and the Discrete Cosine Transform (DCT) as a spatial–frequency representation of a grayscale image. Besides, it uses a block-based strategy and a perfectibility analysis of the best embedding regions inspired by the Human Vision System (HVS), giving the imperceptibility of the watermark, and a Singular-Value Decomposition (SVD) approach improved robustness against attacks. In addition, the proposed method can embed two watermarks, a digital binary image (LOGO) and information about the owner and the technical data of the original image in text format (MetaData). To secure both watermarks, the proposed method uses the Jigsaw Transform (JST) and the Elementary Cellular Automaton (ECA) to encrypt the image LOGO and a random sequence generator and the XOR operation to encrypt the image MetaData. On the other hand, the proposed method was tested using a public dataset of 49 grayscale images to assess the effectiveness of the watermark embedding and extraction procedures. Furthermore, the proposed watermarking algorithm was evaluated under several processing and geometric algorithms to demonstrate its robustness to the majority, intentional or unintentional, attacks, and a comparison was made with several state-of-the-art techniques. The proposed method obtained average values of PSNR = 40.2051 dB, NCC = 0.9987, SSIM = 0.9999, and MSSIM = 0.9994 for the watermarked image. In the case of the extraction of the LOGO, the proposal gave MSE = 0, PSNR ≫ 60 dB, NCC = 1, SSIM = 1, and MSSIM = 1, whereas, for the image MetaData extracted, it gave BER = 0% and . Finally, the proposed encryption method presented a large key space () for the LOGO image. - Open Access
- 22 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2396
Color Image Encryption Algorithm Based on a Chaotic Model Using the Modular Discrete Derivative and Langton’s Ant
In this work, a color image encryption and decryption algorithm for digital images is presented. It is based on the modular discrete derivative (MDD), a novel technique to encrypt images and efficiently hide visual information. In addition, Langton’s ant, which is a two-dimensional universal Turing machine with a high key space, is used. Moreover, a deterministic noise technique that adds security to the MDD is utilized. The proposed hybrid scheme exploits the advantages of MDD and Langton’s ant, generating a very secure and reliable encryption algorithm. In this proposal, if the key is known, the original image is recovered without loss. The method has demonstrated high performance through various tests, including statistical analysis (histograms and correlation distributions), entropy, texture analysis, encryption quality, key space assessment, key sensitivity analysis, and robustness to differential attack. The proposed method highlights obtaining chi-square values between and , entropy values between and , PSNR values (in the original and encrypted images) between and , the number of pixel change rate (NPCR) values between and , unified average changing intensity (UACI) values between and , and a vast range of possible keys . On the other hand, an analysis of the sensitivity of the key shows that slight changes to the key do not generate any additional information to decrypt the image. In addition, the proposed method shows a competitive performance against recent works found in the literature.- 22 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2396
Open AccessColor Image Encryption Algorithm Based on a Chaotic Model Using the Modular Discrete Derivative and Langton’s Ant
In this work, a color image encryption and decryption algorithm for digital images is presented. It is based on the modular discrete derivative (MDD), a novel technique to encrypt images and efficiently hide visual information. In addition, Langton’s ant, which is a two-dimensional universal Turing machine with a high key space, is used. Moreover, a deterministic noise technique that adds security to the MDD is utilized. The proposed hybrid scheme exploits the advantages of MDD and Langton’s ant, generating a very secure and reliable encryption algorithm. In this proposal, if the key is known, the original image is recovered without loss. The method has demonstrated high performance through various tests, including statistical analysis (histograms and correlation distributions), entropy, texture analysis, encryption quality, key space assessment, key sensitivity analysis, and robustness to differential attack. The proposed method highlights obtaining chi-square values between and , entropy values between and , PSNR values (in the original and encrypted images) between and , the number of pixel change rate (NPCR) values between and , unified average changing intensity (UACI) values between and , and a vast range of possible keys . On the other hand, an analysis of the sensitivity of the key shows that slight changes to the key do not generate any additional information to decrypt the image. In addition, the proposed method shows a competitive performance against recent works found in the literature. - Open Access
Image Encryption and Decryption System through a Hybrid Approach Using the Jigsaw Transform and Langton’s Ant Applied to Retinal Fundus Images
In this work, a new medical image encryption/decryption algorithm was proposed. It is based on three main parts: the Jigsaw transform, Langton’s ant, and a novel way to add deterministic noise. The Jigsaw transform was used to hide visual information effectively, whereas Langton’s ant and the deterministic noise algorithm give a reliable and secure approach. As a case study, the proposal was applied to high-resolution retinal fundus images, where a zero mean square error was obtained between the original and decrypted image. The method performance has been proven through several testing methods, such as statistical analysis (histograms and correlation distributions), entropy computation, keyspace assessment, robustness to differential attack, and key sensitivity analysis, showing in each one a high security level. In addition, the method was compared against other works showing a competitive performance and highlighting with a large keyspace (>1. Besides, the method has demonstrated adequate handling of high-resolution images, obtaining entropy values between 7.999988 and 7.999989, an average Number of Pixel Change Rate (NPCR) of , and a mean Uniform Average Change Intensity (UACI) of . In addition, when there is a small change in the key, the method does not give additional information to decrypt the image.Open AccessImage Encryption and Decryption System through a Hybrid Approach Using the Jigsaw Transform and Langton’s Ant Applied to Retinal Fundus Images
In this work, a new medical image encryption/decryption algorithm was proposed. It is based on three main parts: the Jigsaw transform, Langton’s ant, and a novel way to add deterministic noise. The Jigsaw transform was used to hide visual information effectively, whereas Langton’s ant and the deterministic noise algorithm give a reliable and secure approach. As a case study, the proposal was applied to high-resolution retinal fundus images, where a zero mean square error was obtained between the original and decrypted image. The method performance has been proven through several testing methods, such as statistical analysis (histograms and correlation distributions), entropy computation, keyspace assessment, robustness to differential attack, and key sensitivity analysis, showing in each one a high security level. In addition, the method was compared against other works showing a competitive performance and highlighting with a large keyspace (>1. Besides, the method has demonstrated adequate handling of high-resolution images, obtaining entropy values between 7.999988 and 7.999989, an average Number of Pixel Change Rate (NPCR) of , and a mean Uniform Average Change Intensity (UACI) of . In addition, when there is a small change in the key, the method does not give additional information to decrypt the image.