Search

With continuous advancements in ancient‐book digitization and preservation research, the problems with the stitching of ancient‐book images have become increasingly prominent, as traditional feature‐mapping‐based methods cannot satisfactorily stitch non‐overlapping images. To realize the accurate stitching of the left and right pages of ancient‐book images, this paper proposes a method for ancient‐book image stitching to meet the requirements of their digitization in back‐wrapped binding and other binding forms. First, a dataset of the black text frames from ancient‐book images was established and then used to train a VGG16‐UNet network for the extraction of black text frames. Then, the Douglas–Peucker algorithm was used to fit the black text frames and filter outliers. Finally, a sliding matching algorithm based on the position information of black text frames was proposed for the rectification of misalignments. The results showed that the method achieved a satisfying stitching effect and had good robustness. [ABSTRACT FROM AUTHOR]

The current pattern mining algorithms focus on discovering either frequent itemsets or high-utility itemsets. The goal of this research is to study the problem of mining frequent-utility itemsets. To solve this problem, two novel algorithms named FUIMTWU-Tree (Frequent-utility Itemset Mining based on TWU-Tree) and FUIMTF-Tree (Frequent-utility Itemset Mining based on TF-Tree) are presented based on the integration of IHUP and HUI-Miner. The TWU-tree and TF-Tree structures are utilised to avoid the unnecessary utility-list construction of itemsets that do not appear in a transaction dataset. The performance of the proposed algorithms is evaluated on various datasets. The results of the experiments demonstrate that FUIMTWU-Tree and FUIMTF-Tree perform efficiently in terms of speed, pruning performance and scalability. [ABSTRACT FROM AUTHOR]

The checkpoint/restart mechanism is critical in a preemptive system because clusters with this mechanism will be improved in terms of fault tolerance, load balance, and resource utilization. As graphics processing units (GPUs) have more recently become commonplace with the advent of general-purpose computation, and open computing language (OpenCL) programs are portable across various CPUs and GPUs, it is increasingly important to set up checkpoint/restart mechanism in OpenCL programs. However, due to the complexity of the internal computational state of the GPU, there is currently no effective and reasonable checkpoint/restart scheme for OpenCL applications. This paper proposes a feasible system, checkpoint/restart state (CRState), to achieve checkpoint/restart in GPU kernels. The computation states including heap, data segments, local memory, stack and code segments in the underlying hardware are identified and concretized in order to establish an association between the underlying level state and the application level representation. Then, a pre-compiler is developed to insert primitives into OpenCL programs at compile time so that major components of the computation state will be extracted at runtime. Since the computation state is duplicated at application level, such OpenCL programs can be preempted and ported across heterogeneous devices. A comprehensive example and ten authoritative benchmark programs are selected to demonstrate the feasibility and effectiveness of the proposed system. [ABSTRACT FROM AUTHOR]

High-utility pattern mining is an effective technique that extracts significant information from varied types of databases. However, the analysis of data with sensitive private information may cause privacy concerns. To achieve better trade-off between utility maximizing and privacy preserving, privacy-preserving utility mining (PPUM) has become an important research topic in recent years. The MSICF algorithm is a sanitization algorithm for PPUM. It selects the item based on the conflict count and identifies the victim transaction based on the concept of utility. Although MSICF is effective, the heuristic selection strategy can be improved to obtain a lower ratio of side effects. In our paper, we propose an improved sanitization approach named the Improved Maximum Sensitive Itemsets Conflict First Algorithm (IMSICF) to address this issue. It dynamically calculates conflict counts of sensitive items in the sanitization process. In addition, IMSICF chooses the transaction with the minimum number of nonsensitive itemsets and the maximum utility in a sensitive itemset for modification. Extensive experiments have been conducted on various datasets to evaluate the effectiveness of our proposed algorithm. The results show that IMSICF outperforms other state-of-the-art algorithms in terms of minimizing side effects on nonsensitive information. Moreover, the influence of correlation among itemsets on various sanitization algorithms' performance is observed. [ABSTRACT FROM AUTHOR]

• A feature model, including ten signal features, was proposed and run on each of the 12 leads separately. • A novel feature fusion method combining information from all available leads was developed. • A cascaded classifier utilizing random forest (RF) and multilayer perceptron (MLP) was implemented. • Extensive experimental results shown that the average accuracy of our work achieved 99.3%, 99.8%, 97.6% and 99.6% on four databases respectively. • Compared with most state-of-the-art methods, our method has better performance and strong generalization capability. Electrocardiogram (ECG) is an important diagnostic tool for the diagnosis of heart disorders. Useful features and well-designed classification method are crucial for automatic diagnosis. However, most of the contributions were in single lead or two-lead ECG signal and only features from single lead were used to classify the ECG beats. In this paper, a cascaded classification system is proposed to extract features and classify heartbeats in order to improve the performance of ECG beat classification via multi-lead ECG. In contrast with most of the literatures, ten signal features were chosen and run on each of the 12 leads separately. Based on these features, we developed a novel feature fusion method combining information from all available leads, and then implemented a cascaded classifier utilizing random forest (RF) and multilayer perceptron (MLP). Besides, in order to reduce the feature space dimension, principal component analysis (PCA) was applied in the method. Four open source databases including MIT-BIH Arrythmia Database, QT Database, MIT-BIH Supraventricular Arrhythmia Database and St. Petersburg Institute of Cardiological Technics 12-lead Arrhythmia Database (INCART Database) were used in this work. These four databases are different in classes of beats, volume of dataset, number of individual volunteers. Except INCART database, in which the recording format is 12 − l e a d , the other three databases consist of 2 − l e a d recordings. Above all, they all have annotations for every single beat including the type of each beat. Extensive experimental results shown that the average accuracy achieved 99.3%, 99.8%, 97.6% and 99.6% on four databases respectively. Compared with most state-of-the-art methods, our work has better performance and strong generalization capability. [ABSTRACT FROM AUTHOR]

Lung cancer is one of the most diagnosable forms of cancer worldwide. The early diagnoses of pulmonary nodules in computed tomography (CT) chest scans are crucial for potential patients. Recent researches have showed that the methods based on deep learning have made a significant progress for the medical diagnoses. However, the achievements on identification of pulmonary nodules are not yet satisfactory enough to be adopted in clinical practice. It is largely caused by either the existence of many false positives or the heavy time of processing. With the development of fully convolutional networks (FCNs), in this study, we proposed a new method of identifying the pulmonary nodules. The method segments the suspected nodules from their environments and then removes the false positives. Especially, it optimizes the network architecture for the identification of nodules rapidly and accurately. In order to remove the false positives, the suspected nodules are reduced using the 2D models. Furthermore, according to the significant differences between nodules and non-nodules in 3D shapes, the false positives are eliminated by integrating into the 3D models and classified via 3D CNNs. The experiments on 1000 patients indicate that our proposed method achieved 97.78% sensitivity rate for segmentation and 90.1% accuracy rate for detection. The maximum response time was less than 30 s and the average time was about 15 s. Graphical Abstract This paper has proposed a new method of identifying the pulmonary nodules. The method segments the suspected nodules from CT images and removes the false positives. As shown in the above, the proposed approach consists of three stages. In stage I, raw data are filtered and normalized. The clean normalized data are then segmented in stage II to extract the suspected nodular lesions through 2D FCNs. Stage III is to remove some false positives generated at stage II via 3D CNNs and outputs the final results. The experiments on 1000 patients indicate that our proposed method has achieved 97.78% sensitivity rate for segmentation and 90.1% accuracy rate for detection. The maximum response time was less than 30 s and the average time was about 15 s. [ABSTRACT FROM AUTHOR]

Skyline frequent-utility itemset mining is used to discover itemsets that are non-dominated by considering both support and utility factors. It is an extension of high-utility itemset mining. Most existing algorithms are based on the utility-list structure to mine skyline frequent-utility itemsets. A major limitation of utility-list based algorithms is that numerous join operations consume a huge amount of time and memory. To address this issue, two algorithms named EMSFUI-D and EMSFUI-B are proposed to mine skyline frequent-utility itemsets. EMSFUI-D performs the depth-first search to explore the search space of all itemsets. EMSFUI-B discovers itemsets based on the breadth-first search. Both algorithms utilize two pruning strategies to limit the search space. Moreover, in order to further facilitate the mining performance, the ISU -1 and ISU -2 structures are presented in EMSFUI-D to provide tighter utility upper bounds. These structures maintain the support and utility information of all 1-itemsets and 2-itemsets, respectively. Thus, there is no need to use these structures to prune search space in the breadth-first search algorithm. An extensive experimental study on real and synthetic datasets shows that our proposed algorithms outperform the state-of-the-art SKYFUP-D and SKYFUP-B algorithms in terms of execution time, memory consumption and pruning performance. Moreover, our designed algorithms are scalable for handling a large number of distinct items and transactions. [ABSTRACT FROM AUTHOR]

Determining drug–drug interactions (DDIs) is an important part of pharmacovigilance and has a vital impact on public health. Compared with drug trials, obtaining DDI information from scientific articles is a faster and lower cost but still a highly credible approach. However, current DDI text extraction methods consider the instances generated from articles to be independent and ignore the potential connections between different instances in the same article or sentence. Effective use of external text data could improve prediction accuracy, but existing methods cannot extract key information from external data accurately and reasonably, resulting in low utilization of external data. In this study, we propose a DDI extraction framework, instance position embedding and key external text for DDI (IK-DDI), which adopts instance position embedding and key external text to extract DDI information. The proposed framework integrates the article-level and sentence-level position information of the instances into the model to strengthen the connections between instances generated from the same article or sentence. Moreover, we introduce a comprehensive similarity-matching method that uses string and word sense similarity to improve the matching accuracy between the target drug and external text. Furthermore, the key sentence search method is used to obtain key information from external data. Therefore, IK-DDI can make full use of the connection between instances and the information contained in external text data to improve the efficiency of DDI extraction. Experimental results show that IK-DDI outperforms existing methods on both macro-averaged and micro-averaged metrics, which suggests our method provides complete framework that can be used to extract relationships between biomedical entities and process external text data. [ABSTRACT FROM AUTHOR]

Objective. Electrocardiogram (ECG) is an important diagnostic tool that has been the subject of much research in recent years. Owing to a lack of well-labeled ECG record databases, most of this work has focused on heartbeat arrhythmia detection based on ECG signal quality. Approach. A record quality filter was designed to judge ECG signal quality, and a random forest method, a multilayer perceptron, and a residual neural network (RESNET)-based convolutional neural network were implemented to provide baselines for ECG record classification according to three different principles. A new multimodel method was constructed by fusing the random forest and RESNET approaches. Main Results. Owing to its ability to combine discriminative human-crafted features with RESNET deep features, the proposed new method showed over 88% classification accuracy and yielded the best results in comparison with alternative methods. Significance. A new multimodel fusion method was presented for abnormal cardiovascular detection based on ECG data. The experimental results show that separable convolution and multiscale convolution are vital for ECG record classification and are effective for use with one-dimensional ECG sequences. [ABSTRACT FROM AUTHOR]