scholarly journals Fusion of IR and Visual Images Based on Gaussian and Laplacian Decomposition Using Histogram Distributions and Edge Selection

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Seohyung Lee ◽  
Daeho Lee
Keyword(s):  
High Frequency ◽  
Low Frequency ◽  
Experimental Results ◽  
Visual Images ◽  
Fusion Method ◽  
Large Magnitude ◽  
Frequency Information ◽  
Frequency Components

We propose a novel fusion method of IR (infrared) and visual images to combine distinct information from two sources. To decompose an image into its low and high frequency components, we use Gaussian and Laplacian decomposition. The strong high frequency information in the two sources can be easily fused by selecting the large magnitude of Laplacian images. The distinct low frequency information, however, is not as easily determined. As such, we use histogram distributions of the two sources. Therefore, experimental results show that the fused images can contain the dominant characteristics of both sources.

scholarly journals Multi-Focus Image Fusion Method Based on Multi-Scale Decomposition of Information Complementary

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1362
Author(s):  
Hui Wan ◽  
Xianlun Tang ◽  
Zhiqin Zhu ◽  
Weisheng Li
Keyword(s):  
Image Fusion ◽  
High Frequency ◽  
Low Frequency ◽  
Fusion Method ◽  
Complementary Information ◽  
Multi Scale ◽  
Initial Decision ◽  
Focus Image ◽  
Frequency Components ◽  
Image Fusion Method

Multi-focus image fusion is an important method used to combine the focused parts from source multi-focus images into a single full-focus image. Currently, to address the problem of multi-focus image fusion, the key is on how to accurately detect the focus regions, especially when the source images captured by cameras produce anisotropic blur and unregistration. This paper proposes a new multi-focus image fusion method based on the multi-scale decomposition of complementary information. Firstly, this method uses two groups of large-scale and small-scale decomposition schemes that are structurally complementary, to perform two-scale double-layer singular value decomposition of the image separately and obtain low-frequency and high-frequency components. Then, the low-frequency components are fused by a rule that integrates image local energy with edge energy. The high-frequency components are fused by the parameter-adaptive pulse-coupled neural network model (PA-PCNN), and according to the feature information contained in each decomposition layer of the high-frequency components, different detailed features are selected as the external stimulus input of the PA-PCNN. Finally, according to the two-scale decomposition of the source image that is structure complementary, and the fusion of high and low frequency components, two initial decision maps with complementary information are obtained. By refining the initial decision graph, the final fusion decision map is obtained to complete the image fusion. In addition, the proposed method is compared with 10 state-of-the-art approaches to verify its effectiveness. The experimental results show that the proposed method can more accurately distinguish the focused and non-focused areas in the case of image pre-registration and unregistration, and the subjective and objective evaluation indicators are slightly better than those of the existing methods.

Speed of Processing and Stimulus Complexity in Low-Frequency and High-Frequency Channels

Perception ◽  
1997 ◽  
Vol 26 (8) ◽  
pp. 1039-1045 ◽  
Author(s):  
Rainer Hoeger
Keyword(s):  
High Frequency ◽  
Target Identification ◽  
Low Frequency ◽  
Object Perception ◽  
Stimulus Complexity ◽  
Frequency Information ◽  
Intensity Changes ◽  
Low Pass ◽  
Frequency Components ◽  
High Level

Studies of the microgenesis of perception led to the hypothesis that global aspects of objects are processed faster than their details. If one starts with the assumption that low-frequency information of objects corresponds to the global, and high-frequency information to the local aspects, recognising objects should rely at first on information from the low-frequency channels and afterwards from that of the high-frequency channels. The priming paradigm provides a mean of investigating experimentally the temporal availability of low-frequency and high-frequency information in object perception. In the experiments subjects had to respond to target objects preceded either by related or by unrelated priming stimuli, which consisted of low-pass-filtered and high-pass-filtered versions of the objects. With the influence of stimulus complexity controlled, pictures of objects were chosen that varied in the number of intensity changes in the high-frequency components, with those of the low-frequency components kept constant. The exposure duration of each prime was varied between 40 and 100 ms. The results indicated that target identification only profits more from low-frequency than from high-frequency primes if the high-frequency information has a high level of complexity. If the number of intensity changes in the high-frequency components of the prime is low, target identification is most strongly facilitated. The results are discussed in terms of models which focus on organising principles at different scales.

scholarly journals Image Fusion of CT and MR with Sparse Representation in NSST Domain

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Chenhui Qiu ◽  
Yuanyuan Wang ◽  
Huan Zhang ◽  
Shunren Xia
Keyword(s):  
Image Fusion ◽  
Sparse Representation ◽  
High Frequency ◽  
Low Frequency ◽  
Interventional Treatment ◽  
Absolute Maximum ◽  
Fusion Method ◽  
Group Sparsity ◽  
Mr Images ◽  
Frequency Components

Multimodal image fusion techniques can integrate the information from different medical images to get an informative image that is more suitable for joint diagnosis, preoperative planning, intraoperative guidance, and interventional treatment. Fusing images of CT and different MR modalities are studied in this paper. Firstly, the CT and MR images are both transformed to nonsubsampled shearlet transform (NSST) domain. So the low-frequency components and high-frequency components are obtained. Then the high-frequency components are merged using the absolute-maximum rule, while the low-frequency components are merged by a sparse representation- (SR-) based approach. And the dynamic group sparsity recovery (DGSR) algorithm is proposed to improve the performance of the SR-based approach. Finally, the fused image is obtained by performing the inverse NSST on the merged components. The proposed fusion method is tested on a number of clinical CT and MR images and compared with several popular image fusion methods. The experimental results demonstrate that the proposed fusion method can provide better fusion results in terms of subjective quality and objective evaluation.

scholarly journals Image Fusion of Infrared Weak-Small Target Based on Wavelet Transform and Feature Extraction

2020 ◽  
Vol 38 (4) ◽  
pp. 723-732
Author(s):  
Xiaozhu Wang ◽  
Saisai Niu ◽  
Kai Zhang ◽  
Jianfei Yin ◽  
Jie Yan
Keyword(s):  
Feature Extraction ◽  
Wavelet Transform ◽  
High Frequency ◽  
Low Frequency ◽  
Fusion Method ◽  
Small Target ◽  
Signal To Noise ◽  
Frequency Information ◽  
Background Interference ◽  
Long Wave

The image details and contour information cannot be fully reflected for the current infrared single-band data. It is difficult for the weak-small target to resist background interference after imaging, so that the image produces a low ratio of signal-to-noise. Therefore, it is necessary to use the texture difference of different band data to improve the signal-to-noise ratio of the image by using the complementary fusion method. Based on the above-mentioned, a fusion method based on wavelet transform and feature extraction is proposed. Firstly, the source images are multi-scale and two-dimensionally decomposed to obtain low-frequency information and high-frequency information. And that, the high-frequency information adopt the method of maximizing the absolute value, the low-frequency information adopt the method of weighted averaging, and reconstruct the image. Then, the infrared feature extraction method is used to obtain the medium wave and long wave feature images. Finally, the reconstructed image is contrast-modulated and refused with the medium-long wave infrared feature image. The fusion results are compared with a variety of fusion algorithms. The experimental results show that the algorithm can enhance the gray scale of weak-small targets in the image, which can identify the target well and solve the problem of weak target against background interference in infrared images.

scholarly journals A Novel Approach for Transmission Line Protection Using Wavelet Transform and Neural Network

2011 ◽  
pp. 121-126
Author(s):  
Mrunalini M. Rao ◽  
P.M. Deoghare
Keyword(s):  
Neural Network ◽  
Wavelet Transform ◽  
Transmission Line ◽  
High Frequency ◽  
Low Frequency ◽  
Line Length ◽  
Frequency Information ◽  
Protection Scheme ◽  
Frequency Components ◽  
Transmission Line Protection

The two most important expected objectives of the transmission line protection are – 1) Differentiating the internal faults from external faults and 2) identifying exactly the fault type using one end data only. In conventional distance protection scheme only 80 percent of line length gets primary protection while for remaining 20 percent of line length a time delay is provided to avoid maloperation due to overreach in case of D.C. offset. In this new scheme a fault generated transients based protection method is introduced by which the whole line length gets primary protection by using the concept of bus capacitance. This scheme implements improved solution based on wavelet transform and self-organized neural network. The measured current and voltage signals are preprocessed first and then decomposed using wavelet multiresolution analysis to obtain the high frequency and low frequency information. The training patterns are formed based on high frequency signal components and the low frequency components of all three phase voltages and current. Zero sequence voltage and current are also used to identify faults involving grounds. The input sets formed based on the high frequency components are arranged as inputs of neural network-1, whose task is to indicate whether the fault is internal or external. The input sets formed based on the low frequency components are arranged as inputs of neural network- 2, whose task is indicate the type of fault. The new method uses both low and high frequency information of the fault signal to achieve an advanced transmission line protection scheme.

Simulations of high-resolution images of amorphous silicon films

1986 ◽  
Vol 44 ◽  
pp. 544-545
Author(s):  
G. Y. Fan ◽  
J. M. Cowley
Keyword(s):  
Electron Microscope ◽  
High Frequency ◽  
Fourier Transformation ◽  
Amorphous Materials ◽  
Low Frequency ◽  
Chromatic Aberration ◽  
Structure Information ◽  
Frequency Components ◽  
High Resolution Images ◽  
Spatial Frequency Spectrum

It is well known that the structure information on the specimen is not always faithfully transferred through the electron microscope. Firstly, the spatial frequency spectrum is modulated by the transfer function (TF) at the focal plane. Secondly, the spectrum suffers high frequency cut-off by the aperture (or effectively damping terms such as chromatic aberration). While these do not have essential effect on imaging crystal periodicity as long as the low order Bragg spots are inside the aperture, although the contrast may be reversed, they may change the appearance of images of amorphous materials completely. Because the spectrum of amorphous materials is continuous, modulation of it emphasizes some components while weakening others. Especially the cut-off of high frequency components, which contribute to amorphous image just as strongly as low frequency components can have a fundamental effect. This can be illustrated through computer simulation. Imaging of a whitenoise object with an electron microscope without TF limitation gives Fig. 1a, which is obtained by Fourier transformation of a constant amplitude combined with random phases generated by computer.

A Novel Adaptive PET/CT Image Fusion Algorithm

2019 ◽  
Vol 14 (7) ◽  
pp. 658-666
Author(s):  
Kai-jian Xia ◽  
Jian-qiang Wang ◽  
Jian Cai
Keyword(s):  
Lung Cancer ◽  
Image Fusion ◽  
High Frequency ◽  
Malignant Tumors ◽  
Low Frequency ◽  
Combination Method ◽  
Ct Image ◽  
Fusion Algorithm ◽  
Pet Ct ◽  
Frequency Components

Background: Lung cancer is one of the common malignant tumors. The successful diagnosis of lung cancer depends on the accuracy of the image obtained from medical imaging modalities. Objective: The fusion of CT and PET is combining the complimentary and redundant information both images and can increase the ease of perception. Since the existing fusion method sare not perfect enough, and the fusion effect remains to be improved, the paper proposes a novel method called adaptive PET/CT fusion for lung cancer in Piella framework. Methods: This algorithm firstly adopted the DTCWT to decompose the PET and CT images into different components, respectively. In accordance with the characteristics of low-frequency and high-frequency components and the features of PET and CT image, 5 membership functions are used as a combination method so as to determine the fusion weight for low-frequency components. In order to fuse different high-frequency components, we select the energy difference of decomposition coefficients as the match measure, and the local energy as the activity measure; in addition, the decision factor is also determined for the high-frequency components. Results: The proposed method is compared with some of the pixel-level spatial domain image fusion algorithms. The experimental results show that our proposed algorithm is feasible and effective. Conclusion: Our proposed algorithm can better retain and protrude the lesions edge information and the texture information of lesions in the image fusion.

Despeckling of Sar Images Using Shrinkage of Two-Dimensional Discrete Orthonormal S-Transform

2020 ◽  
pp. 2150023
Author(s):  
Priya R. Kamath ◽  
Kedarnath Senapati ◽  
P. Jidesh
Keyword(s):  
High Frequency ◽  
Low Frequency ◽  
Relevant Information ◽  
Detection Algorithm ◽  
Two Dimensional ◽  
Sar Images ◽  
S Transform ◽  
Processing Step ◽  
Frequency Components ◽  
Shock Filter

Speckles are inherent to SAR. They hide and undermine several relevant information contained in the SAR images. In this paper, a despeckling algorithm using the shrinkage of two-dimensional discrete orthonormal S-transform (2D-DOST) coefficients in the transform domain along with shock filter is proposed. Also, an attempt has been made as a post-processing step to preserve the edges and other details while removing the speckle. The proposed strategy involves decomposing the SAR image into low and high-frequency components and processing them separately. A shock filter is used to smooth out the small variations in low-frequency components, and the high-frequency components are treated with a shrinkage of 2D-DOST coefficients. The edges, for enhancement, are detected using a ratio-based edge detection algorithm. The proposed method is tested, verified, and compared with some well-known models on C-band and X-band SAR images. A detailed experimental analysis is illustrated.

Research on Improvement Algorithm of Image Edge Detection

2014 ◽  
Vol 539 ◽  
pp. 141-145
Author(s):  
Shui Li Zhang
Keyword(s):  
Cognitive Psychology ◽  
Edge Detection ◽  
High Frequency ◽  
Detection Method ◽  
Low Frequency ◽  
Frequency Information ◽  
Image Edge Detection ◽  
Improvement Algorithm ◽  
Image Edge ◽  
Edge Detection Method

This paper presents new theorems Stevens edge detection method based on cognitive psychology on. Firstly, based on the number of the image is decomposed into high-frequency and low-frequency information, and the high-frequency information extracted by subtracting the maximum number of images to the image after the filter, then the amount of high frequency information into psychological cognitive psychology based on Stevenss theorem. The algorithm suppression refined edge after the non-minimum, applications Pillar K-means algorithm to extract image edge. Experimental results show that: the brightness of the image is converted to the amount of psychological edge can better unify under different brightness values.

scholarly journals Image compression based on classification coding of constant-pitched functions transformers

2021 ◽  
pp. 48-62
Author(s):  
Vladimir Barannik ◽  
Andrii Krasnorutsky ◽  
Sergii Shulgin ◽  
Valerii Yeroshenko ◽  
Yevhenii Sidchenko ◽  
...  
Keyword(s):  
Image Compression ◽  
Data Transmission ◽  
High Frequency ◽  
Orthogonal Transformation ◽  
Low Frequency ◽  
Information Delivery ◽  
Video Data ◽  
Arithmetic Coding ◽  
Video Images ◽  
Frequency Components

The subject of research in the article are the processes of video image processing using an orthogonal transformation for data transmission in information and telecommunication networks. The aim is to build a method of compression of video images while maintaining the efficiency of its delivery at a given informative probability. That will allow to provide a gain in the time of delivery of compressed video images, a necessary level of availability and authenticity at transfer of video data with preservation of strictly statistical regulations and the controlled loss of quality. Task: to study the known algorithms for selective processing of static video at the stage of approximation and statistical coding of the data based on JPEG-platform. The methods used are algorithm based on JPEG-platform, methods of approximation by orthogonal transformation of information blocks, arithmetic coding. It is a solution of scientific task-developed methods for reducing the computational complexity of transformations (compression and decompression) of static video images in the equipment for processing visual information signals, which will increase the efficiency of information delivery.The following results were obtained. The method of video image compression with preservation of the efficiency of its delivery at the set informative probability is developed. That will allow to fulfill the set requirements at the preservation of structural-statistical economy, providing a gain in time to bring compressed images based on the developed method, relative to known methods, on average up to 2 times. This gain is because with a slight difference in the compression ratio of highly saturated images compared to the JPEG-2000 method, for the developed method, the processing time will be less by at least 34%.Moreover, with the increase in the volume of transmitted images and the data transmission speed in the communication channel - the gain in the time of delivery for the developed method will increase. Here, the loss of quality of the compressed/restored image does not exceed 2% by RMS, or not worse than 45 dB by PSNR. What is unnoticeable to the human eye.Conclusions. The scientific novelty of the obtained results is as follows: for the first time the method of classification (separate) coding (compression) of high-frequency and low-frequency components of Walsh transformants of video images is offered and investigated, which allows to consider their different dynamic range and statistical redundancy reduced using arithmetic coding. This method will allow to ensure the necessary level of availability and authenticity when transmitting video data, while maintaining strict statistical statistics.Note that the proposed method fulfills the set tasks to increase the efficiency of information delivery. Simultaneously, the method for reducing the time complexity of the conversion of highly saturated video images using their representation by the transformants of the discrete Walsh transformation was further developed. It is substantiated that the perspective direction of improvement of methods of image compression is the application of orthogonal transformations on the basis of integer piecewise-constant functions, and methods of integer arithmetic coding of values of transformant transformations.It is substantiated that the joint use of Walsh transformation and arithmetic coding, which reduces the time of compression and recovery of images; reduces additional statistical redundancy. To further increase the degree of compression, a classification coding of low-frequency and high-frequency components of Walsh transformants is developed. It is shown that an additional reduction in statistical redundancy in the arrays of low-frequency components of Walsh transformants is achieved due to their difference in representation. Recommendations for the parameters of the compression method for which the lowest value of the total time of information delivery is provided are substantiated.

Sign in / Sign up

Export Citation Format

Share Document