• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 추계학술대회 논문집 학회본부
• /
• 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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• 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.

• 한국정보과학회논문지:시스템및이론
• /
• 제33권6호
• /
• pp.344-353
• /
• 2006

본 논문은, 연필을 이용하여 종이에 선을 그렸을 때에 나타나는 효과를 모방하는 연필 스트로크 알고리즘을 제안한다. 비사실적 렌더링(NPR, Non-Photorealistic Rendering)에 대한 연구는 사람이 직접 그린 펜화나 수채화, 연필화, 파스텔화 등의 효과를 컴퓨터를 통해 자동으로 표현함을 목적으로 하고 있으며, 현재 그래픽스 분야에서 활발히 진행되고 있다. 이 중에서 연필에 대한 효과에 대한 연구는 LIC(Linear Integral Convolution)를 이용하여 최초 입력영상을, 방향성을 가진 벡터 영역이 반영된 출력 영상으로 변환하는 방식에 대한 연구가 대부분이었다. 그러나 이러한 변환 방식은 후처리방식이므로 사용자가 실시간으로 그림을 그리는 드로잉 툴에 적용하기 불가능하다. 본 논문에서는 무름의 정도에 따라 6B에서부터 6H의 연필들에 의해 실제 선이 그려지는 것을 관찰하고 이를 모방한 새로운 실시간 연필 스트로크 알고리즘을 제시하였다. 본 알고리즘은 연필상수, 스트로크 상의 픽셀 위치에 따른 노이즈 발생 등을 이용한 간단한 형태의 알고리즘임에도 불구하고, 구현 결과, 사용자가 일반 그래픽 에디터와 같은 환경에서 실제 연필 스트로크와 유사한 형태의 스트로크를 실시간으로 그릴 수 있음을 확인할 수 있었다.

• 한국인터넷방송통신학회논문지
• /
• 제8권5호
• /
• pp.181-186
• /
• 2008

본 논문은 빠르게 발전하고 있는 무선통신시스템에서 중요시되는 보안을 강화시키며 신뢰성 있는 통신을 가능하게 하는 MCC(M-sequence Convolution Code)채널부호기 설계를 제안한다. 제안한 부호기는 기존의 채널부호기가 가지는 오류 정정 특성뿐 아니라 정보데이터에 대한 비화성질을 부가하여 인증된 사용자만 접근할 수 있는 부호기이다. 제안한 부호기의 특성은 M부호열의 특성 중 평형특성을 이용함으로써 콘볼루션부호기의 출력부를 변화시켜 부호열을 얻는 물리계층의 보안 시스템이다. M부호열과 콘볼루션부호기를 사용함으로써 기존의 CDMA시스템에서 추가적인 부분 없이 간단하게 설계할 수 있으며 현재 사용되고 있는 콘볼루션부호기와 비교하였을 때 연집오류의 극복으로 약 0.1dB의 부호화 이득을 얻었고, 비화성능으로 인증된 사용자만이 송신된 데이터를 복구 가능한 것을 검증하였다. 비인증 사용자의 접근에 있어서는 SNR의 변화에 상관없이 50% 이상의 오류율을 보인다. 따라서 기존의 콘볼루션부호기 대신 제안한 MCC부호기를 사용함으로써 비화성능과 높은 BER성능을 얻을 수 있다.

• 한국멀티미디어학회논문지
• /
• 제13권11호
• /
• pp.1621-1629
• /
• 2010

본 논문에서는 칼라비전의 색사상에서 가장 많이 활용되는 MSR(multi-scale Retinex) 기법의 속도를 크게 개선한 MSRCR(MSR with color restoration) 알고리즘을 제시한다. 기존 MSR기법은 보통 3개의 SSR(single-scale Retinex)로 구성되며 각 SSR에 크기가 다른 Gaussian 주변함수를 사용하고 있으며, 이 함수와의 상승적분 부분에서 많은 계산이 요구된다. 그러므로 제안한 알고리즘은 속도를 높이기 위해 Gaussian 함수와 등가적인 HDC(hierarchical discrete correlation)를 사용하고 휘도영상에만 적용하는 기법을 제시하며, 휘도영상의 Retinex 결과 값을 이용하여 색이 보존되는 단순한 MSRCR 알고리즘을 개발하였다. 실험을 통하여 제안한 기법은 기존의 가장 단순한 MSR기법보다 연산량 및 속도를 1/9.5배, 1/3.5배로 줄일 수 있었으며 기존 기법과 동등한 결과를 얻을 수 있었다.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2002년도 Proceedings
• /
• 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.

• 한국멀티미디어학회논문지
• /
• 제20권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.

• 반도체디스플레이기술학회지
• /
• 제20권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.

• 대한전기학회논문지
• /
• 제40권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.