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

With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.35-44
• /
• 2004

Recently announced TCP Vegas predicts the degree of congestion in the network and then control the congestion window size. Thus it shows better performance than TCP Reno. however, TCP vegas does not assume any network model, its congestion window control is very limited. Because or this limitation, TCP vegas still can not adapt to fast changing available bandwidth. In this paper, we introduce a new TCP algorithm which adapts to fast changing available bandwidth well. To devise such a TCP, we model the end to end network of TCP connection as a queueing system and finds congestion window size which can utilize the available bandwidth sufficiently but not make the network congested. The simulation results show that our algorithm adapts to the avaliable bandwidth faster than TCP vegas and as a results, when the available bandwidth is changing rapidly, our algorithm not only operates more stably than TCP Vegas, but also it shows higher thruput than TCP Vegas.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.74-80
• /
• 2008

Spatio-temporal filters are capable of reducing noise from moving pictures, which cannot be dealt with by spatial filters. However, the algorithm is too complicated to be realized as hardware. We implemented a real-time spatio-temporal noise reduction system, using at most three frames, based upon adaptive mean filter algorithm. Some factors which interfere with hardware implementation were modified. Noise estimated from the previous frame was used to filter the current frame so that filtering could be conducted in parallel with noise estimation. This speeds up the system thereby enabling real-time execution. The form of filtering windows was also modified to facilitate synchronization. The proposed structure was implemented on Virtex 4 XC4VLX60, occupying 66% of total slices with 80MHz of the maximum operation frequency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.4
• /
• pp.391-397
• /
• 2003

This paper is about the digital image decimation algorithm which generates a value of decimated element by an average of a target pixel value and a value of neighbor intelligible element to adaptively reflect the merits of ZOD method and FOD method on the decimated image. First, a target pixel located at the center of sliding window is selected, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each intelligible weight. Next, a value of neighbor intelligible element is obtained by adding a value of the right neighbor pixel times its intelligible weight to a value of the lower neighbor pixel times its intelligible weight. The decimated image can be acquired by applying the process repetitively to all pixels in input image which generates the value of decimated element by calculating the average of the target pixel value and the value of neighbor intelligible element.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.22 no.5
• /
• pp.465-473
• /
• 2002

Images are easily corrupted by noise during the data transmission, data capture and data processing. A technical method of noise analyzing and adaptive filtering for reducing of quantum noise in radiography is presented. By adjusting the characteristics of the filter according to local statistics around each pixel of the image as moving windowing, it is possible to suppress noise sufficiently while preserve edge and other significant information required in reading. We have proposed adaptive weighted median(AWM) filters based on local statistics. We show two ways of realizing the AWM filters. One is a simple type of AWM filter, whose weights are given by a simple non-linear function of three local characteristics. The other is the AWM filter which is constructed by homogeneous factor(HF). Homogeneous factor(HF) from the quantum noise models that enables the filter to recognize the local structures of the image is introduced, and an algorithm for determining the HF fitted to the detection systems with various inner statistical properties is proposed. We show by the experimented that the performances of proposed method is superior to these of other filters and models in preserving small details and suppressing the noise at homogeneous region. The proposed algorithms were implemented by visual C++ language on a IBM-PC Pentium 550 for testing purposes, the effects and results of the noise filtering were proposed by comparing with images of the other existing filtering methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1587-1595
• /
• 2016

P wave is cardiac parameters that represent the electrical and physiological characteristics, it is very important to diagnose atrial arrhythmia. However, It is very difficult to detect because of the small size compared to R wave and the various morphology. Several methods for detecting P wave has been proposed, such as frequency analysis and non-linear approach. However, in the case of conduction abnormality such as AV block or atrial arrhythmia, detection accuracy is at the lower level. We propose P wave detection algorithm through adaptive threshold and QRS peak variability. For this purpose, we detected Q, R, S wave from noise-free ECG signal through the preprocessing method. And then we classified three pattern of P wave by peak variability and detected adaptive window and threshold. The performance of P wave detection is evaluated by using 48 record of MIT-BIH arrhythmia database. The achieved scores indicate the average detection rate of 92.60%.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.4
• /
• pp.33-39
• /
• 2014

In this paper, a new on-chip aging sensing circuit based on flip-flops is proposed to detect a circuit failure of MOSFET digital circuits casued by aging phenomenon such as HCI and BTI. The proposed circuit uses timing windows to warn against a guardband violation of sequential circuits, and generates three warning bits right before circuit failures occur. The generated bits can apply to an adaptive self-tuning method for reliable system design as control signals. The aging sensor circuit has been implemented using 0.11um CMOS technology and evaluated by $4{\times}4$ multiplier with power gating structure.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.437-438
• /
• 2008

본 논문은 유선 타블렛에서 공진 회로가 적용된 펜의 위치를 알 수 있는 좌표측정 방법을 소개한다. 현재 연구하고 있는 유선 타블렛은 공진회로가 적용된 펜과 루프코일에 라인안테나가 적용된 패드를 사용한다. 공진회로가 적응된 펜을 패드 위에 놓게 되면, 전자기 유도 현상에 의해 발생된 전류를 측정하여 현재 펜의 위치를 알 수 있다. 루프코일에 라인안테나를 설치하면 이를 Differential coil이라고 부르는데 루프 안테나와 라인 안테나 사이에 흐리는 전류를 알 수 있다. 이때 라인안테나를 기준으로 펜의 위치에 따라서 전류량도 변화하며, 또한 라인 안테나를 기준으로 왼쪽과 오른쪽의 전류의 극성이 다르다. 루프회로에 라인안테나를 겹쳐 놓은 형태인 타블렛의 패드는 라인안테나를 순차적으로 변경해 가면서 공진 회로가 적용된 펜에 의해 전자기 유도 현상에 의해 발생된 전류를 측정하게 되며, 이 측정된 값들을 비교하여 좌표를 알아낼 수 있다. 하지만 그 전류의 변화는 아주 적어 직접적인 신호로는 좌표를 알아낼 수 없다. 그래서 우리는 차등증폭을 이용하여 신호를 증폭시켜 신호를 변형한다. 이 변형된 신호를 이용하여 각 라인안테나에서 측정된 전류세기로 좌표를 알아낸다. 이런 연구에서는 전자기 유도현상에 의해 발생된 전류의 세기를 이용해 실제 윈도우 프로그램에서 펜의 위치를 알 수 있는 방법을 찾고, 구현된 모습을 보여준다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.