• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.8
• /
• pp.849-856
• /
• 2014

This paper proposes a new efficient CFAR algorithm. The structure of the proposed CFAR is relatively simple as compared with the OS-CFAR or ML-CFAR which are considered to deal with the nonhomogeneous environment such as clutter and multiple targets. The proposed algorithm is effectively applied to the radar signal processor with reduced computation burden. The relationship between the threshold and PFA of the proposed CFAR is derived analytically. The CFAR loss of the proposed CFAR algorithm is compared with CA-CFAR and OS-CFAR based on both SNR and ADT(Average Detection Threshold).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.5
• /
• pp.2291-2297
• /
• 2012

X-ray fluorescence sprectrum signal include the continuum. XRF analysis the components of material by the amplitude of peaks. XRF remove the noise and background. To remove the noise, we apply the smoothing filter. And background removal methods applied such as SNIP, Morphology, Threshold methods. In this paper, we applied Threshold using DWT. Interval threshold method divide the some blocks in particular levels. We propose the method that is divided the particular level.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.8 no.6
• /
• pp.576-583
• /
• 1984

This paper presents an algorithm for recognition of simple curved two dimensional objects. The algorithm is divided into four steps, determining threshold, edge finding, feature extracting and model matching. To evaluate the performance of this algorithm some experiments were conducted for various objects and illuminations. The results shows that the proposed algorithm can be effectively used for part recognition and quality inspection.

• Speech Sciences
• /
• v.9 no.4
• /
• pp.253-263
• /
• 2002

In this paper, we propose new algorithm of speaker recognition which identifies the speaker using the information obtained by the intensive speech feature analysis such as pitch, intensity, duration, and formant, which are crucial parameters of individual voice, for candidates of high percentage of wrong recognition in the existing speaker recognition algorithm. For testing the power of discrimination of individual parameter, DTW (Dynamic Time Warping) is used. We newly set the range of threshold which affects the power of discrimination in speech verification such that the candidates in the new range of threshold are finally discriminated in the next stage of sound parameter analysis. In the speaker verification test by using voice DB which consists of secret words of 25 males and 25 females of 8 kHz 16 bit, the algorithm we propose shows about 1% of performance improvement to the existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

• MALSORI
• /
• no.60
• /
• pp.109-123
• /
• 2006

Since computing the log-likelihood of Gaussian mixture density is a major computational burden for the speech recognizer based on the continuous HMM, several techniques have been proposed to reduce the number of mixtures to be used for recognition. In this paper, we propose a modified Bucket Box Intersection (BBI) algorithm, in which two relative thresholds are employed: one is the relative threshold in the conventional BBI algorithm and the other is used to reduce the number of the Gaussian boxes which are intersected by the hyperplanes at the boxes' edges. The experimental results show that the proposed algorithm reduces the number of Gaussian mixtures by 12.92% during the recognition phase with negligible performance degradation compared to the conventional BBI algorithm.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.39-46
• /
• 2019

This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.89-96
• /
• 2022

A novel multistage pulse jamming suppression algorithm was proposed to solve the anti-pulse jamming problem encountered in navigation receivers. Based on the characteristics of the short duration of pulse jamming and distribution characteristics of satellite signals, the pulse jamming detection threshold was derived. From the experiments, it was found that the randomness of pulse jamming affects jamming suppression. On this basis, the principle of the multistage anti-pulse jamming algorithm was established. The effectiveness of the anti-jamming algorithm was verified through experiments. The characteristics of the algorithm include simple determination of jamming detection threshold, easy programming, and complete suppression of pulse jamming.

• Journal of Urban Science
• /
• v.6 no.2
• /
• pp.49-57
• /
• 2017

A new Fiber Bragg Grating (FBG) wavelength demodulation scheme is studied in the paper, which consists of an improved de-noising method and Gaussian fitting peak searching algorithm. The improved translational invariant wavelet without threshold adjust factor is proposed to get a better de-noising performance for FBG sensor signal and overcome the drawbacks of soft or hard threshold wavelets. In order to get a high wavelength demodulation precision of FBG sensor signal, this de-noising method is designed to combine with Gaussian fitting peak searching algorithm. The simulation results show that the wavelength maximum measurement error is lower than 1pm, and can get a much higher accuracy.