• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.343-344
• /
• 2012

With the increase of sensitive data and their secure transmission and storage, the use of encryption techniques has become widespread. The performance of encoding majorly depends on the computational time, so a system with less computational time suits more appropriate as compared to its contrary part. Double Random Phase Encoding (DRPE) is an algorithm with many sub functions which consumes more time when executed serially; the computation time can be significantly reduced by implementing important functions in a parallel fashion on Graphics Processing Unit (GPU). Computing convolution using Fast Fourier transform in DRPE is the most important part of the algorithm and it is shown in the paper that by performing this portion in GPU reduced the execution time of the process by substantial amount and can be compared with MATALB for performance analysis. NVIDIA graphic card GeForce 310 is used with CUDA C as a programming language.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.194-196
• /
• 1989

The production costing plays a key role in power system expansion and operations planning especially for the calculation of expected energy, loss of load probability and unserved energy. Therefore, it is crucial to develope a probabilistic production costing algorithm which gives sufficiently precise results within a reasonable computational time. In this respect, a number of methods of solving production simulation have been proposed. In previous paper we proposed the method used Fast Hartley Transform in convolution process with considering only the thermal units. In this paper, the method considering the scheduling of pumped-storage plants and hydro plants with energy constraints is proposed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.344-353
• /
• 2006

In this paper, we present a new algorithm which imitate real pencil strokes. The purpose of research on NPR(Non-Photorealistic Rendering) is simulating automatically manmade artistic expressions such as pen-and-ink illustrations, watercolor paintings, pencil sketches and pastel drawings with computers. Recently, there has been a great deal of research works on NPR. One of them is researching in pencil illustration methods for NPR, and a lot of researchers have investigated into the LIC(Linear Integral Convolution) techniques which would change the initial images into the output images by directional vector field images for generating effects of pencil. However, the LIC techniques can not be applied to real-time drawing tools because they are post processing techniques. This paper presents a real-time pencil strokes algorithm which is based on an observation of how pencils(from 6B to 6H) draw lines. Although this algorithm using some pencil variables and noise generation is simple, it is fast and also can draw real-time pencil strokes similar to real manmade pencil strokes in a GUI drawing tool.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.181-186
• /
• 2008

Wireless data transmission is vulnerable to attackers and hackers. Recently, the fast development of wireless communication systems seamlessly increase the demand for security in this area. Moreover, error correction is especially important because various kinds of interferences among wireless devices. In order to solve two above problems, we propose to apply MCC (M-sequence Convolutional Code) in the system which is able to protect information and correct errors. The proposed system can obtain higher secure property by randomly changing the output connections by the proposed M-sequence. Performance of the system is analyzed according to BER (Bit Error Rate) and secure levels. The simulation results revealed that we can get the coding gain of 0.1 dB over conventional convolution coding technique. The proposed algorithm is installed in physical layer and easily implemented. Another advantage of our proposed (M-sequence and convolutional code) is that it can be applied to CDMA (Code Division Multiple Access) communication system.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1621-1629
• /
• 2010

This paper presents an improved fast MSRCR algorithm that MSRs are commonly adopted at tone mapping in color vision. Conventional MSRs consist of three SSRs, which use three Gaussian functions with different scales as those surround ones. This convolution processes require much computation load. Therefore, the proposed algorithm adopts a hierarchical discrete correlation which is equivalent to Gaussian function and the Retinex process is only applied to the luminance channel in order to get a fast processing. A simple color preservation scheme is applied to the Retinex output from the luminance channel in the proposed MSRCR algorithm. Experimental results show that the proposed algorithm required less number of oprations and computation time about 1/9.5 and 1/3.5 times, respectively, than those of the simplest MSR and was equivalent to conventional MSRs.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.119-120
• /
• 2002

The aim is to urge the need of elaborate commissioning of 3D RTP system from the firsthand experience. A 3D RTP system requires so much data such as beam data and patient data. Most data of radiation beam are directly transferred from a 3D dose scanning system, and some other data are input by editing. In the process inputting parameters and/or data, no error should occur. For RTP system using algorithm-bas ed-on beam-modeling, careless beam-data processing could also cause the treatment error. Beam data of 3 different qualities of photon from two linear accelerators, patient data and calculated results were commissioned. For PDD, the doses by Clarkson, convolution, superposition and fast superposition methods at 10 cm for 10${\times}$10 cm field, 100 cm SSD were compared with the measured. An error in the SCD for one quality was input by the service engineer. Whole SCD defined by a physicist is SAD plus d$\sub$max/, the value was just SAD. That resulted in increase of MU by 100${\times}$((1_d$\sub$max//SAD)$^2$-1)%. For 10${\times}$10 cm open field, 1 m SSD and at 10 cm depth in uniform medium of relative electron density (RED) 1, PDDs for 4 algorithms of dose calculation, Clarkson, convolution, superposition and fast-superposition, were compared with the measured. The calculated PDD were similar to the measured. For 10${\times}$10 cm open field, 1 m SSD and at 10 cm depth with 5 cm thick inhomogeneity of RED 0.2 under 2 cm thick RED 1 medium, PDDs for 4 algorithms were compared. PDDs ranged from 72.2% to 77.0% for 4 MV X-ray and from 90.9% to 95.6% for 6 MV X-ray. PDDs were of maximum for convolution and of minimum for superposition. For 15${\times}$15 cm symmetric wedged field, wedge factor was not constant for calculation mode, even though same geometry. The reason is that their wedge factor is considering beam hardness and ray path. Their definition requires their users to change the concept of wedge factor. RTP user should elaborately review beam data and calculation algorithm in commissioning.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1157-1165
• /
• 2017

2-D complex Gabor filtering has found numerous applications in the fields of computer vision and image processing. Especially, in some applications, it is often needed to compute 2-D complex Gabor filter bank consisting of the 2-D complex Gabor filtering outputs at multiple orientations and frequencies. Although several approaches for fast 2-D complex Gabor filtering have been proposed, they primarily focus on reducing the runtime of performing the 2-D complex Gabor filtering once at specific orientation and frequency. To obtain the 2-D complex Gabor filter bank output, existing methods are repeatedly applied with respect to multiple orientations and frequencies. In this paper, we propose a novel approach that efficiently computes the 2-D complex Gabor filter bank by reducing the computational redundancy that arises when performing the Gabor filtering at multiple orientations and frequencies. The proposed method first decomposes the Gabor basis kernels to allow a fast convolution with the Gaussian kernel in a separable manner. This enables reducing the runtime of the 2-D complex Gabor filter bank by reusing intermediate results of the 2-D complex Gabor filtering computed at a specific orientation. Experimental results demonstrate that our method runs faster than state-of-the-arts methods for fast 2-D complex Gabor filtering, while maintaining similar filtering quality.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.3
• /
• pp.6-10
• /
• 2021

Recognition of characters printed or marked on the PCB components from images captured using cameras is an important task in PCB components inspection systems. Previous optical character recognition (OCR) of PCB components typically consists of two stages: character segmentation and classification of each segmented character. However, character segmentation often fails due to corrupted characters, low image contrast, etc. Thus, OCR without character segmentation is desirable and increasingly used via deep neural networks. Typical implementation based on deep neural nets without character segmentation includes convolutional neural network followed by recurrent neural network (RNN). However, one disadvantage of this approach is slow execution due to RNN layers. LPRNet is a segmentation-free character recognition network with excellent accuracy proved in license plate recognition. LPRNet uses a wide convolution instead of RNN, thus enabling fast inference. In this paper, LPRNet was adapted for recognizing characters printed on PCB components with fast execution and high accuracy. Initial training with synthetic images followed by fine-tuning on real text images yielded accurate recognition. This net can be further optimized on Intel CPU using OpenVINO tool kit. The optimized version of the network can be run in real-time faster than even GPU.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.6
• /
• pp.551-561
• /
• 1991

The probabilistic generation simulation plays a key role in power system expansion and operational planning especially for the calculation of expected energy, loss of load probaility and unserved energy expected. However, it is crucial to develop a probabilistic generation simulation algorithm which gives sufficiently precise results within a reasonable computation time. In a previous paper, we have proposed an efficent method using Fast Hartley Transform in convolution process for considering the thermal and nuclear units. In this paper, a method considering the scheduling of pumped-storage plants and hydro plants with energy constraint is proposed. The method also adopts FHT techniques. We improve the model to include multi-state and multi-block generation. The method has been applied for a real size model system.