• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

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

In this paepr, a Wiener filtering method in wavelet domain is proposed for restoring an image corrupted by additive white noise. The proposed method utilizes the characteristics of wavelet transform signals and the local statistics of each subband. When estimating the local statistics in each subband, the size of filter window is varied according to each scale. At this point, the local statistics in each wavelet subband is estimated only by using pixedls which have similar statistical property. Experimental results show that the proposed method has better performance over the conventional Lee filter with a window of fixed size.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.123-128
• /
• 2011

In this paper, we propose the improved noise power estimation in speech enhancement under various noise environments. The previous MS algorithm tracking the minimum value of finite search window uses the optimal power spectrum of signal for smoothing and adopts minimum probability. From the investigation of the previous MS-based methods it can be seen that a fixed size of the minimum search window is assumed regardless of the various environment. To achieve the different search window size, we use the noise classification algorithm based on the Gaussian mixture model (GMM). Performance of the proposed enhancement algorithm is evaluated by ITU-T P.862 perceptual evaluation of speech quality (PESQ) under various noise environments. Based on this, we show that the proposed algorithm yields better result compared to the conventional MS method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.997-1004
• /
• 2012

In enterprise software projects, performance issues have become more critical during recent decades. While developing software products, many performance tests are executed in the earlier development phase against the newly added code pieces to detect possible performance regressions. In our previous research, we introduced the framework to enable automated performance anomaly detection and reduce the analysis overhead for identifying the root causes, and showed Statistical Process Control (SPC) can be successfully applied to anomaly detection. In this paper, we explain the special performance trend in which the existing anomaly detection system can hardly detect the noticeable performance change especially when a performance regression is introduced and recovered again a while later. Within the fixed number of sampling period, the fluctuation gets aggravated and the lower and upper control limit get relaxed so that sometimes the existing system hardly detect the noticeable performance change. To resolve the issue, we apply dynamically tuned sampling window size based on the performance trend, and Fuzzy theory to find an appropriate size of the moving window.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.475-477
• /
• 2010

In the power saving mechanism specified in IEEE 802.11, all node use the sam ATIM window size. Since the ATIM window size critically affects throughput and energy consumption, a fixed ATIM window does not perform well in all situations. This paper proposes the efficient power management mechanism considering network characteristic in 802.11. To reflect the network characteristic, the paper uses th (m,k)-firm deadline technique. Simulation result shows that proposed mechanism outperforms the IEEE 802.11 power saving mechanism in terms of the amount of power consumed.

• Korean Journal of Remote Sensing
• /
• v.23 no.2
• /
• pp.113-117
• /
• 2007

In this paper, we propose a new method for determining automatically the size of the matching window using histogram of the gradient in order to improve the performance of stereo matching using one-meter resolution satellite imagery. For each pixel, we generate Flatness Index Image by calculating the mean value of the vertical or horizontal intensity gradients of the 4-neighbors of every pixel in the entire image. The edge pixel has high flatness index value, while the non-edge pixel has low flatness index value. By using the histogram of the Flatness Index Image, we find a flatness threshold value to determine whether a pixel is edge pixel or non-edge pixel. If a pixel has higher flatness index value than the flatness threshold value, we classify the pixel into edge pixel, otherwise we classify the pixel into non-edge pixel. If the ratio of the number of non-edge pixels in initial matching window is low, then we consider the pixel to be in homogeneous region and enlarge the size of the matching window We repeat this process until the size of matching window reaches to a maximum size. In the experiment, we used IKONOS satellite stereo imagery and obtained more improved matching results than the matching method using fixed matching window size.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1D
• /
• pp.153-160
• /
• 2009

In relation to digital elevation model(DEM) production using high resolution satellite imagery, existing studies present that DEM accuracy differently show according to land cover property. This study therefore proposes auto-selection method of window size for correlation matching according to land cover property of IKONOS Geo-level stereo image. For this, land cover classified image is obtained by IKONOS color image with four bands. In addition, correlation-coefficients are computed at regular intervals in pixels of the window-search area to shorten of matching time. As the results, DEM by the proposed method showed more accurate than DEM using the fixed window-size matching. We estimate that accuracy of the proposed DEM improved more than DEM by digital map and ERDAS in agricultural land.

• 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.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.93-103
• /
• 1999

To detect obstacles and lane-markers for driving vehicles, a new moving window scheme where moving windows are assigned to an image frame captured by a camera is addressed. For the detection of obstacles, it is important to estimate lane-markers precisely and rapidly. For this purpose, selecting some partes of an image frame at the expected lane locations, i.e., selecting window are generally adopted for extracting lane-markers efficiently. In this paper, a new scheme that extracts lane-markers precisely by assigning variable size windows at the expected locations of lane-markers considering the road curvature and finally detects obstacles within a driving lane is proposed. The accuracy improvement using this moving window scheme is showed by comparing to the conventional fixed window method and to using radar to laser sensors.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.1
• /
• pp.81-88
• /
• 2004

Turbo code has been adopted in the 3GPP standard, since its performance is very close to the Shannon limit. However, the turbo decoder requires a lot of computations and the amount of the memory increases as the block size of turbo codes becomes larger. In order to reduce the complexity of the turbo decoder, the Log-MAP, the Max-Log-MAP and the sliding window algorithm have been proposed. In this paper, the performance of turbo codes adopted in the 3GPP standard is analyzed by using the floating point and the fixed point implementation. The efficient decoding method is also proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.