Pub Date : 2023-01-01DOI: 10.1016/j.cogr.2022.12.003
CHEN Xiao-Yong , YANG Bo-Xiong , ZHAO Shuai , DING Jie , SUN Peng , GAN Lin Lindy
Some problems still exist in health management and application such as insufficient data, limited technology, and lack of professional evaluation methods by physicians with medical theory. In this study, an intelligent method is based on an analysis of physiological big data collected by wearable smartwatches. Firstly, physiological data such as pulse, heart rate, and blood oxygen were collected continuously from individuals by wearing smartwatches, and the data was digitally transmitted. Secondly, the transmitted data was sent to a health management platform by Narrow Band Internet of Things. Analyzing the data, physicians evaluated individual situations via an intelligent math model. Finally, the results were fed back to individuals through a smartphone APP to finish a medical diagnosis, disease prediction, or warning. The intelligent health management method and technology created via years of studies have been verified and will provide a new and effective strategy for health management.
{"title":"Intelligent health management based on analysis of big data collected by wearable smart watch","authors":"CHEN Xiao-Yong , YANG Bo-Xiong , ZHAO Shuai , DING Jie , SUN Peng , GAN Lin Lindy","doi":"10.1016/j.cogr.2022.12.003","DOIUrl":"https://doi.org/10.1016/j.cogr.2022.12.003","url":null,"abstract":"<div><p>Some problems still exist in health management and application such as insufficient data, limited technology, and lack of professional evaluation methods by physicians with medical theory. In this study, an intelligent method is based on an analysis of physiological big data collected by wearable smartwatches. Firstly, physiological data such as pulse, heart rate, and blood oxygen were collected continuously from individuals by wearing smartwatches, and the data was digitally transmitted. Secondly, the transmitted data was sent to a health management platform by Narrow Band Internet of Things. Analyzing the data, physicians evaluated individual situations via an intelligent math model. Finally, the results were fed back to individuals through a smartphone APP to finish a medical diagnosis, disease prediction, or warning. The intelligent health management method and technology created via years of studies have been verified and will provide a new and effective strategy for health management.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"3 ","pages":"Pages 1-7"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49732815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1016/j.cogr.2023.04.002
Benjamin D. Evans, Hendrik W. Jordaan, Herman A. Engelbrecht
The conventional application of deep reinforcement learning (DRL) to autonomous racing requires the agent to crash during training, thus limiting training to simulation environments. Further, many DRL approaches still exhibit high crash rates after training, making them infeasible for real-world use. This paper addresses the problem of safely training DRL agents for autonomous racing. Firstly, we present a Viability Theory-based supervisor that ensures the vehicle does not crash and remains within the friction limit while maintaining recursive feasibility. Secondly, we use the supervisor to ensure the vehicle does not crash during the training of DRL agents for high-speed racing. The evaluation in the open-source F1Tenth simulator demonstrates that our safety system can ensure the safety of a worst-case scenario planner on four test maps up to speeds of 6 m/s. Training agents to race with the supervisor significantly improves sample efficiency, requiring only 10,000 steps. Our learning formulation leads to learning more conservative, safer policies with slower lap times and a higher success rate, resulting in our method being feasible for physical vehicle racing. Enabling DRL agents to learn to race without ever crashing is a step towards using DRL on physical vehicles.
{"title":"Safe reinforcement learning for high-speed autonomous racing","authors":"Benjamin D. Evans, Hendrik W. Jordaan, Herman A. Engelbrecht","doi":"10.1016/j.cogr.2023.04.002","DOIUrl":"https://doi.org/10.1016/j.cogr.2023.04.002","url":null,"abstract":"<div><p>The conventional application of deep reinforcement learning (DRL) to autonomous racing requires the agent to crash during training, thus limiting training to simulation environments. Further, many DRL approaches still exhibit high crash rates after training, making them infeasible for real-world use. This paper addresses the problem of safely training DRL agents for autonomous racing. Firstly, we present a Viability Theory-based supervisor that ensures the vehicle does not crash and remains within the friction limit while maintaining recursive feasibility. Secondly, we use the supervisor to ensure the vehicle does not crash during the training of DRL agents for high-speed racing. The evaluation in the open-source F1Tenth simulator demonstrates that our safety system can ensure the safety of a worst-case scenario planner on four test maps up to speeds of 6 m/s. Training agents to race with the supervisor significantly improves sample efficiency, requiring only 10,000 steps. Our learning formulation leads to learning more conservative, safer policies with slower lap times and a higher success rate, resulting in our method being feasible for physical vehicle racing. Enabling DRL agents to learn to race without ever crashing is a step towards using DRL on physical vehicles.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"3 ","pages":"Pages 107-126"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49732926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1016/j.cogr.2023.05.004
Weiyu Hao
Road detection remains a captivating and crucial aspect of any form of autonomous driving. In this manuscript, we furnish a comprehensive appraisal of recent advancements in road lane detection, a fundamental component integral to autonomous driving. Despite numerous methodologies being proposed to augment accuracy while expediting speed, various hindrances, including lane marking variations, lighting fluctuations, and shadowy conditions, necessitate the establishment of dependable detection systems. Model-based and learning-based methods represent the two predominant techniques for lane detection. Model-based methods afford rapid computation speeds, while learning-based methods extend robustness amidst complexity. This paper delves into the techniques of lane detection and forecasts upcoming trends in the field. Collectively, this review offers a sturdy foundation for prospective research in the realm of road lane detection.
{"title":"Review on lane detection and related methods","authors":"Weiyu Hao","doi":"10.1016/j.cogr.2023.05.004","DOIUrl":"https://doi.org/10.1016/j.cogr.2023.05.004","url":null,"abstract":"<div><p>Road detection remains a captivating and crucial aspect of any form of autonomous driving. In this manuscript, we furnish a comprehensive appraisal of recent advancements in road lane detection, a fundamental component integral to autonomous driving. Despite numerous methodologies being proposed to augment accuracy while expediting speed, various hindrances, including lane marking variations, lighting fluctuations, and shadowy conditions, necessitate the establishment of dependable detection systems. Model-based and learning-based methods represent the two predominant techniques for lane detection. Model-based methods afford rapid computation speeds, while learning-based methods extend robustness amidst complexity. This paper delves into the techniques of lane detection and forecasts upcoming trends in the field. Collectively, this review offers a sturdy foundation for prospective research in the realm of road lane detection.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"3 ","pages":"Pages 135-141"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1016/j.cogr.2023.07.004
Marc-Andrė Blais, Moulay A. Akhloufi
Robots such as drones, ground rovers, underwater vehicles and industrial robots have increased in popularity in recent years. Many sectors have benefited from this by increasing productivity while also decreasing costs and certain risks to humans. These robots can be controlled individually but are more efficient in a large group, also known as a swarm. However, an increase in the quantity and complexity of robots creates the need for an adequate control system. Reinforcement learning, an artificial intelligence paradigm, is an increasingly popular approach to control a swarm of unmanned vehicles. The quantity of reviews in the field of reinforcement learning-based swarm robotics is limited. We propose reviewing the various applications, algorithms and simulators on the subject to fill this gap. First, we present the current applications on swarm robotics with a focus on reinforcement learning control systems. Subsequently, we define important reinforcement learning terminologies, followed by a review of the current state-of-the-art in the field of swarm robotics utilizing reinforcement learning. Additionally, we review the various simulators used to train, validate and simulate swarms of unmanned vehicles. We finalize our review by discussing our findings and the possible directions for future research. Overall, our review demonstrates the potential and state-of-the-art reinforcement learning-based control systems for swarm robotics.
{"title":"Reinforcement learning for swarm robotics: An overview of applications, algorithms and simulators","authors":"Marc-Andrė Blais, Moulay A. Akhloufi","doi":"10.1016/j.cogr.2023.07.004","DOIUrl":"https://doi.org/10.1016/j.cogr.2023.07.004","url":null,"abstract":"<div><p>Robots such as drones, ground rovers, underwater vehicles and industrial robots have increased in popularity in recent years. Many sectors have benefited from this by increasing productivity while also decreasing costs and certain risks to humans. These robots can be controlled individually but are more efficient in a large group, also known as a swarm. However, an increase in the quantity and complexity of robots creates the need for an adequate control system. Reinforcement learning, an artificial intelligence paradigm, is an increasingly popular approach to control a swarm of unmanned vehicles. The quantity of reviews in the field of reinforcement learning-based swarm robotics is limited. We propose reviewing the various applications, algorithms and simulators on the subject to fill this gap. First, we present the current applications on swarm robotics with a focus on reinforcement learning control systems. Subsequently, we define important reinforcement learning terminologies, followed by a review of the current state-of-the-art in the field of swarm robotics utilizing reinforcement learning. Additionally, we review the various simulators used to train, validate and simulate swarms of unmanned vehicles. We finalize our review by discussing our findings and the possible directions for future research. Overall, our review demonstrates the potential and state-of-the-art reinforcement learning-based control systems for swarm robotics.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"3 ","pages":"Pages 226-256"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49710706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-01DOI: 10.1016/j.cogr.2022.03.001
Mohammadreza Lalegani Dezaki, Saghi Hatami, A. Zolfagharian, M. Bodaghi
{"title":"Design and Development of a Pneumatic Conveyor Robot for Color Detection and Sorting","authors":"Mohammadreza Lalegani Dezaki, Saghi Hatami, A. Zolfagharian, M. Bodaghi","doi":"10.1016/j.cogr.2022.03.001","DOIUrl":"https://doi.org/10.1016/j.cogr.2022.03.001","url":null,"abstract":"","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73461653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.cogr.2022.08.001
Jiarui Zhang, Penghui Tian
Aiming at the problem that the panoptic segmentation network based on coding structure can't accurately extract the detailed information of panoptic images, considering that there are some commonalities between semantic segmentation and instance segmentation tasks, this paper proposes a panoptic segmentation model with multi-feature fusion structure, which generates multi-scale fused feature maps for the panoptic segmentation network, uses the Atrous Spatial Pyramid Pooling to preferentially process the high-level features with rich context information, and then uses the cascade method to splice the low-level features to improve the panoptic segmentation performance of the model. By adding coordinate attention to the ASPP module of the corresponding branch, the perception ability of the model to the contour and instance center is enhanced.
{"title":"Panoptic segmentation network based on fusion coding and attention mechanism","authors":"Jiarui Zhang, Penghui Tian","doi":"10.1016/j.cogr.2022.08.001","DOIUrl":"10.1016/j.cogr.2022.08.001","url":null,"abstract":"<div><p>Aiming at the problem that the panoptic segmentation network based on coding structure can't accurately extract the detailed information of panoptic images, considering that there are some commonalities between semantic segmentation and instance segmentation tasks, this paper proposes a panoptic segmentation model with multi-feature fusion structure, which generates multi-scale fused feature maps for the panoptic segmentation network, uses the Atrous Spatial Pyramid Pooling to preferentially process the high-level features with rich context information, and then uses the cascade method to splice the low-level features to improve the panoptic segmentation performance of the model. By adding coordinate attention to the ASPP module of the corresponding branch, the perception ability of the model to the contour and instance center is enhanced.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"2 ","pages":"Pages 186-192"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667241322000179/pdfft?md5=24ed60274e02ce0253046e2bd7a44c68&pid=1-s2.0-S2667241322000179-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73996919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.cogr.2022.03.005
Li Zhang, Yu Tan
To prevent the traditional particle swarm optimizer (PSO) from inefficient search in complex problem spaces, this paper presents a novel spread-based elite opposite swarm optimizer (SEOSO) for large scale optimization. Inspired by the dandelion seeds in nature, the seeds can randomly spread by wind and grow better for the next generation. To achieve this, the spread learning and elite opposite learning are introduced in SEOSO. In spread learning, the particles are divided into some subswarms and these subswarms can exchange the particles to get more useful information that improves the diversity of the swarm. In elite opposite learning, the opposite position of the particle is used to exclude the worse direction. The experiments are conducted on 35 benchmark functions to evaluate the performance of SEOSO in comparison with several state-of-the-art algorithms. The comparative results show the effectiveness of SEOSO in solving large scale optimization problems.
{"title":"Spread-based elite opposite swarm optimizer for large scale optimization","authors":"Li Zhang, Yu Tan","doi":"10.1016/j.cogr.2022.03.005","DOIUrl":"10.1016/j.cogr.2022.03.005","url":null,"abstract":"<div><p>To prevent the traditional particle swarm optimizer (PSO) from inefficient search in complex problem spaces, this paper presents a novel spread-based elite opposite swarm optimizer (SEOSO) for large scale optimization. Inspired by the dandelion seeds in nature, the seeds can randomly spread by wind and grow better for the next generation. To achieve this, the spread learning and elite opposite learning are introduced in SEOSO. In spread learning, the particles are divided into some subswarms and these subswarms can exchange the particles to get more useful information that improves the diversity of the swarm. In elite opposite learning, the opposite position of the particle is used to exclude the worse direction. The experiments are conducted on 35 benchmark functions to evaluate the performance of SEOSO in comparison with several state-of-the-art algorithms. The comparative results show the effectiveness of SEOSO in solving large scale optimization problems.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"2 ","pages":"Pages 112-118"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S266724132200009X/pdfft?md5=72afb6fbbfba394baa5d092c467570af&pid=1-s2.0-S266724132200009X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72570099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.cogr.2022.01.001
Yun Man , Xu Fei , Liu Jun , Zhang Qian
In the use of fire-fighting physics platform for fire alarm data correlation analysis, there are often problems such as too much data volume and insufficient accuracy of the analysis results. For such questions, this paper establishes a full-factor secondary mining mechanism for fire accidents based on the fire big data based on the correlation analysis algorithm and the clustering algorithm. The association algorithm is used to conduct full-factor primary mining on the fire-related factors in the data warehouse, and the common-sense accident attributes in the association rules are extracted. Then use the K-means clustering algorithm, where the cluster center is the relevant attribute in the fire accident record, and perform the second combined clustering of the accident elements to achieve in-depth information mining of all factors of the fire accident. Experimental results show that the improved full-factor deep information mining algorithm proposed in this paper can effectively filter 31.6% of meaningless mining results compared to the traditional single mining algorithm. It shows that the algorithm in this paper can more accurately dig out the relationship between data, and can provide more effective decision support for fire management and other work.
{"title":"Research on improved full-factor deep information mining algorithm","authors":"Yun Man , Xu Fei , Liu Jun , Zhang Qian","doi":"10.1016/j.cogr.2022.01.001","DOIUrl":"https://doi.org/10.1016/j.cogr.2022.01.001","url":null,"abstract":"<div><p>In the use of fire-fighting physics platform for fire alarm data correlation analysis, there are often problems such as too much data volume and insufficient accuracy of the analysis results. For such questions, this paper establishes a full-factor secondary mining mechanism for fire accidents based on the fire big data based on the correlation analysis algorithm and the clustering algorithm. The association algorithm is used to conduct full-factor primary mining on the fire-related factors in the data warehouse, and the common-sense accident attributes in the association rules are extracted. Then use the K-means clustering algorithm, where the cluster center is the relevant attribute in the fire accident record, and perform the second combined clustering of the accident elements to achieve in-depth information mining of all factors of the fire accident. Experimental results show that the improved full-factor deep information mining algorithm proposed in this paper can effectively filter 31.6% of meaningless mining results compared to the traditional single mining algorithm. It shows that the algorithm in this paper can more accurately dig out the relationship between data, and can provide more effective decision support for fire management and other work.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"2 ","pages":"Pages 30-38"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667241322000015/pdfft?md5=0dd4e3a0dc308e9e12201330a7437e1f&pid=1-s2.0-S2667241322000015-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136555883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There are many tasks on image aesthetic assessment, such as aesthetic classification, scoring, score distribution prediction, and captions. Due to the distribution of the aesthetic score is unbalanced, the assessment models always output scores near the mean score. In this paper, we propose a fine-grained regression method for aesthetics score regression and combine position and channel attention mechanisms to enhance the aesthetic feature fusion. And by training the regression network separately from the classification network, we make the classification task a complement to the regression task. Besides, the researchers are used to using Mean Square Error (MSE) as the main evaluation metric which is inadequate in measuring the error of each interval. In order to fully consider the images of the various aesthetic score segments, instead of focusing on the intermediate aesthetic score segments because of the imbalance of the aesthetic datasets, we propose a new evaluation metric called Segmented Mean Square Errors (SMSE) to prove the advantages of the model. We divide the entire AADB dataset into 10 equal parts based on the aesthetic scores and the experiments were carried out on each of the segmented AADB datasets. In this way, images for each aesthetic score segment are fairly considered. The experimental results reveal that our method outperforms all the state-of-the-art methods on both MSE and SMSE. The dual attention modules of position and channel also make the activation maps more reasonable. Our methods make the aesthetic scoring go beyond laboratories to real life applications. Because computational visual aesthetics is a very interesting and challenging task in the field of computer vision, and computer vision is also one of the key areas of focus of this journal, the method proposed in this paper is closely related to the field covered by the journal.
{"title":"Fine-grained regression for image aesthetic scoring","authors":"Xin Jin, Qiang Deng, Hao Lou, Xiqiao Li, Chaoen Xiao","doi":"10.1016/j.cogr.2022.07.003","DOIUrl":"10.1016/j.cogr.2022.07.003","url":null,"abstract":"<div><p>There are many tasks on image aesthetic assessment, such as aesthetic classification, scoring, score distribution prediction, and captions. Due to the distribution of the aesthetic score is unbalanced, the assessment models always output scores near the mean score. In this paper, we propose a fine-grained regression method for aesthetics score regression and combine position and channel attention mechanisms to enhance the aesthetic feature fusion. And by training the regression network separately from the classification network, we make the classification task a complement to the regression task. Besides, the researchers are used to using Mean Square Error (MSE) as the main evaluation metric which is inadequate in measuring the error of each interval. In order to fully consider the images of the various aesthetic score segments, instead of focusing on the intermediate aesthetic score segments because of the imbalance of the aesthetic datasets, we propose a new evaluation metric called Segmented Mean Square Errors (SMSE) to prove the advantages of the model. We divide the entire AADB dataset into 10 equal parts based on the aesthetic scores and the experiments were carried out on each of the segmented AADB datasets. In this way, images for each aesthetic score segment are fairly considered. The experimental results reveal that our method outperforms all the state-of-the-art methods on both MSE and SMSE. The dual attention modules of position and channel also make the activation maps more reasonable. Our methods make the aesthetic scoring go beyond laboratories to real life applications. Because computational visual aesthetics is a very interesting and challenging task in the field of computer vision, and computer vision is also one of the key areas of focus of this journal, the method proposed in this paper is closely related to the field covered by the journal.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"2 ","pages":"Pages 202-210"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667241322000167/pdfft?md5=dc3af1caaad28fd9bab9b75e96e3a5e1&pid=1-s2.0-S2667241322000167-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78743861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-01DOI: 10.1016/j.cogr.2022.03.004
Arslan Ali , Weihua Ou , Saima Kanwal
Due to the numerous real-world applications of the crowd counting job, it has become a popular research topic. Modern crowd counting systems have a sophisticated structure and employ a filter on a big image size, making them difficult to use. Because these technologies are computationally intensive and difficult to implement in small surveillance systems, they are not appropriate for use in small surveillance systems. They also function poorly in a variety of sizes and densities, as well. Transfer learning and deep convolutional neural network architecture are used to create a modest but efficient network, which we describe herein. We named the proposed crowd counting architecture deep crowd transfer network (DCTNets) since it incorporates both deep learning and transfer learning principles into a single system. Among DCTNets’ key components are a detection module that is based on mask R-CNNs and an estimate module that is based on deep convolutional neural networks. In the first step, we apply transfer learning to the Mask R-CNN model using the datasets ShanghaiTech, JHU-CROWD++, and UCF-QNRF. After that, we train and evaluate the complete architecture on these datasets using the transfer learning results. Input images are sent through a Mask R-CNN, which counts individuals and segments the counted region, then through an estimation network, which estimates the population size, and finally through a merge of the outputs from the two models. According to the findings of comparative tests, the proposed model outperforms existing state-of-the-art approaches on the ShanghaiTech, JHU-CROWD++, and UCF-QNRF datasets.
{"title":"DCTNets: Deep crowd transfer networks for an approximate crowd counting","authors":"Arslan Ali , Weihua Ou , Saima Kanwal","doi":"10.1016/j.cogr.2022.03.004","DOIUrl":"10.1016/j.cogr.2022.03.004","url":null,"abstract":"<div><p>Due to the numerous real-world applications of the crowd counting job, it has become a popular research topic. Modern crowd counting systems have a sophisticated structure and employ a filter on a big image size, making them difficult to use. Because these technologies are computationally intensive and difficult to implement in small surveillance systems, they are not appropriate for use in small surveillance systems. They also function poorly in a variety of sizes and densities, as well. Transfer learning and deep convolutional neural network architecture are used to create a modest but efficient network, which we describe herein. We named the proposed crowd counting architecture deep crowd transfer network (DCTNets) since it incorporates both deep learning and transfer learning principles into a single system. Among DCTNets’ key components are a detection module that is based on mask R-CNNs and an estimate module that is based on deep convolutional neural networks. In the first step, we apply transfer learning to the Mask R-CNN model using the datasets ShanghaiTech, JHU-CROWD++, and UCF-QNRF. After that, we train and evaluate the complete architecture on these datasets using the transfer learning results. Input images are sent through a Mask R-CNN, which counts individuals and segments the counted region, then through an estimation network, which estimates the population size, and finally through a merge of the outputs from the two models. According to the findings of comparative tests, the proposed model outperforms existing state-of-the-art approaches on the ShanghaiTech, JHU-CROWD++, and UCF-QNRF datasets.</p></div>","PeriodicalId":100288,"journal":{"name":"Cognitive Robotics","volume":"2 ","pages":"Pages 96-111"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667241322000076/pdfft?md5=9be2d6987eecd7631f37947f00a23f45&pid=1-s2.0-S2667241322000076-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77228331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}