Numerical treatment of ill-posed problems

1986 ◽  
pp. 142-167 ◽  
Author(s):  
Frank Natterer
Keyword(s):  
Numerical Treatment ◽  
Ill Posed

Information and estimation in image processing

1987 ◽  
Vol 45 ◽  
pp. 14-17
Author(s):  
B. Roy Frieden
Keyword(s):  
Image Processing ◽  
Optical System ◽  
Large Amplitude ◽  
Communication Theory ◽  
Image Data ◽  
Direct Approach ◽  
Ill Posed

Despite the skill and determination of electro-optical system designers, the images acquired using their best designs often suffer from blur and noise. The aim of an “image enhancer” such as myself is to improve these poor images, usually by digital means, such that they better resemble the true, “optical object,” input to the system. This problem is notoriously “ill-posed,” i.e. any direct approach at inversion of the image data suffers strongly from the presence of even a small amount of noise in the data. In fact, the fluctuations engendered in neighboring output values tend to be strongly negative-correlated, so that the output spatially oscillates up and down, with large amplitude, about the true object. What can be done about this situation? As we shall see, various concepts taken from statistical communication theory have proven to be of real use in attacking this problem. We offer below a brief summary of these concepts.

Methods of solving ill-posed inverse problems

1983 ◽  
Vol 45 (5) ◽  
pp. 1237-1245 ◽  
Author(s):  
O. M. Alifanov
Keyword(s):  
Inverse Problems ◽  
Ill Posed

scholarly journals A Nonlinearly Ill-Posed Problem of Reconstructing the Temperature from Interior Data

2008 ◽  
Vol 29 (3-4) ◽  
pp. 445-469
Author(s):  
Pham Hoang Quan ◽  
Dang Duc Trong ◽  
Alain Pham Ngoc Dinh
Keyword(s):  
Interior Data ◽  
Ill Posed

scholarly journals Convergence Rates of First- and Higher-Order Dynamics for Solving Linear Ill-Posed Problems

2021 ◽  
Author(s):  
Radu Boţ ◽  
Guozhi Dong ◽  
Peter Elbau ◽  
Otmar Scherzer
Keyword(s):  
Linear Operator ◽  
Operator Equation ◽  
Convex Analysis ◽  
Convergence Rates ◽  
Linear Operator Equation ◽  
Optimal Convergence Rates ◽  
Ill Posed ◽  
Thresholding Algorithm ◽  
The Given ◽  
Theoretical Results

AbstractRecently, there has been a great interest in analysing dynamical flows, where the stationary limit is the minimiser of a convex energy. Particular flows of great interest have been continuous limits of Nesterov’s algorithm and the fast iterative shrinkage-thresholding algorithm, respectively. In this paper, we approach the solutions of linear ill-posed problems by dynamical flows. Because the squared norm of the residual of a linear operator equation is a convex functional, the theoretical results from convex analysis for energy minimising flows are applicable. However, in the restricted situation of this paper they can often be significantly improved. Moreover, since we show that the proposed flows for minimising the norm of the residual of a linear operator equation are optimal regularisation methods and that they provide optimal convergence rates for the regularised solutions, the given rates can be considered the benchmarks for further studies in convex analysis.

scholarly journals Leveraging Label Information in a Knowledge-Driven Approach for Rolling-Element Bearings Remaining Useful Life Prediction

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2163
Author(s):  
Tarek Berghout ◽  
Mohamed Benbouzid ◽  
Leïla-Hayet Mouss
Keyword(s):  
Transfer Learning ◽  
Short Term Memory ◽  
Remaining Useful Life ◽  
Accelerated Life Tests ◽  
Learning Path ◽  
Accelerated Life ◽  
Unseen Data ◽  
Label Information ◽  
Life Tests ◽  
Ill Posed

Since bearing deterioration patterns are difficult to collect from real, long lifetime scenarios, data-driven research has been directed towards recovering them by imposing accelerated life tests. Consequently, insufficiently recovered features due to rapid damage propagation seem more likely to lead to poorly generalized learning machines. Knowledge-driven learning comes as a solution by providing prior assumptions from transfer learning. Likewise, the absence of true labels was able to create inconsistency related problems between samples, and teacher-given label behaviors led to more ill-posed predictors. Therefore, in an attempt to overcome the incomplete, unlabeled data drawbacks, a new autoencoder has been designed as an additional source that could correlate inputs and labels by exploiting label information in a completely unsupervised learning scheme. Additionally, its stacked denoising version seems to more robustly be able to recover them for new unseen data. Due to the non-stationary and sequentially driven nature of samples, recovered representations have been fed into a transfer learning, convolutional, long–short-term memory neural network for further meaningful learning representations. The assessment procedures were benchmarked against recent methods under different training datasets. The obtained results led to more efficiency confirming the strength of the new learning path.

scholarly journals A modified Tikhonov regularization method based on Hermite expansion for solving the Cauchy problem of the Laplace equation

2020 ◽  
Vol 18 (1) ◽  
pp. 1685-1697
Author(s):  
Zhenyu Zhao ◽  
Lei You ◽  
Zehong Meng
Keyword(s):  
Cauchy Problem ◽  
Laplace Equation ◽  
Tikhonov Regularization ◽  
Regularization Method ◽  
Regularization Parameter ◽  
Solution Process ◽  
Tikhonov Regularization Method ◽  
Hermite Expansion ◽  
The Cauchy Problem ◽  
Ill Posed

Abstract In this paper, a Cauchy problem for the Laplace equation is considered. We develop a modified Tikhonov regularization method based on Hermite expansion to deal with the ill posed-ness of the problem. The regularization parameter is determined by a discrepancy principle. For various smoothness conditions, the solution process of the method is uniform and the convergence rate can be obtained self-adaptively. Numerical tests are also carried out to verify the effectiveness of the method.

Sign in / Sign up

Export Citation Format

Share Document