2010
DOI: 10.2298/sjee1001081k
|View full text |Cite
|
Sign up to set email alerts
|

Optimal decomposition level of discrete, stationary and dual tree complex wavelet transform for pixel based fusion of multi-focused images

Abstract: The fast development of digital image processing leads to the growth of feature extraction of images which leads to the development of Image fusion. The process of combining two different images into a new single image by retaining salient features from each image with extended information content is known as Image fusion. Two approaches to image fusion are Spatial Fusion and Transform fusion. Discrete Wavelet Transform plays a vital role in image fusion since it minimizes structural distortions among the vari… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(13 citation statements)
references
References 2 publications
0
13
0
Order By: Relevance
“…In the second method, existing compression algorithms are implemented by a single neural network just by tweaking the network learning algorithm to suit the intended task. For instance, wavelet neural networks [15] are designed to decompose the signal in hand into the optimized linear combination of weighted daughters of a mother wavelet using multilayer CNN. In this case, the activation value is the daughter wavelet while the related weights would be the optimized coefficient value.…”
Section: General Image Compression Algorithmsmentioning
confidence: 99%
“…In the second method, existing compression algorithms are implemented by a single neural network just by tweaking the network learning algorithm to suit the intended task. For instance, wavelet neural networks [15] are designed to decompose the signal in hand into the optimized linear combination of weighted daughters of a mother wavelet using multilayer CNN. In this case, the activation value is the daughter wavelet while the related weights would be the optimized coefficient value.…”
Section: General Image Compression Algorithmsmentioning
confidence: 99%
“…In the similarindexed part s(n) is improved by a normalization parameter Ke to produce the wavelet subband XL1 . In addition, in the odd-indicator part the fault signal d(n) is enhance by K0 to obtain the wavelet subband XH1 [14].…”
Section: ) Splittingmentioning
confidence: 99%
“…And it contain three lists: LIS list of insignificant sets ( LIS), list of insignificant pixels( LIP) and list of significant pixels (LSP). All nodes of the lowest frequency sub band are initialized in LIP stage [14]. In LIP each pixel is compared with the current threshold and a bit (0 or 1) is generated to indicate wich pixel it is significant or not [11].…”
Section: Spiht Coding Schemementioning
confidence: 99%
“…The root mean square error (RMSE) between the original image and compressed image is given by [10], RMSE = (5)…”
Section: Root Mean Square Error (Rmse)mentioning
confidence: 99%