entropy-logo

Journal Browser

Journal Browser

Entropy-Based Algorithms for Signal Processing

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Signal and Data Analysis".

Deadline for manuscript submissions: closed (31 May 2020) | Viewed by 34720

Special Issue Editors


E-Mail Website
Guest Editor
Department of Embedded Systems Engineering, Incheon National University, 119 Academy-ro, Yeonsu-gu, Incheon 22012, Republic of Korea
Interests: remote sensing; deep learning; artificial intelligence; image processing; signal processing
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
1. Department of Applied Sciences, University of Quebec in Chicoutimi, 555, boul. de l’Université, Chicoutimi, QC G7H 2B1, Canada
2. School of Information Technology and Engineering, University of Ottawa, 800 King Edward Avenue Ottawa, Ottawa, ON K1N 6N5, Canada
Interests: machine learning; big data analytics; modeling and optimization of vehicular networks; statistical signal processing; wireless communications; Internet of Things; industry 4.0; 5G
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Entropy, the key factor of information theory, is one of the most important research areas in computer science. Entropy coding informs us of the formal limits of today’s storage and communication infrastructure. Over the last few years, entropy has become as an adequate trade-off measure in signal processing. Entropy measures especially have been used in image and video processing by applying sparsity and are able to help us to solve several of the issues that we are currently facing. As the daily produced data are increasing rapidly, a more effective approach to encode or compress the big data is required. In this sense, applications of entropy coding can improve image and video coding, remote sensing imaging, quality assessment in agricultural products, and product inspection, by applying more effective coding approaches. This Special Issue calls for recent studies on various signal processing approaches that are based on entropy coding. Papers of both a theoretical and applicative nature are welcome, as well as contributions regarding new image and video processing techniques for the entropy research community. Major, though by no means exclusive, topics of interest are:

Keywords:

  • Multichannel imaging;
  • Sensor size, channel number, dynamic range;
  • Modeling of signal processing;
  • Compression approach;
  • Entropy-based video coding;
  • Prediction and redundancy for video coding;
  • Noise removal approach;
  • GPU-based methods for signal processing;
  • Signal quality assessment.

Prof. Gwanggil Jeon
Prof. Abdellah Chehri
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (11 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Editorial

Jump to: Research

5 pages, 163 KiB  
Editorial
Entropy-Based Algorithms for Signal Processing
by Gwanggil Jeon and Abdellah Chehri
Entropy 2020, 22(6), 621; https://doi.org/10.3390/e22060621 - 04 Jun 2020
Cited by 1 | Viewed by 1949
Abstract
Entropy, the key factor of information theory, is one of the most important research areas in computer science [...] Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)

Research

Jump to: Editorial

19 pages, 4676 KiB  
Article
Two-Dimensional Permutation Vectors’ (PV) Code for Optical Code Division Multiple Access Systems
by Hassan Yousif Ahmed, Medien Zeghid, Waqas A.Imtiaz, Teena Sharma, Abdellah Chehri and Paul Fortier
Entropy 2020, 22(5), 576; https://doi.org/10.3390/e22050576 - 20 May 2020
Cited by 20 | Viewed by 3712
Abstract
In this paper, we present a new algorithm to generate two-dimensional (2D) permutation vectors’ (PV) code for incoherent optical code division multiple access (OCDMA) system to suppress multiple access interference (MAI) and system complexity. The proposed code design approach is based on wavelength-hopping [...] Read more.
In this paper, we present a new algorithm to generate two-dimensional (2D) permutation vectors’ (PV) code for incoherent optical code division multiple access (OCDMA) system to suppress multiple access interference (MAI) and system complexity. The proposed code design approach is based on wavelength-hopping time-spreading (WHTS) technique for code generation. All possible combinations of PV code sets were attained by employing all permutations of the vectors with repetition of each vector weight (W) times. Further, 2D-PV code set was constructed by combining two code sequences of the 1D-PV code. The transmitter-receiver architecture of 2D-PV code-based WHTS OCDMA system is presented. Results indicated that the 2D-PV code provides increased cardinality by eliminating phase-induced intensity noise (PIIN) effects and multiple user data can be transmitted with minimum likelihood of interference. Simulation results validated the proposed system for an agreeable bit error rate (BER) of 10−9. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

16 pages, 2881 KiB  
Article
A Cross Entropy Based Deep Neural Network Model for Road Extraction from Satellite Images
by Bowei Shan and Yong Fang
Entropy 2020, 22(5), 535; https://doi.org/10.3390/e22050535 - 09 May 2020
Cited by 16 | Viewed by 3637
Abstract
This paper proposes a deep convolutional neural network model with encoder-decoder architecture to extract road network from satellite images. We employ ResNet-18 and Atrous Spatial Pyramid Pooling technique to trade off between the extraction precision and running time. A modified cross entropy loss [...] Read more.
This paper proposes a deep convolutional neural network model with encoder-decoder architecture to extract road network from satellite images. We employ ResNet-18 and Atrous Spatial Pyramid Pooling technique to trade off between the extraction precision and running time. A modified cross entropy loss function is proposed to train our deep model. A PointRend algorithm is used to recover a smooth, clear and sharp road boundary. The augmentated DeepGlobe dataset is used to train our deep model and the asynchronous training method is applied to accelerate the training process. Five salellite images covering Xiaomu village are taken as input to evaluate our model. The proposed E-Road model has fewer number of parameters and shorter training time. The experiments show E-Road outperforms other state-of-the-art deep models with 5.84% to 59.09% improvement, and can give the accurate predictions for the images with complex environment. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

18 pages, 6821 KiB  
Article
Compound Fault Diagnosis of Rolling Bearing Based on Singular Negentropy Difference Spectrum and Integrated Fast Spectral Correlation
by Guiji Tang and Tian Tian
Entropy 2020, 22(3), 367; https://doi.org/10.3390/e22030367 - 23 Mar 2020
Cited by 17 | Viewed by 2994
Abstract
Compound fault diagnosis is challenging due to the complexity, diversity and non-stationary characteristics of mechanical complex faults. In this paper, a novel compound fault separation method based on singular negentropy difference spectrum (SNDS) and integrated fast spectral correlation (IFSC) is proposed. Firstly, the [...] Read more.
Compound fault diagnosis is challenging due to the complexity, diversity and non-stationary characteristics of mechanical complex faults. In this paper, a novel compound fault separation method based on singular negentropy difference spectrum (SNDS) and integrated fast spectral correlation (IFSC) is proposed. Firstly, the original signal was de-noised by SNDS which improved the noise reduction effect of singular difference spectrum by introducing negative entropy. Secondly, the de-noised signal was analyzed by fast spectral correlation. Finally, IFSC took the fourth-order energy as the index to determine the resonance band and separate the fault features of different single fault. The proposed method is applied to analyze the simulated compound signals and the experimental vibration signals, the results show that the proposed method has excellent performance in the separation of rolling bearing composite faults. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

12 pages, 3853 KiB  
Article
A Multiple-Input Multiple-Output Reservoir Computing System Subject to Optoelectronic Feedbacks and Mutual Coupling
by Xiurong Bao, Qingchun Zhao and Hongxi Yin
Entropy 2020, 22(2), 231; https://doi.org/10.3390/e22020231 - 18 Feb 2020
Cited by 8 | Viewed by 2924
Abstract
In this paper, a multiple-input multiple-output reservoir computing (RC) system is proposed, which is composed of multiple nonlinear nodes (Mach–Zehnder modulators) and multiple mutual-coupling loops of optoelectronic delay lines. Each input signal is added into every mutual-coupling loop to implement the simultaneous recognition [...] Read more.
In this paper, a multiple-input multiple-output reservoir computing (RC) system is proposed, which is composed of multiple nonlinear nodes (Mach–Zehnder modulators) and multiple mutual-coupling loops of optoelectronic delay lines. Each input signal is added into every mutual-coupling loop to implement the simultaneous recognition of multiple route signals, which results in the signal processing speed improving and the number of routes increasing. As an example, the four-route input and four-route output RC is simultaneously realized by numerical simulations. The results show that this type of RC system can successfully recognize the four-route optical packet headers with 3-bit, 8-bit, 16-bit, and 32-bit, and four-route independent digital speeches. When the white noise is added to the signals such that the signal-to-noise ratio (SNR) of the optical packet headers and the digital speeches are 35 dB and 20 dB respectively, the normalized root mean square errors (NRMSEs) of the signal recognition are all close to 0.1. The word error rates (WERs) of the optical packet header recognition are 0%. The WER of the digital speech recognition is 1.6%. The eight-route input and eight-route output RC is also numerically simulated. The recognition of the eight-route 3-bit optical packet headers is implemented. The parallel processing of multiple-route signals and the high recognition accuracy are implemented by this proposed system. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

18 pages, 4575 KiB  
Article
Blind Mesh Assessment Based on Graph Spectral Entropy and Spatial Features
by Yaoyao Lin, Mei Yu, Ken Chen, Gangyi Jiang, Fen Chen and Zongju Peng
Entropy 2020, 22(2), 190; https://doi.org/10.3390/e22020190 - 07 Feb 2020
Cited by 13 | Viewed by 2724
Abstract
With the wide applications of three-dimensional (3D) meshes in intelligent manufacturing, digital animation, virtual reality, digital cities and other fields, more and more processing techniques are being developed for 3D meshes, including watermarking, compression, and simplification, which will inevitably lead to various distortions. [...] Read more.
With the wide applications of three-dimensional (3D) meshes in intelligent manufacturing, digital animation, virtual reality, digital cities and other fields, more and more processing techniques are being developed for 3D meshes, including watermarking, compression, and simplification, which will inevitably lead to various distortions. Therefore, how to evaluate the visual quality of 3D mesh is becoming an important problem and it is necessary to design effective tools for blind 3D mesh quality assessment. In this paper, we propose a new Blind Mesh Quality Assessment method based on Graph Spectral Entropy and Spatial features, called as BMQA-GSES. 3D mesh can be represented as graph signal, in the graph spectral domain, the Gaussian curvature signal of the 3D mesh is firstly converted with Graph Fourier transform (GFT), and then the smoothness and information entropy of amplitude features are extracted to evaluate the distortion. In the spatial domain, four well-performing spatial features are combined to describe the concave and convex information and structural information of 3D meshes. All the extracted features are fused by the random forest regression to predict the objective quality score of the 3D mesh. Experiments are performed successfully on the public databases and the obtained results show that the proposed BMQA-GSES method provides good correlation with human visual perception and competitive scores compared to state-of-art quality assessment methods. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

22 pages, 11340 KiB  
Article
Entropy-Based Image Fusion with Joint Sparse Representation and Rolling Guidance Filter
by Yudan Liu, Xiaomin Yang, Rongzhu Zhang, Marcelo Keese Albertini, Turgay Celik and Gwanggil Jeon
Entropy 2020, 22(1), 118; https://doi.org/10.3390/e22010118 - 18 Jan 2020
Cited by 17 | Viewed by 4196
Abstract
Image fusion is a very practical technology that can be applied in many fields, such as medicine, remote sensing and surveillance. An image fusion method using multi-scale decomposition and joint sparse representation is introduced in this paper. First, joint sparse representation is applied [...] Read more.
Image fusion is a very practical technology that can be applied in many fields, such as medicine, remote sensing and surveillance. An image fusion method using multi-scale decomposition and joint sparse representation is introduced in this paper. First, joint sparse representation is applied to decompose two source images into a common image and two innovation images. Second, two initial weight maps are generated by filtering the two source images separately. Final weight maps are obtained by joint bilateral filtering according to the initial weight maps. Then, the multi-scale decomposition of the innovation images is performed through the rolling guide filter. Finally, the final weight maps are used to generate the fused innovation image. The fused innovation image and the common image are combined to generate the ultimate fused image. The experimental results show that our method’s average metrics are: mutual information ( M I )—5.3377, feature mutual information ( F M I )—0.5600, normalized weighted edge preservation value ( Q A B / F )—0.6978 and nonlinear correlation information entropy ( N C I E )—0.8226. Our method can achieve better performance compared to the state-of-the-art methods in visual perception and objective quantification. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

14 pages, 2626 KiB  
Article
Identification of Functional Bioprocess Model for Recombinant E. Coli Cultivation Process
by Renaldas Urniezius and Arnas Survyla
Entropy 2019, 21(12), 1221; https://doi.org/10.3390/e21121221 - 14 Dec 2019
Cited by 9 | Viewed by 3113
Abstract
The purpose of this study is to introduce an improved Luedeking–Piret model that represents a structurally simple biomass concentration approach. The developed routine provides acceptable accuracy when fitting experimental data that incorporate the target protein concentration of Escherichia coli culture BL21 (DE3) pET28a [...] Read more.
The purpose of this study is to introduce an improved Luedeking–Piret model that represents a structurally simple biomass concentration approach. The developed routine provides acceptable accuracy when fitting experimental data that incorporate the target protein concentration of Escherichia coli culture BL21 (DE3) pET28a in fed-batch processes. This paper presents system identification, biomass, and product parameter fitting routines, starting from their roots of origin to the entropy-related development, characterized by robustness and simplicity. A single tuning coefficient allows for the selection of an optimization criterion that serves equally well for higher and lower biomass concentrations. The idea of the paper is to demonstrate that the use of fundamental knowledge can make the general model more common for technological use compared to a sophisticated artificial neural network. Experimental validation of the proposed model involved data analysis of six cultivation experiments compared to 19 experiments used for model fitting and parameter estimation. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

16 pages, 2916 KiB  
Article
A Novel Infrared and Visible Image Information Fusion Method Based on Phase Congruency and Image Entropy
by Xinghua Huang, Guanqiu Qi, Hongyan Wei, Yi Chai and Jaesung Sim
Entropy 2019, 21(12), 1135; https://doi.org/10.3390/e21121135 - 21 Nov 2019
Cited by 39 | Viewed by 3101
Abstract
In multi-modality image fusion, source image decomposition, such as multi-scale transform (MST), is a necessary step and also widely used. However, when MST is directly used to decompose source images into high- and low-frequency components, the corresponding decomposed components are not precise enough [...] Read more.
In multi-modality image fusion, source image decomposition, such as multi-scale transform (MST), is a necessary step and also widely used. However, when MST is directly used to decompose source images into high- and low-frequency components, the corresponding decomposed components are not precise enough for the following infrared-visible fusion operations. This paper proposes a non-subsampled contourlet transform (NSCT) based decomposition method for image fusion, by which source images are decomposed to obtain corresponding high- and low-frequency sub-bands. Unlike MST, the obtained high-frequency sub-bands have different decomposition layers, and each layer contains different information. In order to obtain a more informative fused high-frequency component, maximum absolute value and pulse coupled neural network (PCNN) fusion rules are applied to different sub-bands of high-frequency components. Activity measures, such as phase congruency (PC), local measure of sharpness change (LSCM), and local signal strength (LSS), are designed to enhance the detailed features of fused low-frequency components. The fused high- and low-frequency components are integrated to form a fused image. The experiment results show that the fused images obtained by the proposed method achieve good performance in clarity, contrast, and image information entropy. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

15 pages, 1095 KiB  
Article
Recognition of a Single Dynamic Gesture with the Segmentation Technique HS-ab and Principle Components Analysis (PCA)
by Diana Alejandra Contreras Alejo and Francisco Javier Gallegos Funes
Entropy 2019, 21(11), 1114; https://doi.org/10.3390/e21111114 - 14 Nov 2019
Cited by 7 | Viewed by 2636
Abstract
A continuous path performed by the hand in a period of time is considered for the purpose of gesture recognition. Dynamic gestures recognition is a complex topic since it spans from the conventional method of separating the hand from surrounding environment to searching [...] Read more.
A continuous path performed by the hand in a period of time is considered for the purpose of gesture recognition. Dynamic gestures recognition is a complex topic since it spans from the conventional method of separating the hand from surrounding environment to searching for the fingers and palm. This paper proposes a strategy of hand recognition using a PC webcam, a segmentation technique (HS-ab which means HSV and CIELab color space), pre-processing of images to reduce noise and a classifier such as Principle Components Analysis (PCA) for the detection and tracking of the hand of the user. The results show that the segmentation technique HS-ab and the method PCA are robust in the execution of the system, although there are various conditions such as illumination, speed and precision of the movements. It is for this reason that a suitable extraction and classification of features allows the location of the gesture. The system was tested with the database of the training images and has a 94.74% accuracy. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

23 pages, 8772 KiB  
Article
An Entropy-Based Algorithm with Nonlocal Residual Learning for Image Compressive Sensing Recovery
by Zhonghua Xie, Lingjun Liu and Cui Yang
Entropy 2019, 21(9), 900; https://doi.org/10.3390/e21090900 - 17 Sep 2019
Cited by 6 | Viewed by 2648
Abstract
Image recovery from compressive sensing (CS) measurement data, especially noisy data has always been challenging due to its implicit ill-posed nature, thus, to seek a domain where a signal can exhibit a high degree of sparsity and to design an effective algorithm have [...] Read more.
Image recovery from compressive sensing (CS) measurement data, especially noisy data has always been challenging due to its implicit ill-posed nature, thus, to seek a domain where a signal can exhibit a high degree of sparsity and to design an effective algorithm have drawn increasingly more attention. Among various sparsity-based models, structured or group sparsity often leads to more powerful signal reconstruction techniques. In this paper, we propose a novel entropy-based algorithm for CS recovery to enhance image sparsity through learning the group sparsity of residual. To reduce the residual of similar packed patches, the group sparsity of residual is described by a Laplacian scale mixture (LSM) model, therefore, each singular value of the residual of similar packed patches is modeled as a Laplacian distribution with a variable scale parameter, to exploit the benefits of high-order dependency among sparse coefficients. Due to the latent variables, the maximum a posteriori (MAP) estimation of the sparse coefficients cannot be obtained, thus, we design a loss function for expectation–maximization (EM) method based on relative entropy. In the frame of EM iteration, the sparse coefficients can be estimated with the denoising-based approximate message passing (D-AMP) algorithm. Experimental results have shown that the proposed algorithm can significantly outperform existing CS techniques for image recovery. Full article
(This article belongs to the Special Issue Entropy-Based Algorithms for Signal Processing)
Show Figures

Figure 1

Back to TopTop