Abstract Content-based image retrieval (CBIR) is a technique used to retrieve image from an image database. However, the CBIR process suffers from less accuracy to retrieve many images from an extensive image database and prove the privacy of images. The aim of this article is to address the issues of accuracy utilizing deep learning techniques such as the CNN method. Also, it provides the necessary privacy for images using fully homomorphic encryption methods by Cheon–Kim–Kim–Song (CKKS). The system has been proposed, namely RCNN_CKKS, which includes two parts. The first part (offline processing) extracts automated high-level features based on a flatting layer in a convolutional neural network (CNN) and then stores these features in a new dataset. In the second part (online processing), the client sends the encrypted image to the server, which depends on the CNN model trained to extract features of the sent image. Next, the extracted features are compared with the stored features using a Hamming distance method to retrieve all similar images. Finally, the server encrypts all retrieved images and sends them to the client. Deep-learning results on plain images were 97.87% for classification and 98.94% for retriever images. At the same time, the NIST test was used to check the security of CKKS when applied to Canadian Institute for Advanced Research (CIFAR-10) dataset. Through these results, researchers conclude that deep learning is an effective method for image retrieval and that a CKKS method is appropriate for image privacy protection.
{"title":"Deep learning for content-based image retrieval in FHE algorithms","authors":"Sura Mahmood Abdullah, Mustafa Musa Jaber","doi":"10.1515/jisys-2022-0222","DOIUrl":"https://doi.org/10.1515/jisys-2022-0222","url":null,"abstract":"Abstract Content-based image retrieval (CBIR) is a technique used to retrieve image from an image database. However, the CBIR process suffers from less accuracy to retrieve many images from an extensive image database and prove the privacy of images. The aim of this article is to address the issues of accuracy utilizing deep learning techniques such as the CNN method. Also, it provides the necessary privacy for images using fully homomorphic encryption methods by Cheon–Kim–Kim–Song (CKKS). The system has been proposed, namely RCNN_CKKS, which includes two parts. The first part (offline processing) extracts automated high-level features based on a flatting layer in a convolutional neural network (CNN) and then stores these features in a new dataset. In the second part (online processing), the client sends the encrypted image to the server, which depends on the CNN model trained to extract features of the sent image. Next, the extracted features are compared with the stored features using a Hamming distance method to retrieve all similar images. Finally, the server encrypts all retrieved images and sends them to the client. Deep-learning results on plain images were 97.87% for classification and 98.94% for retriever images. At the same time, the NIST test was used to check the security of CKKS when applied to Canadian Institute for Advanced Research (CIFAR-10) dataset. Through these results, researchers conclude that deep learning is an effective method for image retrieval and that a CKKS method is appropriate for image privacy protection.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"21 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81845440","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}
Firas Mohammed Aswad, Ali Ahmed, N. A. M. Alhammadi, Bashar Ahmad Khalaf, S. Mostafa
Abstract With the rapid growth of informatics systems’ technology in this modern age, the Internet of Things (IoT) has become more valuable and vital to everyday life in many ways. IoT applications are now more popular than they used to be due to the availability of many gadgets that work as IoT enablers, including smartwatches, smartphones, security cameras, and smart sensors. However, the insecure nature of IoT devices has led to several difficulties, one of which is distributed denial-of-service (DDoS) attacks. IoT systems have several security limitations due to their disreputability characteristics, like dynamic communication between IoT devices. The dynamic communications resulted from the limited resources of these devices, such as their data storage and processing units. Recently, many attempts have been made to develop intelligent models to protect IoT networks against DDoS attacks. The main ongoing research issue is developing a model capable of protecting the network from DDoS attacks that is sensitive to various classes of DDoS and can recognize legitimate traffic to avoid false alarms. Subsequently, this study proposes combining three deep learning algorithms, namely recurrent neural network (RNN), long short-term memory (LSTM)-RNN, and convolutional neural network (CNN), to build a bidirectional CNN-BiLSTM DDoS detection model. The RNN, CNN, LSTM, and CNN-BiLSTM are implemented and tested to determine the most effective model against DDoS attacks that can accurately detect and distinguish DDoS from legitimate traffic. The intrusion detection evaluation dataset (CICIDS2017) is used to provide more realistic detection. The CICIDS2017 dataset includes benign and up-to-date examples of typical attacks, closely matching real-world data of Packet Capture. The four models are tested and assessed using Confusion Metrix against four commonly used criteria: accuracy, precision, recall, and F-measure. The performance of the models is quite effective as they obtain an accuracy rate of around 99.00%, except for the CNN model, which achieves an accuracy of 98.82%. The CNN-BiLSTM achieves the best accuracy of 99.76% and precision of 98.90%.
{"title":"Deep learning in distributed denial-of-service attacks detection method for Internet of Things networks","authors":"Firas Mohammed Aswad, Ali Ahmed, N. A. M. Alhammadi, Bashar Ahmad Khalaf, S. Mostafa","doi":"10.1515/jisys-2022-0155","DOIUrl":"https://doi.org/10.1515/jisys-2022-0155","url":null,"abstract":"Abstract With the rapid growth of informatics systems’ technology in this modern age, the Internet of Things (IoT) has become more valuable and vital to everyday life in many ways. IoT applications are now more popular than they used to be due to the availability of many gadgets that work as IoT enablers, including smartwatches, smartphones, security cameras, and smart sensors. However, the insecure nature of IoT devices has led to several difficulties, one of which is distributed denial-of-service (DDoS) attacks. IoT systems have several security limitations due to their disreputability characteristics, like dynamic communication between IoT devices. The dynamic communications resulted from the limited resources of these devices, such as their data storage and processing units. Recently, many attempts have been made to develop intelligent models to protect IoT networks against DDoS attacks. The main ongoing research issue is developing a model capable of protecting the network from DDoS attacks that is sensitive to various classes of DDoS and can recognize legitimate traffic to avoid false alarms. Subsequently, this study proposes combining three deep learning algorithms, namely recurrent neural network (RNN), long short-term memory (LSTM)-RNN, and convolutional neural network (CNN), to build a bidirectional CNN-BiLSTM DDoS detection model. The RNN, CNN, LSTM, and CNN-BiLSTM are implemented and tested to determine the most effective model against DDoS attacks that can accurately detect and distinguish DDoS from legitimate traffic. The intrusion detection evaluation dataset (CICIDS2017) is used to provide more realistic detection. The CICIDS2017 dataset includes benign and up-to-date examples of typical attacks, closely matching real-world data of Packet Capture. The four models are tested and assessed using Confusion Metrix against four commonly used criteria: accuracy, precision, recall, and F-measure. The performance of the models is quite effective as they obtain an accuracy rate of around 99.00%, except for the CNN model, which achieves an accuracy of 98.82%. The CNN-BiLSTM achieves the best accuracy of 99.76% and precision of 98.90%.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"30 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82967479","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}
Abstract As an important identity authentication method, speaker verification (SV) has been widely used in many domains, e.g., mobile financials. At the same time, the existing SV systems are insecure under replay spoofing attacks. Toward a more secure and stable SV system, this article proposes a replay attack detection system based on deformable convolutional neural networks (DCNNs) and a time–frequency double-channel attention model. In DCNN, the positions of elements in the convolutional kernel are not fixed. Instead, they are modified by some trainable variable to help the model extract more useful local information from input spectrograms. Meanwhile, a time–frequency domino double-channel attention model is adopted to extract more effective distinctive features to collect valuable information for distinguishing genuine and replay speeches. Experimental results on ASVspoof 2019 dataset show that the proposed model can detect replay attacks accurately.
{"title":"Replay attack detection based on deformable convolutional neural network and temporal-frequency attention model","authors":"Dang-en Xie, Hai Hu, Qiang Xu","doi":"10.1515/jisys-2022-0265","DOIUrl":"https://doi.org/10.1515/jisys-2022-0265","url":null,"abstract":"Abstract As an important identity authentication method, speaker verification (SV) has been widely used in many domains, e.g., mobile financials. At the same time, the existing SV systems are insecure under replay spoofing attacks. Toward a more secure and stable SV system, this article proposes a replay attack detection system based on deformable convolutional neural networks (DCNNs) and a time–frequency double-channel attention model. In DCNN, the positions of elements in the convolutional kernel are not fixed. Instead, they are modified by some trainable variable to help the model extract more useful local information from input spectrograms. Meanwhile, a time–frequency domino double-channel attention model is adopted to extract more effective distinctive features to collect valuable information for distinguishing genuine and replay speeches. Experimental results on ASVspoof 2019 dataset show that the proposed model can detect replay attacks accurately.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"23 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82168853","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}
Y. A. A. S. Aldeen, S. Kadhim, N. N. Kadhim, Syed Hamid Hussain Madni
Abstract Wireless sensor networks (WSNs) require accurate localization of sensor nodes for various applications. In this article, we propose the distance vector hop localization method (DVHLM) to address the node dislocation issue in real-time networks. The proposed method combines trilateration and Particle Swarm Optimization techniques to estimate the location of unknown or dislocated nodes. Our methodology includes four steps: coordinate calculation, distance calculation, unknown node position estimation, and estimation correction. To evaluate the proposed method, we conducted simulation experiments and compared its performance with state-of-the-art methods in terms of localization accuracy with known nodes, dislocated nodes, and shadowing effects. Our results demonstrate that DVHLM outperforms the existing methods and achieves better localization accuracy with reduced error. This article provides a valuable contribution to the field of WSNs by proposing a new method with a detailed methodology and superior performance.
{"title":"A novel distance vector hop localization method for wireless sensor networks","authors":"Y. A. A. S. Aldeen, S. Kadhim, N. N. Kadhim, Syed Hamid Hussain Madni","doi":"10.1515/jisys-2023-0031","DOIUrl":"https://doi.org/10.1515/jisys-2023-0031","url":null,"abstract":"Abstract Wireless sensor networks (WSNs) require accurate localization of sensor nodes for various applications. In this article, we propose the distance vector hop localization method (DVHLM) to address the node dislocation issue in real-time networks. The proposed method combines trilateration and Particle Swarm Optimization techniques to estimate the location of unknown or dislocated nodes. Our methodology includes four steps: coordinate calculation, distance calculation, unknown node position estimation, and estimation correction. To evaluate the proposed method, we conducted simulation experiments and compared its performance with state-of-the-art methods in terms of localization accuracy with known nodes, dislocated nodes, and shadowing effects. Our results demonstrate that DVHLM outperforms the existing methods and achieves better localization accuracy with reduced error. This article provides a valuable contribution to the field of WSNs by proposing a new method with a detailed methodology and superior performance.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"235 1","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75572195","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}
Abstract Distributed programming paradigms such as MapReduce and Spark have alleviated sequential bottleneck while mining of massive transaction databases. Of significant importance is mining High Utility Itemset (HUI) that incorporates the revenue of the items purchased in a transaction. Although a few algorithms to mine HUIs in the distributed environment exist, workload skew and data transfer overhead due to shuffling operations remain major issues. In the current study, Parallel Utility Computation (PUC) algorithm has been proposed with novel grouping and load balancing strategies for an efficient mining of HUIs in a distributed environment. To group the items, Transaction Weighted Utility (TWU) values as a degree of transaction similarity is employed. Subsequently, these groups are assigned to the nodes across the cluster by taking into account the mining load due to the items in the group. Experimental evaluation on real and synthetic datasets demonstrate that PUC with TWU grouping in conjunction with load balancing converges mining faster. Due to reduced data transfer, and load balancing-based assignment strategy, PUC outperforms different grouping strategies and random assignment of groups across the cluster. Also, PUC is shown to be faster than PHUI-Growth algorithm with a promising speedup.
{"title":"PUC: parallel mining of high-utility itemsets with load balancing on spark","authors":"Anup Brahmavar, H. Venkatarama, Geetha Maiya","doi":"10.1515/jisys-2022-0044","DOIUrl":"https://doi.org/10.1515/jisys-2022-0044","url":null,"abstract":"Abstract Distributed programming paradigms such as MapReduce and Spark have alleviated sequential bottleneck while mining of massive transaction databases. Of significant importance is mining High Utility Itemset (HUI) that incorporates the revenue of the items purchased in a transaction. Although a few algorithms to mine HUIs in the distributed environment exist, workload skew and data transfer overhead due to shuffling operations remain major issues. In the current study, Parallel Utility Computation (PUC) algorithm has been proposed with novel grouping and load balancing strategies for an efficient mining of HUIs in a distributed environment. To group the items, Transaction Weighted Utility (TWU) values as a degree of transaction similarity is employed. Subsequently, these groups are assigned to the nodes across the cluster by taking into account the mining load due to the items in the group. Experimental evaluation on real and synthetic datasets demonstrate that PUC with TWU grouping in conjunction with load balancing converges mining faster. Due to reduced data transfer, and load balancing-based assignment strategy, PUC outperforms different grouping strategies and random assignment of groups across the cluster. Also, PUC is shown to be faster than PHUI-Growth algorithm with a promising speedup.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"18 1","pages":"568 - 588"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88493013","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}
Abstract Noise will be inevitably mixed with music signals in the recording process. To improve the quality of music signals, it is necessary to reduce noise as much as possible. This article briefly introduces noise, the masking effect, and the spectral subtraction method for reducing noise in reverberant music. The spectral subtraction method was improved by the human ear masking effect to enhance its noise reduction performance. Simulation experiments were carried out on the traditional and improved spectral subtraction methods. The results showed that the improved spectral subtraction method could reduce the noise in reverberant music more effectively; under an objective evaluation criterion, the signal-to-noise ratio, the de-reverberated music signal processed by the improved spectral subtraction method had a higher signal-to-noise ratio; under a subjective evaluation criterion, mean opinion score (MOS), the de-reverberated music signal processed by the improved spectral subtraction method also had a better evaluation.
{"title":"Masking and noise reduction processing of music signals in reverberant music","authors":"Shenghuan Zhang, Ye Cheng","doi":"10.1515/jisys-2022-0024","DOIUrl":"https://doi.org/10.1515/jisys-2022-0024","url":null,"abstract":"Abstract Noise will be inevitably mixed with music signals in the recording process. To improve the quality of music signals, it is necessary to reduce noise as much as possible. This article briefly introduces noise, the masking effect, and the spectral subtraction method for reducing noise in reverberant music. The spectral subtraction method was improved by the human ear masking effect to enhance its noise reduction performance. Simulation experiments were carried out on the traditional and improved spectral subtraction methods. The results showed that the improved spectral subtraction method could reduce the noise in reverberant music more effectively; under an objective evaluation criterion, the signal-to-noise ratio, the de-reverberated music signal processed by the improved spectral subtraction method had a higher signal-to-noise ratio; under a subjective evaluation criterion, mean opinion score (MOS), the de-reverberated music signal processed by the improved spectral subtraction method also had a better evaluation.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"22 1","pages":"420 - 427"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89062788","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}
Abstract To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern (LBP) and stacked autoencoder (AE) is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder (SAE) learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire image. It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs.
{"title":"Face recognition algorithm based on stack denoising and self-encoding LBP","authors":"Yan-sheng Lu, Mudassir Khan, Mohd Dilshad Ansari","doi":"10.1515/jisys-2022-0011","DOIUrl":"https://doi.org/10.1515/jisys-2022-0011","url":null,"abstract":"Abstract To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern (LBP) and stacked autoencoder (AE) is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder (SAE) learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire image. It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"10 1","pages":"501 - 510"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73321286","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}
A. Salim, Wisam K. Jummar, Farah Maath Jasim, Mohammed S. Yousif
Abstract Modern optimisation is increasingly relying on meta-heuristic methods. This study presents a new meta-heuristic optimisation algorithm called Eurasian oystercatcher optimiser (EOO). The EOO algorithm mimics food behaviour of Eurasian oystercatcher (EO) in searching for mussels. In EOO, each bird (solution) in the population acts as a search agent. The EO changes the candidate mussel according to the best solutions to finally eat the best mussel (optimal result). A balance must be achieved among the size, calories, and energy of mussels. The proposed algorithm is benchmarked on 58 test functions of three phases (unimodal, multimodal, and fixed-diminution multimodal) and compared with several important algorithms as follows: particle swarm optimiser, grey wolf optimiser, biogeography based optimisation, gravitational search algorithm, and artificial bee colony. Finally, the results of the test functions prove that the proposed algorithm is able to provide very competitive results in terms of improved exploration and exploitation balances and local optima avoidance.
{"title":"Eurasian oystercatcher optimiser: New meta-heuristic algorithm","authors":"A. Salim, Wisam K. Jummar, Farah Maath Jasim, Mohammed S. Yousif","doi":"10.1515/jisys-2022-0017","DOIUrl":"https://doi.org/10.1515/jisys-2022-0017","url":null,"abstract":"Abstract Modern optimisation is increasingly relying on meta-heuristic methods. This study presents a new meta-heuristic optimisation algorithm called Eurasian oystercatcher optimiser (EOO). The EOO algorithm mimics food behaviour of Eurasian oystercatcher (EO) in searching for mussels. In EOO, each bird (solution) in the population acts as a search agent. The EO changes the candidate mussel according to the best solutions to finally eat the best mussel (optimal result). A balance must be achieved among the size, calories, and energy of mussels. The proposed algorithm is benchmarked on 58 test functions of three phases (unimodal, multimodal, and fixed-diminution multimodal) and compared with several important algorithms as follows: particle swarm optimiser, grey wolf optimiser, biogeography based optimisation, gravitational search algorithm, and artificial bee colony. Finally, the results of the test functions prove that the proposed algorithm is able to provide very competitive results in terms of improved exploration and exploitation balances and local optima avoidance.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"107 1","pages":"332 - 344"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76831424","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}
Abstract Because the traditional social media fuzzy static image interactive three-dimensional (3D) reconstruction method has the problem of poor reconstruction completeness and long reconstruction time, the social media fuzzy static image interactive 3D reconstruction method is proposed. For preprocessing the fuzzy static image of social media, the Harris corner detection method is used to extract the feature points of the preprocessed fuzzy static image of social media. According to the extraction results, the parameter estimation algorithm of contrast divergence is used to learn the restricted Boltzmann machine (RBM) network model, and the RBM network model is divided into input, output, and hidden layers. By combining the RBM-based joint dictionary learning method and a sparse representation model, an interactive 3D reconstruction of fuzzy static images in social media is achieved. Experimental results based on the CAD software show that the proposed method has a reconstruction completeness of above 95% and the reconstruction time is less than 15 s, improving the completeness and efficiency of the reconstruction, effectively reconstructing the fuzzy static images in social media, and increasing the sense of reality of social media images.
{"title":"Interactive 3D reconstruction method of fuzzy static images in social media","authors":"Xiaomei Niu","doi":"10.1515/jisys-2022-0049","DOIUrl":"https://doi.org/10.1515/jisys-2022-0049","url":null,"abstract":"Abstract Because the traditional social media fuzzy static image interactive three-dimensional (3D) reconstruction method has the problem of poor reconstruction completeness and long reconstruction time, the social media fuzzy static image interactive 3D reconstruction method is proposed. For preprocessing the fuzzy static image of social media, the Harris corner detection method is used to extract the feature points of the preprocessed fuzzy static image of social media. According to the extraction results, the parameter estimation algorithm of contrast divergence is used to learn the restricted Boltzmann machine (RBM) network model, and the RBM network model is divided into input, output, and hidden layers. By combining the RBM-based joint dictionary learning method and a sparse representation model, an interactive 3D reconstruction of fuzzy static images in social media is achieved. Experimental results based on the CAD software show that the proposed method has a reconstruction completeness of above 95% and the reconstruction time is less than 15 s, improving the completeness and efficiency of the reconstruction, effectively reconstructing the fuzzy static images in social media, and increasing the sense of reality of social media images.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"94 1","pages":"806 - 816"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83909130","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}
Abstract The development and application scope of the Internet of Things is also becoming more and more extensive. Especially in the application of power testing improved systems, great progress has been made. This article aims to study how to analyze the system detection equipment based on the Internet of Things. This article describes the basic theoretical knowledge of the Internet of Things and power detection improved systems. A clustering analysis algorithm and a support vector machine algorithm based on the Internet of Things are proposed. In the experiment of this article, the scoring items of the expert’s traditional detection system include complex technology, inconvenient use, and incomplete intelligence. Among them, the highest score for complex technology is 8.6 points, the lowest score is 7 points; the highest score for inconvenience is 8.6 points, and the lowest is 8.3 points. It can be seen that related experts believe that the traditional power detection improved system is not only very complicated in technology, very inconvenient to use but also incompletely intelligent. Therefore, it is very necessary to study the system detection equipment based on the Internet of Things.
{"title":"Iot-based power detection equipment management and control system","authors":"Jintao Chen, Jianfeng Jiang, Binruo Zhu","doi":"10.1515/jisys-2022-0127","DOIUrl":"https://doi.org/10.1515/jisys-2022-0127","url":null,"abstract":"Abstract The development and application scope of the Internet of Things is also becoming more and more extensive. Especially in the application of power testing improved systems, great progress has been made. This article aims to study how to analyze the system detection equipment based on the Internet of Things. This article describes the basic theoretical knowledge of the Internet of Things and power detection improved systems. A clustering analysis algorithm and a support vector machine algorithm based on the Internet of Things are proposed. In the experiment of this article, the scoring items of the expert’s traditional detection system include complex technology, inconvenient use, and incomplete intelligence. Among them, the highest score for complex technology is 8.6 points, the lowest score is 7 points; the highest score for inconvenience is 8.6 points, and the lowest is 8.3 points. It can be seen that related experts believe that the traditional power detection improved system is not only very complicated in technology, very inconvenient to use but also incompletely intelligent. Therefore, it is very necessary to study the system detection equipment based on the Internet of Things.","PeriodicalId":46139,"journal":{"name":"Journal of Intelligent Systems","volume":"281 1","pages":"1229 - 1245"},"PeriodicalIF":3.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74979709","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：