The Feature-Binding Question Is An Ill-Posed Question

2011 ◽  
Author(s):  
Vincent Di Lollo
Keyword(s):  
Feature Binding ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document