• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.710-726
• /
• 2018

This paper presents an extended particle filter to increase the accuracy and decrease the computation load of vehicle tracking. Particle filter has been the subject of extensive interest in video-based tracking which is capable of solving nonlinear and non-Gaussian problems. However, there still exist problems such as preventing unnecessary particle consumption, reducing the computational burden, and increasing the accuracy. We aim to increase the accuracy without an increase in computation load. In proposed method, we calculate the direction angle of the target vehicle. The angular difference between the direction of the target vehicle and each particle of the particle filter is observed. Particles are filtered and weighted, based on their angular difference. Particles with angular difference greater than a threshold is eliminated and the remaining are stored with greater weights in order to increase their probability for state estimation. Threshold value is very critical for performance. Thus, instead of having a constant threshold value, proposed algorithm updates it online. The first advantage of our algorithm is that it prevents the system from failures caused by insufficient amount of particles. Second advantage is to reduce the risk of using unnecessary number of particles in tracking which causes computation load. Proposed algorithm is compared against camshift, direction-based particle filter and condensation algorithms. Results show that the proposed algorithm outperforms the other methods in terms of accuracy, tracking duration and particle consumption.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.77-80
• /
• 2001

This paper presents a new threshold-based denoising method by using undecimated discrete wavelet transform (UDWT). It proved excellency of the UDWT compared with orthogonal wavelet transform (OWT), spatia1ly selective noise filtration (SSNF) and NSSNF added new parameter. Methods using the spatial correlation are effectual at edge detection and image enhancement, whereas algorithm is complex and needs more computation However, UDWT is effective at denoising and needs less computation and simple algorithm.

• Journal of Korea Water Resources Association
• /
• v.44 no.11
• /
• pp.875-887
• /
• 2011

The objective of this study is to develop and evaluate a Korean threshold runoff computation method. The selected study area is the Han-River basin and the stream channels in the study area are divided into 3 parts; natural channel and artificial manmade channel for small mountainous catchments, and main channel for master stream. The threshold runoff criteria for small streams is decided to 0.5 m water level increase from the channel bottom, which is the level that mountain climbers and campers successfully escape from natural flood damage. Threshold runoff values in natural channel of small mountainous area are computed by the results from the regional regression analysis between parameters of basin and stream channel, while those in artificial channel of small mountainous area are obtained from the data of basin and channel characteristics parameter. On the other hand, the threshold runoff values for master channel are used the warning flood level that is useful information for escaping guideline for riverside users. For verification of the threshold runoff computation method proposed in this study, three flash flood cases are selected and compared with observed values, which is obtained from SCS effective rainfall computation. The 1, 3, 6-hour effective rainfall values are greater than the corresponding threshold runoff values represents that the proposed computation results are reasonable.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.69-74
• /
• 2004

Threshold digital signature is very useful for networks that have no infrastructure such as ad hoc network Up to date, research on threshold digital signature is mainly focused on RSA and DSA. Though Schnorr's digital signature scheme is very efficient in terms of both computation and communication. its hard structure using interactive proof prevents conversion to threshold version. This paper proposes an efficient threshold signature. scheme based on the Schnorr's signature. It has a desirable property of scalability and reduces runtime costs by precomputation.

• Spatial Information Research
• /
• v.14 no.1 s.36
• /
• pp.15-27
• /
• 2006

This paper is about the threshold discharge computation using GIUH(Geomorphoclimatic Instantaneous Unit Hydrograph) on ungauged small basin. GIUH is one of the possible approaches to predicting the hydrograph characteristics. This study is calculated the various ways which are hydrologic characteristics, bankfull flows, unit peak flows(the Clark, the Nakayasu and the S.C.S) as well as threshold runoffs on about $5km^2$ scale at Kyungbuk gampo in subbasin. We are estimated propriety that peak discharge calculated the GIUH from acquiring data by GIS(Geographic Information System) compared to observed peak discharge. And, the threshold discharge was calculated by NRCS(Natural Resources Conservation Service) for a flash flood standard rainfall.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.269-272
• /
• 2010

In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Journal of Information Technology Applications and Management
• /
• v.24 no.1
• /
• pp.157-167
• /
• 2017

This paper proposes a simple sound source localization (SSL) method based on signal energies comparison and partial cross correlation for TDOA computation. Many sound source localization methods include multiple TDOA computations in order to eliminate front-back confusion. Multiple TDOA computations however increase the methods' computation times which need to be as minimal as possible for real-time applications. Our aim in this paper is to achieve the same results of localization using fewer computations. Using three microphones, we first compare signal energies to predict which quadrant the sound source is in, and then we use partial cross correlation to estimate the TDOA value before computing the azimuth value. Also, we apply a threshold value to reinforce our prediction method. Our experimental results show that the proposed method has less computation time; spending approximately 30% less time than previous three microphone methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1424-1433
• /
• 1995

The edge detection process serves to simplify the analysis of images by drastically reducing the amount of data to be processed, while preserving useful structural informations about object boundaries. At first, this paper proposes an edge detection algorithm to reduce the amount of computation. The gradients of pixels are calculated by using first order differential equations on the pixels with even rows and even columns or odd rows and odd columns, and they are compared with a threshold to decide edges. As a result, the computational complexity is reduced to one third or one forth compared with the provious ones. To enhance the accuracy of edge detection, a method with the adaptive threshold for each pixel window which is calculated by using characteristic values is proposed. In this case, the performance can be improved since the threshold is calculated properly for each window according to the local characteristics of corresponding window.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.389-396
• /
• 2001

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has a faster searching speed and lower missing scene change detection than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect missing frame and searching precision. In this study, the whole moving pictures were primarily retrieved threshold by the temporal difference of histogram scene change detection method. We suggested a dynamic threshold algorithm using cut detection interval and derived an equation formula to determine optimal primary retrieval threshold which can cut detection interval computation. Experimental results show that the proposed dynamic threshold algorithm using cut detection interval method works up about 30 percent in precision of performance than the sequential searching method.