An Iterative Clustering-Based Localization Algorithm for Wireless Sensor Networks

In wireless sensor networks,node localization is a fundamental middleware service.In this paper,a robust and accurate localization algorithm is proposed,which uses a novel iterative clustering model to obtain the most representative intersection points between every two circles and use them to estimate the position of unknown nodes.Simulation results demonstrate that the proposed algorithm outperforms other localization schemes (such as Min-Max,etc.) in accuracy,scalability and gross error tolerance.

AGWO-CNN Classification for Computer-Assisted Diagnosis of Brain Tumors

Brain cancer is the premier reason for cancer deaths all over the world.The diagnosis of brain cancer at an initial stage is mediocre,as the radiologist is ineffectual.Different experiments have been conducted and demonstrated clearly that the algorithms for nodule segmentation are unsuccessful.Therefore,the research has consolidated incremental clustering focused on superpixel segmentation as an appropriate optimization approach for the accurate segmentation of pulmonary nodules.The key aim of the research is to refine brain CT images to accurately distinguish tumors and the segmentation of small-scale anomalous nodules in the brain region.In the beginning stage,an anisotropic diffusion filters(ADF)method with un-sharp intensification masking is utilized to eliminate the noise discernment in images.In the following stage,within the improved nodule image sequence,a Superpixel Segmentation Based Iterative Clustering(SSBIC)algorithm is proposed for irregular brain tissue prediction.Subsequently,the brain nodule samples are captured using deep learning methods:Advanced Grey Wolf Optimization(AGWO)with ONN(AGWO-ONN)and Advanced GWO with CNN-based(AGWOCNN).The proposed technique indicates that the sensitivity is increased and the calculation time is decreased.Consequently,the proposed methodology manifests that the advanced Computer-Assisted Diagnosis(CAD)system has outstanding potential for automatic brain tumor diagnosis.The average segmentation time of the nodule slice order is 1.06s,and 97%of AGWO-ONN and 97.6%of AGWO-CNN achieve the best classification reliability.

Energy-Efficient Multi-Mode Clusters Maintenance(M^2CM) for Hierarchical Wireless Sensor Networks

How to energy-efficiently maintain the topology of wireless sensor networks(WSNs) is still a difficult problem because of their numerous nodes,highly dynamic nature,varied application scenarios and limited resources.An energy-efficient multi-mode clusters maintenance(M2CM) method is proposed based on localized and event-driven mechanism in this work,which is different from the conventional clusters maintenance model with always periodically re-clustered among the whole network style based on time-trigger for hierarchical WSNs.M2 CM can meet such demands of clusters maintenance as adaptive local maintenance for the damaged clusters according to its changes in time and space field.,the triggers of M2 CM include such events as nodes' residual energy being under the threshold,the load imbalance of cluster head,joining in or exiting from any cluster for new node or disable one,etc.Based on neighboring relationship of the damaged clusters,one can start a single cluster(inner-cluster) maintenance or clusters(inter-cluster) maintenance program to meet diverse demands in the topology management of hierarchical WSNs.The experiment results based on NS2 simulation show that the proposed method can significantly save energy used in maintaining a damaged network,effectively narrow down the influenced area of clusters maintenance,and increase transmitted data and prolong lifetime of network compared to the traditional schemes.

The Discovery of Burst Topic and Its Intermittent Evolution in Our Real World

Nowadays, a considerably large number of documents are available over many online news sites (e.g., CNN and NYT). Therefore, the utilization of these online documents, for example, the discovery of a burst topic and its evolution, is a significant challenge. In this paper, a novel topic model, called intermittent Evolution LDA (iELDA) is proposed. In iELDA, the time-evolving documents are divided into many small epochs. iELDA utilizes the detected global topics as priors to guide the detection of an emerging topic and keep track of its evolution over different epochs. As a natural extension of the traditional Latent Dirichlet Allocation (LDA) and Dynamic Topic Model (DTM), iELDA has an advantage: it can discover the intermittent recurring pattern of a burst topic. We apply iELDA to real-world data from NYT; the results demonstrate that the proposed iELDA can appropriately capture a burst topic and track its intermittent evolution as well as produce a better predictive ability than other related topic models.

Copy Move Forgery Detection Using Novel Quadsort Moth Flame Light Gradient Boosting Machine

A severe problem in modern information systems is Digital media tampering along with fake information.Even though there is an enhancement in image development,image forgery,either by the photographer or via image manipulations,is also done in parallel.Numerous researches have been concentrated on how to identify such manipulated media or information manually along with automatically;thus conquering the complicated forgery methodologies with effortlessly obtainable technologically enhanced instruments.However,high complexity affects the developed methods.Presently,it is complicated to resolve the issue of the speed-accuracy trade-off.For tackling these challenges,this article put forward a quick and effective Copy-Move Forgery Detection(CMFD)system utilizing a novel Quad-sort Moth Flame(QMF)Light Gradient Boosting Machine(QMF-Light GBM).Utilizing Borel Transform(BT)-based Wiener Filter(BWF)and resizing,the input images are initially pre-processed by eliminating the noise in the proposed system.After that,by utilizing the Orientation Preserving Simple Linear Iterative Clustering(OPSLIC),the pre-processed images,partitioned into a number of grids,are segmented.Next,as of the segmented images,the significant features are extracted along with the feature’s distance is calculated and matched with the input images.Next,utilizing the Union Topological Measure of Pattern Diversity(UTMOPD)method,the false positive matches that took place throughout the matching process are eliminated.After that,utilizing the QMF-Light GBM visualization,the visualization of forged in conjunction with non-forged images is performed.The extensive experiments revealed that concerning detection accuracy,the proposed system could be extremely precise when contrasted to some top-notch approaches.

A Novel Method for Automated Lung Region Segmentation in Chest X-Ray Images

Detecting and segmenting the lung regions in chest X-ray images is an important part in artificial intelligence-based computer-aided diagnosis/detection (AI-CAD) systems for chest radiography. However, if the chest X-ray images themselves are used as training data for the AI-CAD system, the system might learn the irrelevant image-based information resulting in the decrease of system’s performance. In this study, we propose a lung region segmentation method that can automatically remove the shoulder and scapula regions, mediastinum, and diaphragm regions in advance from various chest X-ray images to be used as learning data. The proposed method consists of three main steps. First, employ the simple linear iterative clustering algorithm, the lazy snapping technique and local entropy filter to generate an entropy map. Second, apply morphological operations to the entropy map to obtain a lung mask. Third, perform automated segmentation of the lung field using the obtained mask. A total of 30 images were used for the experiments. In order to verify the effectiveness of the proposed method, two other texture maps, namely, the maps created from the standard deviation filtering and the range filtering, were used for comparison. As a result, the proposed method using the entropy map was able to appropriately remove the unnecessary regions. In addition, this method was able to remove the markers present in the image, but the other two methods could not. The experimental results have revealed that our proposed method is a highly generalizable and useful algorithm. We believe that this method might act an important role to enhance the performance of AI-CAD systems for chest X-ray images.

A deep semantic segmentation-based algorithm to segment crops and weeds in agronomic color images

In precision agriculture,the accurate segmentation of crops and weeds in agronomic images has always been the center of attention.Many methods have been proposed but still the clean and sharp segmentation of crops and weeds is a challenging issue for the images with a high presence of weeds.This work proposes a segmentation method based on the combination of semantic segmentation and K-means algorithms for the segmenta-tion of crops and weeds in color images.Agronomic images of two different databases were used for the segmentation algorithms.Using the thresholding technique,everything except plants was removed from the images.Afterward,semantic segmentation was applied using U-net followed by the segmentation of crops and weeds using the K-means subtractive algorithm.The comparison of segmentation performance was made for the proposed method and K-Means clustering and superpixels algorithms.The proposed algorithm pro-vided more accurate segmentation in comparison to other methods with the maximum accuracy of equivalent to 99.19%.Based on the confusion matrix,the true-positive and true-negative values were 0.9952 and 0.8985 representing the true classification rate of crops and weeds,respectively.The results indicated that the proposed method successfully provided accurate and convincing results for the segmentation of crops and weeds in the images with a complex presence of weeds.

Complex Traffic Scene Image Classification Based on Sparse Optimization Boundary Semantics Deep Learning

With the rapid development of intelligent traffic information monitoring technology,accurate identification of vehicles,pedestrians and other objects on the road has become particularly important.Therefore,in order to improve the recognition and classification accuracy of image objects in complex traffic scenes,this paper proposes a segmentation method of semantic redefine segmentation using image boundary region.First,we use the Seg Net semantic segmentation model to obtain the rough classification features of the vehicle road object,then use the simple linear iterative clustering(SLIC)algorithm to obtain the over segmented area of the image,which can determine the classification of each pixel in each super pixel area,and then optimize the target segmentation of the boundary and small areas in the vehicle road image.Finally,the edge recovery ability of condition random field(CRF)is used to refine the image boundary.The experimental results show that compared with FCN-8s and Seg Net,the pixel accuracy of the proposed algorithm in this paper improves by 2.33%and 0.57%,respectively.And compared with Unet,the algorithm in this paper performs better when dealing with multi-target segmentation.