• Title/Summary/Keyword: Recovery algorithm

Search Result 555, Processing Time 0.029 seconds

A Method to Calculate Charge for Reactive Power Service under Competition of Electric Power Utilities

  • Ro, Kyoung-Soo;Park, Sung-Chul
    • KIEE International Transactions on Power Engineering
    • /
    • v.11A no.4
    • /
    • pp.39-44
    • /
    • 2001
  • As electric power systems have been moving from vertically integrated utilities to a deregulated environment, the charging of reactive power management is a new challenging them for market operators. This paper proposes a new methodology to compute the costs of providing reactive power management service in a competitive electrical power market. The proposed formulation, which is basically different from those shown in the literature, consists of two parts. One is to recover investment capital costs of reactive power supporting equipment based on a reactive power flow tracing algorithm. The other is to recover operational costs based on variable spot prices using the optimal power flow algorithm. The charging shapes resulted from the proposed approach exhibit a quite good meaning viewed from a practical sense. It turns out that reactive power charged are mostly due to recovery of capital costs and slightly due to recovery of operational costs. The methods can be useful in providing additional insight into power system operation and can be used to determined tariffs of a reactive power management service.

  • PDF

New Initialization method for the robust self-calibration of the camera

  • Ha, Jong-Eun;Kang, Dong-Joong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.752-757
    • /
    • 2003
  • Recently, 3D structure recovery through self-calibration of camera has been actively researched. Traditional calibration algorithm requires known 3D coordinates of the control points while self-calibration only requires the corresponding points of images, thus it has more flexibility in real application. In general, self-calibration algorithm results in the nonlinear optimization problem using constraints from the intrinsic parameters of the camera. Thus, it requires initial value for the nonlinear minimization. Traditional approaches get the initial values assuming they have the same intrinsic parameters while they are dealing with the situation where the intrinsic parameters of the camera may change. In this paper, we propose new initialization method using the minimum 2 images. Proposed method is based on the assumption that the least violation of the camera’s intrinsic parameter gives more stable initial value. Synthetic and real experiment shows this result.

  • PDF

Implementation of QPSK Demodulator for IMT-2000 System (IMT-2000 시스템을 위한 QPSK 복조기 구현)

  • 김상명;김상훈;황원철;정지원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.226-230
    • /
    • 2000
  • In this paper, we implemented the QPSK demodulator with a CPLD chip, and examined the results. DD(Decision Directed)-Gardner algorithm is used for STR loop and Decision-Directed algorithm is used for CPR loop. The speed of the QPSK demodulator implemented in FLEX10K chip can be guaranteed approximately 2[Mbpsl] transmission speed. In practical designed by ASIC, the speed is faster than that of CPLD by 5-6 times.

  • PDF

Recovery Method of missing Motion Vector using Cluster (클러스터를 이용한 손실된 움직임 벡터 복원 방법)

  • 손남례;이귀상
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2371-2374
    • /
    • 2003
  • In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image qualify In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by clustering the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

  • PDF

Design and Implementation of Reed-Solomon Code for 2-Dimensional Bar Code System (Reed-Solomon 알고리즈을 이용한 2차원 바코드 시스템에서 오류 극복 기능 설계 및 구현)

  • Jang, Seung-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1491-1499
    • /
    • 2000
  • This paper is designed and implemented the data recovery mechanism for 2-D (2-dimensional) bar code system. The data recovery algorithm used the modified Reed-Solomon algorithm and it is implemented into 2-D bar code system. There are 7 types of 2-D bar code system, which are 21x21, 25x25, 41x41, 73x73, 101x101, 177x177. This paper has been experimented that how many data is saved among several 2-D bar code types and how many data re recovered. In the first experiment, the big size 2-D bar code system has many ECC codeword. Therefore, original data cannot be assigned to 2-D bar code system. In the second experiment, even if 35∼40% loss dta for the 2-D bar code system, the 2-D bar code system could have been recovered to original data.

  • PDF

A Method to Calculate a Service Charge for Reactive Power/Voltage Control under Competition of Power Utilities (전력시장 경쟁체제에서 무효전력/전압 제어 서비스의 가격책정 방법에 관한 연구)

  • Ro, Kyoung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2001.11b
    • /
    • pp.77-82
    • /
    • 2001
  • As electric power systems have been moving from vertically integrated utilities to a deregulated environment, the charging of reactive power management is a new challenging theme for market operators. This paper proposes a new methodology to compute the costs of providing reactive power management service in a competitive electrical power market. The proposed formulation, which is basically different from those shown in the literature, consists of two parts. One is to recover investment capital costs of reactive power supporting equipment based on a reactive power flow tracing algorithm. The other is to recover operational costs based on variable spot prices using the optimal power flow algorithm. The charging shapes resulted from the proposed approach exhibit a quite good meaning viewed from a practical sense. It turns out that reactive power charges are mostly due to recovery of capital costs and slightly due to recovery of operational costs. The method can be useful in providing additional insight into power system operation and can be used to determine tariffs of a reactive power management service.

  • PDF

Chip Timing Recovery Algorithm Robust to Frequency Offset and Time Variant Fading

  • Kang, Hyung-Wook;Lee, Young-Yong;Park, Hyung-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1948-1951
    • /
    • 2002
  • In this paper, we propose a chip timing recovery algorithm that is robust to frequency offset and time variant fading environments for DS/CDMA. The proposed structure is a modified non-coherent Delay Locked Loop (DLL) that employs a decimator. Analytical expression for the proposed non-coherent DLL S-curve and steady-state timing jitter is derived and confirmed by computer simulation. The results show that the proposed structure can reduce a steady-state timing jitter of the regenerated spreading code replica to frequency offset and time-variant fading in mobile radio channel, especially in very low SNR.

  • PDF

Congestion Control in TCP over ATM-UBR Networks

  • Park, Woo-Chool;Park, Sang-Jun;Rhee, Byung-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.88-91
    • /
    • 2000
  • In this paper we approach the problem of congestion control for TCP traffic over ATM-UBR networks by focusing on the fact that to get best performance. We study how to efficiently support TCP traffic in the subnet ATM model, when ATM is only a single link in the whole path. We show that when UBR connection. We analyze the ATM-UBR network service using the BSD 4.3 Reno, Tahoe TCP. However we found the fact that the characteristic of fast recovery algorithm makes a serious degradation of performance in multiple cell loss drop situation. We propose new fast recovery algorithm to solve the problem.

  • PDF

Depth Map Generation Algorithm from Single Defocused Image (흐린 초점의 단일영상에서 깊이맵 생성 알고리즘)

  • Lee, Yong-Hwan;Kim, Youngseop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.15 no.3
    • /
    • pp.67-71
    • /
    • 2016
  • This paper addresses a problem of defocus map recovery from single image. We describe a simple effective approach to estimate the spatial value of defocus blur at the edge location of the image. At first, we perform a re-blurring process using Gaussian function with input image, and calculate a gradient magnitude ratio with blurring amount between input image and re-blurred image. Then we get a full defocus map by propagating the blur amount at the edge location. Experimental result reveals that our method outperforms a reliable estimation of depth map, and shows that our algorithm is robust to noise, inaccurate edge location and interferences of neighboring edges within input image.

3D multiple objects recognition using a disparity image

  • Park, Hongpyo;Park, Seungjoon;Kim, Sungjin;Sangchol Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.34.3-34
    • /
    • 2002
  • 1. Introduction 2. Stereovison Algorithm 3. Superquadric Models 4. Recovery of Superquadric Models 5. Conclusions

  • PDF