• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (B)
• /
• pp.835-837
• /
• 2005

본 논문에서는 가보 웨이블릿을 통해 얼굴 이미지로부터 특징을 추출하고, 그에 Genetic Algorithm 을 통해 구한 특징점별 가중치를 적용하여 얼굴 인식을 하는 방법을 소개한다. 각 특징점별로 가중치를 적용하는 방법은, 기존의 Gabor wavelet 을 사용한 얼굴 인식 방법들에 비해 높은 인식률을 보인다. 특징점별 가중치들은 진화 알고리즘을 통해 학습 되어진다.

• Journal of Electrical Engineering and Technology
• /
• 제4권4호
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• 대한전자공학회논문지TE
• /
• 제39권4호
• /
• pp.363-369
• /
• 2002

본 논문은 적응성 뉴로-퍼지 인터페이스 시스템(Adaptive Neuro-Fuzzy Inference System : ANFIS)과 웨이브렛 변환 다중해상도 분해(multi-resolution Analysis : MRA)을 기반으로 한 웨이브렛 신경망을 가지고 임의의 비선형 함수 학습 근사화를 개선하는 것이다. ANFIS 구조는 벨형 퍼지 소속 함수로 구성이 되었으며, 웨이브렛 신경망은 전파 알고리즘과 역전파 신경망 알고리즘으로 구성되었다. 이 웨이브렛 구성은 단일 크기이고, ANFIS 기반 웨이브렛 신경망의 학습을 위해 역전파 알고리즘을 사용하였다. 1차원과 2차원 함수에서 웨이브렛 전달 파라미터 학습과 ANFIS의 벨형 소속 함수를 이용한 ANFIS 모델 기반 웨이브렛 신경망의 웨이브렛 기저 수 감소와 수렴 속도 성능이 기존의 알고리즘 보다 개선되었음을 확인하였다.

• 융합신호처리학회논문지
• /
• 제13권1호
• /
• pp.19-25
• /
• 2012

An adaptive system is a well-known method for removing noise from noise-corrupted speech. In this paper, we perform a least mean square (LMS) based on wavelet adaptive algorithm. It establishes the faster convergence rate of as compared to time domain because of eigenvalue distribution width. And this paper provides the basic tool required for the FIR algorithm whose algorithm reduces the arithmetic complexity. We consider a new fast short-length running FIR structure in discrete wavelet adaptive algorithm. We compare FIR algorithm and short-length fast running FIR algorithm (SFIR) to the proposed fast short-length running FIR algorithm(FSFIR) for arithmetic complexities.

• 전자공학회논문지SC
• /
• 제38권5호
• /
• pp.7-13
• /
• 2001

단일 신경망에 기반한 웨이블릿 이론과 모듈라 개념을 결합하여 기존의 웨이블릿 신경망이나 모듈라 네트워크의 일종인 모듈라 웨이블릿 신경망이 제안되었다. 본 논문에서는 유전 알고리즘을 사용하여 모듈라 웨이블릿 신경망의 최적구조를 효과적으로 설계하는 방법을 제시하였다. 각 모듈을 구성하는 웨이블릿 신경망의 웨이블릿 기저함수의 팽창과 이동계수를 결장하기 위해 유전 알고리즘을 사용하였다. 제안한 최적 구조 설계 알고리즘을 근사화 문제에 적용하여 우수성을 검증하였다.

• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.74-86
• /
• 1994

In this paper a hierarchical stereo matching algorithm to obtain the disparity in wavelet transformed domain by using locally adaptive window and weights is proposed. The pyramidal structure obtained by wavelet transform is used to solve the loss of information which the conventional Gaussian or Laplacian pyramid have. The wavelet transformed images are decomposed into the blurred image the horizontal edges the vertical edges and the diagonal edges. The similarity between each wavelet channel of left and right image determines the relative importance of each primitive and make the algorithm perform the area-based and feature-based matching adaptively. The wavelet transform can extract the features that have the dense resolution as well as can avoid the duplication or loss of information. Meanwhile the variable window that needs to obtain precise and stable estimation of correspondense is decided adaptively from the disparities estimated in coarse resolution and LL(low-low) channel of wavelet transformed stereo image. Also a new relaxation algorithm that can reduce the false match without the blurring of the disparity edge is proposed. The experimental results for various images show that the proposed algorithm has good perfpormance even if the images used in experiments have the unfavorable conditions.

• Journal of Information Processing Systems
• /
• 제18권5호
• /
• pp.711-718
• /
• 2022

In this paper, an accurate segmentation algorithm of video dynamic background image (VDBI) based on improved wavelet transform is proposed. Based on the smooth processing of VDBI, the traditional wavelet transform process is improved, and the two-layer decomposition of dynamic image is realized by using two-dimensional wavelet transform. On the basis of decomposition results and information enhancement processing, image features are detected, feature points are extracted, and quantum ant colony algorithm is adopted to complete accurate segmentation of the image. The maximum SNR of the output results of the proposed algorithm can reach 73.67 dB, the maximum time of the segmentation process is only 7 seconds, the segmentation accuracy shows a trend of decreasing first and then increasing, and the global maximum value can reach 97%, indicating that the proposed algorithm effectively achieves the design expectation.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.254-257
• /
• 2009

In this paper, we propose a learning-based super-resolution algorithm. In the proposed algorithm, a multi-resolution wavelet approach is adopted to perform the synthesis of local high-frequency features. To obtain a high-resolution image, wavelet coefficients of two dominant LH- and HL-bands are estimated based on wavelet frames. In order to prepare more efficient training sets, the proposed algorithm utilizes the LH-band and transposed HL-band. The training sets are then used for the estimation of wavelet coefficients for both LH- and HL-bands. Using the estimated high frequency bands, a high resolution image is reconstructed via the wavelet transform. Experimental results demonstrate that the proposed scheme can synthesize high-quality images.

• 한국산업정보학회논문지
• /
• 제7권4호
• /
• pp.17-21
• /
• 2002

적응신호처리 분야에서 LMS알고리즘은 수식이 간단하고, 적은 계산량으로 인해 널리 사용되고 있지만, 시간영역의 적응알고리즘은 입력신호의 고유치 분포폭이 넓게 분포할 때는 수렴속도가 느려지는 단점이 있다. 또한 알고리즘의 성능을 좌우하는 고정된 적응상수를 적절하게 선택해야만 알고리즘이 수렴할 수 있다. 이런 문제점을 개선하기 위하여 본 논문에서는 시간영역의 적응알고리즘을 변환영역인 웨이블렛 변환에서 적응알고리즘을 적용한다. 그리고 안정되고 빠른 수렴을 위해 고정된 적응상수를 오차신호의 순시치 절대값에 비례하여 각 반복구간마다 변화시키는 가변스텝사이즈를 갖는 웨이블렛 기반 고속적응알고리즘을 제안, 적응잡음제거기에 적용하여 기존의 알고리즘과 비교하여 그 성능이 우수함을 입증하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.1079-1082
• /
• 1999

This paper presents a denoising algorithm that can suppress additive noise components while preserving signal components in the wavelet domain. The algorithm uses the local statistics of wavelet coefficients to attenuate noise components adaptively. Then threshohding operation is followed to reject the residuary noise components in the wavelet coefficients. Simulations are carried out over 1-D signals corrupted by Gaussian noise and the experimental results show the effectiveness of the proposed algorithm.