#### Filter Results:

- Full text PDF available (66)

#### Publication Year

1989

2017

- This year (4)
- Last 5 years (21)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tony F. Chan, Selim Esedoglu, Mila Nikolova
- SIAM Journal of Applied Mathematics
- 2006

We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of global minimizers via standard convex minimization schemes.

- Raymond H. Chan, Chung-Wa Ho, Mila Nikolova
- IEEE Transactions on Image Processing
- 2005

This paper proposes a two-phase scheme for removing salt-and-pepper impulse noise. In the first phase, an adaptive median filter is used to identify pixels which are likely to be contaminated by noise (noise candidates). In the second phase, the image is restored using a specialized regularization method that applies only to those selected noise candidates.… (More)

- Mila Nikolova, Michael K. Ng
- SIAM J. Scientific Computing
- 2005

We address the minimization of regularized convex cost functions which are customarily used for edge-preserving restoration and reconstruction of signals and images. In order to accelerate computation, the multiplicative and the additive half-quadratic reformulation of the original cost-function have been pioneered in Geman & Reynolds (1992) and Geman &… (More)

- Mila Nikolova
- Journal of Mathematical Imaging and Vision
- 2004

We consider signal and image restoration using convex cost-functions composed of a non-smooth data-fidelity term and a smooth regularization term. We provide a convergent method to minimize such cost-functions. In order to restore data corrupted with outliers and impulsive noise, we focus on cost-functions composed of an ℓ1 data-fidelity term and an… (More)

- Jian-Feng Cai, Raymond H. Chan, Mila Nikolova
- Journal of Mathematical Imaging and Vision
- 2009

In this paper, we propose a two-phase approach to restore images corrupted by blur and impulse noise. In the first phase, we identify the outlier candidates—the pixels that are likely to be corrupted by impulse noise. We consider that the remaining data pixels are essentially free of outliers. Then in the second phase, the image is deblurred and denoised… (More)

- Mila Nikolova, Michael K. Ng, Chi-Pan Tam
- IEEE Transactions on Image Processing
- 2010

Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonconvex nonsmooth minimization. In this paper, we deal with nonconvex nonsmooth minimization methods for image restoration and… (More)

- Mila Nikolova
- Multiscale Modeling & Simulation
- 2005

We consider the restoration of discrete signals and images using least-squares with nonconvex regularization. Our goal is to find important features of the (local) minimizers of the cost function in connection with the shape of the regularization term. This question is of paramount importance for a relevant choice of regularization term. The main point of… (More)

- Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki Ching
- SIAM J. Imaging Sciences
- 2008

We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant values between neighboring regions, from noisy data obtained at the output of a linear operator (e.g., a blurring kernel or a Radon transform). Thus we also address the generic… (More)

- Mila Nikolova
- SIAM J. Numerical Analysis
- 2002

We present a theoretical study of the recovery of an unknown vector x ∈ IR (a signal, an image) from noisy data y ∈ IR by minimizing with respect to x a regularized cost-function F(x, y) = Ψ(x, y) + αΦ(x), where Ψ is a data-fidelity term, Φ is a smooth regularization term and α > 0 is a parameter. Typically, Ψ(x, y) = ‖Ax − y‖ where A is a linear operator.… (More)

- Mila Nikolova
- SIAM Journal of Applied Mathematics
- 2000