• Title/Summary/Keyword: Wavelet Shift Key

Search Result 6, Processing Time 0.03 seconds

A new Robust Wavelet Shift Keying System Using Scaling and Wavelet Functions (스케일링 함수와 웨이브릿을 이용한 잡음에 강인한 새로운 웨이브릿 편이 변조 시스템)

  • Jeong, Tae-Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.2
    • /
    • pp.98-103
    • /
    • 2008
  • There are the frequency shift keying(FSK), phase shift keying(PSK) and amplitude shift keying(ASK) in the conventional digital communications method. In this paper, We proposed a new robust wavelet shift keying system using scaling and wavelet function in the digital communication. Wavelet Transform consist of a low frequency and high frequency coefficient. When the input signal is one, if it finds the impulse response, the signal is separated from the scaling and wavelet function. The binary data is encoded by modulator which assigned the scaling function to 1(one), and wavelet to zero(0). It was demonstrated by experiment that the proposed algorithm can be a robust noise.

  • PDF

Wavelet Shift Keying System Using a Binary Matching Filter (2진 정합필터를 이용한 웨이브릿 편이변조 시스템)

  • Oh, Hyoung-Jin;Jeong, Tae-Il;Lee, Tae-Oh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.11
    • /
    • pp.1933-1938
    • /
    • 2008
  • There are the frequency shift keying(FSK), phase shift keying(PSK) and amplitude shift keying(ASK) in the conventional digital communications method. In this parer, We proposed the algorithm for wavelet shift keying system using a binary matching filter in the digital communication. Wavelet shift keying system are used to a scaling function(low frequency) and wavelet(high frequency) coefficients. The binary data is encoded by modulator which assigned the scaling function to 1(one), and wavelet to zero(0). Wavelet shift keying of the conventional method needs to a post-processing for the decoding. In this paper, wavelet shift keying signal is reconstructed by the decoder using a binary matching filter. So, it was able to the decoding without the post-processing. It was demonstrated by the experiment that the proposed algorithm is a validity.

Digital Watermark Algorithm Based on Energy Distribution of Subband Tree Structure in Wavelet Domain (웨이블릿 영역에서 부대역간 트리구조의 에너지 분포에 의한 디지털 워터마크 삽입 알고리즘)

  • 서영호;최순영;박진영;김동욱
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.85-88
    • /
    • 2002
  • In this paper, the proposed watermark algorithm is based on energy distribution of the subband coefficients in the frequency domain and edge of the original image in the spacial domain. Out of these information, the KeyMap which decides the embedded position of watermark is produced. And then the binary watermark is embedded into the wavelet coefficient of LL3 subband using KeyMap and LFSR(Linear Feedback Shift Register).

  • PDF

A network traffic prediction model of smart substation based on IGSA-WNN

  • Xia, Xin;Liu, Xiaofeng;Lou, Jichao
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.366-375
    • /
    • 2020
  • The network traffic prediction of a smart substation is key in strengthening its system security protection. To improve the performance of its traffic prediction, in this paper, we propose an improved gravitational search algorithm (IGSA), then introduce the IGSA into a wavelet neural network (WNN), iteratively optimize the initial connection weighting, scalability factor, and shift factor, and establish a smart substation network traffic prediction model based on the IGSA-WNN. A comparative analysis of the experimental results shows that the performance of the IGSA-WNN-based prediction model further improves the convergence velocity and prediction accuracy, and that the proposed model solves the deficiency issues of the original WNN, such as slow convergence velocity and ease of falling into a locally optimal solution; thus, it is a better smart substation network traffic prediction model.

A Novel Automatic Block-based Multi-focus Image Fusion via Genetic Algorithm

  • Yang, Yong;Zheng, Wenjuan;Huang, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1671-1689
    • /
    • 2013
  • The key issue of block-based multi-focus image fusion is to determine the size of the sub-block because different sizes of the sub-block will lead to different fusion effects. To solve this problem, this paper presents a novel genetic algorithm (GA) based multi-focus image fusion method, in which the block size can be automatically found. In our method, the Sum-modified-Laplacian (SML) is selected as an evaluation criterion to measure the clarity of the image sub-block, and the edge information retention is employed to calculate the fitness of each individual. Then, through the selection, crossover and mutation procedures of the GA, we can obtain the optimal solution for the sub-block, which is finally used to fuse the images. Experimental results show that the proposed method outperforms the traditional methods, including the average, gradient pyramid, discrete wavelet transform (DWT), shift invariant DWT (SIDWT) and two existing GA-based methods in terms of both the visual subjective evaluation and the objective evaluation.

Selectively Partial Encryption of Images in Wavelet Domain (웨이블릿 영역에서의 선택적 부분 영상 암호화)

  • ;Dujit Dey
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6C
    • /
    • pp.648-658
    • /
    • 2003
  • As the usage of image/video contents increase, a security problem for the payed image data or the ones requiring confidentiality is raised. This paper proposed an image encryption methodology to hide the image information. The target data of it is the result from quantization in wavelet domain. This method encrypts only part of the image data rather than the whole data of the original image, in which three types of data selection methodologies were involved. First, by using the fact that the wavelet transform decomposes the original image into frequency sub-bands, only some of the frequency sub-bands were included in encryption to make the resulting image unrecognizable. In the data to represent each pixel, only MSBs were taken for encryption. Finally, pixels to be encrypted in a specific sub-band were selected randomly by using LFSR(Linear Feedback Shift Register). Part of the key for encryption was used for the seed value of LFSR and in selecting the parallel output bits of the LFSR for random selection so that the strength of encryption algorithm increased. The experiments have been performed with the proposed methods implemented in software for about 500 images, from which the result showed that only about 1/1000 amount of data to the original image can obtain the encryption effect not to recognize the original image. Consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. Also, in this paper, several encryption scheme according to the selection of the sub-bands and the number of bits from LFSR outputs for pixel selection have been proposed, and it has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.