Search

Sea ice disasters are already one of the most serious marine disasters in the Bohai Sea region of our country, which have seriously affected the coastal economic development and residents' lives. Sea ice classification is an important part of sea ice detection. Hyperspectral imagery and multispectral imagery contain rich spectral information and spatial information and provide important data support for sea ice classification. At present, most sea ice classification methods mainly focus on shallow learning based on spectral features, and the good performance of the deep learning method in remote sensing image classification provides a new idea for sea ice classification. However, the level of deep learning is limited due to the influence of input size in sea ice image classification, and the deep features in the image cannot be fully mined, which affects the further improvement of sea ice classification accuracy. Therefore, this paper proposes an image classification method based on multilevel feature fusion using residual network. First, the PCA method is used to extract the first principal component of the original image, and the residual network is used to deepen the number of network layers. The FPN, PAN, and SPP modules increase the mining between layer and layer features and merge the features between different layers to further improve the accuracy of sea ice classification. In order to verify the effectiveness of the method in this paper, sea ice classification experiments were performed on the hyperspectral image of Bohai Bay in 2008 and the multispectral image of Bohai Bay in 2020. The experimental results show that compared with the algorithm with fewer layers of deep learning network, the method proposed in this paper utilizes the idea of residual network to deepen the number of network layers and carries out multilevel feature fusion through FPN, PAN, and SPP modules, which effectively solves the problem of insufficient deep feature extraction and obtains better classification performance. [ABSTRACT FROM AUTHOR]

In recent years, region features extracted from target detection networks have played an important role in visual question answering. The region features only extract the areas that are related to the target, but they lose a lot of nontarget context information and fine-grained details. On the contrary, the grid feature does not lose the details of nontargets but is not conducive to the recognition of the counting question of multiple small targets in the image. To solve this problem, this paper proposes a visual question answering network via joint grid-region features (JGRCAN), which consists of a feature extraction layer, co-attention layer, and fusion layer. The feature extraction layer includes extracting grid features and region features from the image and text features from the question and extracting multivisual feature representation and question feature representation through the co-attention layer to output attention weight and attention feature representation, respectively. The proposed approach effectively integrates grid features and region features, realizes the complementary advantages of region features and grid features, and is able to accurately focus on areas of the image that are relevant to the answer to the question. The results show that the overall classification accuracy of the algorithm on the test-dev and test-std subsets of VQA-v2 is 70.87% and 71.18%, respectively. Compared with baseline models, our proposed JGRCAN has good performance. [ABSTRACT FROM AUTHOR]

A variety of open relation extraction systems have been developed in the last decade. And deep learning, especially with attention model, has gained much success in the task of relation classification. Nevertheless, there is, yet, no research reported on classifying open relation tuples to our knowledge. In this paper, we propose a novel semieager learning algorithm (SemiE) to tackle the problem of open relation classification. Different from the eager learning approaches (e.g., ANNs) and the lazy learning approaches (e.g., kNN), the SemiE offers the benefits of both categories of learning scheme, with its significantly lower computational cost (O(n)). This algorithm can also be employed in other classification tasks. Additionally, this paper presents an adapted attention model to transform relation phrases into vectors by using word embedding. The experimental results on two benchmark datasets show that our method outperforms the state-of-the-art methods in the task of open relation classification. [ABSTRACT FROM AUTHOR]

Local mean decomposition (LMD) is widely used in the area of multicomponents signal processing and fault diagnosis. One of the major problems is end effects, which distort the decomposed waveform at each end of the analyzed signal and influence feature frequency. In order to solve this problem, this paper proposes a novel self-adaptive waveform point extended method based on long short-term memory (LSTM) network. First, based on existing signal points, the LSTM network parameters of right and left ends are trained; then, these parameters are used to extend the waveform point at each end-side of signal; furthermore, the corresponding parameters are adaptively updated. The proposed method is compared with the characteristic segment extension and the traditional neural network extension methods through a simulated signal to verify the effectiveness. By combing the proposed method with LMD, an improved LMD algorithm is obtained. Finally, application of rolling bearing fault signal is carried out by the improved LMD algorithm, and the results show that the feature frequencies of the rolling bearing's ball and inner and outer rings are successfully extracted. [ABSTRACT FROM AUTHOR]

In 2004, Macharis et al. proposed a consistent comparison matrix. In this study, we provide a patch work for discussing the construction and restrictions of their consistent comparison matrix. Their study is important in academia and has been cited by over 200 papers. However, in the article, the authors neither provide a detailed explanation on how to construct the proposed revised consistent comparison matrix nor mention any restriction when constructing it. In this study, we not only propose an algorithm to construct the consistent matrix, but also prove that two restrictions exist when developing a sequence of their consistent comparison matrices, which are: (a) the changing of entries should follow a decreasing order with respect to the row index and (b) there is at most one entry in each row that can be revised by experts. The results of this study will help researchers properly apply the consistent matrices proposed by Macharis et al. (2004) in the future. [ABSTRACT FROM AUTHOR]

Contour line is the main linear feature on topographic maps. Extraction of contour lines is tedious and time-consuming process, but is still an interesting problem. This paper presents a novel method for extracting contour lines from average-quality scanned topographic maps. First, it uses spatial fuzzy c-means algorithm (sFCM) to solve color aliasing and false color problems by taking into consideration both color and spatial information of topographic maps during color segmentation. In order to improve the categorizing rate, upper and lower cut-sets are introduced into sFCM. Second, to deal with the problem of thick lines, node segments are removed before gaps are repaired. Third, different methods are used to repair contour lines gaps according to the causes, which improves the break points matching accuracy. The performance of the method is tested on several topographic maps comparing with other methods, and the results show that the method can avoid misleading results caused by distortion and wrong branches at intersecting regions when using thinning algorithms and have more accurate and higher quality extraction results. [ABSTRACT FROM AUTHOR]

Distant supervision (DS) automatically annotates free text with relation mentions from existing knowledge bases (KBs), providing a way to alleviate the problem of insufficient training data for relation extraction in natural language processing (NLP). However, the heuristic annotation process does not guarantee the correctness of the generated labels, promoting a hot research issue on how to efficiently make use of the noisy training data. In this paper, we model two types of biases to reduce noise: (1) bias-dist to model the relative distance between points (instances) and classes (relation centers); (2) bias-reward to model the possibility of each heuristically generated label being incorrect. Based on the biases, we propose three noise tolerant models: MIML-dist, MIML-dist-classify, and MIML-reward, building on top of a state-of-the-art distantly supervised learning algorithm. Experimental evaluations compared with three landmark methods on the KBP dataset validate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

Real time pedestrian tracking could be one of the important features for autonomous navigation. Laser Range Finder (LRF) produces accurate pedestrian data but a problem occurs when a pedestrian is represented by multiple clusters which affect the overall tracking process. Multiple Hypothesis Tracking (MHT) is a proven method to solve tracking problem but suffers a large computational cost. In this paper, a multilevel clustering of LRF data is proposed to improve the accuracy of a tracking system by adding another clustering level after the feature extraction process. A Dynamic Track Management (DTM) is introduced in MHT with multiple motion models to perform a track creation, association, and deletion. The experimental results from real time implementation prove that the proposed multiclustering is capable of producing a better performance with less computational complexity for a track management process. The proposed Dynamic Track Management is able to solve the tracking problem with lower computation time when dealing with occlusion, crossed track, and track deletion. [ABSTRACT FROM AUTHOR]

In the field of image superresolution reconstruction (SRR), the prior can be employed to solve the ill-posed problem. However, the prior model is selected empirically and characterizes the entire image so that the local feature of image cannot be represented accurately. This paper proposes a feature-driven prior model relying on feature of the image and introduces a block-based maximum a posteriori (MAP) framework under which the image is split into several blocks to perform SRR. Therefore, the local feature of image can be characterized more accurately, which results in a better SRR. In process of recombining superresolution blocks, we still design a border-expansion strategy to remove a byproduct, namely, cross artifacts. Experimental results show that the proposed method is effective. [ABSTRACT FROM AUTHOR]

In low SNR condition, it is difficult to identify the radio transient characteristics of the signals. To solve this problem, a new recognition algorithm based on multifractal dimension characteristics is proposed. In fractal theory, multifractal dimension is the most sophisticated characterize that can describe the similar characteristics of the signals. Therefore, multifractal dimension is used in this paper to extract the subtle features of different impulse noise signals, in order to achieve the purpose of the classification and identification of the radiation source. [ABSTRACT FROM AUTHOR]

Feature space heterogeneity often exists in many real world data sets so that some features are of different importance for classification over different subsets. Moreover, the pattern of feature space heterogeneity might dynamically change over time as more and more data are accumulated. In this paper, we develop an incremental classification algorithm, Supervised Clustering for Classification with Feature Space Heterogeneity (SCCFSH), to address this problem. In our approach, supervised clustering is implemented to obtain a number of clusters such that samples in each cluster are from the same class. After the removal of outliers, relevance of features in each cluster is calculated based on their variations in this cluster. The feature relevance is incorporated into distance calculation for classification. The main advantage of SCCFSH lies in the fact that it is capable of solving a classification problem with feature space heterogeneity in an incremental way, which is favorable for online classification tasks with continuously changing data. Experimental results on a series of data sets and application to a database marketing problem show the efficiency and effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]