• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권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.

• 한국전자파학회논문지
• /
• 제25권8호
• /
• pp.849-856
• /
• 2014

본 논문에서는 CA-CFAR 알고리듬을 보완한 효율적인 CFAR 알고리듬을 제시한다. 레이더 수신기에 유입되는 신호는 열잡음뿐만 아니라, 클러터 및 다중표적 신호가 존재하며, 시스템 내부에서 발진되는 하모닉 성분도 존재하여 기존에 널리 알려진 CA-CFAR로는 표적 탐지 성능을 보장할 수 없다. 이를 보완하기 위한 OS-CFAR나 ML-CFAR 등이 연구되었지만, 제시하는 CFAR 알고리듬은 OS-CFAR나 ML-CFAR에 비해 적은 계산량으로 레이더 신호처리기에 적용시킬 수 있다. 제시하는 CFAR 알고리듬의 문턱치와 오경보율의 관계식을 유도하고, SNR 관점과 ADT 관점에서 CFAR 손실을 분석하였다.

• 한국산학기술학회논문지
• /
• 제13권5호
• /
• pp.2291-2297
• /
• 2012

X-선 스펙트럼 데이터는 물질의 성분과 관련이 없는 신호(백그라운드, 노이즈)들을 포함 하고 있다. XRF는 스펙트럼에서 가우시안 형태의 피크 위치와 크기를 이용하여 시료의 성분을 분석하며, 시료의 성분을 정확히 분석하기 위해서는 노이즈와 백그라운드를 제거 하여야 한다. 백그라운드를 제거하기 위한 방법으로는 SNIP, Threshold, Morphology 방법 등을 적용하고 있으며, Threshold 기법을 중에서 블록별로 각기 다른 임계값을 적용하는 Interval Threshold기법이 하나의 임계값을 적용하는 Level Threshold 방법보다 더 좋은 성능을 발휘한다. 본 논문에서는 Interval Threshold를 적용하기 위하여 웨이블릿을 이용하여 블록을 분리하는 알고리즘을 제안하였다.

• 대한기계학회논문집
• /
• 제8권6호
• /
• pp.576-583
• /
• 1984

본 연구에서 대상으로 하는 영상은 2차원 물체에 대한 영상으로서 하나의 영 역을 이루는 화소는 좁은 범위내의 gray level을 갖고 있으며, 서로 다른 영역의 gray level이 다른 몇개의 영역으로 이루어진 영상으로부터 윤곽선을 찾을 수 있는 적응 threshold를 찾고, 그것을 이용하여 가느다란 윤곽선을 찾을 수 있는 방법을 개발했다. 또한 이를 이용하여 대상 물체를 인식했다.

• 음성과학
• /
• 제9권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.

• 한국컴퓨터정보학회논문지
• /
• 제21권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.

• 대한음성학회지:말소리
• /
• 제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
• /
• 제11권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
• /
• 제18권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.

• 도시과학
• /
• 제6권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.