• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.532-535
• /
• 2005

These days, many image processing techniques have been studied for effective image compression. Among those, 2D image filtering is widely used for 2D image processing. The 2D image filtering can be implemented by performing ID linear filtering separately in the direction of horizontal and vertical. Efficiency of image compression depends on what filtering method is used. Generally, circular convolution is widely used in the 2D image filtering for image processing. However it doesn't consider correlations at the region of image boundary, therefore filtering can not be performed effectively. To solve this problem. I proposed new convolution technique using Symmetric-Mirroring convolution, satisfying the 'alias-free' and 'error-free' requirement in the reconstructed image. This method could provide more effective performance than former compression methods. Because it used very high correlative data when performed at the boundary region. In this paper, pre-processing filtering in H.264 codec was adopted to analyze efficiency of proposed filtering technique, and the simulator developed by Matlab language was used to examine the performance of the proposed method.

• 대한음성학회지:말소리
• /
• 제51호
• /
• pp.85-98
• /
• 2004

It is almost impossible to generate the sound field effect in real time with the time-domain linear convolution because of its large multiplication operation requirement. To solve this, three methods are introduced to reduce the number of multiplication operations in this paper. Firstly, the time-domain linear convolution is replaced with the frequency-domain circular convolution. In other words, the linear convolution result can be derived from that of the circular convolution. This technique reduces the number of multiplication operations remarkably, Secondly, a subframe concept is introduced, i.e., one original frame is divided into several subframes. Then the FFT is executed for each subframe and, as a result, the number of multiplication operations can be reduced. Finally, the QFT is used in stead of the FFT. By combining all the above three methods into our final the SFE generation algorithm, the number of computations are reduced sufficiently and the real-time SFE generation becomes possible with a general PC.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1979년도 하계 전자.전기연합학술발표회논문집
• /
• pp.166-167
• /
• 1979

Performances of three computational algorithms for one-dimensional frequency filtering are compared and tradeoffs are studied. If the size of the filter impulse response is small, it is well-known that the conventional convolution is superior than the FFT convolution. If the size of the impulse response is large, it was suggested that the recursive filter might be competitive in terms of speed to the FFT convolution. We, therefore, have developed an computational, algorithm for the recursive filter to compare the speed advantages over the FFT convolution and the results are presented.

• 대한전자공학회논문지SP
• /
• 제42권6호
• /
• pp.99-110
• /
• 2005

효과적인 영상의 압축을 위하여 여러 가지 기법들이 연구되고 있는데, 그 중에 2 차원 필터링은 2 차원 영상 처리를 위해 많이 사용되고 있다. 2 차원 영상 필터링은 수평과 수직 방향으로 각각 1 차원 선형 필터를 수행함으로서 구현할 수 있으며, 필터링 방법에 따라 압축 효율에 많은 영향을 미치게 된다. 일반적으로 순환 콘볼루션을 이용한 필터링 기법은 영상을 감축하는데 가장 많이 사용되고 있는데, 경계 부분에서의 상관성 등이 전혀 고려되지 않기 때문에 필터링 효율이 떨어지는 문제를 가지고 있다. 이러한 문제를 해결하기 위하여 본 논문에서는 루프 콘볼루션을 이용한 필터링 기법을 제안 하였다. 제안된 필터링 기법은 경계 부분의 필터링 시 상관성이 높은 데이터를 이용하기 때문에 필터링의 효율을 높일 수가 있다. 제안된 필터링의 효율을 정확하게 분석하기 위하여 대역분할 부호화에 적용하였고, 자바 기반의 시뮬레이터를 사용하여 성능을 평가하였다.

• 정보보호학회논문지
• /
• 제24권6호
• /
• pp.1129-1138
• /
• 2014

캡차는 사람은 쉽게 판단할 수 있으나 기계는 판단할 수 없는 문제를 이용하여 사람과 기계를 구별하는 기술이다. 널리 사용되고 있는 문자열 기반 캡차는 구현이 간단하나 이미지 기반이나 소리 기반 캡차에 비해 상대적으로 보안성이 약하다. 텍스트 기반 캡차의 보안성을 높이기 위해 다양한 기법이 개발되었으며, 그 중 하나는 복잡한 배경이나 노이즈를 사용하여 기계가 문자를 인식하기 어렵게 만드는 것이다. 이 논문에서는 이미지 프로세싱 기법 중 하나인 콘볼루션 필터링(Convolution Filter)을 이용하여 효과적으로 캡차를 공격하는 방법을 제시하고, 이를 네이버 카페의 캡차에 적용하여 분석해보았다.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.125-133
• /
• 1996

In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.

• 디지털융복합연구
• /
• 제17권1호
• /
• pp.123-130
• /
• 2019

웹 추천기법에서 가장 많이 사용하는 방식 중의 하나는 협업필터링 기법이다. 협업필터링 관련 많은 연구에서 정확도를 개선하기 위한 방안이 제시되어 왔다. 본 연구는 Word2Vec과 앙상블 합성곱 신경망을 활용한 영화추천 방안에 대해 제안한다. 먼저 사용자, 영화, 평점 정보에서 사용자 문장과 영화 문장을 구성한다. 사용자 문장과 영화 문장을 Word2Vec에 입력으로 넣어 사용자 벡터와 영화 벡터를 구한다. 사용자 벡터는 사용자 합성곱 모델에 입력하고, 영화 벡터는 영화 합성곱 모델에 입력한다. 사용자 합성곱 모델과 영화 합성곱 모델은 완전연결 신경망 모델로 연결된다. 최종적으로 완전연결 신경망의 출력 계층은 사용자 영화 평점의 예측값을 출력한다. 실험결과 전통적인 협업필터링 기법과 유사 연구에서 제안한 Word2Vec과 심층 신경망을 사용한 기법에 비해 본 연구의 제안기법이 정확도를 개선함을 알 수 있었다.

• Journal of Multimedia Information System
• /
• 제5권2호
• /
• pp.131-138
• /
• 2018

This work describes a binary image based fast Difference of Gaussian (DoG) filter using zero-dimensional (0-d) convolution and state machine look up tables (LUTs) for image and video stitching hardware platforms. The proposed approach for using binary images to obtain DoG filtering can significantly reduce the data size compared to conventional gray scale based DoG filters, yet binary images still preserve the key features of the image such as contours, edges, and corners. Furthermore, the binary image based DoG filtering can be realized with zero-dimensional convolution and state machine LUTs which eliminates the major portion of the adder and multiplier blocks that are generally used in conventional DoG filter hardware engines. This enables fast computation time along with the data size reduction which can lead to compact and low power image and video stitching hardware blocks. The proposed DoG filter using binary images has been implemented with a FPGA (Altera DE2-115), and the results have been verified.

• ETRI Journal
• /
• 제4권3호
• /
• pp.18-29
• /
• 1982

In a block adaptive filtering procedure, the filter coefficients are adjusted once per each output block while maintaining performance comparable to that of widely used LMS adaptive filtering in which the filter coefficients are adjusted once per each output data sample. An efficient implementation of block adaptive filter is possible by means of discrete transform technique which has cyclic convolution property and fast algorithms. In this paper, the block adaptive filtering using Fermat Number Transform (FNT) is investigated to exploit the computational efficiency and less quantization effect on the performance compared with finite precision FFT realization. And this has been verified by computer simulation for several applications including adaptive channel equalizer and system identification.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1979년도 하계 전자.전기연합학술발표회논문집
• /
• pp.164-165
• /
• 1979

Two dimensional kernels which reconstruct the tomographic image from the blurred one formed by simple back-projection are investigated and their performances are compared. These kernels are derived from tile point spread function of the tomographic system and have the form of a ramp filter modified by several window functions to suppress ringing in the reconstruction. Computer simulation using a computer generated phantom image data with different correction functions(kernels) has been carried out. In this simulation, filtering in frequency domain by 2-D FFT technique or in space domain by 2-D direct convolution is considered. It is found that the-computation time required for real space convolution technique is much larger than that of Fourier 2-D filtering technique in the pratical situation.