• 한국ITS학회:학술대회논문집
• /
• 2010.05a
• /
• pp.79-81
• /
• 2010

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2714-2726
• /
• 1997

In this paper, adaptive symbol changes-based medical image compression method is presented. First, the differenctial image domain is obtained using the differentiation rules or obaptive predictors applied to original mdeical image. Also, the algorithm determines the context associated with the differential image from the domain. Then prediction symbols which are thought tobe the most probable differential image values are maintained at a high value through the adaptive symbol changes procedure based on estimates of the symbols with polarity coincidence between the differential image values to be coded under to context and differential image values in the model template. At the coding step, the differential image values are encoded as "predicted" or "non-predicted" by the binary adaptive arithmetic encoder, where a binary decision tree is employed. The simlation results indicate that the prediction hit ratios of differential image values using the proposed algorithm improve the coding gain by 25% and 23% than arithmetic coder with ISO JPEG lossless predictor and arithmetic coder with differentiation rules or adaptive predictors, respectively. It can be used in compression part of medical PACS because the proposed method allows the encoder be directly applied to the full bit-planes medical image without a decomposition of the full bit-plane into a series of binary bit-planes as well as lower complexity of encoder through using an additions when sub-dividing recursively unit intervals.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.817-825
• /
• 2019

Difference equation is useful for control algorithm in the microprocessor. To approximate a derivative values from sampled data, it is used the methods of forward, backward and central differences. The key of computing discrete derivative values is the finite difference coefficient. The focus of this paper is a new approach method of finite difference formula. And we apply the proposed method to the recursive least squares(RLS) algorithm.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.359-363
• /
• 2009

가역 정보 은닉이 되기 위해서는, 비밀 정보가 삽입된 컨텐츠에서, 삽입된 비밀 정보 뿐만아니라, 원본 컨텐츠를 완벽하게 복구시킬 수 있어야 한다. 이미지 상에서 가역 정보 은닉을 할 때, 데이터의 삽입 용량이 크고, 왜곡이 작도록 설계해야 한다. 본 논문은 삽입 용량을 증가시키기 위해 데이터를 삽입시키는 차분값으로서 예측 오류 값을 이용하였고, 왜곡을 감소시키기 위해서 차분값을 정렬하고, 데이터 삽입 시에 최적화된 히스토그램 이동을 이용하였다. 본 논문에서는 이 세 가지 기술을 조합하여 가역 정보 은닉을 하는데 성공하였고, 최적화된 히스토그램 경계값을 구해내는 알고리즘이 제시되었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.143-150
• /
• 2009

In this paper, we present a spatial domain error concealment method to recover a lost block in intra-coded frames. The edge directions of the lost block are estimated by the difference values of the border pixels of the accurately received blocks. The lost block is interpolated according to the estimated edge directions. Our algorithm can adaptively recover a lost block according to the estimated edge direction. The distances between pixels are used as weights for interpolation. In spite of the low computational cost, the proposed method outperforms the previous methods in objective and subjective qualities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.999-1006
• /
• 2005

The difference threshold test (DTT) declares erasures whenever the difference between the largest and second largest energy detector outputs does not exceed a given threshold. we show that the DTT outperforms the ratio threshold test (RTT) for finite modulation size and diversity order in the detection of M-FSK signals. The asymptotic performance for infinite modulation size and diversity order is then investigated. It is shown that the minimum signal-to-noise ratio required to achieve error-free communication for the DTT is the same as that for the RTT.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.607-611
• /
• 2008

This paper proposes new video signature using spatio-temporal information for copy detection. The proposed video copy detection method is based on concentric circle partitioning method for each key frame. Firstly, key frames are extracted from whole video using temporal bilinear interpolation periodically and each frame is partitioned as a shape of concentric circle. For the partitioned sub-regions, 4 feature distributions of average intensity, its difference, symmetric difference and circular difference distributions are obtained by using the relation between the sub-regions. Finally these feature distributions are converted into binary signature by using simple hash function and merged together. For the proposed video signature, the similarity distance is calculated by simple Hamming distance so that its matching speed is very fast. From experiment results, the proposed method shows high detection success ratio of average 97.4% for various modifications. Therefore it is expected that the proposed method can be utilized for video copy detection widely.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.3
• /
• pp.23-30
• /
• 1985

When a digital filter implementation is based on a difference equation, the frequency characteristics cannot be obtained by direct computation, but be obtained by experiment or analogized by Z-transform. In this paper, the method to compute the frequency magnitude response of the function expressed in a difference equation is derived from PARSEVAL's relation. To verify the validity of this new method two types of digital filters are implemented. Both filters' characteristics are measured and their values are compared with the value obtained by a Z-transform and with the value by a difference equation. The result shows that the measured values and the values obtained by the difference equaton are more closer than the values by a Z-transform. And the difference-equaton-based filters' showed sharper roll off characteristics than the Z-transform-based filters. Therefore when a digital filter implementation is based on a difference equation, the characteristics computation by a difference equation predicts better practical results than based on Z-transform.

• Proceedings of the KSRS Conference
• /
• 2006.03a
• /
• pp.127-130
• /
• 2006

SRTM 데이터와 USGS의 NED (National Elevation Datasets) 데이터를 사용하였으며 두 데이터를 차분함으로써 식생수고도(vegetation height map)를 얻었다. 또한 차분값과 shape 파일에 포함된 식수년도의 비교를 통해 상관관계여부를 판단하고자 했다. 회귀분석을 통해 차분데이터와 식수년도 사이의 큰 상관관계가 존재함을 확인할 수 있었으며 결국 수령추정과 수령정보의 맵핑이 가능함을 보였다. 추가적으로 지역별 지형특성, 숲의 균일도 등에 의해 선형성이 영향을 받는지 관찰하였다.

• The Korean Journal of Financial Management
• /
• v.18 no.1
• /
• pp.1-21
• /
• 2001

주가가 장기기억과정에 의하여 생성되면 주가과정에 가해진 충격은 쌍곡선감소율로 소멸한다. 따라서 충격의 영향이 대단히 느리게 감소하여 충격이 지속성을 가진다. 반면 주가가 단기 기억과정을 따르면 지수율로 감소하여 소멸한다. 지수율감소는 충격의 영향을 급속히 소멸시키므로 충격의 영향이 조만간 소멸한다. 따라서 충격으로 변화된 주가는 평균으로 회귀한다. 충격의 영향이 영원히 존재하는 과정도 존재한다. 장기기억과정은 쪽거리차분과정 또는 분수차분과정이다. 차분모수가 분수일 것이 요구되는 시계열은 장기기억과정이다. 주가가 장기기억과정에 의하여 생성되고 있는지의 여부를 검정하였다. 장기기억과정을 형성시키는 차분모수는 분수차분모수이다. 일별 주가지수의 수익률을 사용하여 차분모수를 추정하였는 바 그 값이 0에 근접하고 있음이 밝혀졌다. 그러나 Kospi, Nasdaq과 Mib30은 장기기억모수가 0에 접근하고 있으나 0이 아니다. 따라서 이 지수들은 장기기억과정에 의하여 생성된다고 할 수 있다. 반면 Dow Jones, S&P 500와 Dax는 장기기억모수가 0이라는 가설이 기각되지 않고 있어 이 지수들은 단기기억과정을 따르고 있다. 따라서 평균회귀과정에 의하여 생성되고 있음을 알 수 있다.