• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.293-298
• /
• 2005

LIDAR의 표고점 데이터는 건물, 수목 등의 개체를 구성하는 비지면점과 순수한 지표면을 나타내는 지면점들이 섞여있기 때문에 이들을 분리하는 과정이 필요하다. 지금까지 연구된 방법들은 몇 가지 입력 요소가 필요하여 완전 자동화를 이루지는 못하고 있으며, 다양한 크기의 개체를 동시에 자동으로 찾아내기 어렵고 경사진 지형에 대해서는 적용하기 어려운 문제점을 가지고 있다. 이에 본 논문에서는 원 데이터의 동일 스캔 라인 상에 존재하는 이웃 점들 간의 경사를 이용하여 입력 요소를 최소화하여 개체를 추출하고자 한다. 이웃하는 두 점플 간의 경사를 이용하여 비지면점을 탐지하여 이웃하는 지면점의 높이 값으로 대체하며 갱신된 값을 바로 다음 연산에 반영시킴으로써 윈도우를 사용하거나 그룹화 할 필요가 없다. 또한 갱신된 값을 전파시키기 때문에 복잡한 지붕을 가지는 건물도 추출할 수가 있다. 이와 같은 연산을 두 방향에 대하여 수행하여 경사진 지형에 대하여 적용할 수 있도록 하였으며 천안과 마산지역에 대하여 테스트를 수행하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.389-392
• /
• 2008

유비쿼터스 환경에서 센서 데이터는 빠르고 연속적인 데이터 스트림 형태로 전송된다. 이러한 개별적인 데이터 스트림 정보를 연관되어 처리하기 위해 조인 연산이 필요하다. LWO, SWF 와 같은 기존 기법들은 Nested Loop Join 을 이용해 데이터 스트림 환경에서 조인 알고리즘을 제시하였다. 하지만 Nested Loop Join 을 사용하기 때문에 슬라이딩 윈도우의 크기에 따라 처리 속도가 영향을 많이 받고 XJoin 은 디스크 I/O 추가 비용이 필요하다. 제안 기법은 환형 큐 버퍼 기반의 해시 색인을 이용한 조인 기법은 환형 큐를 이용하여 데이터의 삽입, 삭제를 관리하고 해시 색인을 이용해 조인 연산을 처리 하여 제안 기법은 기존의 기법 보다 조인 연산을 보다 효율적으로 처리 할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.6-15
• /
• 2009

In this paper, a new 4-way search window is designed for the high-performance 2D PE architecture in H.264 Motion Estimation(ME) to improve the memory bandwidth. While existing 2D PE architectures reuse the overlapped data of adjacent search windows scanned in 1 or 3-way, the new window utilizes the overlapped data of adjacent search windows as well as adjacent multiple scanning (window) paths to enhance the reusage of retrieved search window data. In order to scan adjacent windows and multiple paths instead of single raster and zigzag scanning of adjacent windows, bidirectional row and column window scanning results in the 4-way(up. down, left, right) search window. The proposed 4-way search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 3.1, though the 1/3-way search window redundantly requires $7.7{\sim}11$ times of data retrieval. Thus, the new 4-way search window scheme enhances the memory bandwidth by $70{\sim}58%$ compared with 1/3-way search window. The 2D PE architecture in H.264 ME for 4-way search window consists of $16{\times}16$ pe array. computing the absolute difference between current and reference frames, and $5{\times}16$ reusage array, storing the overlapped data of adjacent search windows and multiple scanning paths. The reference data could be loaded upward and downward into the new 2D PE depending on scanning direction, and the reusage array is combined with the pe array rotating left as well as right to utilize the overlapped data of adjacent multiple scan paths. In experiments, the new implementation of 4-way search window on Magnachip 0.18um could deal with the HD($1280{\times}720$) video of 1 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps at 149.25MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1029-1039
• /
• 2009

In this paper, the existing disparity aquisition algorithms were analyzed, on the bases of which a disparity generation technique that is superior in accuracy to the generation time was proposed. Basically it uses a pixel-by-pixel motion estimation technique. It has a merit of possibility of a high-speed operation. But the motion estimation technique has a disadvantage of lower accuracy because it depends on the similarity of the matching window regardless of the distribution characteristics of the texture in an image. Therefore, an enhanced technique to increase the accuracy of the disparity is required. This paper introduced a variable-sized window matching technique for this requirement. By the proposed technique, high accuracies could be obtained at the homogeneous regions and the object edges. A hardware to generate disparity image was designed, which was optimized to the processing speed so that a high throughput is possible. The hardware was designed by Verilog-HDL and synthesized using Hynix $0.35{\mu}m$ CMOS cell library. The designed hardware was operated stably at 120MHz using Cadence NC-VerilogTM and could process 15 frames per second at this clock frequency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1185-1193
• /
• 1999

최적 스택 필터는 시그널 또는 영상의 임의의 특성 정보를 보존하고자 하는 요구조건에 의해 강제된 구조적 제약 하에서 최대의 잡음제거 효과를 얻을 수 있다. 그리고 임계치 분할 특성과 양의 부울 함수에 기반한 이진 영역에서의 처리 특성은 이 필터가 높은 병렬성을 갖고 있음을 보여준다. 본 논문에서는 두 개의 병렬 계산 모델 MCC(Mesh-Connected Computer)와 CCC(Cube-Connected Computer)에서 최적 스택 필터를 위한 1차원 병렬 알고리즘을 개발한다. 최적 스택 필터의 실행 시간은 주로 이진 median 연산에 의해 결정되고 본 논문에서 제안된 알고리즘은 선형 분리성에 의해 이 연산을 구현한다. 이를 바탕으로, M 레벨의 1-D 시그널의 길이가 L이고 윈도우 폭이 N이라고 가정할 때, 제안된 알고리즘은 {{{{root M times root M`` MCC에서 O(L sqrt{M}`) 시간에 그리고 M 개의 PE를 갖는 CCC에서 O(L log M)시간에 수행될 수 있다. 또한 잡음을 더욱 효과적으로 제거하기 위해 윈도우 폭 N을 증가시킬 때, 제안된 병렬 알고리즘의 계산 시간은 일정하게 유지됨을 보인다.Abstract An optimal stack filter achieves the maximum noise attenuation under the structural constraints imposed by the requirement of preserving certain signal or image features. And the filter provides a high parallelism due to the principles of threshold decomposition and binary processing based on positive Boolean functions(PBFs). In this paper, we develop an one-dimensional parallel algorithm for the optimal stack filter on two parallel computation models, MCC(Mesh-Connected Computer) and CCC(Cube-Connected Computer). The running time of the optimal stack filter depends mainly on the binary median operation and our algorithm realizes this operation by the linear separability. Based on this scheme, our parallel algorithm can be performed in {{{{O(L sqrt{M}`) MCC and inO(L log M) time on CCC with M PEs, when the length of M``-valued 1-D signal is L`` and window width is N`` Also, we show that the computation time of our parallel algorithm keeps constant when the window width N increases in order to achieve the best noise attenuation.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.548-559
• /
• 2009

The cascade face detector learned by Adaboost algorithm, which was proposed by Viola and Jones, is state of the art face detector due to its great speed and accuracy. In spite of its great performance, it still suffers from false alarms, and more computation is required to reduce them. In this paper, we want to reduce false alarms with less computation using facial color. Using facial color information, proposed face detection model scans sub-window efficiently and adapts a fast face/non-face classifier at the first stage of cascade face detector. This makes face detection faster and reduces false alarms. For facial color filtering, we define a facial color membership function, and facial color filtering image is obtained using that. An integral image is calculated from facial color filtering image. Using this integral image, its density of subwindow could be obtained very fast. The proposed scanning method skips over sub-windows that do not contain possible faces based on this density. And the face/non-face classifier at the first stage of cascade detector rejects a non-face quickly. By experiment, we show that the proposed face detection model reduces false alarms and is faster than the original cascade face detector.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.985-991
• /
• 2015

The user's secret key can be retrieved by various side channel leakage informations occurred during the execution of cryptographic RSA exponentiation algorithm which is embedded on a security device. The collision-based power analysis attack known as a serious side channel threat can be accomplished by finding some collision pairs on a RSA power consumption trace. Recently, an RSA exponentiation algorithm was proposed as a countermeasure which is based on the window method adopted combination of message blinding and exponent splitting. In this paper, we show that this countermeasure provides approximately $2^{53}$ attack complexity, much lower than $2^{98}$ insisted in the original article, when the window size is two.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.77-83
• /
• 2004

In this paper, the Classification of Energy Labeling has been proposed. Energy parameters of input signal which are extracted from each phoneme are labelled. And groups of labelling according to detected energies of input signals are detected. Next. DTW processes in a selected group of labeling. This leads to DTW processing faster than a previous algorithm. In this Method, because an accurate detection of parameters is necessary on the assumption in steps of a detection of speeching duration and a detection of energy parameters, variable windows which are decided by pitch period are used. A pitch period is detected firstly : next window scale is decided between 200 frames and 300 frames. The proposed method makes it possible to cancel an influence of windows and reduces the computational complexity by $25\%$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1289-1295
• /
• 2009

Premature ventricular contractions are the most common of all arrhythmias and may cause more serious situation like ventricular fibrillation and ventricular tachycardia in some patients. Therefore, the detection of this arrhythmia becomes crucial in the early diagnosis and prevention of possible life threatening cardiac diseases. Particularly, in the healthcare system that must continuously monitor people's situation, it is necessary to process ECG signal in realtime. In other words, design of algorithm that exactly detects R wave using minimal computation and classifies PVC is needed. So, R wave detection algorithm based adaptive threshold and window for the classification of PVC is presented in this paper. For this purpose, ECG signals are first processed by the usual preprocessing method and R wave was detected and adaptive window through R-R interval is used for efficiency of the detection. The performance of R wave detection and PVC classification is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate 99.33%, 88.86% accuracy respectively for R wave detection and PVC classification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1844-1850
• /
• 2016

The bilateral filter can reduce the noise while preserving details computing the filtering output at each pixels as the average of neighboring pixels. In this paper, we propose a real-time system based on window division. Overall performance is increased due to the parallel architectures which computes five rows in the kernel window simultaneously but with pipelined scheduling. We consider the tradeoff between the filter performance and the hardware cost and the bit allocation has been determined by PSNR analysis. The proposed architecture is designed with verilogHDL and synthesized using Dongbu Hitek 110nm standard cell library. The proposed architecture shows 416Mpixels/s (397fps) of throughput at 416MHz of operating frequency with 132K gates.