• 한국통신학회논문지
• /
• 제30권12C호
• /
• pp.1153-1161
• /
• 2005

가장 최근에 표준화된 H.264 동영상 압축 부호화 방식은 이전의 비디오 부호화 방식에 비해 율-왜곡 관점에서 높은 성능을 보이지만 더불어 부호기의 복잡도가 상당히 증가하는 단점이 있다. 본 논문에서는 H.264 비디오 부호화에서 인터/인트라 예측을 위한 적응적이고도 효율적인 복잡도 감소 알고리즘을 제시한다. 제안하는 인터 예측 알고리즘은 효율적이고 간단한 모드 결정 방법을 제시하며 그에 따른 움직임 추정 기법을 적응적으로 적용하여 복잡도를 감소시킨다. 또한 인트라 예측에서 기존에 계산된 최소 율-왜곡 비용을 인트라 $16{\times}16$과 인트라 $4{\times}4$ 모드 결정에 이용하여 복잡도를 줄이는 알고리즘을 제안한다. 제안하는 알고리즘은 전체 부호화 시간을 최대 $60.9\%$까지 감소시키는데 비해 PSNR이나 비트율에는 거의 손실을 발생시키지 않는 장점이 있다.

• 한국위성정보통신학회논문지
• /
• 제7권2호
• /
• pp.97-103
• /
• 2012

본 논문에서는 MIMO(Multi Input Multi Output) 시스템을 위한 적응형 검색범위 기반 복잡도 감소 QRD-M 기법을 제안한다. 기존의 fixed QRD-M 기법은 각 단계에서 survivor path들을 현 단계의 모든 가능한 성상도 심벌들로 확장하여 그 중 가장 작은 path metric을 가지는 M개를 선택한다. 성능의 저하를 최소화 하기 위해서는 큰 값의 M을 사용해야 하지만, 계산양 또한 증가하는 단점을 가진다. 이러한 단점을 보완하기 위해 측정된 평균 잡음 전력 값에 따라 survivor path의 개수나, 검색 범위를 적절히 조절하는 기법들이 제안되었다. 하지만 이 기법들에 채널 상태를 판별하기 위해 사용된 지표는 평균 잡음 전력 정보이므로 잡음 전력 값이 순간적으로 크게 변하는 경우 성능 저하를 가져올 수 있다. 제안된 기법에서는 수신 심벌 벡터와 QRD에 의해 임시적으로 추정된 심벌 벡터와의 Euclidean distance와 채널 행렬의 대각성분을 이용하여 순시적인 채널 정보를 추정하여 검색 범위를 적절히 조절하므로 기존의 기법의 단점을 보완한다. 실험 결과에서는 제안된 기법이 MLD(Maximum Likelihood Detection)의 성능에 근접하면서, 동일한 성능을 가지는 기존의 QRD-M 기법들에 비해 확연히 작은 복잡도를 가지는 것을 보인다.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2005년도 GIS/RS 공동 춘계학술대회
• /
• pp.345-349
• /
• 2005

Massive amount of satellite image processing such asglobal/continental-level analysis and monitoring requires automated and speedy georegistration. There could be two major automated approaches: (1) rigid mathematical modeling using sensor model and ephemeris data; (2) heuristic co-registration approach with respect to existing reference image. In case of ETM+, the accuracy of the first approach is known as RMSE 250m, which is far below requested accuracy level for most of satellite image processing. On the other hands, the second approach is to find identical points between new image and reference image and use heuristic regression model for registration. The latter shows better accuracy but has problems with expensive computation. To improve efficiency of the coregistration approach, the author proposed a pre-qualified matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with correlation coefficient. Throughout the pre-qualification approach, the computation time was significantly improved and make the registration accuracy is improved. A prototype was implemented and tested with the proposed algorithm. The performance test of 14 TM/ETM+ images in the U.S. showed: (1) average RMSE error of the approach was 0.47 dependent upon terrain and features; (2) the number average matching points were over 15,000; (3) the time complexity was 12 min per image with 3.2GHz Intel Pentium 4 and 1G Ram.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2017년도 춘계학술발표대회
• /
• pp.618-620
• /
• 2017

Currently, IoT mobile applications are growing fast in number and complexity. As a result, the applications quality issue became crucial, hence to ensure their quality a proper testing is highly required. Testing such mobile applications is always tedious, time-consuming and expensive. To cope with these issues, we propose a testing approach using activity diagram with data flow information. The main functionality of IoT applications is exposing the meaningful data obtained from the sensors to the users by doing a lot of analysis, comparison, and computation. Therefore, our focus is on identifying and selecting the most appropriate paths at which calculation is taking place and the paths at which predicate exists. In our case study, we have used a real-world IoT mobile application and identified a total of ten test paths with two predicate uses and two computation uses through an example. With applying only this four critical paths, we can adequately test the application's core functionalities while significantly reduce the testing effort and cost.

• 한국정보과학회논문지:시스템및이론
• /
• 제27권5호
• /
• pp.475-484
• /
• 2000

최근에 전자 버스 대신에 광 버스를 사용하여 버스의 대역폭을 늘리고 하드웨어의 복잡도를 줄이기 위한 처리기 배열의 구조가 다수의 문헌에서 제안되었다. 본 논문에서는 먼저 슬롯된 광 버스를 갖는 선형 처리기 배열(LASOB) 상에서 괄호 매칭 문제에 대한 상수 시간 알고리즘을 제안한다. 다음에 이 알고리즘을 사용하여 길이 n의 대수 식이 주어지면 n개의 처리기를 갖는 LASOB 상에서 상수 시간에 계산 트리 형식을 생성하는 비용이 최적인 병렬 알고리즘을 제안한다. 아직 임의의 병렬 컴퓨터 모델에서 이 문제에 대한 상수 시간에 수행되는 비용 최적인 병렬 알고리즘은 알려지지 않고 있다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권7호
• /
• pp.344-351
• /
• 2006

The fatigue of back muscle in the repetitive lifting motion was studied using multiple parameters(FFT_MDF, RMS, 2C, NT) in this study. Recent developments in the time-frequency analysis procedures to compute the IMDF(instantaneous median frequency) were utilized to overcome the nonstationarity of EMG signal using Cohen-Posch distribution. But the above method has a lot of computation time because of its complexity. So, in this study, FFT_MDF(median frequency estimation based on FFT) algorithm was used for median frequency estimation of back muscle EMG signal during muscle work in uniform velocity portion of lumbar movement. The analysis period of EMG signal was determined by using the run test and lumbar movement angle in dynamic task, such as lifting. Results showed that FFT_MDF algorithm is well suited for the estimation of back muscle fatigue from the view point of computation time. The negative slope of a regression line fitted to the median frequency values of back muscle EMG signal was taken as an indication of muscle fatigue. The slope of muscle fatigueness with FFT_MDF method shows the similarity of 77.8% comparing with CP_MDF(median frequency estimation based on Cohen Posch distribution) method.

• 대한전자공학회논문지SP
• /
• 제43권1호
• /
• pp.1-8
• /
• 2006

본 논문은 다중 참조영상(multiple reference image)에 적용 가능한 새로운 고속 전역탐색 움직임 추정 기법을 제안한다. 제안된 방법은 기존의 비트율을 고려한 연속제거알고리즘(rate constrained successive elimination algorithm: RSEA)을 다중 참조영상에 확대 적용하는 방법이다. 첫 번째 참조영상에 대한 움직임 추정의 계산량에 비해 그 이후 참조영상에 대한 움직임 추정의 계산량이 적어질 수 있음을 보일 것이다. 계산량 감축을 위해, 본 논문에서 최적 움직임 벡터의 후보 블록의 개수를 감소시킬 수 있는 새로운 조건을 소개한다. 실험 결과을 통해 제안된 방법이 기존의 RSEA과 동일한 움직임 추정오차를 가지면서도 계산량을 감소시킴을 보일 것이다.

• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.317-328
• /
• 2000

This paper presents an effective approach to collision-free motion planning of a robot in the work-space including time-varying obstacles. The free arc is defined as a set composed of the configuration points of the robot satisfying collision-free motion constraint at each sampling time. We represent this free arc with respect to the new coordinate frame centered at the goal configuration and there for the collision-free path satisfying motion constraint is obtained by connecting the configuration points of the free arc at each sampling mined from the sequence of free arcs the optimality is determined by the performance index. Therefore the complicated collision-free motion planning problem of a robot is transformed to a simplified SUB_Optimal Collision Avoidance Problem(SOCAP). We analyze the completeness of the proposed approach and show that it is partly guaranteed using the backward motion. Computational complexity of our approach is analyzed theoretically and practical computation time is compared with that of the other method. Simulation results for two cally and practical computation time is compared with that of the other method. Simulation results for two SCARA robot manipulators are presented to verify the efficacy of the proposed method.

• 한국자동차공학회논문집
• /
• 제12권4호
• /
• pp.173-180
• /
• 2004

The tread pattern of a tire has an important effect on tire performances such as handling, wear, noise, hydroplaning and so on. However, a finite element analysis of a patterned tire with detailed tread blocks has been limited owing to the complexity of making meshes for tread blocks and the huge computation time. The computation time has been shortened due to the advance in the computer technology. The modeling of tread blocks usually requires creating a solid model using a CAD software. Therefore it is a very complicated and time-consuming job to generate meshes of a patterned tire using a CAD model. A new efficient and convenient method for generating meshes of a patterned tire has been developed. In this method, 3-D meshes of tread pattern are created by mapping 2-D meshes of tread geometry onto 3-D tread surfaces and extruding them through tread depth. Then, the tread pattern meshes are assembled with the tire body meshes by the tie contact constraint. Residual aligning torque and frictional energy are calculated by using a patterned tire model and compared to the experimental results. It is shown that the calculated results of a patterned tire model are in a good agreement with the experimental ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3166-3179
• /
• 2013

A pre-processing system for adaptive noise removal is proposed based on the principle of identifying and filtering object regions and background regions. Human perception of images depends on bright, well-focused object regions; these regions can be treated with the best filters, while simpler filters can be applied to other regions to reduce overall computational complexity. In the proposed method, bright region segmentation is performed, followed by segmentation of object and background regions. Noise in dark, background, and object regions is then removed by the median, fast bilateral, and bilateral filters, respectively. Simulations show that the proposed algorithm is much faster than and performs nearly as well as the bilateral filter (which is considered a powerful noise removal algorithm); it reduces computation time by 19.4 % while reducing PSNR by only 1.57 % relative to bilateral filtering. Thus, the proposed algorithm remarkably reduces computation while maintaining accuracy.