scholarly journals A new HSI denoising method via interpolated block matching 3D and guided filter

PeerJ ◽  
2021 ◽  
Vol 9 ◽  
pp. e11642
Author(s):  
Ping Xu ◽  
Bingqiang Chen ◽  
Jingcheng Zhang ◽  
Lingyun Xue ◽  
Lei Zhu
Keyword(s):  
State Of The Art ◽  
Correlation Coefficients ◽  
Block Matching ◽  
Superior Performance ◽  
Spectral Correlation ◽  
Denoising Method ◽  
Guided Filtering ◽  
Noise Assessment ◽  
Inverse Interpolation ◽  
Guided Image Filtering

A new hyperspectral images (HSIs) denoising method via Interpolated Block-Matching and 3D filtering and Guided Filtering (IBM3DGF) denoising method is proposed. First, inter-spectral correlation analysis is used to obtain inter-spectral correlation coefficients and divide the HSIs into several adjacent groups. Second, high-resolution HSIs are produced by using adjacent three images to interpolate. Third, Block-Matching and 3D filtering (BM3D) is conducted to reduce the noise level of each group; Fourth, the guided image filtering is utilized to denoise HSI of each group. Finally, the inverse interpolation is applied to retrieve HSI. Experimental results of synthetic and real HSIs showed that, comparing with other state-of-the-art denoising methods, the proposed IBM3DGF method shows superior performance according to spatial and spectral domain noise assessment. Therefore, the proposed method has a potential to effectively remove the spatial/spectral noise for HSIs.

Pre-Processing of Hyperspectral Images Using Nonlinear Filters

2013 ◽  
Vol 11 (1) ◽  
pp. 8-13
Author(s):  
V. Behar ◽  
V. Bogdanova
Keyword(s):  
Signal To Noise Ratio ◽  
Correlation Coefficients ◽  
Hyperspectral Images ◽  
Spectral Correlation ◽  
Edge Preserving ◽  
Improvement Factor ◽  
Filter Output ◽  
Average Improvement ◽  
Processing Procedure

Abstract In this paper the use of a set of nonlinear edge-preserving filters is proposed as a pre-processing stage with the purpose to improve the quality of hyperspectral images before object detection. The capability of each nonlinear filter to improve images, corrupted by spatially and spectrally correlated Gaussian noise, is evaluated in terms of the average Improvement factor in the Peak Signal to Noise Ratio (IPSNR), estimated at the filter output. The simulation results demonstrate that this pre-processing procedure is efficient only in case the spatial and spectral correlation coefficients of noise do not exceed the value of 0.6

Enhanced context-aware recommendation using topic modeling and particle swarm optimization

2021 ◽  
pp. 1-16
Author(s):  
Ibtissem Gasmi ◽  
Mohamed Walid Azizi ◽  
Hassina Seridi-Bouchelaghem ◽  
Nabiha Azizi ◽  
Samir Brahim Belhaouari
Keyword(s):  
Topic Modeling ◽  
Latent Dirichlet Allocation ◽  
State Of The Art ◽  
Weighting Function ◽  
Contextual Factors ◽  
Pearson Correlation ◽  
Correlation Coefficients ◽  
Pso Algorithm ◽  
Context Aware ◽  
Proposed Model

Context-Aware Recommender System (CARS) suggests more relevant services by adapting them to the user’s specific context situation. Nevertheless, the use of many contextual factors can increase data sparsity while few context parameters fail to introduce the contextual effects in recommendations. Moreover, several CARSs are based on similarity algorithms, such as cosine and Pearson correlation coefficients. These methods are not very effective in the sparse datasets. This paper presents a context-aware model to integrate contextual factors into prediction process when there are insufficient co-rated items. The proposed algorithm uses Latent Dirichlet Allocation (LDA) to learn the latent interests of users from the textual descriptions of items. Then, it integrates both the explicit contextual factors and their degree of importance in the prediction process by introducing a weighting function. Indeed, the PSO algorithm is employed to learn and optimize weights of these features. The results on the Movielens 1 M dataset show that the proposed model can achieve an F-measure of 45.51% with precision as 68.64%. Furthermore, the enhancement in MAE and RMSE can respectively reach 41.63% and 39.69% compared with the state-of-the-art techniques.

scholarly journals Utilization of Eco-Friendly Waste Generated Nanomaterials in Water-Based Drilling Fluids; State of the Art Review

Materials ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4171
Author(s):  
Rabia Ikram ◽  
Badrul Mohamed Jan ◽  
Akhmal Sidek ◽  
George Kenanakis
Keyword(s):  
State Of The Art ◽  
Superior Performance ◽  
Future Research ◽  
Drilling Fluids ◽  
Drill Cuttings ◽  
Environmental Friendly ◽  
Water Based ◽  
Drilling Operations ◽  
Filtration Properties

An important aspect of hydrocarbon drilling is the usage of drilling fluids, which remove drill cuttings and stabilize the wellbore to provide better filtration. To stabilize these properties, several additives are used in drilling fluids that provide satisfactory rheological and filtration properties. However, commonly used additives are environmentally hazardous; when drilling fluids are disposed after drilling operations, they are discarded with the drill cuttings and additives into water sources and causes unwanted pollution. Therefore, these additives should be substituted with additives that are environmental friendly and provide superior performance. In this regard, biodegradable additives are required for future research. This review investigates the role of various bio-wastes as potential additives to be used in water-based drilling fluids. Furthermore, utilization of these waste-derived nanomaterials is summarized for rheology and lubricity tests. Finally, sufficient rheological and filtration examinations were carried out on water-based drilling fluids to evaluate the effect of wastes as additives on the performance of drilling fluids.

scholarly journals Active Learning in the Geometric Block Model

2020 ◽  
Vol 34 (04) ◽  
pp. 3641-3648 ◽  
Author(s):  
Eli Chien ◽  
Antonia Tulino ◽  
Jaime Llorca
Keyword(s):  
Active Learning ◽  
Community Detection ◽  
Random Graphs ◽  
State Of The Art ◽  
Superior Performance ◽  
Model Parameters ◽  
Block Model ◽  
Stochastic Block Model ◽  
Synthetic Datasets ◽  
Community Detection Problems

The geometric block model is a recently proposed generative model for random graphs that is able to capture the inherent geometric properties of many community detection problems, providing more accurate characterizations of practical community structures compared with the popular stochastic block model. Galhotra et al. recently proposed a motif-counting algorithm for unsupervised community detection in the geometric block model that is proved to be near-optimal. They also characterized the regimes of the model parameters for which the proposed algorithm can achieve exact recovery. In this work, we initiate the study of active learning in the geometric block model. That is, we are interested in the problem of exactly recovering the community structure of random graphs following the geometric block model under arbitrary model parameters, by possibly querying the labels of a limited number of chosen nodes. We propose two active learning algorithms that combine the use of motif-counting with two different label query policies. Our main contribution is to show that sampling the labels of a vanishingly small fraction of nodes (sub-linear in the total number of nodes) is sufficient to achieve exact recovery in the regimes under which the state-of-the-art unsupervised method fails. We validate the superior performance of our algorithms via numerical simulations on both real and synthetic datasets.

WTRPNet: An Explainable Graph Feature Convolutional Neural Network for Epileptic EEG Classification

2021 ◽  
Vol 17 (3s) ◽  
pp. 1-18
Author(s):  
Qi Xin ◽  
Shaohao Hu ◽  
Shuaiqi Liu ◽  
Ling Zhao ◽  
Shuihua Wang
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
State Of The Art ◽  
Traumatic Injury ◽  
Recurrence Plot ◽  
Superior Performance ◽  
Eeg Classification ◽  
Epilepsy Diagnosis ◽  
Electroencephalogram Eeg

As one of the important tools of epilepsy diagnosis, the electroencephalogram (EEG) is noninvasive and presents no traumatic injury to patients. It contains a lot of physiological and pathological information that is easy to obtain. The automatic classification of epileptic EEG is important in the diagnosis and therapeutic efficacy of epileptics. In this article, an explainable graph feature convolutional neural network named WTRPNet is proposed for epileptic EEG classification. Since WTRPNet is constructed by a recurrence plot in the wavelet domain, it can fully obtain the graph feature of the EEG signal, which is established by an explainable graph features extracted layer called WTRP block . The proposed method shows superior performance over state-of-the-art methods. Experimental results show that our algorithm has achieved an accuracy of 99.67% in classification of focal and nonfocal epileptic EEG, which proves the effectiveness of the classification and detection of epileptic EEG.

scholarly journals DeepTable: a permutation invariant neural network for table orientation classification

2020 ◽  
Vol 34 (6) ◽  
pp. 1963-1983
Author(s):  
Maryam Habibi ◽  
Johannes Starlinger ◽  
Ulf Leser
Keyword(s):  
Deep Neural Networks ◽  
State Of The Art ◽  
Superior Performance ◽  
Web Pages ◽  
Specific Information ◽  
Silver Standard ◽  
Present Information ◽  
Previous State ◽  
Novel Method

Abstract Tables are a common way to present information in an intuitive and concise manner. They are used extensively in media such as scientific articles or web pages. Automatically analyzing the content of tables bears special challenges. One of the most basic tasks is determination of the orientation of a table: In column tables, columns represent one entity with the different attribute values present in the different rows; row tables are vice versa, and matrix tables give information on pairs of entities. In this paper, we address the problem of classifying a given table into one of the three layouts horizontal (for row tables), vertical (for column tables), and matrix. We describe DeepTable, a novel method based on deep neural networks designed for learning from sets. Contrary to previous state-of-the-art methods, this basis makes DeepTable invariant to the permutation of rows or columns, which is a highly desirable property as in most tables the order of rows and columns does not carry specific information. We evaluate our method using a silver standard corpus of 5500 tables extracted from biomedical articles where the layout was determined heuristically. DeepTable outperforms previous methods in both precision and recall on our corpus. In a second evaluation, we manually labeled a corpus of 300 tables and were able to confirm DeepTable to reach superior performance in the table layout classification task. The codes and resources introduced here are available at https://github.com/Marhabibi/DeepTable.

scholarly journals Linear Support Vector Machines for Prediction of Student Performance in School-Based Education

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Nalindren Naicker ◽  
Timothy Adeliyi ◽  
Jeanette Wing
Keyword(s):  
Machine Learning ◽  
Support Vector Machines ◽  
Student Performance ◽  
State Of The Art ◽  
Learning Algorithms ◽  
The State ◽  
Machine Learning Algorithms ◽  
Superior Performance ◽  
Support Vector ◽  
Vector Machines

Educational Data Mining (EDM) is a rich research field in computer science. Tools and techniques in EDM are useful to predict student performance which gives practitioners useful insights to develop appropriate intervention strategies to improve pass rates and increase retention. The performance of the state-of-the-art machine learning classifiers is very much dependent on the task at hand. Investigating support vector machines has been used extensively in classification problems; however, the extant of literature shows a gap in the application of linear support vector machines as a predictor of student performance. The aim of this study was to compare the performance of linear support vector machines with the performance of the state-of-the-art classical machine learning algorithms in order to determine the algorithm that would improve prediction of student performance. In this quantitative study, an experimental research design was used. Experiments were set up using feature selection on a publicly available dataset of 1000 alpha-numeric student records. Linear support vector machines benchmarked with ten categorical machine learning algorithms showed superior performance in predicting student performance. The results of this research showed that features like race, gender, and lunch influence performance in mathematics whilst access to lunch was the primary factor which influences reading and writing performance.

scholarly journals Robust place recognition based on salient landmarks screening and convolutional neural network features

2020 ◽  
Vol 17 (6) ◽  
pp. 172988142096696
Author(s):  
Jie Niu ◽  
Kun Qian
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
State Of The Art ◽  
Environmental Modeling ◽  
Superior Performance ◽  
Similarity Measurement ◽  
Natural Environments ◽  
Place Recognition ◽  
Average Precision ◽  
Specific Object

In this work, we propose a robust place recognition measurement in natural environments based on salient landmark screening and convolutional neural network (CNN) features. First, the salient objects in the image are segmented as candidate landmarks. Then, a category screening network is designed to remove specific object types that are not suitable for environmental modeling. Finally, a three-layer CNN is used to get highly representative features of the salient landmarks. In the similarity measurement, a Siamese network is chosen to calculate the similarity between images. Experiments were conducted on three challenging benchmark place recognition datasets and superior performance was achieved compared to other state-of-the-art methods, including FABMAP, SeqSLAM, SeqCNNSLAM, and PlaceCNN. Our method obtains the best results on the precision–recall curves, and the average precision reaches 78.43%, which is the best of the comparison methods. This demonstrates that the CNN features on the screened salient landmarks can be against a strong viewpoint and condition variations.

scholarly journals CharTeC-Net: An Efficient and Lightweight Character-Based Convolutional Network for Text Classification

2020 ◽  
Vol 2020 ◽  
pp. 1-7 ◽  
Author(s):  
Aboubakar Nasser Samatin Njikam ◽  
Huan Zhao
Keyword(s):  
Text Classification ◽  
Building Block ◽  
Large Scale ◽  
State Of The Art ◽  
Building Blocks ◽  
Training Data ◽  
Superior Performance ◽  
Classification Problems ◽  
Computationally Efficient ◽  
Convolutional Network

This paper introduces an extremely lightweight (with just over around two hundred thousand parameters) and computationally efficient CNN architecture, named CharTeC-Net (Character-based Text Classification Network), for character-based text classification problems. This new architecture is composed of four building blocks for feature extraction. Each of these building blocks, except the last one, uses 1 × 1 pointwise convolutional layers to add more nonlinearity to the network and to increase the dimensions within each building block. In addition, shortcut connections are used in each building block to facilitate the flow of gradients over the network, but more importantly to ensure that the original signal present in the training data is shared across each building block. Experiments on eight standard large-scale text classification and sentiment analysis datasets demonstrate CharTeC-Net’s superior performance over baseline methods and yields competitive accuracy compared with state-of-the-art methods, although CharTeC-Net has only between 181,427 and 225,323 parameters and weighs less than 1 megabyte.

Robust and discriminative dictionary learning for face recognition

2018 ◽  
Vol 16 (02) ◽  
pp. 1840004 ◽  
Author(s):  
Guojun Lin ◽  
Meng Yang ◽  
Linlin Shen ◽  
Mingzhong Yang ◽  
Mei Xie
Keyword(s):  
Face Recognition ◽  
Facial Expressions ◽  
Dictionary Learning ◽  
State Of The Art ◽  
Face Image ◽  
Superior Performance ◽  
Face Images ◽  
Proposed Model ◽  
Classification Capability ◽  
Discriminative Dictionary Learning

For face recognition, conventional dictionary learning (DL) methods have some disadvantages. First, face images of the same person vary with facial expressions and pose, illumination and disguises, so it is hard to obtain a robust dictionary for face recognition. Second, they don’t cover important components (e.g., particularity and disturbance) completely, which limit their performance. In the paper, we propose a novel robust and discriminative DL (RDDL) model. The proposed model uses sample diversities of the same face image to learn a robust dictionary, which includes class-specific dictionary atoms and disturbance dictionary atoms. These atoms can well represent the data from different classes. Discriminative regularizations on the dictionary and the representation coefficients are used to exploit discriminative information, which improves effectively the classification capability of the dictionary. The proposed RDDL is extensively evaluated on benchmark face image databases, and it shows superior performance to many state-of-the-art dictionary learning methods for face recognition.

Sign in / Sign up

Export Citation Format

Share Document