ABSTRACT
Neuroscience is a swiftly progressing discipline that aims to unravel the intricate workings of the human brain and mind. Brain tumors, ranging from non-cancerous to malignant forms, pose a significant diagnostic challenge due to the presence of more than 100 distinct types. Effective treatment hinges on the precise detection and segmentation of these tumors early. We introduce a cutting-edge deep-learning approach employing a binary convolutional neural network (BCNN) to address this. This method is employed to segment the 10 most prevalent brain tumor types and is a significant improvement over current models restricted to only segmenting four types. Our methodology begins with acquiring MRI images, followed by a detailed preprocessing stage where images undergo binary conversion using an adaptive thresholding method and morphological operations. This prepares the data for the next step, which is segmentation. The segmentation identifies the tumor type and classifies it according to its grade (Grade I to Grade IV) and differentiates it from healthy brain tissue. We also curated a unique dataset comprising 6,600 brain MRI images specifically for this study. The overall performance achieved by our proposed model is 99.36%. The effectiveness of our model is underscored by its remarkable performance metrics, achieving 99.40% accuracy, 99.32% precision, 99.45% recall, and a 99.28% F-Measure in segmentation tasks.
ABSTRACT
Underwater wireless sensor networks (UWSNs) contain sensor nodes that sense the data and then transfer them to the sink node or base station. Sensor nodes are operationalized through limited-power batteries. Therefore, improvement in energy consumption becomes critical in UWSNs. Data forwarding through the nearest sensor node to the sink or base station reduces the network's reliability and stability because it creates a hotspot and drains the energy early. In this paper, we propose the cooperative energy-efficient routing (CEER) protocol to increase the network lifetime and acquire a reliable network. We use the sink mobility scheme to reduce energy consumption by eliminating the hotspot issue. We have divided the area into multiple sections for better deployment and deployed the sink nodes in each area. Sensor nodes generate the data and send it to the sink nodes to reduce energy consumption. We have also used the cooperative technique to achieve reliability in the network. Based on simulation results, the proposed scheme performed better than existing routing protocols in terms of packet delivery ratio (PDR), energy consumption, transmission loss, and end-to-end delay.
ABSTRACT
MOTIVATION: Many real applications such as businesses and health generate large categorical datasets with uncertainty. A fundamental task is to efficiently discover hidden and non-trivial patterns from such large uncertain categorical datasets. Since the exact value of an attribute is often unknown in uncertain categorical datasets, conventional clustering analysis algorithms do not provide a suitable means for dealing with categorical data, uncertainty, and stability. PROBLEM STATEMENT: The ability of decision making in the presence of vagueness and uncertainty in data can be handled using Rough Set Theory. Though, recent categorical clustering techniques based on Rough Set Theory help but they suffer from low accuracy, high computational complexity, and generalizability especially on data sets where they sometimes fail or hardly select their best clustering attribute. OBJECTIVES: The main objective of this research is to propose a new information theoretic based Rough Purity Approach (RPA). Another objective of this work is to handle the problems of traditional Rough Set Theory based categorical clustering techniques. Hence, the ultimate goal is to cluster uncertain categorical datasets efficiently in terms of the performance, generalizability and computational complexity. METHODS: The RPA takes into consideration information-theoretic attribute purity of the categorical-valued information systems. Several extensive experiments are conducted to evaluate the efficiency of RPA using a real Supplier Base Management (SBM) and six benchmark UCI datasets. The proposed RPA is also compared with several recent categorical data clustering techniques. RESULTS: The experimental results show that RPA outperforms the baseline algorithms. The significant percentage improvement with respect to time (66.70%), iterations (83.13%), purity (10.53%), entropy (14%), and accuracy (12.15%) as well as Rough Accuracy of clusters show that RPA is suitable for practical usage. CONCLUSION: We conclude that as compared to other techniques, the attribute purity of categorical-valued information systems can better cluster the data. Hence, RPA technique can be recommended for large scale clustering in multiple domains and its performance can be enhanced for further research.
Subject(s)
Algorithms , Cluster Analysis , Entropy , UncertaintyABSTRACT
Wireless sensor network is widely used in different IoT-enabled applications such as health care, underwater sensor networks, body area networks, and various offices. A sensor node may face operational difficulties due to low computing capacity. Moreover, mobility has become an open challenge in the healthcare wireless body area network that is highly affected by message loss due to topological manipulation. In this article, an enhanced version of the well-known algorithm MT-MAC is proposed, namely DT-MAC, to ensure successful message delivery. It considers node handover mechanism among virtual clusters to ensure network integrity and also uses the concept of minimum connected dominating set for network formation to achieve efficient energy utilization. It is then compared with well-known algorithms such as MT-MAC. The simulation results show that an increase in little latency of roughly 3 percent in using the proposed protocol improves the MT-MAC's packet delivery by 13-17 percent and the response time by around 15 percent. Therefore, the algorithm is best fitted for real-time applications where the high packet delivery and response time are required.
Subject(s)
Computer Communication Networks , Wireless Technology , Algorithms , Computer Simulation , Delivery of Health CareABSTRACT
LoRaWAN is renowned and a mostly supported technology for the Internet of Things, using an energy-efficient Adaptive Data Rate (ADR) to allocate resources (e.g., Spreading Factor (SF)) and Transmit Power (TP) to a large number of End Devices (EDs). When these EDs are mobile, the fixed SF allocation is not efficient owing to the sudden changes caused in the link conditions between the ED and the gateway. As a result of this situation, significant packet loss occurs, increasing the retransmissions from EDs. Therefore, we propose a Resource Management ADR (RM-ADR) at both ED and Network Sides (NS) by considering the packet transmission information and received power to address this issue. Through simulation results, RM-ADR showed improved performance compared to the state-of-the-art ADR techniques. The findings indicate a faster convergence time by minimizing packet loss ratio and retransmission in a mobile LoRaWAN network environment.
Subject(s)
Mobile Applications , Wireless Technology , Computer SimulationABSTRACT
Road surface defects are crucial problems for safe and smooth traffic flow. Due to climate changes, low quality of construction material, large flow of traffic, and heavy vehicles, road surface anomalies are increasing rapidly. Detection and repairing of these defects are necessary for the safety of drivers, passengers, and vehicles from mechanical faults. In this modern era, autonomous vehicles are an active research area that controls itself with the help of in-vehicle sensors without human commands, especially after the emergence of deep learning (DNN) techniques. A combination of sensors and DNN techniques can be useful for unmanned vehicles for the perception of their surroundings for the detection of tracks and obstacles for smooth traveling based on the deployment of artificial intelligence in vehicles. One of the biggest challenges for autonomous vehicles is to avoid the critical road defects that may lead to dangerous situations. To solve the accident issues and share emergency information, the Intelligent Transportation System (ITS) introduced the concept of vehicular network termed as vehicular ad hoc network (VANET) for achieving security and safety in a traffic flow. A novel mechanism is proposed for the automatic detection of road anomalies by autonomous vehicles and providing road information to upcoming vehicles based on Edge AI and VANET. Road images captured via camera and deployment of the trained model for road anomaly detection in a vehicle could help to reduce the accident rate and risk of hazards on poor road conditions. The techniques Residual Convolutional Neural Network (ResNet-18) and Visual Geometry Group (VGG-11) are applied for the automatic detection and classification of the road with anomalies such as a pothole, bump, crack, and plain roads without anomalies using the dataset from different online sources. The results show that the applied models performed well than other techniques used for road anomalies identification.
Subject(s)
Accidents, Traffic , Deep Learning , Accidents, Traffic/prevention & control , Artificial Intelligence , Humans , Neural Networks, Computer , TransportationABSTRACT
With the growing information on web, online movie review is becoming a significant information resource for Internet users. However, online users post thousands of movie reviews on daily basis and it is hard for them to manually summarize the reviews. Movie review mining and summarization is one of the challenging tasks in natural language processing. Therefore, an automatic approach is desirable to summarize the lengthy movie reviews, and it will allow users to quickly recognize the positive and negative aspects of a movie. This study employs a feature extraction technique called bag of words (BoW) to extract features from movie reviews and represent the reviews as a vector space model or feature vector. The next phase uses Naïve Bayes machine learning algorithm to classify the movie reviews (represented as feature vector) into positive and negative. Next, an undirected weighted graph is constructed from the pairwise semantic similarities between classified review sentences in such a way that the graph nodes represent review sentences, while the edges of graph indicate semantic similarity weight. The weighted graph-based ranking algorithm (WGRA) is applied to compute the rank score for each review sentence in the graph. Finally, the top ranked sentences (graph nodes) are chosen based on highest rank scores to produce the extractive summary. Experimental results reveal that the proposed approach is superior to other state-of-the-art approaches.