Local Smoothing for Scattered and Noisy Data

1985 ◽  
pp. 51-60
Author(s):  
Mira Bozzini ◽  
Licia Lenarduzzi
Keyword(s):  
Noisy Data ◽  
Local Smoothing

Haptically Guided Filtering for Reverse Engineering

2004 ◽  
Author(s):  
Kristin Potter ◽  
David Johnson ◽  
Elaine Cohen
Keyword(s):  
Reverse Engineering ◽  
Laser Scanning ◽  
Force Feedback ◽  
Noisy Data ◽  
Large Datasets ◽  
Haptic Interface ◽  
Local Smoothing ◽  
Natural Interface ◽  
Guided Filtering ◽  
Sharp Edges

Reverse engineering of mechanical systems often begins with large datasets produced from laser scanning of physical artifacts. Commonly it is necessary to remove noise and filter them; however, selecting noisy regions and preserving sharp edges on desired features is difficult using standard GUI interfaces. We demonstrate a haptic interface for marking and preserving features in noisy data and for performing local smoothing operations. The force-feedback provides a natural interface for these operations.

Noisy Data: Incorporating Variability into Your Analysis

2014 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Richard Schwartz
Keyword(s):  
Noisy Data

Effect of chamber roughness and local smoothing on performance of a CAES axial turbine

2021 ◽  
Vol 170 ◽  
pp. 500-516
Author(s):  
Xing Wang ◽  
Xuehui Zhang ◽  
Zhitao Zuo ◽  
Yangli Zhu ◽  
Wen Li ◽  
...  
Keyword(s):  
Local Smoothing ◽  
Axial Turbine

scholarly journals Principled Decision-Making Workflow with Hierarchical Bayesian Models of High-Throughput Dose-Response Measurements

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 727
Author(s):  
Eric J. Ma ◽  
Arkadij Kummer
Keyword(s):  
Decision Making ◽  
High Throughput ◽  
Noisy Data ◽  
Hierarchical Bayesian ◽  
Hierarchical Bayesian Models ◽  
Melting Temperatures ◽  
Hierarchical Bayesian Estimation ◽  
The Face ◽  
Point Data

We present a case study applying hierarchical Bayesian estimation on high-throughput protein melting-point data measured across the tree of life. We show that the model is able to impute reasonable melting temperatures even in the face of unreasonably noisy data. Additionally, we demonstrate how to use the variance in melting-temperature posterior-distribution estimates to enable principled decision-making in common high-throughput measurement tasks, and contrast the decision-making workflow against simple maximum-likelihood curve-fitting. We conclude with a discussion of the relative merits of each workflow.

scholarly journals Approximation of noisy data using multivariate splines and finite element methods

2021 ◽  
Vol 15 ◽  
pp. 174830262110084
Author(s):  
Bishnu P Lamichhane ◽  
Elizabeth Harris ◽  
Quoc Thong Le Gia
Keyword(s):  
Finite Element ◽  
Differential Operators ◽  
Impulsive Noise ◽  
Noisy Data ◽  
Multivariate Splines ◽  
The Finite Element Method ◽  
Data Smoothing ◽  
Multivariate Spline ◽  
Partial Differential Operators ◽  
Mixture Of Gaussian

We compare a recently proposed multivariate spline based on mixed partial derivatives with two other standard splines for the scattered data smoothing problem. The splines are defined as the minimiser of a penalised least squares functional. The penalties are based on partial differential operators, and are integrated using the finite element method. We compare three methods to two problems: to remove the mixture of Gaussian and impulsive noise from an image, and to recover a continuous function from a set of noisy observations.

scholarly journals Prediction of Transcription Factor Binding Sites of SP1 on Human Chromosome1

2021 ◽  
Vol 11 (11) ◽  
pp. 5123
Author(s):  
Maiada M. Mahmoud ◽  
Nahla A. Belal ◽  
Aliaa Youssif
Keyword(s):  
Transcription Factor ◽  
Binding Sites ◽  
Messenger Rna ◽  
Area Under The Curve ◽  
Noisy Data ◽  
Transcription Factor Binding Sites ◽  
Classification Problem ◽  
Transcription Factor Binding ◽  
K Nearest Neighbors ◽  
Factor Binding

Transcription factors (TFs) are proteins that control the transcription of a gene from DNA to messenger RNA (mRNA). TFs bind to a specific DNA sequence called a binding site. Transcription factor binding sites have not yet been completely identified, and this is considered to be a challenge that could be approached computationally. This challenge is considered to be a classification problem in machine learning. In this paper, the prediction of transcription factor binding sites of SP1 on human chromosome1 is presented using different classification techniques, and a model using voting is proposed. The highest Area Under the Curve (AUC) achieved is 0.97 using K-Nearest Neighbors (KNN), and 0.95 using the proposed voting technique. However, the proposed voting technique is more efficient with noisy data. This study highlights the applicability of the voting technique for the prediction of binding sites, and highlights the outperformance of KNN on this type of data. The study also highlights the significance of using voting.

scholarly journals Low-complexity learning of Linear Quadratic Regulators from noisy data

Automatica ◽  
2021 ◽  
Vol 128 ◽  
pp. 109548
Author(s):  
Claudio De Persis ◽  
Pietro Tesi
Keyword(s):  
Noisy Data ◽  
Low Complexity ◽  
Linear Quadratic ◽  
Linear Quadratic Regulators

scholarly journals An Application of the Associate Hopfield Network for Pattern Matching in Chart Analysis

2021 ◽  
Vol 11 (9) ◽  
pp. 3876
Author(s):  
Weiming Mai ◽  
Raymond S. T. Lee
Keyword(s):  
Time Series ◽  
Pattern Matching ◽  
Time Series Data ◽  
Financial Time Series ◽  
Noisy Data ◽  
Hopfield Neural Network ◽  
Hopfield Network ◽  
Series Data ◽  
Financial Time ◽  
Chart Patterns

Chart patterns are significant for financial market behavior analysis. Lots of approaches have been proposed to detect specific patterns in financial time series data, most of them can be categorized as distance-based or training-based. In this paper, we applied a trainable continuous Hopfield Neural Network for financial time series pattern matching. The Perceptually Important Points (PIP) segmentation method is used as the data preprocessing procedure to reduce the fluctuation. We conducted a synthetic data experiment on both high-level noisy data and low-level noisy data. The result shows that our proposed method outperforms the Template Based (TB) and Euclidean Distance (ED) and has an advantage over Dynamic Time Warping (DTW) in terms of the processing time. That indicates the Hopfield network has a potential advantage over other distance-based matching methods.

scholarly journals Machine learning modeling and predictive control of nonlinear processes using noisy data

AIChE Journal ◽  
2021 ◽  
Author(s):  
Zhe Wu ◽  
David Rincon ◽  
Junwei Luo ◽  
Panagiotis D. Christofides
Keyword(s):  
Machine Learning ◽  
Predictive Control ◽  
Noisy Data ◽  
Nonlinear Processes
Sign in / Sign up

Export Citation Format

Share Document