• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.889-897
• /
• 2004

In this Paper, we propose the algorithm to provide stable communication in OFDM system under the highly interfered environment by the same/different systems which use same bandwidth or other jamming signal, i.e., radar signal. The proposed Adaptive Subcarrier Assignment(ASA) method first estimates the received power of each subcarrier in the block or fin or OFDM receiver. Then we estimate the threshold level which is the average power of the transmitted OFDM signal with AWGN. The highly interfered subcarriers, which are greater powers than the specified threshold level, are rejected in the next transmission and the only non-interfered subcarriers are selected as the next transmission. This algorithm provides stable communication in any OFDM systems without changing the physical layer under the highly interfered communication environment. We estimated the status of the subcarriers based on the bandwidth and power of the jamming signal and showed the performance of the proposed algorithm by the simulation.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.495-498
• /
• 1999

In this paper, we propose the adaptive Odd/Even Multi-shell Median Filter(adaptive O/E MMF) to improve the defect that Modified Multi-shell Median Filter(MMMF) can not recover missing lines of vertical and cross direction. This filter uses odd/even multi-shells and new proposed threshold strategy The performance of the proposed filter is evaluated over image 'airfield 'by using MATLAB. As the proposed threshold strategy eliminate the number of redundant replacement, it suppresses impulse noise and recovers missing lines.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1E
• /
• pp.1-10
• /
• 2008

A noise suppression algorithm is proposed for nonstationary noisy environments. The proposed algorithm is different from the conventional approaches such as the spectral subtraction algorithm and the minimum statistics noise estimation algorithm in that it classifies speech and noise signals in time-frequency bins. It calculates the ratio of the variance of the noisy power spectrum in time-frequency bins to its normalized time-frequency average. If the ratio is greater than an adaptive threshold, speech is considered to be present. Our adaptive algorithm tracks the threshold and controls the trade-off between residual noise and distortion. The estimated clean speech power spectrum is obtained by a modified gain function and the updated noisy power spectrum of the time-frequency bin. This new algorithm has the advantages of simplicity and light computational load for estimating the noise. This algorithm reduces the residual noise significantly, and is superior to the conventional methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.473-480
• /
• 2004

This paper presents a new edge detection algorithm in color image. The proposed Adaptive morphological Wavelet-CNN algorithm is divided into two parts : The Adaptive morpholog and WCNN(Wavelet Cellular Neural Networks). It detects the optimal edge with applying this color image to WCNN algorithm, after it does level up a boundary side of a color image by using the adaptive morphology as the threshold of an input color image. Also, it is used not a conventional fixed mask edge detection method but variable mask method which is called a variable BBM. Finally, to show the feasibility of the proposed algorithm, this paper provides by simulation that the color image consists of 30.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.208-217
• /
• 2012

This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.7
• /
• pp.45-55
• /
• 1999

In this paper, we used the WLMS(Wavelet domain Least Mean Square) adaptive filter based on the wavelet transform to cancel grain noise. Usually, grain noise occurs in changes of the crystalline structure of metals in high temperature environment. It makes the detection of flaw difficult. The WLMS adaptive filtering algorithm establishes the faster convergence rate by orthogonalizaing the input vector of adaptive filter as compared with that of LMS adaptive filtering algorithm in time domain. We implemented the WLMS adaptive filter by using the delayed version of the primary input vector as the reference input vector and then implemented the CA-CFAR(Cell Averaging- Constant False Alarm Rate) threshold estimator. CA-CFAR threshold estimator enables to detect the flaw and back echo signals automatically. Here, we used the output signals of adaptive filter as its input signal. To Cow the statistical characteristic of ultrasonic signals corrupted by grain noise, we performed run test. The results showed that ultrasonic signals are nonstationary signal, that is, signals whose statistical properties vary with time. The performance of each filter is appreciated by the signal-to-noise ratio. After LMS adaptive filtering in time domain, SNR improves to about 2-3㏈ but after WLMS adaptive filtering in wavelet domain, SNR improves to about 4-6㏈.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.23-33
• /
• 2009

A shot change detection technique is an important technique for effective management of video data, thus it requires an adaptive algorithm for various video sequences to detect an accurate shot change frames. In this paper, we propose an adaptive shot change detection algorithm using histogram mean of frames within extension sliding window. Our algorithm calculates a frame feature value using histogram and defines an adaptive threshold using an average of histogram mean of frames within the extension sliding window and determines a shot change by comparing the feature value and the threshold. We obtained better detection rate than the conventional methods maximally by 15% in the experiment with the same test sequence. We verified real-time operation of shot change detection in the hardware platform with low performance by implementing it on TVUS HM-900 PLUS model of Homecast. The Proposed algorithm can be useful in the hardware platform such as portable multimedia player(PMP) or cellular phone with low CPU performance.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.391-395
• /
• 2011

Cognitive radio (CR) technique is a useful tool for improving spectrum utilization by detecting and using the vacant frequency bands while avoiding interference to the primary user. The sensing performance in a CR network can be improved by allowing some CR users to perform cooperative spectrum sensing. In this paper, we propose a new sensing algorithm that utilizes an adaptive energy threshold for cooperative spectrum sensing in which a changeable energy threshold is adopted by the CR users for improving local sensing performance. Through the proposed scheme, the reliability of global decision can be enhanced mainly due to the improvement in local sensing performance.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1343-1358
• /
• 2020

In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.47-50
• /
• 2000

In this paper, we propose a new destage algorithms, called the Dynamic Adaptive Threshold which determines turn-on and turn-off thresholds dynamically depending on the current write cache occupancy level and the differential rate of the host write requests. For performance evaluation, the proposed algorithm is compared with the wellknown High-Low Water Mark (HLWM) algorithm. Performance tests are fulfilled with our cached RAID 5 simulator. The simulation results show that the proposed algorithm outperforms the HLWM algorithm in terms of response time of host reads and write cache hit ratio under various workloads.