2016
DOI: 10.1142/s0219691316500247
|View full text |Cite
|
Sign up to set email alerts
|

Efficient image fusion with approximate sparse representation

Abstract: In this paper, an efficient approximate sparse representation (SR) algorithm with multi-selection strategy is used to solve the image fusion problem. We have shown that the approximate SR is effective for image fusion even if the sparse coefficients are not the sparsest ones possible. A multi-selection strategy is used to accelerate the process of generating the approximate sparse coefficients which are used to guide the fusion of image patches. The relative parameters are also investigated experimentally to f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
16
0
1

Year Published

2019
2019
2025
2025

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(17 citation statements)
references
References 20 publications
0
16
0
1
Order By: Relevance
“…Traditional image fusion methods employed discrete cosine transform (DCT) [18], sparse representation (SR) [19], [8], principal component analysis (PCA) [20], etc. to extract useful features.…”
Section: A Image Fusionmentioning
confidence: 99%
See 1 more Smart Citation
“…Traditional image fusion methods employed discrete cosine transform (DCT) [18], sparse representation (SR) [19], [8], principal component analysis (PCA) [20], etc. to extract useful features.…”
Section: A Image Fusionmentioning
confidence: 99%
“…Traditional methods for image fusion include sparse representation (SR) based methods [8], [9]; multi-scale transformation based methods [10], [11]; saliency-based methods Vibashan VS, Jeya Maria Jose Valanarasu, Poojan Oza, Vishal M. Patel are with Department of Electrical and Computer Engineering in Johns Hopkins University, Baltimore, MD 21218, USA. (e-mail: {vvishnu2, jvalana1, poza2, vpatel36}@jhu.edu).…”
Section: Introductionmentioning
confidence: 99%
“…In fact, images contain different details feature richness under different exposure conditions. 15 Thus image details factor C k ðx; yÞ was selected as another key factor of image fusion. Because the Laplacian has rotation invariance, Laplace filter L is selected to extract the detailed features of I gray k ðx; yÞ, and the detail image D k ðx; yÞ of I gray k ðx; yÞ are obtained.…”
Section: Selection Of Image Fusion Weightsmentioning
confidence: 99%
“…In the representation learning domain. The most methods are based on sparse representation such as sparse representation (SR) and gradient histogram (HOG) [7], joint sparse representation (JSR) [8], approximate sparse representation with multi-selection strategy [9], etc.…”
Section: Introductionmentioning
confidence: 99%