• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4
• /
• pp.178-178
• /
• 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 Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.499-507
• /
• 2016

Medical imaging techniques such as Magnetic Resonance Imaging (MRI), Computed Tomography (CT) and Ultrasound (US) produce a large amount of digital medical images. Hence, compression of digital images becomes essential and is very much desired in medical applications to solve both storage and transmission problems. But at the same time, an efficient image compression scheme that reduces the size of medical images without sacrificing diagnostic information is required. This paper proposes a novel threshold-based medical image compression algorithm to reduce the size of the medical image without degradation in the diagnostic information. This algorithm discusses a novel type of thresholding to maximize Compression Ratio (CR) without sacrificing diagnostic information. The compression algorithm is designed to get image with high optimum compression efficiency and also with high fidelity, especially for Peak Signal to Noise Ratio (PSNR) greater than or equal to 36 dB. This value of PSNR is chosen because it has been suggested by previous researchers that medical images, if have PSNR from 30 dB to 50 dB, will retain diagnostic information. The compression algorithm utilizes one-level wavelet decomposition with threshold-based coefficient selection.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.113-122
• /
• 2015

Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.12-21
• /
• 2012

IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1064-1069
• /
• 2014

In this paper, we propose a novel approach to improve the performance of a voice activity detection(VAD) which is based on the adaptive band-partitioning with the likelihood ratio(LR). The previous method based on the adaptive band-partitioning use the weights that are derived from the variance of the spectral. In our VAD algorithm, the weights are derived from LR, and then the weights are incorporated with the entropy. The proposed algorithm discriminates the voice activity by comparing the weighted entropy with the adaptive threshold. Experimental results show that the proposed algorithm yields better results compared to the conventional VAD algorithms. Especially, the proposed algorithm shows superior improvement in non-stationary noise environments.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.2
• /
• pp.18-28
• /
• 2008

In inverse acoustic problem with nearfield sources, it is important to separate multiple acoustic sources and to measure the position of each target. This paper proposes a new algorithm by applying MUSIC(Multiple Signal Classification) to the outputs of discrete wavelet transformation with sub-band selection based on the entropy threshold, Some numerical experiments show that the proposed method can estimate the more precise positions than a conventional MUSIC algorithm under moderately correlated signal and relatively low signal-to-noise ratio case.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.930-932
• /
• 2003

For this study we used a CCD video camera to capture the pavement image information via the computer. During investigation processing, the CCD video camera captured 10${\sim}$30 images per second. If the vehicle velocity is too fast, the collected images will be duplicated and if the velocity is too slow there will be a gapped between images. Therefore, in order to control the efficiency of the image grabber we should add accessory tools such as the Differential Global Positioning System (DGPS) and odometer. Furthermore, Kalman Filtering can also solve these problems. After the CCD video camera captured the pavement images, we used the Least-Squares method to eliminate images of gradation which have non-uniform surfaces due to the illumination at night. The Fuzzy Entropy method calculates images of threshold segments and creates binary images. Finally, the Object Labeling algorithm finds objects that are cracks or noises from the binary image based on volume pixels of the object. We used these algorithms and tested them, also providing some discussion and suggestions.

• Journal of the Optical Society of Korea
• /
• v.20 no.5
• /
• pp.601-606
• /
• 2016

In this study, in order to analyze the low-temperature sintering process of silver and copper nanoparticles, we calculate their melting temperatures and surface melting temperatures with respect to particle size. For this calculation, we introduce the concept of mean-squared displacement of the atom proposed by Shi (1994). Using a parameter defined by the vibrational component of melting entropy, we readily obtained the surface and bulk melting temperatures of copper and silver nanoparticles. We also calculated the absorption cross-section of nanoparticles for variation in the wavelength of light. By using the calculated absorption cross-section of the nanoparticles at the melting temperature, we obtained the laser threshold energy for the sintering process with respect to particle size and wavelength of laser. We found that the absorption cross-section of silver nanoparticles has a resonant peak at a wavelength of close to 350 nm, yielding the lowest threshold energy. We calculated the intensity distribution around the nanoparticles using the finite-difference time-domain method and confirmed the resonant excitation of silver nanoparticles near the wavelength of the resonant peak.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.1047-1054
• /
• 2012

Atrial fibrillation (AF) is the most common arrhythmia encountered in clinical practice, and its risk increases with age. Conventionally, the way of detecting AF was the time·frequency domain analysis of RR variability. However, the detection of ECG signal is difficult because of the low amplitude of the P wave and the corruption by the noise. Also, the time·frequency domain analysis of RR variability has disadvantage to get the details of irregular RR interval rhythm. In this study, we describe an atrial fibrillation pattern analysis based on symbolization and information entropy. We transformed RR interval data into symbolic sequence through differential partition, analyzed RR interval pattern, quantified the complexity through Shannon entropy and detected atrial fibrillation. The detection algorithm was tested using the threshold between 10ms and 100ms on two databases, namely the MIT-BIH Atrial Fibrillation Database.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.910-913
• /
• 2000

In this paper, we propose an improved SBIHT algorithm based on double significance criteria. According to the defined relationship between a threshold and a boundary rate-distortion slope, we choose significant coefficients and trees. The selected significant coefficients and trees are quantized and entropy-coded. Experimental results demonstrate that the boundary rate-distortion slope is well adapted and the proposed algorithm is quite competitive to and often outperforms the SPIHT algorithm.