10 research outputs found

    Efficient Semantic Segmentation on Edge Devices

    Full text link
    Semantic segmentation works on the computer vision algorithm for assigning each pixel of an image into a class. The task of semantic segmentation should be performed with both accuracy and efficiency. Most of the existing deep FCNs yield to heavy computations and these networks are very power hungry, unsuitable for real-time applications on portable devices. This project analyzes current semantic segmentation models to explore the feasibility of applying these models for emergency response during catastrophic events. We compare the performance of real-time semantic segmentation models with non-real-time counterparts constrained by aerial images under oppositional settings. Furthermore, we train several models on the Flood-Net dataset, containing UAV images captured after Hurricane Harvey, and benchmark their execution on special classes such as flooded buildings vs. non-flooded buildings or flooded roads vs. non-flooded roads. In this project, we developed a real-time UNet based model and deployed that network on Jetson AGX Xavier module

    Decoding Clinical Biomarker Space of COVID-19: Exploring Matrix Factorization-based Feature Selection Methods

    Full text link
    One of the most critical challenges in managing complex diseases like COVID-19 is to establish an intelligent triage system that can optimize the clinical decision-making at the time of a global pandemic. The clinical presentation and patients’ characteristics are usually utilized to identify those patients who need more critical care. However, the clinical evidence shows an unmet need to determine more accurate and optimal clinical biomarkers to triage patients under a condition like the COVID-19 crisis. Here we have presented a machine learning approach to find a group of clinical indicators from the blood tests of a set of COVID-19 patients that are predictive of poor prognosis and morbidity. Our approach consists of two interconnected schemes: Feature Selection and Prognosis Classification. The former is based on different Matrix Factorization (MF)-based methods, and the latter is performed using Random Forest algorithm. Our model reveals that Arterial Blood Gas (ABG) O2 Saturation and C-Reactive Protein (CRP) are the most important clinical biomarkers determining the poor prognosis in these patients. Our approach paves the path of building quantitative and optimized clinical management systems for COVID-19 and similar diseases

    Comparative Study of Real-Time Semantic Segmentation Networks in Aerial Images During Flooding Events

    No full text
    Real-time semantic segmentation of aerial imagery is essential for unmanned ariel vehicle applications, including military surveillance, land characterization, and disaster damage assessments. Recent real-time semantic segmentation neural networks promise low computation and inference time, appropriate for resource-limited platforms, such as edge devices. However, these methods are mainly trained on human-centric view datasets, such as Cityscapes and CamVid, unsuitable for aerial applications. Furthermore, we do not know the feasibility of these models under adversarial settings, such as flooding events. To solve these problems, we train the most recent real-time semantic segmentation architectures on the FloodNet dataset containing annotated aerial images captured after hurricane Harvey. This article comprehensively studies several lightweight architectures, including encoder–decoder and two-pathway architectures, evaluating their performance on aerial imagery datasets. Moreover, we benchmark the efficiency and accuracy of different models on the FloodNet dataset to examine the practicability of these models during emergency response for aerial image segmentation. Some lightweight models attain more than 60% test mIoU on the FloodNet dataset and yield qualitative results on images. This article highlights the strengths and weaknesses of current segmentation models for aerial imagery, requiring low computation and inference time. Our experiment has direct applications during catastrophic events, such as flooding events

    Maximizing Sustainability in Reservoir Operation under Climate Change Using a Novel Adaptive Accelerated Gravitational Search Algorithm

    No full text
    Holding a lasting balance between the water resources and water demands has become a challenging task for water resources managers, especially in recent years with the looming global warming crisis and its resulting climatic change effects. This paper focuses on modeling the optimized operation of the Zayandehrud Reservoir, located in west-central Iran, under two fifth-generation climate change scenarios called RCP4.5 and RCP8.5. A novel variant of the gravitational search algorithm (GSA), named the adaptive accelerated GSA (AAGSA) is proposed and adopted as the optimizer of the reservoir operation in this paper. The major advancement of the AAGSA against the original GSA is its high exploration capability, allowing the proposal to effectively tackle a variety of difficulties any complex optimization problem can face. The goal of the optimization process is the maximization of the sustainability of supplying the downstream water demands by the reservoir. The optimal results obtained by the original GSA and the proposed AAGSA algorithms suggest that the AAGSA can achieve much more accurate results with much less computational runtime, such that the proposed AAGSA is able to achieve the reservoir operation sustainability index of 98.53% and 99.46%, under RCP4.5 and RCP8.5 scenarios, respectively. These figures are higher than those obtained by the original GSA by 23.5% and 16% under RCP4.5 and RCP8.5, respectively, while the runtime of the proposal is reduced by over 80% in both scenarios, as compared to the GSA, suggesting the high competence of the proposed AAGSA to solve such a high-dimensional and complex real-world engineering problem

    Maximizing Sustainability in Reservoir Operation under Climate Change Using a Novel Adaptive Accelerated Gravitational Search Algorithm

    No full text
    Holding a lasting balance between the water resources and water demands has become a challenging task for water resources managers, especially in recent years with the looming global warming crisis and its resulting climatic change effects. This paper focuses on modeling the optimized operation of the Zayandehrud Reservoir, located in west-central Iran, under two fifth-generation climate change scenarios called RCP4.5 and RCP8.5. A novel variant of the gravitational search algorithm (GSA), named the adaptive accelerated GSA (AAGSA) is proposed and adopted as the optimizer of the reservoir operation in this paper. The major advancement of the AAGSA against the original GSA is its high exploration capability, allowing the proposal to effectively tackle a variety of difficulties any complex optimization problem can face. The goal of the optimization process is the maximization of the sustainability of supplying the downstream water demands by the reservoir. The optimal results obtained by the original GSA and the proposed AAGSA algorithms suggest that the AAGSA can achieve much more accurate results with much less computational runtime, such that the proposed AAGSA is able to achieve the reservoir operation sustainability index of 98.53% and 99.46%, under RCP4.5 and RCP8.5 scenarios, respectively. These figures are higher than those obtained by the original GSA by 23.5% and 16% under RCP4.5 and RCP8.5, respectively, while the runtime of the proposal is reduced by over 80% in both scenarios, as compared to the GSA, suggesting the high competence of the proposed AAGSA to solve such a high-dimensional and complex real-world engineering problem

    An Enhanced Grey Wolf Optimizer with a Velocity-Aided Global Search Mechanism

    No full text
    This paper proposes a novel variant of the Grey Wolf Optimization (GWO) algorithm, named Velocity-Aided Grey Wolf Optimizer (VAGWO). The original GWO lacks a velocity term in its position-updating procedure, and this is the main factor weakening the exploration capability of this algorithm. In VAGWO, this term is carefully set and incorporated into the updating formula of the GWO. Furthermore, both the exploration and exploitation capabilities of the GWO are enhanced in VAGWO via stressing the enlargement of steps that each leading wolf takes towards the others in the early iterations while stressing the reduction in these steps when approaching the later iterations. The VAGWO is compared with a set of popular and newly proposed meta-heuristic optimization algorithms through its implementation on a set of 13 high-dimensional shifted standard benchmark functions as well as 10 complex composition functions derived from the CEC2017 test suite and three engineering problems. The complexity of the proposed algorithm is also evaluated against the original GWO. The results indicate that the VAGWO is a computationally efficient algorithm, generating highly accurate results when employed to optimize high-dimensional and complex problems

    An Enhanced Grey Wolf Optimizer with a Velocity-Aided Global Search Mechanism

    No full text
    This paper proposes a novel variant of the Grey Wolf Optimization (GWO) algorithm, named Velocity-Aided Grey Wolf Optimizer (VAGWO). The original GWO lacks a velocity term in its position-updating procedure, and this is the main factor weakening the exploration capability of this algorithm. In VAGWO, this term is carefully set and incorporated into the updating formula of the GWO. Furthermore, both the exploration and exploitation capabilities of the GWO are enhanced in VAGWO via stressing the enlargement of steps that each leading wolf takes towards the others in the early iterations while stressing the reduction in these steps when approaching the later iterations. The VAGWO is compared with a set of popular and newly proposed meta-heuristic optimization algorithms through its implementation on a set of 13 high-dimensional shifted standard benchmark functions as well as 10 complex composition functions derived from the CEC2017 test suite and three engineering problems. The complexity of the proposed algorithm is also evaluated against the original GWO. The results indicate that the VAGWO is a computationally efficient algorithm, generating highly accurate results when employed to optimize high-dimensional and complex problems

    Drivers’ behavior confronting fixed and point-to-point speed enforcement camera: agent-based simulation and translation to crash relative risk change

    No full text
    Abstract Utilizing a novel microsimulation approach, this study evaluates the impact of fixed and average point-to-point Speed Enforcement Cameras (SEC) on driving safety. Using the SUMO software, agent-based models for a 6-km highway without exits or obstacles were created. Telematics data from 93,160 trips were used to determine the desired free-flow speed. A total of 13,860 scenarios were simulated with 30 random seeds. The ratio of unsafe driving (RUD) is the spatial division of the total distance travelled at an unsafe speed by the total travel distance. The study compared different SEC implementations under different road traffic and community behaviours using the Power Model and calculated crash risk changes. Results showed that adding one or two fixed SECs reduced RUD by 0.20% (0.18–0.23) and 0.57% (0.54–0.59), respectively. However, average SECs significantly lowered RUD by 10.97% (10.95–10.99). Furthermore, a 1% increase in telematics enforcement decreased RUD by 0.22% (0.21–0.22). Point-to-point cameras effectively reduced crash risk in all implementation scenarios, with reductions ranging from − 3.44 to − 11.27%, pointing to their superiority as speed enforcement across various scenarios. Our cost-conscious and replicable approach can provide interim assessments of SEC effectiveness, even in low-income countries

    Decoding clinical biomarker space of COVID-19: Exploring matrix factorization-based feature selection methods

    No full text
    One of the most critical challenges in managing complex diseases like COVID-19 is to establish an intelligent triage system that can optimize the clinical decision-making at the time of a global pandemic. The clinical presentation and patients’ characteristics are usually utilized to identify those patients who need more critical care. However, the clinical evidence shows an unmet need to determine more accurate and optimal clinical biomarkers to triage patients under a condition like the COVID-19 crisis. Here we have presented a machine learning approach to find a group of clinical indicators from the blood tests of a set of COVID-19 patients that are predictive of poor prognosis and morbidity. Our approach consists of two interconnected schemes: Feature Selection and Prognosis Classification. The former is based on different Matrix Factorization (MF)-based methods, and the latter is performed using Random Forest algorithm. Our model reveals that Arterial Blood Gas (ABG) O2 Saturation and C-Reactive Protein (CRP) are the most important clinical biomarkers determining the poor prognosis in these patients. Our approach paves the path of building quantitative and optimized clinical management systems for COVID-19 and similar diseases.</p

    Decoding clinical biomarker space of COVID-19:exploring matrix factorization-based feature selection methods

    No full text
    Abstract One of the most critical challenges in managing complex diseases like COVID-19 is to establish an intelligent triage system that can optimize the clinical decision-making at the time of a global pandemic. The clinical presentation and patients’ characteristics are usually utilized to identify those patients who need more critical care. However, the clinical evidence shows an unmet need to determine more accurate and optimal clinical biomarkers to triage patients under a condition like the COVID-19 crisis. Here we have presented a machine learning approach to find a group of clinical indicators from the blood tests of a set of COVID-19 patients that are predictive of poor prognosis and morbidity. Our approach consists of two interconnected schemes: Feature Selection and Prognosis Classification. The former is based on different Matrix Factorization (MF)-based methods, and the latter is performed using Random Forest algorithm. Our model reveals that Arterial Blood Gas (ABG) O₂ Saturation and C-Reactive Protein (CRP) are the most important clinical biomarkers determining the poor prognosis in these patients. Our approach paves the path of building quantitative and optimized clinical management systems for COVID-19 and similar diseases
    corecore