Pub Date : 2024-02-01Epub Date: 2024-02-08DOI: 10.1080/0954898X.2023.2275722
Vaishali Bajait, Nandagopal Malarvizhi
Our approach includes picture preprocessing, feature extraction utilizing the SqueezeNet model, hyperparameter optimisation utilising the Equilibrium Optimizer (EO) algorithm, and classification utilising a Stacked Autoencoder (SAE) model. Each of these processes is carried out in a series of separate steps. During the image preprocessing stage, contrast limited adaptive histogram equalisations (CLAHE) is utilized to improve the contrasts, and Adaptive Bilateral Filtering (ABF) to get rid of any noise that may be present. The SqueezeNet paradigm is utilized to obtain relevant characteristics from the pictures that have been preprocessed, and the EO technique is utilized to fine-tune the hyperparameters. Finally, the SAE model categorises the diseases that affect the grape leaf. The simulation analysis of the EODTL-GLDC technique tested New Plant Diseases Datasets and the results were inspected in many prospects. The results demonstrate that this model outperforms other deep learning techniques and methods that are more often related to machine learning. Specifically, this technique was able to attain a precision of 96.31% on the testing datasets and 96.88% on the training data set that was split 80:20. These results offer more proof that the suggested strategy is successful in automating the detection and categorization of grape leaf diseases.
{"title":"Automated grape leaf nutrition deficiency disease detection and classification Equilibrium Optimizer with deep transfer learning model.","authors":"Vaishali Bajait, Nandagopal Malarvizhi","doi":"10.1080/0954898X.2023.2275722","DOIUrl":"10.1080/0954898X.2023.2275722","url":null,"abstract":"<p><p>Our approach includes picture preprocessing, feature extraction utilizing the SqueezeNet model, hyperparameter optimisation utilising the Equilibrium Optimizer (EO) algorithm, and classification utilising a Stacked Autoencoder (SAE) model. Each of these processes is carried out in a series of separate steps. During the image preprocessing stage, contrast limited adaptive histogram equalisations (CLAHE) is utilized to improve the contrasts, and Adaptive Bilateral Filtering (ABF) to get rid of any noise that may be present. The SqueezeNet paradigm is utilized to obtain relevant characteristics from the pictures that have been preprocessed, and the EO technique is utilized to fine-tune the hyperparameters. Finally, the SAE model categorises the diseases that affect the grape leaf. The simulation analysis of the EODTL-GLDC technique tested New Plant Diseases Datasets and the results were inspected in many prospects. The results demonstrate that this model outperforms other deep learning techniques and methods that are more often related to machine learning. Specifically, this technique was able to attain a precision of 96.31% on the testing datasets and 96.88% on the training data set that was split 80:20. These results offer more proof that the suggested strategy is successful in automating the detection and categorization of grape leaf diseases.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71489081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays, wireless sensor networks (WSN) have gained huge attention worldwide due to their wide applications in different domains. The limited amount of energy resources is considered as the main limitations of WSN, which generally affect the network life time. Hence, a dynamic clustering and routing model is designed to resolve this issue. In this research work, a deep-learning model is employed for the prediction of energy and an optimization algorithmic technique is designed for the determination of optimal routes. Initially, the dynamic cluster WSN is simulated using energy, mobility, trust, and Link Life Time (LLT) models. The deep neuro-fuzzy network (DNFN) is utilized for the prediction of residual energy of nodes and the cluster workloads are dynamically balanced by the dynamic clustering of data using a fuzzy system. The designed Flamingo Jellyfish Search Optimization (FJSO) model is used for tuning the weights of the fuzzy system by considering different fitness parameters. Moreover, routing is performed using FJSO model which is used for the identification of optimal path to transmit data. In addition, the experimentation is done using MATLAB tool and the results proved that the designed FJSO model attained maximum of 0.657J energy, a minimum of 0.739 m distance, 0.649 s delay, 0.849 trust, and 0.885 Mbps throughput.
{"title":"Flamingo Jelly Fish search optimization-based routing with deep-learning enabled energy prediction in WSN data communication.","authors":"Dhanabal Subramanian, Sangeetha Subramaniam, Krishnamoorthy Natarajan, Kumaravel Thangavel","doi":"10.1080/0954898X.2023.2279971","DOIUrl":"10.1080/0954898X.2023.2279971","url":null,"abstract":"<p><p>Nowadays, wireless sensor networks (WSN) have gained huge attention worldwide due to their wide applications in different domains. The limited amount of energy resources is considered as the main limitations of WSN, which generally affect the network life time. Hence, a dynamic clustering and routing model is designed to resolve this issue. In this research work, a deep-learning model is employed for the prediction of energy and an optimization algorithmic technique is designed for the determination of optimal routes. Initially, the dynamic cluster WSN is simulated using energy, mobility, trust, and Link Life Time (LLT) models. The deep neuro-fuzzy network (DNFN) is utilized for the prediction of residual energy of nodes and the cluster workloads are dynamically balanced by the dynamic clustering of data using a fuzzy system. The designed Flamingo Jellyfish Search Optimization (FJSO) model is used for tuning the weights of the fuzzy system by considering different fitness parameters. Moreover, routing is performed using FJSO model which is used for the identification of optimal path to transmit data. In addition, the experimentation is done using MATLAB tool and the results proved that the designed FJSO model attained maximum of 0.657J energy, a minimum of 0.739 m distance, 0.649 s delay, 0.849 trust, and 0.885 Mbps throughput.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138479329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-01Epub Date: 2024-02-08DOI: 10.1080/0954898X.2023.2270040
Rajveer K Shastri, Aparna R Shastri, Prashant P Nitnaware, Digambar M Padulkar
In the diagnosis of cardiac disorders Heart sound has a major role, and early detection is crucial to safeguard the patients. Computerized strategies of heart sound classification advocate intensive and more exact results in a quick and better manner. Using a hybrid optimization-controlled deep learning strategy this paper proposed an automatic heart sound classification module. The parameter tuning of the Deep Neural Network (DNN) classifier in a satisfactory manner is the importance of this research which depends on the Hybrid Sneaky optimization algorithm. The developed sneaky optimization algorithm inherits the traits of questing and societal search agents. Moreover, input data from the Phonocardiogram (PCG) database undergoes the process of feature extraction which extract the important features, like statistical, Heart Rate Variability (HRV), and to enhance the performance of this model, the features of Mel frequency Cepstral coefficients (MFCC) are assisted. The developed Sneaky optimization-based DNN classifier's performance is determined in respect of the metrics, namely precision, accuracy, specificity, and sensitivity, which are around 97%, 96.98%, 97%, and 96.9%, respectively.
{"title":"Hybrid Sneaky algorithm-based deep neural networks for Heart sound classification using phonocardiogram.","authors":"Rajveer K Shastri, Aparna R Shastri, Prashant P Nitnaware, Digambar M Padulkar","doi":"10.1080/0954898X.2023.2270040","DOIUrl":"10.1080/0954898X.2023.2270040","url":null,"abstract":"<p><p>In the diagnosis of cardiac disorders Heart sound has a major role, and early detection is crucial to safeguard the patients. Computerized strategies of heart sound classification advocate intensive and more exact results in a quick and better manner. <u>U</u>sing a hybrid optimization-controlled deep learning strategy this paper proposed an automatic heart sound classification module. The parameter tuning of the Deep Neural Network (DNN) classifier in a satisfactory manner is the importance of this research which depends on the Hybrid Sneaky optimization algorithm. The developed sneaky optimization algorithm inherits the traits of questing and societal search agents. Moreover, input data from the Phonocardiogram (PCG) database undergoes the process of feature extraction which extract the important features, like statistical, Heart Rate Variability (HRV), and to enhance the performance of this model, the features of Mel frequency Cepstral coefficients (MFCC) are assisted. The developed Sneaky optimization-based DNN classifier's performance is determined in respect of the metrics, namely precision, accuracy, specificity, and sensitivity, which are around 97%, 96.98%, 97%, and 96.9%, respectively.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138453076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-21DOI: 10.1080/0954898X.2023.2286002
David Femi, Manapakkam Anandan Mukunthan
Leaf infection detection and diagnosis at an earlier stage can improve agricultural output and reduce monetary costs. An inaccurate segmentation may degrade the accuracy of disease classification due to some different and complex leaf diseases. Also, the disease's adhesion and dimension can overlap, causing partial under-segmentation. Therefore, a novel robust Deep Encoder-Decoder Cascaded Network (DEDCNet) model is proposed in this manuscript for leaf image segmentation that precisely segments the diseased leaf spots and differentiates similar diseases. This model is comprised of an Infected Spot Recognition Network and an Infected Spot Segmentation Network. Initially, ISRN is designed by integrating cascaded CNN with a Feature Pyramid Pooling layer to identify the infected leaf spot and avoid an impact of background details. After that, the ISSN developed using an encoder-decoder network, which uses a multi-scale dilated convolution kernel to precisely segment the infected leaf spot. Moreover, the resultant leaf segments are provided to the pre-learned CNN models to learn texture features followed by the SVM algorithm to categorize leaf disease classes. The ODEDCNet delivers exceptional performance on both the Betel Leaf Image and PlantVillage datasets. On the Betel Leaf Image dataset, it achieves an accuracy of 94.89%, with high precision (94.35%), recall (94.77%), and F-score (94.56%), while maintaining low under-segmentation (6.2%) and over-segmentation rates (2.8%). It also achieves a remarkable Dice coefficient of 0.9822, all in just 0.10 seconds. On the PlantVillage dataset, the ODEDCNet outperforms other existing models with an accuracy of 96.5%, demonstrating high precision (96.61%), recall (96.5%), and F-score (96.56%). It excels in reducing under-segmentation to just 3.12% and over-segmentation to 2.56%. Furthermore, it achieves a Dice coefficient of 0.9834 in a mere 0.09 seconds. It evident for the greater efficiency on both segmentation and categorization of leaf diseases contrasted with the existing models.
{"title":"Plant leaf infected spot segmentation using robust encoder-decoder cascaded deep learning model.","authors":"David Femi, Manapakkam Anandan Mukunthan","doi":"10.1080/0954898X.2023.2286002","DOIUrl":"https://doi.org/10.1080/0954898X.2023.2286002","url":null,"abstract":"<p><p>Leaf infection detection and diagnosis at an earlier stage can improve agricultural output and reduce monetary costs. An inaccurate segmentation may degrade the accuracy of disease classification due to some different and complex leaf diseases. Also, the disease's adhesion and dimension can overlap, causing partial under-segmentation. Therefore, a novel robust Deep Encoder-Decoder Cascaded Network (DEDCNet) model is proposed in this manuscript for leaf image segmentation that precisely segments the diseased leaf spots and differentiates similar diseases. This model is comprised of an Infected Spot Recognition Network and an Infected Spot Segmentation Network. Initially, ISRN is designed by integrating cascaded CNN with a Feature Pyramid Pooling layer to identify the infected leaf spot and avoid an impact of background details. After that, the ISSN developed using an encoder-decoder network, which uses a multi-scale dilated convolution kernel to precisely segment the infected leaf spot. Moreover, the resultant leaf segments are provided to the pre-learned CNN models to learn texture features followed by the SVM algorithm to categorize leaf disease classes. The ODEDCNet delivers exceptional performance on both the Betel Leaf Image and PlantVillage datasets. On the Betel Leaf Image dataset, it achieves an accuracy of 94.89%, with high precision (94.35%), recall (94.77%), and F-score (94.56%), while maintaining low under-segmentation (6.2%) and over-segmentation rates (2.8%). It also achieves a remarkable Dice coefficient of 0.9822, all in just 0.10 seconds. On the PlantVillage dataset, the ODEDCNet outperforms other existing models with an accuracy of 96.5%, demonstrating high precision (96.61%), recall (96.5%), and F-score (96.56%). It excels in reducing under-segmentation to just 3.12% and over-segmentation to 2.56%. Furthermore, it achieves a Dice coefficient of 0.9834 in a mere 0.09 seconds. It evident for the greater efficiency on both segmentation and categorization of leaf diseases contrasted with the existing models.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138464478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-18DOI: 10.1080/0954898X.2023.2279973
Atul Barve, Pushpinder Singh Patheja
We, the Editors and Publisher of Network: Computation in Neural Systems, have retracted the following article:Barve, A., & Patheja, P. S. (2023). A clustering approach for attack detection and data transmission in vehicular ad-hoc networks. Network: Computation in Neural Systems, 1-26. https://doi.org/10.1080/0954898X.2023.2279973Since publication, significant concerns have been raised about the fact that this article has substantial overlaps with the following article:Barve, A. & Patheja, P. S. (2023). A clustering approach for attack detection and data transmission in vehicular ad-hoc networks. Ad Hoc & Sensor Wireless Networks, 58. 1-2, p. 127-149.DOI: 10.32908/ahswn.v58.10375Further investigations by the Publisher revealed that these overlaps are present in all sections of the article, including the figures and tables without appropriate acknowledgement. Upon query, the authors agree that the article is a duplicate submission. As this is a serious breach of our Editorial Policies, we are retracting the article from the journal. The corresponding author listed in this publication has been informed.We have been informed in our decision-making by our editorial policies and the COPE guidelines.The retracted article will remain online to maintain the scholarly record, but it will be digitally watermarked on each page as 'Retracted'.
{"title":"RETRACTED ARTICLE: A clustering approach for attack detection and data transmission in vehicular ad-hoc networks.","authors":"Atul Barve, Pushpinder Singh Patheja","doi":"10.1080/0954898X.2023.2279973","DOIUrl":"10.1080/0954898X.2023.2279973","url":null,"abstract":"<p><p>We, the Editors and Publisher of <i>Network: Computation in Neural Systems</i>, have retracted the following article:Barve, A., & Patheja, P. S. (2023). A clustering approach for attack detection and data transmission in vehicular ad-hoc networks. <i>Network: Computation in Neural Systems</i>, 1-26. https://doi.org/10.1080/0954898X.2023.2279973Since publication, significant concerns have been raised about the fact that this article has substantial overlaps with the following article:Barve, A. & Patheja, P. S. (2023). A clustering approach for attack detection and data transmission in vehicular ad-hoc networks. <i>Ad Hoc & Sensor Wireless Networks</i>, 58. 1-2, p. 127-149.DOI: 10.32908/ahswn.v58.10375Further investigations by the Publisher revealed that these overlaps are present in all sections of the article, including the figures and tables without appropriate acknowledgement. Upon query, the authors agree that the article is a duplicate submission. As this is a serious breach of our Editorial Policies, we are retracting the article from the journal. The corresponding author listed in this publication has been informed.We have been informed in our decision-making by our editorial policies and the COPE guidelines.The retracted article will remain online to maintain the scholarly record, but it will be digitally watermarked on each page as 'Retracted'.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138048829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wind power has been valued by countries for its renewability and cleanness and has become most of the focus of energy development in all countries. However, due to the uncertainty and volatility of wind power generation, making the grid-connected wind power system presents some serious challenges. Improving the accuracy of wind power prediction has become the focus of current research. Therefore, this paper proposes a combined short-term wind power prediction model based on T-LSTNet_markov to improve prediction accuracy. First, perform data cleaning and data preprocessing operations on the original data. Second, forecast using T-LSTNet model in original wind power data. Finally, calculate the error between the forecast value and the actual value. The k-means++ method and Weighted Markov process are used to correct errors and to get the result of the final prediction. The data that are collected from a wind farm in Inner Mongolia Autonomous Region, China, are selected as a case study to demonstrate the effectiveness of the proposed combined models. The empirical results show that the prediction accuracy is further improved after correcting errors.
{"title":"A combination predicting methodology based on T-LSTNet_Markov for short-term wind power prediction.","authors":"Yongsheng Wang, Yuhao Wu, Hao Xu, Zhen Chen, Jing Gao, ZhiWei Xu, Leixiao Li","doi":"10.1080/0954898X.2023.2213756","DOIUrl":"10.1080/0954898X.2023.2213756","url":null,"abstract":"<p><p>Wind power has been valued by countries for its renewability and cleanness and has become most of the focus of energy development in all countries. However, due to the uncertainty and volatility of wind power generation, making the grid-connected wind power system presents some serious challenges. Improving the accuracy of wind power prediction has become the focus of current research. Therefore, this paper proposes a combined short-term wind power prediction model based on T-LSTNet_markov to improve prediction accuracy. First, perform data cleaning and data preprocessing operations on the original data. Second, forecast using T-LSTNet model in original wind power data. Finally, calculate the error between the forecast value and the actual value. The k-means++ method and Weighted Markov process are used to correct errors and to get the result of the final prediction. The data that are collected from a wind farm in Inner Mongolia Autonomous Region, China, are selected as a case study to demonstrate the effectiveness of the proposed combined models. The empirical results show that the prediction accuracy is further improved after correcting errors.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9852002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-01Epub Date: 2023-08-22DOI: 10.1080/0954898X.2023.2237587
Syed Jahangir Badashah, Shaik Shafiulla Basha, Shaik Rafi Ahamed, S P V Subba Rao, M Janardhan Raju, Mudda Mallikarjun
In order to guarantee the desired quality of machined products, a reliable surface roughness assessment is essential. Using a surface profile metre with a contact stylus, which can produce accurate measurements of surface profiles, is the most popular technique for determining the surface roughness of machined items. One of the limitations of this technique is the work piece surface degradation brought on by mechanical contact between the stylus and the surface. Hence, in this paper, a roughness assessment technique based on the suggested Taylor-Gorilla troops optimizer-based Deep Neuro-Fuzzy Network (Taylor-GTO based DNFN) is proposed for estimating the surface roughness. Pre-processing, data augmentation, feature extraction, feature fusion, and roughness estimation are the procedures that the suggested technique uses to complete the roughness estimate procedure. Roughness estimation is performed using DNFN that has been trained using Taylor-GTO, which was created by combining the Taylor series with the Gorilla troop's optimizer. The created Taylor-GTO based DNFN model has minimum Mean Absolute Error, Mean Square Error, and RMSE of 0.403, 0.416, and 1.149, respectively.
{"title":"Taylor-Gorilla troops optimized deep learning network for surface roughness estimation.","authors":"Syed Jahangir Badashah, Shaik Shafiulla Basha, Shaik Rafi Ahamed, S P V Subba Rao, M Janardhan Raju, Mudda Mallikarjun","doi":"10.1080/0954898X.2023.2237587","DOIUrl":"10.1080/0954898X.2023.2237587","url":null,"abstract":"<p><p>In order to guarantee the desired quality of machined products, a reliable surface roughness assessment is essential. Using a surface profile metre with a contact stylus, which can produce accurate measurements of surface profiles, is the most popular technique for determining the surface roughness of machined items. One of the limitations of this technique is the work piece surface degradation brought on by mechanical contact between the stylus and the surface. Hence, in this paper, a roughness assessment technique based on the suggested Taylor-Gorilla troops optimizer-based Deep Neuro-Fuzzy Network (Taylor-GTO based DNFN) is proposed for estimating the surface roughness. Pre-processing, data augmentation, feature extraction, feature fusion, and roughness estimation are the procedures that the suggested technique uses to complete the roughness estimate procedure. Roughness estimation is performed using DNFN that has been trained using Taylor-GTO, which was created by combining the Taylor series with the Gorilla troop's optimizer. The created Taylor-GTO based DNFN model has minimum Mean Absolute Error, Mean Square Error, and RMSE of 0.403, 0.416, and 1.149, respectively.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10030533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-01Epub Date: 2023-11-09DOI: 10.1080/0954898X.2023.2275045
Sudhakar Raju, Venkateswara Rao Peddireddy Veera
Brain tumours are produced by the uncontrolled, and unusual tissue growth of brain. Because of the wide range of brain tumour locations, potential shapes, and image intensities, segmentation of the brain tumour by magnetic resonance imaging (MRI) is challenging. In this research, the deep learning (DL)-enabled brain tumour detection is developed by hybrid optimization method. The pre-processing stage used adaptive Wiener filter for minimizing the noise from input image. After that, the abnormal section of the image is segmented using U-Net. Afterwards, the data augmentation is accomplished to recover the random erasing, brightness, and translation characters. The statistical, shape, and texture features are extracted in feature extraction process. In first-level classification, the abnormal section of the image is sensed as brain tumour or not. Here, the Red Deer Tasmanian Devil Optimization (RDTDO) trained DenseNet is hired for brain tumour detection process. If tumour is identified, then second-level classification provides the brain tumour classification, where deep residual network (DRN)-enabled RDTDO is employed. Furthermore, the system performance is assessed by accuracy, true positive rate (TPR), true negative rate (TNR), positive predictive value (PPV), and negative predictive value (NPV) with the maximum values of 0.947, 0.926, 0.950, 0.937, and 0.926 are attained.
{"title":"Classification of brain tumours from MRI images using deep learning-enabled hybrid optimization algorithm.","authors":"Sudhakar Raju, Venkateswara Rao Peddireddy Veera","doi":"10.1080/0954898X.2023.2275045","DOIUrl":"10.1080/0954898X.2023.2275045","url":null,"abstract":"<p><p>Brain tumours are produced by the uncontrolled, and unusual tissue growth of brain. Because of the wide range of brain tumour locations, potential shapes, and image intensities, segmentation of the brain tumour by magnetic resonance imaging (MRI) is challenging. In this research, the deep learning (DL)-enabled brain tumour detection is developed by hybrid optimization method. The pre-processing stage used adaptive Wiener filter for minimizing the noise from input image. After that, the abnormal section of the image is segmented using U-Net. Afterwards, the data augmentation is accomplished to recover the random erasing, brightness, and translation characters. The statistical, shape, and texture features are extracted in feature extraction process. In first-level classification, the abnormal section of the image is sensed as brain tumour or not. Here, the Red Deer Tasmanian Devil Optimization (RDTDO) trained DenseNet is hired for brain tumour detection process. If tumour is identified, then second-level classification provides the brain tumour classification, where deep residual network (DRN)-enabled RDTDO is employed. Furthermore, the system performance is assessed by accuracy, true positive rate (TPR), true negative rate (TNR), positive predictive value (PPV), and negative predictive value (NPV) with the maximum values of 0.947, 0.926, 0.950, 0.937, and 0.926 are attained.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71489082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-01DOI: 10.1080/0954898X.2022.2157903
Ziyin Huang, Bingo Wing-Kuen Ling, Yui-Lam Chan
This paper proposes a two phases-based training method to design the codewords to map the cluster indices of the input feature vectors to the outputs of the new perceptrons with the multi-pulse type activation functions. Our proposed method is applied to classify two types of the tachycardias. First, the total number of the new perceptrons is initialized as the dimensions of the input feature vectors. Next, a set of new perceptrons with each new perceptron having a single pulse type activation function is designed. Then, the new perceptrons with the multi-pulse type activation function are designed based on those new perceptrons with the single pulse type activation function. After that, the codewords are assigned according to the outputs of the new perceptrons with the multi-pulse type activation functions. Finally, a condition on the codewords is checked. The significance of this work is to guarantee to achieve the no classification error efficiently through using more than one new perceptron with the multi-pulse type activation if the feature space can be linearly partitioned into the multiple clusters. The computer numerical simulation results show that our proposed method outperforms the conventional perceptrons with the sign type activation function.
{"title":"Two phases based training method for designing codewords for a set of perceptrons with each perceptron having multi-pulse type activation function.","authors":"Ziyin Huang, Bingo Wing-Kuen Ling, Yui-Lam Chan","doi":"10.1080/0954898X.2022.2157903","DOIUrl":"https://doi.org/10.1080/0954898X.2022.2157903","url":null,"abstract":"<p><p>This paper proposes a two phases-based training method to design the codewords to map the cluster indices of the input feature vectors to the outputs of the new perceptrons with the multi-pulse type activation functions. Our proposed method is applied to classify two types of the tachycardias. First, the total number of the new perceptrons is initialized as the dimensions of the input feature vectors. Next, a set of new perceptrons with each new perceptron having a single pulse type activation function is designed. Then, the new perceptrons with the multi-pulse type activation function are designed based on those new perceptrons with the single pulse type activation function. After that, the codewords are assigned according to the outputs of the new perceptrons with the multi-pulse type activation functions. Finally, a condition on the codewords is checked. The significance of this work is to guarantee to achieve the no classification error efficiently through using more than one new perceptron with the multi-pulse type activation if the feature space can be linearly partitioned into the multiple clusters. The computer numerical simulation results show that our proposed method outperforms the conventional perceptrons with the sign type activation function.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9335357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-01Epub Date: 2023-08-03DOI: 10.1080/0954898X.2023.2238070
G Jasmine Christabel, A C Subhajini
The rapid advancement of technology such as stream processing technologies, deep-learning approaches, and artificial intelligence plays a prominent and vital role, to detect heart rate using a prediction model. However, the existing methods could not handle high -dimensional datasets, and deep feature learning to improvise the performance. Therefore, this work proposed a real-time heart rate prediction model, using K-nearest neighbour (KNN) adhered to the principle component analysis algorithm (PCA) and weighted random forest algorithm for feature fusion (KPCA-WRF) approach and deep CNN feature learning framework. The feature selection, from the fused features, was optimized by ant colony optimization (ACO) and particle swarm optimization (PSO) algorithm to enhance the selected fused features from deep CNN. The optimized features were reduced to low dimensions using the PCA algorithm. The significant straight heart rate features are plotted by capturing out nearest similar data point values using the algorithm. The fused features were then classified for aiding the training process. The weighted values are assigned to those tuned hyper parameters (feature matrix forms). The optimal path and continuity of the weighted feature representations are moved using the random forest algorithm, in K-fold validation iterations.
{"title":"KPCA-WRF-prediction of heart rate using deep feature fusion and machine learning classification with tuned weighted hyper-parameter.","authors":"G Jasmine Christabel, A C Subhajini","doi":"10.1080/0954898X.2023.2238070","DOIUrl":"10.1080/0954898X.2023.2238070","url":null,"abstract":"<p><p>The rapid advancement of technology such as stream processing technologies, deep-learning approaches, and artificial intelligence plays a prominent and vital role, to detect heart rate using a prediction model. However, the existing methods could not handle high -dimensional datasets, and deep feature learning to improvise the performance. Therefore, this work proposed a real-time heart rate prediction model, using K-nearest neighbour (KNN) adhered to the principle component analysis algorithm (PCA) and weighted random forest algorithm for feature fusion (KPCA-WRF) approach and deep CNN feature learning framework. The feature selection, from the fused features, was optimized by ant colony optimization (ACO) and particle swarm optimization (PSO) algorithm to enhance the selected fused features from deep CNN. The optimized features were reduced to low dimensions using the PCA algorithm. The significant straight heart rate features are plotted by capturing out nearest similar data point values using the algorithm. The fused features were then classified for aiding the training process. The weighted values are assigned to those tuned hyper parameters (feature matrix forms). The optimal path and continuity of the weighted feature representations are moved using the random forest algorithm, in K-fold validation iterations.</p>","PeriodicalId":54735,"journal":{"name":"Network-Computation in Neural Systems","volume":null,"pages":null},"PeriodicalIF":7.8,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9927799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}