2012
DOI: 10.1109/tip.2012.2201492
|View full text |Cite
|
Sign up to set email alerts
|

Super Resolution Image Reconstruction Through Bregman Iteration Using Morphologic Regularization

Abstract: Multiscale morphological operators are studied extensively in the literature for image processing and feature extraction purposes. In this paper, we model a nonlinear regularization method based on multiscale morphology for edge-preserving super resolution (SR) image reconstruction. We formulate SR image reconstruction as a deblurring problem and then solve the inverse problem using Bregman iterations. The proposed algorithm can suppress inherent noise generated during low-resolution image formation as well as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 66 publications
(36 citation statements)
references
References 49 publications
0
36
0
Order By: Relevance
“…If it is nonconvex, the time consuming simulated annealing can be used [5] (1987), [6], [135], [241], [483], or else Graduated Non-Convexity [95], [293], [496] (with normalized convolution for obtaining an initial good approximation), [540], EM [113], [181], [288], [454], Genetic Algorithm [174], Markov Chain Monte Carlo using Gibbs Sampler [209], [214], [234], [241], [254], [612], Energy Minimization using Graph-Cuts [248], [279], [305], [535], Bregman Iteration [353], [590], proximal iteration [357], (Regularized) Orthogonal Matching Pursuit [390], [464], and Particle Swarm Optimization [448] might be used. [109], [118], [133], [172], [181], [184], [197], [199], [204], [216], [218], [221], [223], [226], [229], [251]…”
Section: Cost Functions and Optimization Methodsmentioning
confidence: 99%
“…If it is nonconvex, the time consuming simulated annealing can be used [5] (1987), [6], [135], [241], [483], or else Graduated Non-Convexity [95], [293], [496] (with normalized convolution for obtaining an initial good approximation), [540], EM [113], [181], [288], [454], Genetic Algorithm [174], Markov Chain Monte Carlo using Gibbs Sampler [209], [214], [234], [241], [254], [612], Energy Minimization using Graph-Cuts [248], [279], [305], [535], Bregman Iteration [353], [590], proximal iteration [357], (Regularized) Orthogonal Matching Pursuit [390], [464], and Particle Swarm Optimization [448] might be used. [109], [118], [133], [172], [181], [184], [197], [199], [204], [216], [218], [221], [223], [226], [229], [251]…”
Section: Cost Functions and Optimization Methodsmentioning
confidence: 99%
“…SR is a problem of obtaining a HR image from multiple or single LR images [10], which is an inverse problem of imaging process. In imaging process, the LR image is acquired through various imaging devices which are corrupted by noise and other degraded effect [11][12][13], and the imaging process is shown in Figure 1(a). It is worthwhile to improve the resolution of LR images in some special situations.…”
Section: Basic Framework Of Srmentioning
confidence: 99%
“…We solve (1.2) with the proposed adaptive regularization (3.1) by gradient descent technique. The non-differentiability and nonlinearity are handled by appropriate shrinkage operators [4]. The detail of optimization method is not included in this paper.…”
Section: Geodesic Distance Computationmentioning
confidence: 99%
“…These are called deblurring and super-resolution (SR) respectively and are classical inverse problems in image processing. In these inverse problems, the relation between the observed image Y and the desired sharp image X can be represented as [1][2][3][4] Y = HX + η (1.1) where Y , X and η represent lexicographically ordered column vectors of the observed image, desired sharp image and the additive noise respectively. H is blurring matrix for deblurring problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation