Search

Tracking the trends and taking early steps accordingly is important in academia, as well as in other domains such as technology and finance. In this work, we focus on the problem of predicting the trending research topics from a collection of academic papers. Previous efforts model the problem in different ways and mostly apply classical approaches such as correlation analysis and clustering. There are also several recent neural model based solutions, however they rely on feature vectors and additional information for the trend prediction. In this work, given a collection of publications within the observation time window, we predict whether the use of a keyword will increase, decrease or be steady for the future time window (prediction window). As the solution, we propose a family of deep neural architectures that focus on generating summary representations for paper collections under the query keyword. Due to the sequence based nature of the data, Long Short-Term Memory (LSTM) module plays a core role, but it is combined with different layers in a novel way. The first group of proposed neural architectures consider each paper as a sequence of keywords and use word embeddings to construct paper collection representations. In this group, the proposed architectures differ from each other in the way year based and overall summary representations are constructed. In the second group, each paper is directly represented as a vector and the use of different paper embedding techniques are explored. The analyses of the models are performed on a variety of paper collections belonging to different academic venues, obtained from Microsoft Academic Graph data set. The experiments conducted against baseline methods show that proposed deep neural based models achieve higher trend prediction performance than the baseline models on the overall. Among the proposed models, paper embedding based models provide better results for most of the cases.

The semiconductor industry is the core industry of the information age. As a key link in the semiconductor industry, wafer fabrication plays a key role in its development. In the testing stage of the wafer, each die of the wafer is detected and marked, and a wafer map with a certain spatial pattern can be formed. The analysis and classification of these spatial patterns can identify the cause of wafer defects, thereby improving production yield. However, as wafer size increases, line widths become smaller, etc., the probability of a mixed defect mode wafer pattern increases. Moreover, the mixed defect mode wafer map is more difficult to identify and classify than the single defect mode wafer map. Therefore, this paper proposes an improved deep convolutional neural network (DCNN) structure model for the recognition and classification of mixed defect pattern wafer maps. From the perspective of increasing the width of the DCNN, the improved network structure can avoid problems such as over-fitting and limited extraction of features due to the continuous deepening of the DCNN. The network is called Multi-Path DCNN (MP-DCNN) structure. The experimental results show that the proposed Multi-Path DCNN structure has better performance and higher classification accuracy than existing methods. [ABSTRACT FROM AUTHOR]

This paper presents an asset health index (HI) prediction methodology for high voltage transmission overhead lines (OHLs) using supervised machine learning and structured, unambiguous visual inspections. We propose a framework for asset HI predictions to determine the technical condition of individual OHL towers to improve grid reliability in a cost-effective manner. The paper focuses on asset HI prediction and the selection of the most parsimonious model. Based on the technical specifications and HI data, our methodology allows for the prediction of a HI for OHLs without HI data, and models asset aging behaviour. Technical specifications and the HI as defined in this paper are taken from the Estonian TSO periodical visual inspections implemented in 2018. The case study successfully demonstrates that the proposed methodology can predict tower HI values for a single OHL with nearly 80 percent accuracy without the need for additional measurements. [ABSTRACT FROM AUTHOR]

Data quality plays an important role during the training stage of machine/deep learning models. The annotation hinges on the experiences of domain experts. To acquire the expert’s knowledge in the context of machine learning, manual data labeling, a tedious and time-consuming task in supervised learning, should be given a top priority. However, the domain experts in the line of plentiful manual annotation may easily get distracted or fatigued after long-time work, causing judgment errors, mislabeling, etc. The pattern recognition of wafer defect map is investigated in this paper, the primary goal of which is to train the convolutional neural network (CNN) model through a very limited number of manually labeled data so that the trained model is capable of performing pseudo labeling. Subsequently, a self-assured adaptive ensemble learner in terms of a series of shallow neural networks is proposed to filter wafer map samples with untrusted pseudo-labels. In the result, the amount of human annotations is significantly reduced by 61% for training a highly accurate classifier. A minimum number of manually labeled data is suggested while the equally high classification performance of wafer defect pattern is maintained. For the evaluation purpose, the proposed self-assured learning is compared with the confidence learning. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs), including convolutional neural networks (CNNs) and residual networks (ResNets) models, are able to learn abstract representations from the input data by considering a deep hierarchy of layers that perform advanced feature extraction. The combination of these models with visual attention techniques can assist with the identification of the most representative parts of the data from a visual standpoint, obtained through more detailed filtering of the features extracted by the operational layers of the network. This is of significant interest for analyzing remotely sensed hyperspectral images (HSIs), characterized by their very high spectral dimensionality. However, few efforts have been conducted in the literature in order to adapt visual attention methods to remotely sensed HSI data analysis. In this paper, we introduce a new visual attention-driven technique for the HSI classification. Specifically, we incorporate attention mechanisms to a ResNet in order to better characterize the spectral–spatial information contained in the data. Our newly proposed method calculates a mask that is applied to the features obtained by the network in order to identify the most desirable ones for classification purposes. Our experiments, conducted using four widely used HSI data sets, reveal that the proposed deep attention model provides competitive advantages in terms of classification accuracy when compared to other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Multi-label classification has gained in importance in the last decade and it is today confronted to the current needs to process massive raw data from heterogeneous sources. Therefore, dimensionality reduction, which aims at reducing the number of features, labels, or both, knows a renewed interest to enhance the scaling properties of the classifiers and their predictive performances. In this paper we review more than fifty papers presenting dimensionality reduction approaches for multi-label classification and we propose an analysis in three steps : (i) a typology of the methods describing the main components of their strategies, the problem they tackle and the way they solve it (ii) a unified formalization of the problems to help to distinguish the similarities and differences between the approaches, and (iii) a meta-analysis of the published experimental results inspired by the consensus theory to identify the most efficient algorithms. [ABSTRACT FROM AUTHOR]

Uncertain data objects are objects that can be characterized by either a probability density function (PDF) or with multiple points. Because of existing levels of uncertainty for uncertain data objects, the scatter of this type of objects might be very different than the scatter of certain data objects. Measures of scatter for uncertain objects have not been defined before. In this paper, we define covariance matrix, within scatter matrix, and between scatter matrix as the measures of scatter for uncertain data objects. Also, in this paper, we extend the idea of Fisher linear discriminant analysis for uncertain objects (UFLDA). We also develop kernel Fisher discriminant analysis for uncertain objects (UKFDA). The developed uncertain kernel Fisher discriminants are for two cases: 1) when the uncertain objects are given with PDF and 2) when the uncertain objects are given with multiple points. We compare the performance of our developed uncertain Fisher discriminants (UFLDA and UKFDA) with a few other methods in classification of uncertain data objects through several examples on both simulated and real-world data. We will show in the experiments that our developed uncertain Fisher discriminants outperform other methods in classifying uncertain data objects. [ABSTRACT FROM AUTHOR]

In this paper, we propose a modified strategy using sparse representation to identify the authorship of online handwritten documents. The note-worthy aspect of this paper lies in the introduction of a-priori information for each dictionary atom, that in a way indicates its degree of importance with respect to the dynamic characteristics of the writer. The methodology behind obtaining this information for the dictionary atoms is based on the computation of entropy values over histograms that are generated from the sparse coefficients during the training phase. The prelearned values are incorporated on the traditional schemes of “max” and “mean” pooling of sparse codes, thereby resulting in a modified writer descriptor. Experiments performed with the proposed sparse classification strategy on the handwritten samples of the IAM and IBM-UB1 online handwriting databases demonstrate promising results. [ABSTRACT FROM AUTHOR]

In active and assisted living environments, a major service that can be provided is the automated assessment of elderly people’s well-being. Therefore, activity recognition is required to detect what types of help disabled persons need to support them in their daily life activities. Unfortunately, it is still a difficult task to estimate the size of the required window for online sensor data streams to recognize a specific activity, especially when new sensor events are recorded. This paper proposes a windowing algorithm, which presents promising results to recognize complex human activities for multi-resident homes. The approach is based on the analysis of the sensor data to identify the best fitting sensors that should be considered in a specified window. Moreover, the second part of this paper proposes a set of different statistical spatio-temporal features to recognize human activities. In order to check the overall performance, this approach is tested using the CASAS data set and artificially generated laboratory data using our HBMS simulator. The results show high performance based on different evaluation metrics compared to other approaches. We believe that the proposed windowing approach provides a good approximation of the required window size in order to robustly detect human activities in comparison to other windowing approaches. [ABSTRACT FROM AUTHOR]

Artificial intelligence evolved as a powerful tool in condition monitoring of the induction motor for early diagnosis of bearing faults. This paper attempted to identify the features to improve the accuracy of diagnosis using the benchmark database of the Case Western Reserve University (CWRU) and the Machinery Fault Prevention Technology (MFPT). In this paper, 18 time-domain features are extracted constituting six proposed time-dependent spectral features (TDSFs) and 12 statistical time-domain features. For the first time, a set of six TDSFs are extracted to diagnose the bearing faults. This involves extracting frequency-domain features using the relationship between Parseval’s theorem and the Fourier transform directly from the time domain. Particle swarm optimization (PSO) and wheel-based differential evolution (WBDE) feature selection algorithms are also implemented to identify four prominent features. It is found that three of the four selected features are TDSF features, and results of selected features revealed the attainment of 90.92% for 48 class identifications of CWRU database and 100% for 17 class identifications of the MFPT database, respectively. [ABSTRACT FROM AUTHOR]

Among the Steady-state visual evoked potential (SSVEP)-based brain-computer interfaces (BCIs), the phase-tagged SSVEP (p-SSVEP) has been proved a reliable paradigm to extend the number of available targets, especially for high-frequency SSVEP-based BCIs. However, the recognition efficiency of the high-frequency p-SSVEP still remains relatively low. A longer data segment may achieve a higher classification accuracy, but the time consumption of computation leads to the decrease of information transfer rate. This paper presents a recursive Bayesian-based approach to improve the high-frequency p-SSVEP classification efficiency. In each signal processing period, the classification result is generated by the current scores, the condition probability and a recursive prior probability (dynamic prior probability). The experiment displays the SSVEP stimuli with 20 Hz and 30 Hz respectively, and each frequency contains six phases. This paper compared three classification approaches and the recursive Bayesian-based approach could obtain the highest classification accuracy and practical bit rate under the same data length. The mean accuracy and practical bit rate were 89.7% and 37.8 bits/min with 20Hz, and 89.0% and 36.5 bits/min with 30Hz, respectively Furthermore, the recursive Bayesian-based approach could reduce the individual differences among different subjects. Therefore, the recursive Bayesian-based approach can lead to high classification efficiency in high-frequency p-SSVEP. [ABSTRACT FROM AUTHOR]

Image classification needs to consider the existence of image degradations in practice. Although degraded images have various levels of degradation, the degradation levels are usually unknown. This paper proposes a convolutional neural network to classify degraded images by using a restoration network and an ensemble learning. The proposed network can automatically infer ensemble weights by using estimated degradation levels of degraded images and features of restored images, where the degradation levels are estimated internally. The proposed network is mainly discussed with JPEG distortion, while degradations of both Gaussian noise and blurring are also examined. We demonstrate that the proposed network can classify degraded images over various levels of degradation. This paper also reveals how the image-quality of training data for a classification network affects the classification performance of degraded images. [ABSTRACT FROM AUTHOR]

Wafer-level direct bonding technology is a key process for the production of backside illuminated (BSI) CMOS image sensor (CIS). Usually, constant-depth mode scanning acoustic microscope (C-SAM) 300mm wafer images are acquired and defect size distribution is provided to monitor defects that degrade bonding yield. This acquisition technique is used as it is nondestructive and is able to capture the full wafer. Current solutions are not providing information detailed enough to identify the root cause of this degradation. A consequence is that most measurements and classification is currently done manually which take time and have reproducibility issues. In this paper, we propose a rule-based method for the classification of the defects and automatic segmentation of the defects to extract precise measurements depending on the type of defect. The classes of defects are precisely defined based on their origin in the process. All these information will allow to reduce the time to analyze the images and improve the precision and consistency of the analysis. These results will allow to identify more precisely the defects thus the causes of yield degradation during bonding process. [ABSTRACT FROM AUTHOR]

Histopathological tissue classification is a simpler way to achieve semantic segmentation for the whole slide images, which can alleviate the requirement of pixel-level dense annotations. Existing works mostly leverage the popular CNN classification backbones in computer vision to achieve histopathological tissue classification. In this paper, we propose a super lightweight plug-and-play module, named Pyramidal Deep-Broad Learning (PDBL), for any well-trained classification backbone to improve the classification performance without a re-training burden. For each patch, we construct a multi-resolution image pyramid to obtain the pyramidal contextual information. For each level in the pyramid, we extract the multi-scale deep-broad features by our proposed Deep-Broad block (DB-block). We equip PDBL in three popular classification backbones, ShuffLeNetV2, EfficientNetb0, and ResNet50 to evaluate the effectiveness and efficiency of our proposed module on two datasets (Kather Multiclass Dataset and the LC25000 Dataset). Experimental results demonstrate the proposed PDBL can steadily improve the tissue-level classification performance for any CNN backbones, especially for the lightweight models when given a small among of training samples (less than 10%). It greatly saves the computational resources and annotation efforts. The source code is available at: https://github.com/linjiatai/PDBL. [ABSTRACT FROM AUTHOR]

In this paper, classification of mental task-root brain–computer interfaces (BCIs) is being investigated. The mental tasks are dominant area of investigations in BCI, which utmost interest as these system can be augmented life of people having severe disabilities. The performance of BCI model primarily depends on the construction of features from brain, electroencephalography (EEG), signal, and the size of feature vector, which are obtained through multiple channels. The availability of training samples to features are minimal for mental task classification. The feature selection is used to increase the ratio for the mental task classification by getting rid of irrelevant and superfluous features. This paper suggests an approach to augment the performance of a learning algorithm for the mental task classification on the utility of power spectral density (PSD) using feature selection. This paper also deals a comparative analysis of multivariate and univariate feature selection for mental task classification. After applying the above stated method, the findings demonstrate substantial improvements in the performance of learning model for mental task classification. Moreover, the efficacy of the proposed approach is endorsed by carrying out a robust ranking algorithm and Friedman’s statistical test for finding the best combinations and compare various combinations of PSD and feature selection methods. [ABSTRACT FROM AUTHOR]

The power distribution system’s fault root cause classification is an important but challenging problem. Traditional classifiers fail to achieve high accuracy and good generalization performance due to data insufficiency. A large volume of unlabeled data is available, which can be utilized to improve classification performance. This paper proposes a novel classifier called Robust Semi-Supervised Prototypical Network (RSSPN) based on Prototypical Network architecture and semi-supervised learning to address this issue. The proposed method can mine information from unlabeled data to improve the generalization ability and classification accuracy. Furthermore, RSSPN adopts the idea of meta-learning to obtain the “few-shot learning” ability for identifying new fault classes using very few samples encountered during the operation and update online. Experiments have been conducted on a dataset consisting of 1152 labeled samples belonging to 12 different classes and 10000 unlabeled samples. The accuracy of the proposed method is significantly better than the traditional classifiers. [ABSTRACT FROM AUTHOR]

In the electroencephalography (EEG) based cross-subject motor imagery (MI) classification task, the device and subject problems can cause the time-related data distribution shift problem. In a single-source to single-target (STS) MI classification task, such a shift problem will certainly provoke an increase in the overall data distribution difference between the source and target domains, giving rise to poor classification accuracy. In this paper, a novel multi-subdomain adaptation method (MSDAN) is proposed to solve the shift problem and improve the classification accuracy of the traditional approaches. In the proposed MSDAN, the adaptation losses in both class-related and time-related subdomains (that are divided by different data labels and session labels) are obtained by measuring the distribution differences between the source and target subdomains. Then, the adaptation and classification losses in the loss function of MSDAN are minimized concurrently. To illustrate the application value of the proposed method, our method is applied to solve the STS MI classification task about data analysis with respect to the brain-computer interface (BCI) competition III-IVa dataset. The resultant experiment results demonstrate that compared with other well-known domain adaptation and deep learning methods, the proposed method is capable of solving the time-related data distribution problem at higher classification accuracy. [ABSTRACT FROM AUTHOR]

Objective: To explain individual differences in development, behavior, and cognition, most previous studies focused on projecting resting-state functional MRI (fMRI) based functional connectivity (FC) data into a low-dimensional space via linear dimensionality reduction techniques, followed by executing analysis operations. However, linear dimensionality analysis techniques may fail to capture the nonlinearity of brain neuroactivity. Moreover, besides resting-state FC, the FC based on task fMRI can be expected to provide complementary information. Motivated by these considerations, we nonlinearly fuse resting-state and task-based FC networks (FCNs) to seek a better representation in this paper. Methods: We propose a framework based on alternating diffusion map (ADM), which extracts geometry-preserving low-dimensional embeddings that successfully parameterize the intrinsic variables driving the phenomenon of interest. Specifically, we first separately build resting-state and task-based FCNs by symmetric positive definite matrices using sparse inverse covariance estimation for each subject, and then utilize the ADM to fuse them in order to extract significant low-dimensional embeddings, which are used as fingerprints to identify individuals. Results: The proposed framework is validated on the Philadelphia Neurodevelopmental Cohort data, where we conduct extensive experimental study on resting-state and fractal $n$ -back task fMRI for the classification of intelligence quotient (IQ). The fusion of resting-state and $n$ -back task fMRI by the proposed framework achieves better classification accuracy than any single fMRI, and the proposed framework is shown to outperform several other data fusion methods. Conclusion and Significance: To our knowledge, this paper is the first to demonstrate a successful extension of the ADM to fuse resting-state and task-based fMRI data for accurate prediction of IQ. [ABSTRACT FROM AUTHOR]

Recently, researchers have shown the powerful ability of deep methods with multilayers to extract high-level features and to obtain better performance for hyperspectral image classification. However, a common problem of traditional deep models is that the learned deep models might be suboptimal because of the limited number of training samples, especially for the image with large intraclass variance and low interclass variance. In this paper, novel convolutional neural networks (CNNs) with multiscale convolution (MS-CNNs) are proposed to address this problem by extracting deep multiscale features from the hyperspectral image. Moreover, deep metrics usually accompany with MS-CNNs to improve the representational ability for the hyperspectral image. However, the usual metric learning would make the metric parameters in the learned model tend to behave similarly. This similarity leads to obvious model’s redundancy and, thus, shows negative effects on the description ability of the deep metrics. Traditionally, determinantal point process (DPP) priors, which encourage the learned factors to repulse from one another, can be imposed over these factors to diversify them. Taking advantage of both the MS-CNNs and DPP-based diversity-promoting deep metrics, this paper develops a CNN with multiscale convolution and diversified metric to obtain discriminative features for hyperspectral image classification. Experiments are conducted over four real-world hyperspectral image data sets to show the effectiveness and applicability of the proposed method. Experimental results show that our method is better than original deep models and can produce comparable or even better classification performance in different hyperspectral image data sets with respect to spectral and spectral–spatial features. [ABSTRACT FROM AUTHOR]

To support their massively-multithreaded architecture, GPUs use very large register file (RF) which has a capacity higher than even L1 and L2 caches. In total contrast, traditional CPUs use tiny RF and much larger caches to optimize latency. Due to these differences, along with the crucial impact of RF in determining GPU performance, novel and intelligent techniques are required for managing GPU RF. In this paper, we survey the techniques for designing and managing GPU RF. We discuss techniques related to performance, energy and reliability aspects of RF. To emphasize the similarities and differences between the techniques, we classify them along several parameters. The aim of this paper is to synthesize the state-of-art developments in RF management and also stimulate further research in this area. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a novel Semi-supervised Learning with Incomplete Modality (SLIM) method considering the modal consistency and complementarity simultaneously, and Kernel SLIM (SLIM-K) based on matrix completion for further solving the modal incompleteness. As is well known, most realistic data have multi-modal representations, multi-modal learning refers to the process of learning a precise model for complete modalities. However, due to the failures of data collection, self-deficiencies, or other various reasons, multi-modal examples are usually with incomplete modalities, which generate utility obstacle using previous methods. In this paper, SLIM integrates the intrinsic consistency and extrinsic complementary information for prediction and cluster simultaneously. In detail, SLIM forms different modal classifiers and clustering learner consistently in a unified framework, while using the extrinsic complementary information from unlabeled data against the insufficiencies brought by the incomplete modal issue. Moreover, in order to deal with missing modality in essence, we propose the SLIM-K, which takes the complemented kernel matrix into the classifiers and the cluster learner respectively. Thus, SLIM-K can solve the defects of missing modality in result. Finally, we give the discussion of generalization of incomplete modalities. Experiments on 13 benchmark multi-modal datasets and two real-world incomplete multi-modal datasets validate the effectiveness of our methods. [ABSTRACT FROM AUTHOR]

The importance of effective surgical wound care cannot never be underestimated. Poorly managing surgical wounds may cause many serious complications. Thus, it raises the necessity to develop a patient-friendly self-care system which can help both patients and medical professionals to ensure the state of the surgical wounds without any special medical equipment. In this paper, a surgical wound assessment system for self-care is proposed. The proposed system is designed to enable patients capture surgical wound images of themselves by using a mobile device and upload these images for analysis. Combining image-processing and machine-learning techniques, the proposed method is composed of four phases. First, images are segmented into superpixels where each superpixel contains the pixels in the similar color distribution. Second, these superpixels corresponding to the skin are identified and the area of connected skin superpixels is derived. Third, surgical wounds will be extracted from this area based on the observation of the texture difference between skin and wounds. Lastly, state and symptoms of surgical wound will be assessed. Extensive experimental results are conducted. With the proposed method, more than 90% state assessment results are correct and more than 91% symptom assessment results consistent with the actual diagnosis. Moreover, case studies are provided to show the advantage and limitation of this system. These results show that this system could perform well in the practical self-care scenario. [ABSTRACT FROM AUTHOR]

Recently, substantial research effort has focused on how to apply CNNs or RNNs to better capture temporal patterns in videos, so as to improve the accuracy of video classification. In this paper, we investigate the potential of a purely attention based local feature integration. Accounting for the characteristics of such features in video classification, we first propose Basic Attention Clusters (BAC), which concatenates the output of multiple attention units applied in parallel, and introduce a shifting operation to capture more diverse signals. Experiments show that BAC can achieve excellent results on multiple datasets. However, BAC treats all feature channels as an indivisible whole, which is suboptimal for achieving a finer-grained local feature integration over the channel dimension. Additionally, it treats the entire local feature sequence as an unordered set, thus ignoring the sequential relationships. To improve over BAC, we further propose the channel pyramid attention schema by splitting features into sub-features at multiple scales for coarse-to-fine sub-feature interaction modeling, and propose the temporal pyramid attention schema by dividing the feature sequences into ordered sub-sequences of multiple lengths to account for the sequential order. Our final model pyramid×pyramid attention clusters (PPAC) combines both channel pyramid attention and temporal pyramid attention to focus on the most important sub-features, while also preserving the temporal information of the video. We demonstrate the effectiveness of PPAC on seven real-world video classification datasets. Our model achieves competitive results across all of these, showing that our proposed framework can consistently outperform the existing local feature integration methods across a range of different scenarios. [ABSTRACT FROM AUTHOR]

As the extension of high efficiency video coding (HEVC) standard, three dimensional-HEVC (3D-HEVC) is the latest 3D video coding standard. 3D-HEVC adopts many complicated coding algorithms to generate additional intermediate views for 3D video representation, which result in extremely high coding complexity. Therefore, this paper proposed a fast depth intra coding approach to reduce the 3D-HEVC complexity, which is based on convolutional neural network (CNN). First, we established a database based on the independent view of the depth map, which includes coding unit (CU) partition data of the depth map. Second, we constructed a depth edge classification CNN (DEC-CNN) framework to classify the edges for the depth map and embedded the network into a 3D-HEVC test platform. Finally, we utilized the pixel value of the binarized depth image to correct the above classification results. The experimental results demonstrated that our approach can reduce the intra coding time by 72.5% on average under negligible degradation of coding performance. This result outperforms the other state-of-the-art methods to reduce the coding complexity of 3D-HEVC. [ABSTRACT FROM AUTHOR]

Fault diagnosis of bearings using classification techniques plays an important role in industrial applications, and, hence, has received increasing attention. Recently, significant efforts have been made to develop various methods for bearing fault classification and the application of Case Western Reserve University (CWRU) data for validation has become a standard reference to test the fault classification algorithms. However, a systematic research for evaluating bearing fault classification performance using the CWRU data is still lacking. This paper aims to provide a comprehensive benchmark analysis of the CWRU data using various entropy and classification methods. The main contribution of this paper is applying entropy-based fault classification methods to establish a benchmark analysis of entire CWRU datasets, aiming to provide a proper assessment of any new classification methods. Recommendations are provided for the selection of the CWRU data to aid in testing new fault classification algorithms, which will enable the researches to develop and evaluate various diagnostic algorithms. In the end, the comparison results and discussion are reported as a useful baseline for future research. [ABSTRACT FROM AUTHOR]

Objective: Radar technology promises to be a touchless and thereby burden-free method for continuous heart sound monitoring, which can be used to detect cardiovascular diseases. However, the first and most crucial step is to differentiate between high- and low-quality segments in a recording to assess their suitability for a subsequent automated analysis. This paper gives a comprehensive study on this task and first addresses the specific characteristics of radar-recorded heart sound signals. Methods: To gather heart sound signals recorded from radar, a bistatic radar system was built and installed at the university hospital. Under medical supervision, heart sound data were recorded from 30 healthy test subjects. The signals were segmented and labeled as high- or low-quality by a medical expert. Different state-of-the-art pattern classification algorithms were evaluated for the task of automated signal quality determination and the most promising one was optimized and evaluated using leave-one-subject-out cross validation. Results: The proposed classifier is able to achieve an accuracy of up to 96.36% and demonstrates a superior classification performance compared with the state-of-the-art classifier with a maximum accuracy of 76.00%. Conclusion: This paper introduces an ensemble classifier that is able to perform automated signal quality determination of radar-recorded heart sound signals with a high accuracy. Significance: Besides achieving a higher performance compared with state-of-the-art classifiers, this study is the first one to deal with the quality determination of heart sounds that are recorded by radar systems. The proposed method enables contactless and continuous heart sound monitoring for the detection of cardiovascular diseases. [ABSTRACT FROM AUTHOR]

Remotely sensed images with very high spatial resolution provide a detailed representation of the surveyed scene with a geometrical resolution that, at the present, can be up to 30 cm (WorldView-3). A set of powerful image processing operators have been defined in the mathematical morphology framework. Among those, connected operators [e.g., attribute filters (AFs)] have proven their effectiveness in processing very high resolution images. AFs are based on attributes which can be efficiently implemented on tree-based image representations. In this paper, we considered the definition of \min, \max, \textdirect, and \textsubtractive filter rules for the computation of AFs over the tree-of-shapes representation. We study their performance on the classification of remotely sensed images. We compare the classification results over the tree of shapes with the results obtained when the same rules are applied on the component trees. The random forest is used as a baseline classifier, and the experiments are conducted using multispectral data sets acquired by QuickBird and IKONOS sensors over urban areas. [ABSTRACT FROM AUTHOR]

This paper describes the application of polyharmonic sinc signals in devices for metal object detection. A basic problem of conventional eddy current metal detectors (induction devices in general) lies in their limited possibilities of discrimination or identification of detected objects. To better characterize the detected object, the excitation signal and the following signal processing in the detector should be done. The application of polyharmonic excitation signal and its processing could bring an opportunity to improve the determination ability. This paper is focused on the polyharmonic sinc signal. Spheres of different diameters and from different ferrous and non-ferrous materials were used as specimens. Experimental measurements were processed in frequency-domain amplitude, and phase spectra were calculated and presented. As part of the work, classifications of ferrous and non-ferrous materials were done based on measured data as well as the classification of individual ferrous, including non-ferrous materials and estimation of the size of the classified object. Support vector classifier was primarily used for data classification. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel Bayesian classification framework of the matrix variate Bingham distributions with the inclusion of its normalizing constant and develop a consistent general parametric modeling framework based on the Grassmann manifolds. To calculate the normalizing constants of the Bingham model, this paper extends the method of saddle-point approximation (SPA) to a new setting. Furthermore, it employs the standard theory of maximum likelihood estimation (MLE) to evaluate the involved parameters in the used probability density functions. The validity and performance of the proposed approach are tested on 14 real-world visual classification databases. We have compared the classification performance of our proposed approach with the baselines from the previous related approaches. The comparison shows that on most of the databases, the performance of our approach is superior. [ABSTRACT FROM AUTHOR]

Powered prostheses are effective for helping amputees walk in a single environment, but these devices are inconvenient to use in complex environments. In order to help amputees walk in complex environments, prostheses need to understand the motion intent of amputees. Recently, researchers have found that vision sensors can be utilized to classify environments and predict the motion intent of amputees. Although previous studies have been able to classify environments accurately in offline analysis, the corresponding time delay has not been considered. To increase the accuracy and decrease the time delay of environmental classification, the present paper proposes a new decision fusion method. In this method, the sequential decisions of environmental classification are fused by constructing a hidden Markov model and designing a transition probability matrix. The developed method is evaluated by inviting five able-bodied subjects and three amputees to perform indoor and outdoor walking experiments. The results indicate that the proposed method can classify environments with accuracy improvements of 1.01% (indoor) and 2.48% (outdoor) over the previous voting method when a delay of only one frame is incorporated. The present method also achieves higher classification accuracy than with the methods of recurrent neural network (RNN), long-short term memory (LSTM), and gated recurrent unit (GRU). When achieving the same classification accuracy, the method of the present paper can decrease the time delay by 67 ms (indoor) and 733 ms (outdoor) in comparison to the previous voting method. Besides classifying environments, the proposed decision fusion method may be able to optimize the sequential predictions of the human motion intent. [ABSTRACT FROM AUTHOR]

In order to improve low voltage (LV) network visibility without extensive monitoring and integrate low carbon technologies (LCTs) in a cost-effective manner, this paper proposes a novel three-stage network load profiling method. It uses real-time information monitored from selective representative areas to develop network templates. The three stages are: clustering, classification and scaling. It can be used to identify the loading conditions of unmonitored LV systems with similar fixed data to those monitored LV substations. In the clustering stage, hierarchical clustering and K-means are used to cluster substations into groups based on the shape of the monitored load profiles. The classification tool designed with multinomial logistic regression maps an unmonitored LV substation into the most probable templates by using routinely available fixed data. Finally, clusterwise weighted constrained regression is employed to estimate peak for individual LV substations and the developed templates. The three-stage profiling is demonstrated on a practical system in the U.K. under the umbrella of a smart grid trail project. Ten LV templates are developed by using the metered data from 800 monitored LV substations. A comprehensive comparison between the estimated peaks using the three-stage process and the metered peaks suggests that the methodology can achieve superior accuracy. This is part I of the paper, introducing clustering and classification. The scaling (peak estimation) process will be introduced in part II of the paper. [ABSTRACT FROM PUBLISHER]

This paper presents the results from a one-year study of 12 patients with moderate dementia in an adult day program who played a novel whack-a-mole game-based measurement instrument for cognitive behavior and performance. The ongoing measurement of cognition and changes associated with dementia is a challenge for healthcare providers. Measurement methods based on a tablet-based instrument are proposed. Partnership with the adult day program greatly eased recruitment: all but 1 eligible participant joined our study, compared to one in five, or lower, for previous studies with similar populations. There are three unique aspects to the design of our game: first, it has two distinct targets requiring different actions, which increases the cognitive processing for the users; second, each level is systematically more difficult; third, it records and analyzes player performance. The results show that the patients’ game performance improves over the first few weeks; this indicates that they are learning the game and retaining ability gains from week-to-week, suggesting some procedural learning is still intact. Over the year, 4 participants showed cognitive decline, 4 were stable and 3 improved based on their Minimental State Exam (MMSE) score. Two measures are proposed based on level progression within the sessions and mole hit performance. The level progression measure identifies declining participants with one false negative (FN) and one false positive error. The mole hit performance measure identifies declining participants with one FN error. These results demonstrate the potential for the proposed instrument to provide an ongoing measurement as an alternative for the repeated application of the MMSE. [ABSTRACT FROM AUTHOR]

Near-infrared gray images captured along with corresponding visible color images have recently proven useful for image restoration and classification. This paper introduces a new coloring method to add colors to near-infrared gray images based on a contrast-preserving mapping model. A naive coloring method directly adds the colors from the visible color image to the near-infrared gray image. However, this method results in an unrealistic image because of the discrepancies in the brightness and image structure between the captured near-infrared gray image and the visible color image. To solve the discrepancy problem, first, we present a new contrast-preserving mapping model to create a new near-infrared gray image with a similar appearance in the luminance plane to the visible color image, while preserving the contrast and details of the captured near-infrared gray image. Then, we develop a method to derive realistic colors that can be added to the newly created near-infrared gray image based on the proposed contrast-preserving mapping model. Experimental results show that the proposed new method not only preserves the local contrast and details of the captured near-infrared gray image, but also transfers the realistic colors from the visible color image to the newly created near-infrared gray image. It is also shown that the proposed near-infrared coloring can be used effectively for noise and haze removal, as well as local contrast enhancement. [ABSTRACT FROM PUBLISHER]

Although deep networks have been shown to perform very well on a variety of medical imaging tasks, inference in the presence of pathology presents several challenges to common models. These challenges impede the integration of deep learning models into real clinical workflows, where the customary process of cascading deterministic outputs from a sequence of image-based inference steps (e.g. registration, segmentation) generally leads to an accumulation of errors that impacts the accuracy of downstream inference tasks. In this paper, we propose that by embedding uncertainty estimates across cascaded inference tasks, performance on the downstream inference tasks should be improved. We demonstrate the effectiveness of the proposed approach in three different clinical contexts: (i) We demonstrate that by propagating T2 weighted lesion segmentation results and their associated uncertainties, subsequent T2 lesion detection performance is improved when evaluated on a proprietary large-scale, multi-site, clinical trial dataset acquired from patients with Multiple Sclerosis. (ii) We show an improvement in brain tumour segmentation performance when the uncertainty map associated with a synthesised missing MR volume is provided as an additional input to a follow-up brain tumour segmentation network, when evaluated on the publicly available BraTS-2018 dataset. (iii) We show that by propagating uncertainties from a voxel-level hippocampus segmentation task, the subsequent regression of the Alzheimer’s disease clinical score is improved. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel backtrackless aligned-spatial graph convolutional network (BASGCN) model to learn effective features for graph classification. Our idea is to transform arbitrary-sized graphs into fixed-sized backtrackless aligned grid structures and define a new spatial graph convolution operation associated with the grid structures. We show that the proposed BASGCN model not only reduces the problems of information loss and imprecise information representation arising in existing spatially-based graph convolutional network (GCN) models, but also bridges the theoretical gap between traditional convolutional neural network (CNN) models and spatially-based GCN models. Furthermore, the proposed BASGCN model can both adaptively discriminate the importance between specified vertices during the convolution process and reduce the notorious tottering problem of existing spatially-based GCNs related to the Weisfeiler-Lehman algorithm, explaining the effectiveness of the proposed model. Experiments on standard graph datasets demonstrate the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

Semiconductor manufacturing is on the cusp of a revolution – the Internet of Things (IoT). With IoT we can connect all the equipment and feed information back to the factory so that quality issues can be detected. In this situation, more and more edge devices are used in wafer inspection equipment. This edge device must have the ability to quickly detect defects. Therefore, how to develop a high-efficiency architecture for automatic defect classification to be suitable for edge devices is the primary task. In this paper, we present a novel architecture that can perform defect classification in a more efficient way. The first function is self-proliferation, using a series of linear transformations to generate more feature maps at a cheaper cost. The second function is self-attention, capturing the long-range dependencies of feature map by the channel-wise and spatial-wise attention mechanism. We named this method as self-proliferation-and-attention neural network (SP&A-Net). This method has been successfully applied to various defect pattern classification tasks. Compared with other latest methods, SP&A-Net has higher accuracy and lower computation cost in many defect inspection tasks. [ABSTRACT FROM AUTHOR]

In this paper, we propose to leverage freely available unlabeled video data to facilitate few-shot video classification. In this semi-supervised few-shot video classification task, millions of unlabeled data are available for each episode during training. These videos can be extremely imbalanced, while they have profound visual and motion dynamics. To tackle the semi-supervised few-shot video classification problem, we make the following contributions. First, we propose a label independent memory (LIM) to cache label related features, which enables a similarity search over a large set of videos. LIM produces a class prototype for few-shot training. This prototype is an aggregated embedding for each class, which is more robust to noisy video features. Second, we integrate a multi-modality compound memory network to capture both RGB and flow information. We propose to store the RGB and flow representation in two separate memory networks, but they are jointly optimized via a unified loss. In this way, mutual communications between the two modalities are leveraged to achieve better classification performance. Third, we conduct extensive experiments on the few-shot Kinetics-100, Something-Something-100 datasets, which validates the effectiveness of leveraging the accessible unlabeled data for few-shot classification. [ABSTRACT FROM AUTHOR]

Identifying the patterns of defective chips in wafer bin maps (WBMs) in semiconductor manufacturing processes is crucial because different defect patterns correspond to different root causes of process failures. Recently, mixed-type defect patterns (i.e., multiple defect patterns in a single wafer) have become increasingly common owing to the increased complexity of semiconductor manufacturing processes. Previous methods for classifying mixed-type defect patterns in WBMs focused on outputting only the class labels of the defect patterns and not their locations, although location information of the defect patterns is useful for tracking the root causes of failure and improving processes. Moreover, most previous methods used only labeled WBM data, although a larger quantity of unlabeled WBM data are more accessible because of the costly process of label annotation. Therefore, in this paper, we propose a semi-supervised learning method for classifying mixed-type defect patterns and detecting their locations simultaneously using both labeled and unlabeled WBM data. The proposed method extends a recent unsupervised object detection method called Attend-Infer-Repeat in a semi-supervised manner to perform object detection and classification simultaneously. The performance of the proposed method is verified using WBM datasets of different sizes. The results demonstrate the effectiveness of the proposed method for classification and location detection. [ABSTRACT FROM AUTHOR]

In many real-world scenarios, data from multiple modalities (sources) are collected during a development phase. Such data are referred to as multiview data. While additional information from multiple views often improves the performance, collecting data from such additional views during the testing phase may not be desired due to the high costs associated with measuring such views or, unavailability of such additional views. Therefore, in many applications, despite having a multiview training data set, it is desired to do performance testing using data from only one view. In this paper, we present a multiview feature selection method that leverages the knowledge of all views and use it to guide the feature selection process in an individual view. We realize this via a multiview feature weighting scheme such that the local margins of samples in each view are maximized and similarities of samples to some reference points in different views are preserved. Also, the proposed formulation can be used for cross-view matching when the view-specific feature weights are pre-computed on an auxiliary data set. Promising results have been achieved on nine real-world data sets as well as three biometric recognition applications. On average, the proposed feature selection method has improved the classification error rate by 31 percent of the error rate of the state-of-the-art. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging (HSI) classification has become a popular research topic in recent years, and effective feature extraction is an important step before the classification task. Traditionally, spectral feature extraction techniques are applied to the HSI data cube directly. This paper presents a novel algorithm for HSI feature extraction by exploiting the curvelet-transformed domain via a relatively new spectral feature processing technique—singular spectrum analysis (SSA). Although the wavelet transform has been widely applied for HSI data analysis, the curvelet transform is employed in this paper since it is able to separate image geometric details and background noise effectively. Using the support vector machine classifier, experimental results have shown that features extracted by SSA on curvelet coefficients have better performance in terms of classification accuracy over features extracted on wavelet coefficients. Since the proposed approach mainly relies on SSA for feature extraction on the spectral dimension, it actually belongs to the spectral feature extraction category. Therefore, the proposed method has also been compared with some state-of-the-art spectral feature extraction techniques to show its efficacy. In addition, it has been proven that the proposed method is able to remove the undesirable artifacts introduced during the data acquisition process. By adding an extra spatial postprocessing step to the classified map achieved using the proposed approach, we have shown that the classification performance is comparable with several recent spectral–spatial classification methods. [ABSTRACT FROM PUBLISHER]

Linear Regression (LR) is a popular and effective technique in pattern recognition area, which aims to find a transform matrix between source data and target data (usually label matrix). However, a binary zero-one label matrix may be too strict and inappropriate for regression. Besides, directly projecting source data to target data by one transform matrix may lose some intrinsic data information. To address these issues, this paper proposes a novel Pairwise Relations oriented Discriminative Regression (PRDR) method. In PRDR, the source data is regressed into a latent space instead of label space. To supervise the discriminative projection learning, the pairwise relations in source data space and label space are exploited in the latent space simultaneously. The pairwise label relations are transferred into the latent subspace by solving a distance-distance difference minimization problem, and the intraclass instance relations are also preserved in latent space. These two constraints ensure the pairwise similarity of data points after transformation which is beneficial for classification. By further enlarging the margins between true and false classes, PRDR is extended to a robust version, i.e., R-PRDR. An efficient algorithm is presented to solve the PRDR model. Extensive experiments on several popular image datasets demonstrate the effectiveness and efficiency of the proposed method compared with some state-of-the-art regression approaches. [ABSTRACT FROM AUTHOR]

Automated detection of retinal structures, such as retinal vessels (RV), the foveal avascular zone (FAZ), and retinal vascular junctions (RVJ), are of great importance for understanding diseases of the eye and clinical decision-making. In this paper, we propose a novel Voting-based Adaptive Feature Fusion multi-task network (VAFF-Net) for joint segmentation, detection, and classification of RV, FAZ, and RVJ in optical coherence tomography angiography (OCTA). A task-specific voting gate module is proposed to adaptively extract and fuse different features for specific tasks at two levels: features at different spatial positions from a single encoder, and features from multiple encoders. In particular, since the complexity of the microvasculature in OCTA images makes simultaneous precise localization and classification of retinal vascular junctions into bifurcation/crossing a challenging task, we specifically design a task head by combining the heatmap regression and grid classification. We take advantage of three different en face angiograms from various retinal layers, rather than following existing methods that use only a single en face. We carry out extensive experiments on three OCTA datasets acquired using different imaging devices, and the results demonstrate that the proposed method performs on the whole better than either the state-of-the-art single-purpose methods or existing multi-task learning solutions. We also demonstrate that our multi-task learning method generalizes across other imaging modalities, such as color fundus photography, and may potentially be used as a general multi-task learning tool. We also construct three datasets for multiple structure detection, and part of these datasets with the source code and evaluation benchmark have been released for public access. [ABSTRACT FROM AUTHOR]

Pattern recognition based on a high-dimensional predictor is considered. A classifier is defined which is based on a Transformer encoder. The rate of convergence of the misclassification probability of the classifier towards the optimal misclassification probability is analyzed. It is shown that this classifier is able to circumvent the curse of dimensionality provided the a posteriori probability satisfies a suitable hierarchical composition model. Furthermore, the difference between the Transformer classifiers theoretically analyzed in this paper and the ones used in practice today is illustrated by means of classification problems in natural language processing. [ABSTRACT FROM AUTHOR]