• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• 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.

• MALSORI
• /
• no.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.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.99-110
• /
• 2005

These days, many image processing techniques have been studied for effective image compression. Among those, The 2D image filtering is widely used for 2D image processing. The 2D image filtering can be implemented by performing the 1D linear filter separately in the horizontal and vertical direction. Efficiency of image compression depends on what filtering method is used. Generally, circular convolution is widely used in 2D image filtering for image processing. However it doesn't consider correlations at the boundary region of image, therefore effective filtering can not be performed. To solve this problem. I proposed new convolution technique using loop convolution which satisfies the 'alias-free' and 'error-free' requirement in the reconstructed image. This method could provide more effective compression performance than former methods because it used highly-correlated data when performed at the boundary region. In this paper, Sub-band Coding(SBC) was adopted to analyze efficiency of proposed filtering technique, and the simulator developed by Java-based language was used to examine the performance of proposed method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1129-1138
• /
• 2014

CAPTCHA is a technique which distinguishes human and machine using what human can judge easily but machine can't. Though Text-based-CAPTCHA has been widely used and can be implemented easily, it is less security than other CAPTCHAs such as image-based, or audio-based CAPTCHAs. To enhance the security of text-based CAPTCHA, many techniques have been developed. One of them is making CAPTCHA recognized hard using complex background or noise. In this paper, we introduce how to apply convolution filtering effectively to attack CAPTCHA and actually analyze Naver's CAPTCHA which has been used for joining a cafe with this method.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.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.

• Journal of Digital Convergence
• /
• v.17 no.1
• /
• pp.123-130
• /
• 2019

One of the most commonly used methods of web recommendation techniques is collaborative filtering. Many studies on collaborative filtering have suggested ways to improve accuracy. This study proposes a method of movie recommendation using Word2Vec and an ensemble convolutional neural networks. First, in the user, movie, and rating information, construct the user sentences and movie sentences. It inputs user sentences and movie sentences into Word2Vec to obtain user vectors and movie vectors. User vectors are entered into user convolution model and movie vectors are input to movie convolution model. The user and the movie convolution models are linked to a fully connected neural network model. Finally, the output layer of the fully connected neural network outputs forecasts of user movie ratings. Experimentation results showed that the accuracy of the technique proposed in this study accuracy of conventional collaborative filtering techniques was improved compared to those of conventional collaborative filtering technique and the technique using Word2Vec and deep neural networks proposed in a similar study.

• Journal of Multimedia Information System
• /
• v.5 no.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
• /
• v.4 no.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.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• 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.