• ETRI Journal
• /
• v.46 no.3
• /
• pp.392-403
• /
• 2024

Even though generalized frequency division multiplexing is an alternative waveform method expected to replace the orthogonal frequency division multiplexing in the future, its implementation must alleviate channel effects. Least-squares (LS), a low-complexity channel estimation technique, could be improved by using the discrete Fourier transform (DFT) without increasing complexity. Unlike the usage of the LS method, the DFT-based method requires the receiver to know the channel impulse response (CIR) length, which is unknown. This study introduces a simple, yet effective, CIR length estimator by utilizing LS estimation. As the cyclic prefix (CP) length is commonly set to be longer than the CIR length, it is possible to search through the first samples if CP is larger than a threshold set using the remaining samples. An adaptive scale is also designed to lower the error probability of the estimation, and a simple signal-to-interference-noise ratio estimation is also proposed by utilizing a sparse preamble to support the use of the scale. A software simulation is used to show the ability of the proposed system to estimate the CIR length. Due to shorter CIR length of rural area, the performance is slightly poorer compared to urban environment. Nevertheless, satisfactory performance is shown for both environments.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.676-679
• /
• 2006

In this letter, we propose an adaptive hard handoff algorithm with a dynamic hysteresis value based on the received signal strength from the serving base station, for mobile cellular communication systems. A discrete-time method is presented to evaluate handoff algorithms analytically. Performance is evaluated in terms of the average number of handoffs, the probability of link degradation, and the average handoff delay. Numerical results and simulations demonstrate that the proposed algorithm outperforms the handoff algorithm with fixed hysteresis values and the handoff algorithm using both threshold and hysteresis.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4E
• /
• pp.178-182
• /
• 2002

In this paper, we propose an adaptive wavelet method for car interior noise cancellation. For this purpose, we use a node dependent threshold which minimizes the Bayesian risk. We propose a noise estimation method based on spectral entropy using histogram of intensity and a candidate best basis instead of Donoho's best bases. And we modify the hard threshold function. Experimental results show that the proposed algorithm is more efficient, especially to heavy noisy signal than conventional one.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.1
• /
• pp.113-118
• /
• 2011

This paper proposes computer visual inspection algorithms for PCB defects which are found in a manufacturing process. The proposed method can detect open circuit and short circuit on bare PCB without using any reference images. It performs adaptive threshold processing for the ROI (Region of Interest) of a target image, median filtering to remove noises, and then analyzes connected components of the binary image. In this paper, the connected components of circuit pattern are defined as 6 types. The proposed method classifies the connected components of the target image into 6 types, and determines an unclassified component as a defect of the circuit. The analysis of the original target image detects open circuits, while the analysis of the complement image finds short circuits. The machine vision inspection system is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiment results show that the proposed algorithms are quite successful.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.587-595
• /
• 2011

In this paper, we focus on the issue of automatic selection for multi-level threshold, and we greatly improve the efficiency of Otsu's method for image segmentation based on genetic algorithm. We have investigated and evaluated the performance of the Otsu and Valley-emphasis threshold methods. Based on this observation we propose a method for automatic threshold method that segments an image into more than two regions with high performance and processing in real-time. Our paper introduced new peak detection, combines with evolution algorithm using MAGA (Modified Adaptive Genetic Algorithm) and HCA (Hill Climbing Algorithm), to find the best threshold automatically, accurately, and quickly. The experimental results show that the proposed evolutionary algorithm achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.195-202
• /
• 2005

An adaptive segmentation algorithm is used to efficiently target decisions in local non-stationary images. Until now, several adaptive approaches have been proposed as a method of segmentation. However, they can't be directly used for radar target detection because a radar signal has different characteristics from general images. Generally, a histogram of radar signal shows that targets have a relatively small number of frequency functions compared to the background and distribution of background, which have several shapes as the environment changes. In this paper, we propose an adaptive segmentation algorithm using a histogram chord which is a right-down line from maximum pick of frequency function. The proposed method provides thresholds which are optimum for several radar environments because the used chord for threshold search is not significantly effected by interference conditions. Simulation results show that the proposed method is superior to the traditional algorithms, global threshold method and distribution median method, with respect to detection performance.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.55-62
• /
• 2001

In this paper, we propose a new adaptative pruning algorithm which effectively reduces the search space during the recognition process. As maximum probabilities between neighbor frames are highly interrelated, an efficient pruning threshold value can be obtained from the maximum probabilities of previous frames. The main idea is to update threshold at the present frame by a combination of previous maximum probability and hypotheses probabilities. As present threshold is obtained in on-going recognition process, the algorithm does not need any pre-experiments to find threshold values even when recognition tasks are changed. In addition, the adaptively selected threshold allows an improvement of recognition speed under different environments. The proposed algorithm has been applied to a Korean Address recognition system. Experimental results show that the proposed algorithm reduces the search space of average 14.4% and 9.14% respectively while preserving the recognition accuracy, compared to the previous method of using fixed pruning threshold values and variable pruning threshold values.

• Current Optics and Photonics
• /
• v.7 no.4
• /
• pp.387-397
• /
• 2023

Tooth surface shape error is an important parameter in gear accuracy evaluation. When tooth surface shape error is measured by laser interferometry, the gear interferogram is highly distorted and the gray level distribution is not uniform. Therefore, it is important for gear interferometry to extract the foreground region from the gear interference fringe image directly and accurately. This paper presents an approach for foreground extraction in gear interference images by leveraging the sinusoidal variation characteristics shown by the interference fringes. A gray level mask with an adaptive threshold is established to capture the relevant features, while a local variance evaluation function is employed to analyze the fluctuation state of the interference image and derive a repair mask. By combining these masks, the foreground region is directly extracted. Comparative evaluations using qualitative and quantitative assessment methods are performed to compare the proposed algorithm with both reference results and traditional approaches. The experimental findings reveal a remarkable degree of matching between the algorithm and the reference results. As a result, this method shows great potential for widespread application in the foreground extraction of gear interference images.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.7-12
• /
• 2003

This paper propose the 1-pass spatially adaptive wavelet thresholding for image denosing. The method of wavelet thresholding for denosing, has been concentrated on finding the best uniform threshold or best basis. However, not much has been done to make this method adaptive to spatially changing statistics which is typical of a large class of images. This spatially adaptive thresholding is extended to the overcomplete wavelet expansion, which yields better results than the orthogonal transform. Experiments show that this proposed method does indeed remove noise significantly, especially for large noise power. Experimental results show that the proposed method outperforms level dependent thresholding techniques and is comparable to spatial Wiener filtering method, 2-pass spatially adaptive wavelet thresholding method in matlab.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.4
• /
• pp.229-237
• /
• 2017

In this paper we propose an auto tonal detection method which exploits short term stationary when targets located in a detection beam area and then additional methods are proposed in order to reduce the computational complexity of the proposed method. The proposed method is adaptive to input signals and robust against interference caused by multiple targets because it compares an expected value of input signals with a threshold value which are estimated from a single beam while signals are keep stationary. The performances of the proposed methods are evaluated using by simulated data and acquired data from real ocean. The proposed method has shown better performance than conventional CFAR (Constant False Alarm Rate) methods.