Georgia Koukiou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Georgia Koukiou has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Vassilis Anastassopoulos
Electronics Laboratory, Physics Department, University of Patras, 26504 Patras, Greece
17 shared publications - Spiros Papadopoulos
Electronics Laboratory, Physics Department, University of Patras, 26504 Patras, Greece
5 shared publications Vassilis Anastassopoulos
Electronics Laboratory, Department of Physics, University of Patras, 26504, Rio, Greece
4 shared publications- Konstantinos Karachristos
Electronics Laboratory (ELLAB), Physics Department, University of Patras, 26504 Rio, Greece
3 shared publications - Styliani Tassiopoulou
Electronics Laboratory, Physics Department, University of Patras, Rio, 26504 Patras, Greece
3 shared publications Anastasios Natsos
Department of Urology University of Patras Patras Greece
1 shared publication
Latest Publications
- Open Access
- 1 June 2026
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 15 Ā (11) , 2402
Deep Learning Architectures for Pattern Recognition: A Comparative Review of Challenges, Applications, and the Path Toward XAI
The recent rapid growth of deep learning has significantly reshaped the landscape of computer vision, establishing itself as the preferred paradigm for various tasks. Deep learning methods have demonstrated superior performance compared to previous state-of-the-art machine learning techniques across various fields. This review provides a concise overview of artificial neural networks (ANNs) and some of the most significant deep learning architectures, such as recurrent neural networks (RNNs), generative adversarial networks (GANs) and radial basis function networks (RBFNs). This review not only outlines the historical context and structures of these architectures but also provides a sophisticated understanding of their applications across different computer vision domains. A rigorous and comprehensive overview of these architectures is discussed throughout this review, and an essential systematic comparative analysis based on specific benchmarking criteria is provided. While individual deep learning frameworks excel in distinct domains, selecting the optimal architecture requires a balanced trade-off between algorithmic complexity, computational overhead, data dependencies, and structural interpretability. An intuitive and holistic benchmarking process synthesizes the core characteristics, technical configurations, operational constraints, and developmental pathways toward Explainable AI (XAI) and Green AI sustainability for the examined architectures (ANNs, RNNs, LSTMs, GANs, and RBFNs). Additionally, in this work the advantages and limitations of these architectures are discussed. Furthermore, an investigation of their applications in diverse computer vision tasks is carried out.
- 1 June 2026
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 15 Ā (11) , 2402
Open AccessDeep Learning Architectures for Pattern Recognition: A Comparative Review of Challenges, Applications, and the Path Toward XAI
The recent rapid growth of deep learning has significantly reshaped the landscape of computer vision, establishing itself as the preferred paradigm for various tasks. Deep learning methods have demonstrated superior performance compared to previous state-of-the-art machine learning techniques across various fields. This review provides a concise overview of artificial neural networks (ANNs) and some of the most significant deep learning architectures, such as recurrent neural networks (RNNs), generative adversarial networks (GANs) and radial basis function networks (RBFNs). This review not only outlines the historical context and structures of these architectures but also provides a sophisticated understanding of their applications across different computer vision domains. A rigorous and comprehensive overview of these architectures is discussed throughout this review, and an essential systematic comparative analysis based on specific benchmarking criteria is provided. While individual deep learning frameworks excel in distinct domains, selecting the optimal architecture requires a balanced trade-off between algorithmic complexity, computational overhead, data dependencies, and structural interpretability. An intuitive and holistic benchmarking process synthesizes the core characteristics, technical configurations, operational constraints, and developmental pathways toward Explainable AI (XAI) and Green AI sustainability for the examined architectures (ANNs, RNNs, LSTMs, GANs, and RBFNs). Additionally, in this work the advantages and limitations of these architectures are discussed. Furthermore, an investigation of their applications in diverse computer vision tasks is carried out.
- Open Access
- 8 May 2026
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 16 Ā (10) , 4649
Applications of the Kalman Filter in Physical Processes: A Review
This article outlines various specialized adaptations of the Kalman Filter designed to address specific estimation challenges across different domains of Physics. The work demonstrates the significant potential of the Kalman filter to enhance the accuracy and reliability of measurements in Physics, providing robust, real-time, and adaptive estimation capabilities. The paper starts with an extensive introduction to the core of the Kalman filter. A clear description of the different filter categories follows, along with the conditions under which each is applied. Various Kalman filter variants address nonlinear, adaptive, continuous-time, large-scale, and uncertain systems. These include the Extended and Unscented Kalman Filters for nonlinear estimation, Adaptive and KalmanāBucy filters for changing or continuous dynamics, and Ensemble or SchmidtāKalman filters for large or reduced-order systems. Robust, Cubature, Probabilistic, and Particle Kalman filters further improve performance under outliers, strong nonlinearities, and non-Gaussian uncertainty. To illustrate the practical relevance, detailed applications in Physics are discussed, including thermodynamics, electromagnetism, high-energy physics, quantum physics, and astrophysics, highlighting how Kalman filtering enhances both predictive accuracy and measurement-informed decision-making.
- 8 May 2026
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 16 Ā (10) , 4649
Open AccessApplications of the Kalman Filter in Physical Processes: A Review
This article outlines various specialized adaptations of the Kalman Filter designed to address specific estimation challenges across different domains of Physics. The work demonstrates the significant potential of the Kalman filter to enhance the accuracy and reliability of measurements in Physics, providing robust, real-time, and adaptive estimation capabilities. The paper starts with an extensive introduction to the core of the Kalman filter. A clear description of the different filter categories follows, along with the conditions under which each is applied. Various Kalman filter variants address nonlinear, adaptive, continuous-time, large-scale, and uncertain systems. These include the Extended and Unscented Kalman Filters for nonlinear estimation, Adaptive and KalmanāBucy filters for changing or continuous dynamics, and Ensemble or SchmidtāKalman filters for large or reduced-order systems. Robust, Cubature, Probabilistic, and Particle Kalman filters further improve performance under outliers, strong nonlinearities, and non-Gaussian uncertainty. To illustrate the practical relevance, detailed applications in Physics are discussed, including thermodynamics, electromagnetism, high-energy physics, quantum physics, and astrophysics, highlighting how Kalman filtering enhances both predictive accuracy and measurement-informed decision-making.
- Open Access
- 25 January 2026
- Published byĀ MDPI AGĀ inĀ Remote Sensing
- Vol.Ā 18 Ā (3) , 399
A Multi-Class BahadurāLazarsfeld Expansion Framework for Pixel-Level Fusion in Multi-Sensor Land Cover Classification
In many land cover classification tasks, the limited precision of individual sensors hinders the accurate separation of certain classes, largely due to the complexity of the Earthās surface morphology. To mitigate these issues, decision fusion methodologies are employed, allowing data from multiple sensors to be synthesized into robust and more conclusive classification outcomes. This study employs fully polarimetric Synthetic Aperture Radar (PolSAR) imagery and leverages the strengths of three decomposition methods, namely Pauliās, Krogagerās, and Cloudeās, by extracting their respective components for improved detection. From each decomposition method, three scattering components are derived, enabling the extraction of informative features that describe the scattering behavior associated with various land cover types. The extracted scattering features, treated as independent sensors, were used to train three neural network classifiers. The resulting outputs were then considered as local decisions for each land cover type and subsequently fused through a decision fusion rule to generate more complete and accurate classification results. Experimental results demonstrate that the proposed Multi-Class BahadurāLazarsfeld Expansion (MC-BLE) fusion significantly enhances classification performance, achieving an overall accuracy (OA) of 95.78% and a Kappa coefficient of 0.94. Compared to individual classification methods, the fusion notably improved per-class accuracy, particularly for complex land cover boundaries. The core innovation of this work is the transformation of the BahadurāLazarsfeld Expansion (BLE), originally designed for binary decision fusion into a multi-class framework capable of addressing multiple land cover types, resulting in a more effective and reliable decision fusion strategy.
- 25 January 2026
- Published byĀ MDPI AGĀ inĀ Remote Sensing
- Vol.Ā 18 Ā (3) , 399
Open AccessA Multi-Class BahadurāLazarsfeld Expansion Framework for Pixel-Level Fusion in Multi-Sensor Land Cover Classification
In many land cover classification tasks, the limited precision of individual sensors hinders the accurate separation of certain classes, largely due to the complexity of the Earthās surface morphology. To mitigate these issues, decision fusion methodologies are employed, allowing data from multiple sensors to be synthesized into robust and more conclusive classification outcomes. This study employs fully polarimetric Synthetic Aperture Radar (PolSAR) imagery and leverages the strengths of three decomposition methods, namely Pauliās, Krogagerās, and Cloudeās, by extracting their respective components for improved detection. From each decomposition method, three scattering components are derived, enabling the extraction of informative features that describe the scattering behavior associated with various land cover types. The extracted scattering features, treated as independent sensors, were used to train three neural network classifiers. The resulting outputs were then considered as local decisions for each land cover type and subsequently fused through a decision fusion rule to generate more complete and accurate classification results. Experimental results demonstrate that the proposed Multi-Class BahadurāLazarsfeld Expansion (MC-BLE) fusion significantly enhances classification performance, achieving an overall accuracy (OA) of 95.78% and a Kappa coefficient of 0.94. Compared to individual classification methods, the fusion notably improved per-class accuracy, particularly for complex land cover boundaries. The core innovation of this work is the transformation of the BahadurāLazarsfeld Expansion (BLE), originally designed for binary decision fusion into a multi-class framework capable of addressing multiple land cover types, resulting in a more effective and reliable decision fusion strategy.
- Open Access
- 16 December 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 13, 212856-212866
Continuous-Time Quantum Walk on Biological Network
Disease gene prioritization is a computational strategy that assigns scores to genes or proteins to estimate their likelihood of being associated with a specific disease, helping reduce the cost and effort of experimental validation. Given the large number of candidate genes and limited laboratory resources, effective prioritization techniques are essential for focusing experimental efforts on the most promising targets. In this study, we introduce a novel disease gene prioritization method based on continuous-time quantum walks applied to a heterogeneous biological network comprising both gene and disease nodes. This heterogeneous formulation enables a more comprehensive representation of biological interactions compared to traditional homogeneous models. By propagating quantum amplitudes through the network, the proposed framework captures complex structural patterns and interaction dynamics that classical approaches may overlook. To assess its effectiveness, we perform two types of evaluation: (i) comparison of our predictions with established findings reported in the literature, and (ii) benchmarking against a widely used classical prioritization technique. Experimental results show that our quantum walk-based model consistently outperforms the classical baseline, achieving an area under the curve (AUC) of 0.912 versus 0.804. These results demonstrate the potential of quantum-inspired algorithms to enhance accuracy in disease gene discovery and highlight their value for advancing computational methods in omics research.We further validated the robustness of our approach by incorporating the PrecisionāRecall AUC, which confirmed the superior predictive performance of the quantum walk model across multiple seed genes.
- 16 December 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 13, 212856-212866
Open AccessContinuous-Time Quantum Walk on Biological Network
Disease gene prioritization is a computational strategy that assigns scores to genes or proteins to estimate their likelihood of being associated with a specific disease, helping reduce the cost and effort of experimental validation. Given the large number of candidate genes and limited laboratory resources, effective prioritization techniques are essential for focusing experimental efforts on the most promising targets. In this study, we introduce a novel disease gene prioritization method based on continuous-time quantum walks applied to a heterogeneous biological network comprising both gene and disease nodes. This heterogeneous formulation enables a more comprehensive representation of biological interactions compared to traditional homogeneous models. By propagating quantum amplitudes through the network, the proposed framework captures complex structural patterns and interaction dynamics that classical approaches may overlook. To assess its effectiveness, we perform two types of evaluation: (i) comparison of our predictions with established findings reported in the literature, and (ii) benchmarking against a widely used classical prioritization technique. Experimental results show that our quantum walk-based model consistently outperforms the classical baseline, achieving an area under the curve (AUC) of 0.912 versus 0.804. These results demonstrate the potential of quantum-inspired algorithms to enhance accuracy in disease gene discovery and highlight their value for advancing computational methods in omics research.We further validated the robustness of our approach by incorporating the PrecisionāRecall AUC, which confirmed the superior predictive performance of the quantum walk model across multiple seed genes.
- Open Access
- 1 August 2025
- Published byĀ MDPI AGĀ inĀ Machine Learning and Knowledge Extraction
- Vol.Ā 7 Ā (3) , 75
Quantum Machine Learning and Deep Learning: Fundamentals, Algorithms, Techniques, and Real-World Applications
Quantum computing, with its foundational principles of superposition and entanglement, has the potential to provide significant quantum advantages, addressing challenges that classical computing may struggle to overcome. As data generation continues to grow exponentially and technological advancements accelerate, classical machine learning algorithms increasingly face difficulties in solving complex real-world problems. The integration of classical machine learning with quantum information processing has led to the emergence of quantum machine learning, a promising interdisciplinary field. This work provides the reader with a bottom-up view of quantum circuits starting from quantum data representation, quantum gates, the fundamental quantum algorithms, and more complex quantum processes. Thoroughly studying the mathematics behind them is a powerful tool to guide scientists entering this domain and exploring their connection to quantum machine learning. Quantum algorithms such as Shorās algorithm, Groverās algorithm, and the HarrowāHassidimāLloyd (HHL) algorithm are discussed in detail. Furthermore, real-world implementations of quantum machine learning and quantum deep learning are presented in fields such as healthcare, bioinformatics and finance. These implementations aim to enhance time efficiency and reduce algorithmic complexity through the development of more effective quantum algorithms. Therefore, a comprehensive understanding of the fundamentals of these algorithms is crucial.
- 1 August 2025
- Published byĀ MDPI AGĀ inĀ Machine Learning and Knowledge Extraction
- Vol.Ā 7 Ā (3) , 75
Open AccessQuantum Machine Learning and Deep Learning: Fundamentals, Algorithms, Techniques, and Real-World Applications
Quantum computing, with its foundational principles of superposition and entanglement, has the potential to provide significant quantum advantages, addressing challenges that classical computing may struggle to overcome. As data generation continues to grow exponentially and technological advancements accelerate, classical machine learning algorithms increasingly face difficulties in solving complex real-world problems. The integration of classical machine learning with quantum information processing has led to the emergence of quantum machine learning, a promising interdisciplinary field. This work provides the reader with a bottom-up view of quantum circuits starting from quantum data representation, quantum gates, the fundamental quantum algorithms, and more complex quantum processes. Thoroughly studying the mathematics behind them is a powerful tool to guide scientists entering this domain and exploring their connection to quantum machine learning. Quantum algorithms such as Shorās algorithm, Groverās algorithm, and the HarrowāHassidimāLloyd (HHL) algorithm are discussed in detail. Furthermore, real-world implementations of quantum machine learning and quantum deep learning are presented in fields such as healthcare, bioinformatics and finance. These implementations aim to enhance time efficiency and reduce algorithmic complexity through the development of more effective quantum algorithms. Therefore, a comprehensive understanding of the fundamentals of these algorithms is crucial.
- Open Access
- 11 March 2025
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 14 Ā (6) , 1096
Coastline and Riverbed Change Detection in the Broader Area of the City of Patras Using Very High-Resolution Multi-Temporal Imagery
Accurate and robust information on land cover changes in urban and coastal areas is essential for effective urban land management, ecosystem monitoring, and urban planning. This paper details the methodology and results of a pixel-level classification and change detection analysis, leveraging 1945 Royal Air Force (RAF) aerial imagery and 2011 Very High-Resolution (VHR) multispectral WorldView-2 satellite imagery from the broader area of Patras, Greece. Our attention is mainly focused on the changes in the coastline from the city of Patras to the northeast direction and the two major rivers, Charadros and Selemnos. The methodology involves preprocessing steps such as registration, denoising, and resolution adjustments to ensure computational feasibility for both coastal and riverbed change detection procedures while maintaining critical spatial features. For change detection at coastal areas over time, the Normalized Difference Water Index (NDWI) was applied to the new imagery to mask out the sea from the coastline and manually archive imagery from 1945. To determine the differences in the coastline between 1945 and 2011, we perform image differencing by subtracting the 1945 image from the 2011 image. This highlights the areas where changes have occurred over time. To conduct riverbed change detection, feature extraction using the Gray-Level Co-occurrence Matrix (GLCM) was applied to capture spatial characteristics. A Support Vector Machine (SVM) classification model was trained to distinguish river pixels from non-river pixels, enabling the identification of changes in riverbeds and achieving 92.6% and 92.5% accuracy for new and old imagery, respectively. Post-classification processing included classification maps to enhance the visualization of the detected changes. This approach highlights the potential of combining historical and modern imagery with supervised machine learning methods to effectively assess coastal erosion and riverbed alterations.
- 11 March 2025
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 14 Ā (6) , 1096
Open AccessCoastline and Riverbed Change Detection in the Broader Area of the City of Patras Using Very High-Resolution Multi-Temporal Imagery
Accurate and robust information on land cover changes in urban and coastal areas is essential for effective urban land management, ecosystem monitoring, and urban planning. This paper details the methodology and results of a pixel-level classification and change detection analysis, leveraging 1945 Royal Air Force (RAF) aerial imagery and 2011 Very High-Resolution (VHR) multispectral WorldView-2 satellite imagery from the broader area of Patras, Greece. Our attention is mainly focused on the changes in the coastline from the city of Patras to the northeast direction and the two major rivers, Charadros and Selemnos. The methodology involves preprocessing steps such as registration, denoising, and resolution adjustments to ensure computational feasibility for both coastal and riverbed change detection procedures while maintaining critical spatial features. For change detection at coastal areas over time, the Normalized Difference Water Index (NDWI) was applied to the new imagery to mask out the sea from the coastline and manually archive imagery from 1945. To determine the differences in the coastline between 1945 and 2011, we perform image differencing by subtracting the 1945 image from the 2011 image. This highlights the areas where changes have occurred over time. To conduct riverbed change detection, feature extraction using the Gray-Level Co-occurrence Matrix (GLCM) was applied to capture spatial characteristics. A Support Vector Machine (SVM) classification model was trained to distinguish river pixels from non-river pixels, enabling the identification of changes in riverbeds and achieving 92.6% and 92.5% accuracy for new and old imagery, respectively. Post-classification processing included classification maps to enhance the visualization of the detected changes. This approach highlights the potential of combining historical and modern imagery with supervised machine learning methods to effectively assess coastal erosion and riverbed alterations.
- Open Access
- 8 February 2025
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 14 Ā (4) , 664
A Pixel Shift Estimation Approach Using Spectral Information
This research paper presents a robust image registration algorithm tailored for the accurate estimation of image displacements. Image registration is a fundamental task in computer vision and image processing, with applications ranging from medical imaging to motion tracking in surveillance systems. The algorithmās efficacy is explored through a series of experiments conducted on image pairs, both in scenarios without noise and those affected by additive noise. The algorithmās core methodology involves a combination of techniques, including Fourier transforms, phase correlation, and subpixel estimation. By leveraging these techniques, the algorithm can simultaneously compute both the integer and subpixel components of image displacement. This capability is particularly valuable in scenarios demanding precise alignment and motion analysis. In the experiments, the algorithmās performance is assessed using the Mean Estimation Error (MEE), which quantifies the accuracy of displacement estimation. The results reveal that the algorithm consistently achieves high precision and accuracy, even in the presence of uniform white noise with a mean of 25 and standard deviation of 15. This robustness to noise underscores its suitability for real-world applications where images are often affected by various sources of interference. The comparative analysis between noise-free and noisy scenarios demonstrates the algorithmās resilience to adverse conditions, making it a versatile tool for image registration tasks in practical environments. Its potential applications encompass computer vision, medical imaging, security and surveillance, and high-precision image processing. The robustness of the algorithm to noise and sub-pixel accuracy makes it an asset for a wide range of applications, promising enhanced capabilities in image alignment and motion analysis.
- 8 February 2025
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 14 Ā (4) , 664
Open AccessA Pixel Shift Estimation Approach Using Spectral Information
This research paper presents a robust image registration algorithm tailored for the accurate estimation of image displacements. Image registration is a fundamental task in computer vision and image processing, with applications ranging from medical imaging to motion tracking in surveillance systems. The algorithmās efficacy is explored through a series of experiments conducted on image pairs, both in scenarios without noise and those affected by additive noise. The algorithmās core methodology involves a combination of techniques, including Fourier transforms, phase correlation, and subpixel estimation. By leveraging these techniques, the algorithm can simultaneously compute both the integer and subpixel components of image displacement. This capability is particularly valuable in scenarios demanding precise alignment and motion analysis. In the experiments, the algorithmās performance is assessed using the Mean Estimation Error (MEE), which quantifies the accuracy of displacement estimation. The results reveal that the algorithm consistently achieves high precision and accuracy, even in the presence of uniform white noise with a mean of 25 and standard deviation of 15. This robustness to noise underscores its suitability for real-world applications where images are often affected by various sources of interference. The comparative analysis between noise-free and noisy scenarios demonstrates the algorithmās resilience to adverse conditions, making it a versatile tool for image registration tasks in practical environments. Its potential applications encompass computer vision, medical imaging, security and surveillance, and high-precision image processing. The robustness of the algorithm to noise and sub-pixel accuracy makes it an asset for a wide range of applications, promising enhanced capabilities in image alignment and motion analysis.
- Open Access
- 28 September 2024
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 13 Ā (19) , 3846
Pixel-Level Decision Fusion for Land Cover Classification Using PolSAR Data and Local Pattern Differences
Combining various viewpoints to produce coherent and cohesive results requires decision fusion. These methodologies are essential for synthesizing data from multiple sensors in remote sensing classification in order to make conclusive decisions. Using fully polarimetric Synthetic Aperture Radar (PolSAR) imagery, our study combines the benefits of both approaches for detection by extracting Pauliās and Krogagerās decomposition components. The Local Pattern Differences (LPD) method was employed on every decomposition component for pixel-level texture feature extraction. These extracted features were utilized to train three independent classifiers. Ultimately, these findings were handled as independent decisions for each land cover type and were fused together using a decision fusion rule to produce complete and enhanced classification results. As part of our approach, after a thorough examination, the most appropriate classifiers and decision rules were exploited, as well as the mathematical foundations required for effective decision fusion. Incorporating qualitative and quantitative information into the decision fusion process ensures robust and reliable classification results. The innovation of our approach lies in the dual use of decomposition methods and the application of a simple but effective decision fusion strategy.
- 28 September 2024
- Published byĀ MDPI AGĀ inĀ Electronics
- Vol.Ā 13 Ā (19) , 3846
Open AccessPixel-Level Decision Fusion for Land Cover Classification Using PolSAR Data and Local Pattern Differences
Combining various viewpoints to produce coherent and cohesive results requires decision fusion. These methodologies are essential for synthesizing data from multiple sensors in remote sensing classification in order to make conclusive decisions. Using fully polarimetric Synthetic Aperture Radar (PolSAR) imagery, our study combines the benefits of both approaches for detection by extracting Pauliās and Krogagerās decomposition components. The Local Pattern Differences (LPD) method was employed on every decomposition component for pixel-level texture feature extraction. These extracted features were utilized to train three independent classifiers. Ultimately, these findings were handled as independent decisions for each land cover type and were fused together using a decision fusion rule to produce complete and enhanced classification results. As part of our approach, after a thorough examination, the most appropriate classifiers and decision rules were exploited, as well as the mathematical foundations required for effective decision fusion. Incorporating qualitative and quantitative information into the decision fusion process ensures robust and reliable classification results. The innovation of our approach lies in the dual use of decomposition methods and the application of a simple but effective decision fusion strategy.
- Open Access
- 4 August 2024
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 14 Ā (15) , 6808
Fusing Ground-Penetrating Radar Images for Improving Image Characteristics Fidelity
The analysis of ground-penetrating radar (GPR) data is of vital importance for detecting various subsurface features that might manifest as hyperbolic peaks, which are indicators of a buried object or grayscale variation in the case of contrast in the soil texture. This method focuses on identifying exaggerated patterns through a series of image-processing steps. Two GPR images are initially read and preprocessed by extracting channels, flipping, and resizing. Then, specific regions of interest (ROIs) are cropped, and the Fourier transform is further applied to turn them into the frequency domain. With the help of their frequency signatures, these patterns are extracted from the images, and binary masks are constructed to obtain features of interest. These masked images were reconstructed and merged to make hyperbolic features visible. Finally, Local Binary Pattern (LBP) analysis is used to emphasize these hyperbolic peaks, thereby facilitating their recognition across the whole image. The proposed approach improves the detection of performance subsurface features in GPR data; hence, it is an important tool for geophysical surveys and other related applications. The results prove the high performance of the proposed procedure in improving GPR image characteristics.
- 4 August 2024
- Published byĀ MDPI AGĀ inĀ Applied Sciences
- Vol.Ā 14 Ā (15) , 6808
Open AccessFusing Ground-Penetrating Radar Images for Improving Image Characteristics Fidelity
The analysis of ground-penetrating radar (GPR) data is of vital importance for detecting various subsurface features that might manifest as hyperbolic peaks, which are indicators of a buried object or grayscale variation in the case of contrast in the soil texture. This method focuses on identifying exaggerated patterns through a series of image-processing steps. Two GPR images are initially read and preprocessed by extracting channels, flipping, and resizing. Then, specific regions of interest (ROIs) are cropped, and the Fourier transform is further applied to turn them into the frequency domain. With the help of their frequency signatures, these patterns are extracted from the images, and binary masks are constructed to obtain features of interest. These masked images were reconstructed and merged to make hyperbolic features visible. Finally, Local Binary Pattern (LBP) analysis is used to emphasize these hyperbolic peaks, thereby facilitating their recognition across the whole image. The proposed approach improves the detection of performance subsurface features in GPR data; hence, it is an important tool for geophysical surveys and other related applications. The results prove the high performance of the proposed procedure in improving GPR image characteristics.
- Open Access
- 27 May 2024
- Published byĀ MDPI AGĀ inĀ Remote Sensing
- Vol.Ā 16 Ā (11) , 1923
SAR Features and Techniques for Urban PlanningāA Review
Urban planning has, in recent years, been significantly assisted by remote sensing data. The data and techniques that are used are very diverse and are available to government agencies as well as to private companies that are involved in planning urban and peri-urban areas. Synthetic aperture radar data are particularly important since they provide information on the geometric and electrical characteristics of ground objects and, at the same time, are unaffected by sunlight (dayānight) and cloud cover. SAR data are usually combined with optical data (fusion) in order to increase the reliability of the terrain information. Most of the existing relative classification methods have been reviewed. New techniques that have been developed use decorrelation and interferometry to record changes on the Earthās surface. Texture-based features, such as Markov random fields and co-occurrence matrices, are employed, among others, for terrain classification. Furthermore, target geometrical features are used for the same purpose. Among the innovative works presented in this manuscript are those dealing with tomographic SAR imaging for creating digital elevation models in urban areas. Finally, tomographic techniques and digital elevation models can render three-dimensional representations for a much better understanding of the urban region. The above-mentioned sources of information are integrated into geographic information systems, making them more intelligent. In this work, most of the previous techniques and methods are reviewed, and selected papers are highlighted in order for the reader-researcher to have a complete picture of the use of SAR in urban planning.
- 27 May 2024
- Published byĀ MDPI AGĀ inĀ Remote Sensing
- Vol.Ā 16 Ā (11) , 1923
Open AccessSAR Features and Techniques for Urban PlanningāA Review
Urban planning has, in recent years, been significantly assisted by remote sensing data. The data and techniques that are used are very diverse and are available to government agencies as well as to private companies that are involved in planning urban and peri-urban areas. Synthetic aperture radar data are particularly important since they provide information on the geometric and electrical characteristics of ground objects and, at the same time, are unaffected by sunlight (dayānight) and cloud cover. SAR data are usually combined with optical data (fusion) in order to increase the reliability of the terrain information. Most of the existing relative classification methods have been reviewed. New techniques that have been developed use decorrelation and interferometry to record changes on the Earthās surface. Texture-based features, such as Markov random fields and co-occurrence matrices, are employed, among others, for terrain classification. Furthermore, target geometrical features are used for the same purpose. Among the innovative works presented in this manuscript are those dealing with tomographic SAR imaging for creating digital elevation models in urban areas. Finally, tomographic techniques and digital elevation models can render three-dimensional representations for a much better understanding of the urban region. The above-mentioned sources of information are integrated into geographic information systems, making them more intelligent. In this work, most of the previous techniques and methods are reviewed, and selected papers are highlighted in order for the reader-researcher to have a complete picture of the use of SAR in urban planning.