• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.33-36
• /
• 2012

변이 탐색 범위는 스테레오 정합을 위한 변이 추정 알고리즘의 성능에 가장 큰 영향을 줄 수 있는 변수 중 하나이다. 일반적으로 이러한 변이 탐색 범위는 영상 전체의 최소 변이 값과 최대 변이 값의 범위로 정의된 전역적인 탐색 범위를 사용하게 된다. 이러한 전역적인 탐색 범위는 픽셀에 따라서 불필요한 범위에까지 탐색하게 하며, 이는 변이 추정의 성능적, 속도적 측면에서 좋지 않은 영향을 미치게 된다. 본 논문에서는 픽셀에 따라 변이 탐색 범위를 제한시키는 방법을 제안한다. 낮은 계산 복잡도를 갖는 간단한 변이 추정 알고리즘을 통해 먼저 변이 지도를 생성하여 각 픽셀 당 윈도우를 대응하여 변이 히스토그램을 만든다. 변이 히스토그램에 적응적인 임계 값을 적용하여 픽셀당 변이 후보군을 결정한다. 전역적인 변이 탐색 범위와 제안하는 방법으로 제한된 변이 탐색 범위를 각각 동일한 변이 추정 알고리즘에 적용해 보는 실험을 통해 제안하는 방법의 성능을 분석하였다. 실험 결과로부터 제안하는 방식은 변이 추정 알고리즘의 정확도 측면의 성능을 향상시켰고, 알고리즘의 속도를 평균 5배 이상 향상시켜주는 결과를 보여주었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.53-56
• /
• 2005

NTSS(New Three-Step Search Algorithm)는 대표적인 Fast BMA(Block Matching Algorithm)인 TSS(Three-Step Search Algorithm)에 중앙 편향적(Center-Biased) 특성을 고려하여 향상시킨 방법이다. 그러나 NTSS는 움직임이 작은 영상인 경우에는 TSS보다 개선된 성능을 보여주지만, 움직임이 큰 영상에 대해서는 TSS와 큰 차이가 없으며 탐색영역이 커질수록 오히려 성능이 떨어지는 단점이 있다. 본 논문에서는 움직임 벡터의 특성에 맞는 탐색영역을 적용시킴으로써 탐색영역의 증가로 발생되는 NTSS의 단점을 보완하여 움직임이 큰 영상에 대해서도 향상된 성능을 갖는 방법을 제안한다. 제안된 방법을 적용 하였을 때 움직임이 작은 영상에서는 기존의 방법과 동일한 결과를 얻었으며 움직임이 큰 영상에서는 최고 0.5dB이상 성능이 개선되었다.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.343-346
• /
• 2003

본 논문에서는 최신 동영상 압축 표준 규격 H.264에서 화면 간 예측 부호화시 참조 화면 수가 제한되어 있을 때 부호화 효율을 최대화할 수 있는 적웅적 참조 화면 선택 기법을 제안하였다. 참조 화면 선택 시 시간적인 거리를 우선시 하는 현재 방식은 부호화 효율 측면에서 최적의 선택과는 거리가 있다. 따라서 참조 화면 선택에 있어서 실시간 온라인 상황을 가정하고 부가적인 계산을 최소화하는 것을 조건으로 했을 때 대표 화면과의 간접 비교를 통하여 현재 참조 화면들 간 상호 유사성이 가장 큰 화면을 제외하는 방법을 통해 문제를 해결하고자 하였다. 화면 간 예측 부호화 시 참조 화면 간 중복되는 요소를 최대한 줄이는 방향으로 참조 화면을 선택해 나감으로서 참조되는 샘플들을 다양화할 수 있다. 참조 화면 간 상호 유사성 판별은 대표 화면과 각 참조 화면 간 움직임 정보를 고려해 화면 간 부호화시 계산되는 8*8 블록의 R-D 비용함수 값을 사용하였다. 실험 결과 기존의 슬라이딩 윈도우 방식을 이용한 참조 화면 선택 방법에 비해 부가적인 계산이 거의 없이 부호화 효율의 개선이 있었으며 그 개선 정도는 기존의 방식에서 참조 화면을 $1{\sim}2$장 더 사용한 결과와 같았다. 이는 기존의 방법에 의해 참조 화면을 선택할 경우 나타나는 참조 화면 간 중복성을 줄였기 때문이다.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.8
• /
• pp.371-378
• /
• 2002

This paper presents the rapid and accurate algorithm for fault detection and location estimation in the transmission line. This algorithm uses wavelet transform for fault detection and harmonics elimination and utilizes least square error method for fault impedance estimation. Wavelet transform decomposes fault signals into high frequence component Dl and low frequence component A3. The former is used for fault phase detection and fault types classification and the latter is used for harmonics elimination. After fault detection, an adaptive data window technique using LSE estimates fault impedance. It can find a optimal data window length and estimate fault impedance rapidly, because it changes the length according to the fault disturbance. To prove the performance of the algorithm, the authors test relaying signals obtained from EMTP simulation. Test results show that the proposed algorithm estimates fault location within a half cycle after fault irrelevant to fault types and various fault conditions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.9-16
• /
• 2006

This Paper proposes an adaptive error diffusioThis paper proposes an adaptive error diffusion algorithm for text enhancement followed by an efficient text segmentation that uses the maximum gradient difference (MGD). The gradients are calculated along with scan lines, and the MGD values are filled within a local window to merge the potential text segments. Isolated segments are then eliminated in the non-text region filtering process. After the left segmentation, a conventional error diffusion method is applied to the background, while the edge enhancement error diffusion is used for the text. Since it is inevitable that visually objectionable artifacts are generated when using two different halftoning algorithms, the gradual dilation is proposed to minimize the boundary artifacts in the segmented text blocks before halftoning. Sharpening based on the gradually dilated text region (GDTR) prevents the printing of successive dots around the text region boundaries. The error diffusion algorithm with edge enhancement is extended to halftone color images to sharpen the tort regions. The proposed adaptive error diffusion algorithm involves color halftoning that controls the amount of edge enhancement using a general error filter. The multiplicative edge enhancement parameters are selected based on the amount of edge sharpening and color difference. Plus, the additional error factor is introduced to reduce the dot elimination artifact generated by the edge enhancement error diffusion. By using the proposed algorithm, the text of a scanned image is sharper than that with a conventional error diffusion without changing background.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.60-68
• /
• 2012

Current wireless sensor networks are considered to support more complex operations ranging from military to health care which require energy-efficient and timely transmission of large amounts of data. In this paper, we propose an adaptive temporal suppression algorithm which exploits a temporal correlation among sensor readings. The proposed scheme can significantly reduce the number of transmitted sensor readings by sensor node, and consequently decrease the energy consumption and delay. Instead of transmitting all sensor readings from sensor node to sink node, the proposed scheme is to selectively transmit some elements of sensor readings using the adaptive temporal suppression, and the sink node is able to reconstruct the original data without deteriorating data quality by linear interpolation. In our proposed scheme, sensing data stream at sensor node is divided into many small sensing windows and the transmission ratio in each window is decided by the window complexity. It is defined as the number of a fluctuation point which has greater absolute gradient than threshold value. We have been able to achieve up about 90% communication reduction while maintaining a minimal distortion ratio 6.5% in 3 samples among 4 ones.

• Archives of design research
• /
• v.12 no.4
• /
• pp.61-68
• /
• 1999

Most of the time, developers spend their energy to analyze the main function of the system or make source codes. As a result, they can not consider user interface on their own system and this is true in most programmer's world. But we want to consider the design concept in developing mechanism. In this case we have to upgrade the legacy system which maintaining the transmission system using the copper cables, and add the transmission system using the optical fiber cables. Therefore we design the user interface make easy for end users who are using the maintaining system on copper cables not to confuse the new system which include optical fibers. Especially, we are consider the developing model of design policy and real user to make easy to use new system. In this paper we will describe the instance to adapt the design concept on Broadband Access Network Operation Support System.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.1-14
• /
• 2011

This paper analyzes the fairness and efficiency of channel sharing when heterogeneous wireless networks that have different transmission power and/or coverage coexist with the contention-based channel access protocol. First, we show that the existing CSMA (carrier sensing multiple access) protocol, that is a prevailing contention-based mechanism, results in significant unfairness of channel access because of (1) the asymmetric capability of carrier sensing and (2) the blindness of binary exponential backoff and link adaptation mechanisms to the interference-driven transmission failures. Next, we derive the feasible region of carrier sensing thresholds that assures spatial reuse and fair channel sharing simultaneously. Moreover, we establish an analytical model for per-system throughput and investigate the effect of contention window size and transmission rate on the fairness and efficiency of channel sharing. Finally, we compare the performance of several approaches for fair channel sharing via simulations under various network configurations.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.137-145
• /
• 2004

In this paper, a new algorithm for the segmentation of the multi moving objects at the 3 dimension space and the method of measuring the distance from the camera to the moving object by using stereo video monitoring system is proposed. It get the input image of left and right from the stereo video monitoring system, and the area of the multi moving objects segmented by using adaptive threshold and PRA(pixel recursive algorithm). Each of the object segmented by window mask, then each coordinate value and stereo disparity of the multi moving objects obtained from the window masks. The distance of the multi moving objects can be calculated by this disparity, the feature of the stereo vision system and the trigonometric function. From the experimental results, the error rate of a distance measurement be existed within 7.28％, therefore, in case of implementation the proposed algorithm, the stereo security system, the automatic moving robot system and the stereo remote control system will be applied practical application.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1132-1137
• /
• 2011

In this paper, we propose Modified Multi CAMShift Algorithm(Modified Multi Continuously Adaptive Mean Shift Algorithm) that extracts skin color area and tracks several human body parts for real-time human tracking system. Skin color area is extracted by filtering input image in predefined RGB value range. These areas are initial search windows of hands and face for tracking. Gaussian background model prevents search window expending because it restricts skin color area. Also when occluding between these areas, we give more weights in occlusion area and move mass center of target area in color probability distribution image. As result, the proposed algorithm performs better than the original CAMShift approach in multiple object tracking and even when occluding of objects with similar colors.