Rebound of Region of Interest (RROI), a New Kernel-Based Algorithm for Video Object Tracking Applications

This paper presents a new kernel-based algorithm for video object tracking called rebound of region of interest (RROI). The novel algorithm uses a rectangle-shaped section as region of interest (ROI) to represent and track specific objects in videos. The proposed algorithm is constituted by two stages. The first stage seeks to determine the direction of the object’s motion by analyzing the changing regions around the object being tracked between two consecutive frames. Once the direction of the object’s motion has been predicted, it is initialized an iterative process that seeks to minimize a function of dissimilarity in order to find the location of the object being tracked in the next frame. The main advantage of the proposed algorithm is that, unlike existing kernel-based methods, it is immune to highly cluttered conditions. The results obtained by the proposed algorithm show that the tracking process was successfully carried out for a set of color videos with different challenging conditions such as occlusion, illumination changes, cluttered conditions, and object scale changes.

Ultrasound liver tumor segmentation using adaptively regularized kernel-based fuzzy C means with enhanced level set algorithm

Purpose-The purpose of this study is to develop a hybrid algorithm for segmenting tumor from ultrasound images of the liver.Design/methodology/approach-After collecting the ultrasound images,contrast-limited adaptive histogram equalization approach(CLAHE)is applied as preprocessing,in order to enhance the visual quality of the images that helps in better segmentation.Then,adaptively regularized kernel-based fuzzy C means(ARKFCM)is used to segment tumor from the enhanced image along with local ternary pattern combined with selective level set approaches.Findings-The proposed segmentation algorithm precisely segments the tumor portions from the enhanced images with lower computation cost.The proposed segmentation algorithm is compared with the existing algorithms and ground truth values in terms of Jaccard coefficient,dice coefficient,precision,Matthews correlation coefficient,f-score and accuracy.The experimental analysis shows that the proposed algorithm achieved 99.18% of accuracy and 92.17% of f-score value,which is better than the existing algorithms.Practical implications-From the experimental analysis,the proposed ARKFCM with enhanced level set algorithm obtained better performance in ultrasound liver tumor segmentation related to graph-based algorithm.However,the proposed algorithm showed 3.11% improvement in dice coefficient compared to graph-based algorithm.Originality/value-The image preprocessing is carried out using CLAHE algorithm.The preprocessed image is segmented by employing selective level set model and Local Ternary Pattern in ARKFCM algorithm.In this research,the proposed algorithm has advantages such as independence of clustering parameters,robustness in preserving the image details and optimal in finding the threshold value that effectively reduces the computational cost.

Multistep-ahead River Flow Prediction using LS-SVR at Daily Scale

In this study, potential of Least Square-Support Vector Regression (LS-SVR) approach is utilized to model the daily variation of river flow. Inherent complexity, unavailability of reasonably long data set and heterogeneous catchment response are the couple of issues that hinder the generalization of relationship between previous and forthcoming river flow magnitudes. The problem complexity may get enhanced with the influence of upstream dam releases. These issues are investigated by exploiting the capability of LS-SVR–an approach that considers Structural Risk Minimization (SRM) against the Empirical Risk Minimization (ERM)–used by other learning approaches, such as, Artificial Neural Network (ANN). This study is conducted in upper Narmada river basin in India having Bargi dam in its catchment, constructed in 1989. The river gauging station–Sandia is located few hundred kilometer downstream of Bargi dam. The model development is carried out with pre-construction flow regime and its performance is checked for both pre- and post-construction of the dam for any perceivable difference. It is found that the performances are similar for both the flow regimes, which indicates that the releases from the dam at daily scale for this gauging site may be ignored. In order to investigate the temporal horizon over which the prediction performance may be relied upon, a multistep-ahead prediction is carried out and the model performance is found to be reasonably good up to 5-day-ahead predictions though the performance is decreasing with the increase in lead-time. Skills of both LS-SVR and ANN are reported and it is found that the former performs better than the latter for all the lead-times in general, and shorter lead times in particular.

An IoT Based Secure Patient Health Monitoring System

Internet of things(IoT)field has emerged due to the rapid growth of artificial intelligence and communication technologies.The use of IoT technology in modern healthcare environments is convenient for doctors and patients as it can be used in real-time monitoring of patients,proper administration of patient information,and healthcare management.However,the usage of IoT in the healthcare domain will become a nightmare if patient information is not securely maintainedwhile transferring over an insecure network or storing at the administrator end.In this manuscript,the authors have developed a secure IoT healthcare monitoring system using the Blockchainbased XOR Elliptic Curve Cryptography(BC-XORECC)technique to avoid various vulnerable attacks.Initially,thework has established an authentication process for patient details by generating tokens,keys,and tags using Length Ceaser Cipher-based PearsonHashingAlgorithm(LCC-PHA),EllipticCurve Cryptography(ECC),and Fishers Yates Shuffled Based Adelson-Velskii and Landis(FYS-AVL)tree.The authentications prevent unauthorized users from accessing or misuse the data.After that,a secure data transfer is performed using BC-XORECC,which acts faster by maintaining high data privacy and blocking the path for the attackers.Finally,the Linear Spline Kernel-Based Recurrent Neural Network(LSK-RNN)classification monitors the patient’s health status.The whole developed framework brings out a secure data transfer without data loss or data breaches and remains efficient for health care monitoring via IoT.Experimental analysis shows that the proposed framework achieves a faster encryption and decryption time,classifies the patient’s health status with an accuracy of 89%,and remains robust comparedwith the existing state-of-the-art method.

A Security-Improved Scheme for Virtual TPM Based on KVM

Virtual trusted platform module （vTPM） is an impor- tant part in building trusted cloud environment. Aiming at the remediation of lack of effective security assurances of vTPM in- stances in the existing virtual TPM architecture, this paper pre- sents a security-improved scheme for virtual TPM based on ker- nel-based virtual machine （KVM）. By realizing the TPM2.0 speci- fication in hardware and software, we add protection for vTPM＇s secrets using the asymmetric encryption algorithm of TPM. This scheme supports the safety migration of a TPM key during VM-vTPM migration and the security association for different virtual machines （VMs） with vTPM instances. We implement a virtual trusted platform with higher security based on KVM virtual infrastructure. The experiments show that the proposed scheme can enhance the security of virtual trusted platform and has fewer additional performance loss for the VM migration with vTPM.

Final optics damage online inspection in high power laser facility

For the laser-induced damage(LID) in large-aperture final optics, we present a novel approach of damage online inspection and its experimental system, which solves two problems: classification of true and false LID and size measurement of the LID. We first analyze the imaging principle of the experimental system for the true and false damage sites, then use kernel-based extreme learning machine(K-ELM) to distinguish them, and finally propose hierarchical kernel extreme learning machine(HK-ELM) to predict the damage size. The experimental results show that the classification accuracy is higher than 95%, the mean relative error of the predicted LID size is within 10%. So the proposed method meets the technical requirements for the damage online inspection.

Low Speed Bearing Fault Diagnosis Based on EMD-CIIT Histogram Entropy and KFCM Clustering

In view of weak defect signals and large acoustic emission(AE) data in low speed bearing condition monitoring, we propose a bearing fault diagnosis technique based on a combination of empirical mode decomposition(EMD), clear iterative interval threshold(CIIT) and the kernel-based fuzzy c-means(KFCM) eigenvalue extraction. In this technique, we use EMD-CIIT and EMD to complete the noise removal and to extract the intrinsic mode functions(IMFs). Then we select the first three IMFs and calculate their histogram entropies as the main fault features. These features are used for bearing fault classification using KFCM technique. The result shows that the combined EMD-CIIT and KFCM algorithm can accurately identify various bearing faults based on AE signals acquired from a low speed bearing test rig.

Effort-aware cross-project just-in-time defect prediction framework for mobile apps

As the boom of mobile devices,Android mobile apps play an irreplaceable roles in people’s daily life,which have the characteristics of frequent updates involving in many code commits to meet new requirements.Just-in-Time(JIT)defect prediction aims to identify whether the commit instances will bring defects into the new release of apps and provides immediate feedback to developers,which is more suitable to mobile apps.As the within-app defect prediction needs sufficient historical data to label the commit instances,which is inadequate in practice,one alternative method is to use the cross-project model.In this work,we propose a novel method,called KAL,for cross-project JIT defect prediction task in the context of Android mobile apps.More specifically,KAL first transforms the commit instances into a high-dimensional feature space using kernel-based principal component analysis technique to obtain the representative features.Then,the adversarial learning technique is used to extract the common feature embedding for the model building.We conduct experiments on 14 Android mobile apps and employ four effort-aware indicators for performance evaluation.The results on 182 cross-project pairs demonstrate that our proposed KAL method obtains better performance than 20 comparative methods.

Bat-Grey Wolf Optimizer and kernel mapping for automatic incremental clustering

The technical advancement in information systems contributes towards the massive availability of the documents stored in the electronic databases such as e-mails,internet and web pages.Therefore,it becomes a complex task for arranging and browsing the required document.This paper proposes an approach for incremental clustering using the BatGrey Wolf Optimizer(BAGWO).The input documents are initially subjected to the pre-processing module to obtain useful keywords,and then the feature extraction is performed based on wordnet features.After feature extraction,feature selection is carried out using entropy function.Subsequently,the clustering is done using the proposed BAGWO algorithm.The BAGWO algorithm is designed by integrating the Bat Algorithm(BA)and Grey Wolf Optimizer(GWO)for generating the different clusters of text documents.Hence,the clustering is determined using the BAGWO algorithm,yielding the group of clusters.On the other side,upon the arrival of a new document,the same steps of pre-processing and feature extraction are performed.Based on the features of the test document,the mapping is done between the features of the test document,and the clusters obtained by the proposed BAGWO approach.The mapping is performed using the kernel-based deep point distance and once the mapping terminated,the representatives are updated based on the fuzzy-based representative update.The performance of the developed BAGWO outperformed the existing techniques in terms of clustering accuracy,Jaccard coefficient,and rand coefficient with maximal values 0.948,0.968,and 0.969,respectively.

MRI image segmentation based on fast kernel clustering analysis

Kernel-based clustering is supposed to provide a better analysis tool for pattern classification,which implicitly maps input samples to a highdimensional space for improving pattern separability.For this implicit space map,the kernel trick is believed to elegantly tackle the problem of“curse of dimensionality”,which has actually been more challenging for kernel-based clustering in terms of computational complexity and classification accuracy,which traditional kernelized algorithms cannot effectively deal with.In this paper,we propose a novel kernel clustering algorithm,called KFCM-III,for this problem by replacing the traditional isotropic Gaussian kernel with the anisotropic kernel formulated by Mahalanobis distance.Moreover,a reduced-set represented kernelized center has been employed for reducing the computational complexity of KFCM-I algorithm and circumventing the model deficiency of KFCM-II algorithm.The proposed KFCMIII has been evaluated for segmenting magnetic resonance imaging(MRI)images.For this task,an image intensity inhomogeneity correction is employed during image segmentation process.With a scheme called preclassification,the proposed intensity correction scheme could further speed up image segmentation.The experimental results on public image data show the superiorities of KFCM-III.