scholarly journals A Generalized Framework for Edge-Preserving and Structure-Preserving Image Smoothing

2020 ◽  
Vol 34 (07) ◽  
pp. 11620-11628
Author(s):  
Wei Liu ◽  
Pingping Zhang ◽  
Yinjie Lei ◽  
Xiaolin Huang ◽  
Jie Yang ◽  
...  
Keyword(s):  
Penalty Function ◽  
State Of The Art ◽  
Superior Performance ◽  
Image Smoothing ◽  
Edge Preserving ◽  
Structure Preserving ◽  
Smoothing Operator ◽  
Optimization Framework ◽  
Generalized Framework ◽  
Smooth Optimization

Image smoothing is a fundamental procedure in applications of both computer vision and graphics. The required smoothing properties can be different or even contradictive among different tasks. Nevertheless, the inherent smoothing nature of one smoothing operator is usually fixed and thus cannot meet the various requirements of different applications. In this paper, a non-convex non-smooth optimization framework is proposed to achieve diverse smoothing natures where even contradictive smoothing behaviors can be achieved. To this end, we first introduce the truncated Huber penalty function which has seldom been used in image smoothing. A robust framework is then proposed. When combined with the strong flexibility of the truncated Huber penalty function, our framework is capable of a range of applications and can outperform the state-of-the-art approaches in several tasks. In addition, an efficient numerical solution is provided and its convergence is theoretically guaranteed even the optimization framework is non-convex and non-smooth. The effectiveness and superior performance of our approach are validated through comprehensive experimental results in a range of applications.

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 Near-Optimal A-B Testing

2020 ◽  
Vol 66 (10) ◽  
pp. 4477-4495
Author(s):  
Nikhil Bhat ◽  
Vivek F. Farias ◽  
Ciamac C. Moallemi ◽  
Deeksha Sinha
Keyword(s):  
Selection Bias ◽  
Dynamic Optimization ◽  
State Of The Art ◽  
Stopping Times ◽  
Elliptical Distribution ◽  
Statistical Efficiency ◽  
Optimization Framework ◽  
Online Setting ◽  
Operational Constraints ◽  
The Impact

We consider the problem of A-B testing when the impact of the treatment is marred by a large number of covariates. Randomization can be highly inefficient in such settings, and thus we consider the problem of optimally allocating test subjects to either treatment with a view to maximizing the precision of our estimate of the treatment effect. Our main contribution is a tractable algorithm for this problem in the online setting, where subjects arrive, and must be assigned, sequentially, with covariates drawn from an elliptical distribution with finite second moment. We further characterize the gain in precision afforded by optimized allocations relative to randomized allocations, and show that this gain grows large as the number of covariates grows. Our dynamic optimization framework admits several generalizations that incorporate important operational constraints such as the consideration of selection bias, budgets on allocations, and endogenous stopping times. In a set of numerical experiments, we demonstrate that our method simultaneously offers better statistical efficiency and less selection bias than state-of-the-art competing biased coin designs. This paper was accepted by Noah Gans, stochastic models and simulation.

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.

Sign in / Sign up

Export Citation Format

Share Document