• Title/Summary/Keyword: threshold values

Search Result 977, Processing Time 0.026 seconds

Selection Method of Multiple Threshold Based on Probability Distribution function Using Fuzzy Clustering (퍼지 클러스터링을 이용한 확률분포함수 기반의 다중문턱값 선정법)

  • Kim, Gyung-Bum;Chung, Sung-Chong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.5 s.98
    • /
    • pp.48-57
    • /
    • 1999
  • Applications of thresholding technique are based on the assumption that object and background pixels in a digital image can be distinguished by their gray level values. For the segmentation of more complex images, it is necessary to resort to multiple threshold selection techniques. This paper describes a new method for multiple threshold selection of gray level images which are not clearly distinguishable from the background. The proposed method consists of three main stages. In the first stage, a probability distribution function for a gray level histogram of an image is derived. Cluster points are defined according to the probability distribution function. In the second stage, fuzzy partition matrix of the probability distribution function is generated through the fuzzy clustering process. Finally, elements of the fuzzy partition matrix are classified as clusters according to gray level values by using max-membership method. Boundary values of classified clusters are selected as multiple threshold. In order to verify the performance of the developed algorithm, automatic inspection process of ball grid array is presented.

  • PDF

An Adaptive Pruning Threshold Algorithm for the Korean Address Speech Recognition (한국어 주소 음성인식의 고속화를 위한 적응 프루닝 문턱치 알고리즘)

  • 황철준;오세진;김범국;정호열;정현열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.7
    • /
    • pp.55-62
    • /
    • 2001
  • In this paper, we propose a new adaptative pruning algorithm which effectively reduces the search space during the recognition process. As maximum probabilities between neighbor frames are highly interrelated, an efficient pruning threshold value can be obtained from the maximum probabilities of previous frames. The main idea is to update threshold at the present frame by a combination of previous maximum probability and hypotheses probabilities. As present threshold is obtained in on-going recognition process, the algorithm does not need any pre-experiments to find threshold values even when recognition tasks are changed. In addition, the adaptively selected threshold allows an improvement of recognition speed under different environments. The proposed algorithm has been applied to a Korean Address recognition system. Experimental results show that the proposed algorithm reduces the search space of average 14.4% and 9.14% respectively while preserving the recognition accuracy, compared to the previous method of using fixed pruning threshold values and variable pruning threshold values.

  • PDF

Development and Evaluation of Computational Method for Korean Threshold Runoff (국내 유역특성을 반영한 한계유출량 산정기법 개발 및 평가)

  • Cho, Bae-Gun;Ji, Hee-Sook;Bae, Deg-Hyo
    • 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.

Fatigue Crack Propagation Characteristics of Duplex-Stainless Steel Weldments (II) -Crack Propagation on Near-Threshold Region- (2상계 스테인리스강 용접부의 피로크랙 전파특성 (II) -하한계치 근접에서의 전파특성-)

  • 권종완;김상대;이택순
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.13 no.1
    • /
    • pp.115-124
    • /
    • 1989
  • Near-threshold fatigue crack-growth behavior at room temperature for a duplex stainless steel weldments was investigated to evaluate the effect of load ratio, microstructural change, and residual stresses. Near-threshold fatigue crack propagation behavior is found to show a marked sensitivity to .alpha./.gamma. phase ratio, and little residual stress effects. Threshold values in the heat affected zones are higher than those of base metals and threshold values for crack growth decrease with increasing the load ratio in the base metals and weldments. The fractrographic features in base metals, weldments and heat affectred zones were discussed in terms mechanism of crack growth.

Dynamic Threshold based Even-wear Leveling Policies (동적 임계값을 이용한 메모리 소거)

  • Park, Je-Ho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.6 no.2 s.19
    • /
    • pp.5-10
    • /
    • 2007
  • According to the advantageous features of flash memory, its exploitation and application in mobile and ubiquitous related devices as well as voluminous storage devices is being increased rapidly. The inherent properties that are determined by configuration of flash memory unit might restrict the promising expansion in its utilization. In this paper, we study policies based on threshold values, instead of using global search, in order to satisfy our objective that is to decrease the necessary processing cost or penalty for recycling of flash memory space at the same time minimizing the potential degradation of performance. The proposed cleaning methods create partitions of candidate memory regions, to be reclaimed as free, by utilizing global or dynamic threshold values. The impact of the proposed policies is evaluated through a number of experiments, the composition of the optimal configuration featuring the methods is tested through experiments as well.

  • PDF

Effects of Multiple Threshold Values for PN Code Acquisition in DS-CDMA Systems (PN 코드 동기획득에서 다중 임계치의 효과)

  • Lee, Seong-Ju;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.42-48
    • /
    • 2002
  • In this paper, a decision method using multiple threshold values for PN code acquisition in Direct Sequence Code Division Multiple Access (DS-CDMA) systems is described. We apply this technique to the conventional double dwell serial search algorithm and analyze it in terms of mean code acquisition time. For the analysis, we present mathematical model of proposed algorithm and also perform the simulation under IMT-2000 channel models. Numerical results show that our proposed scheme outperforms the conventional one by 0.2 - 0.5 sec with respect to the mean code acquisition time because multiple threshold values mitigate the possible decline in search performance caused by the use of a single threshold.

Practical Datasets for Similarity Measures and Their Threshold Values (유사도 측정 데이터 셋과 쓰레숄드)

  • Yang, Byoungju;Shim, Junho
    • The Journal of Society for e-Business Studies
    • /
    • v.18 no.1
    • /
    • pp.97-105
    • /
    • 2013
  • In the e-business domain where data objects are quantitatively large, measuring similarity to find the same or similar objects is important. It basically requires comparing and computing the features of objects in pairs, and therefore takes longer time as the amount of data becomes bigger. Recent studies have shown various algorithms to efficiently perform it. Most of them show their performance superiority by empirical tests over some sets of data. In this paper, we introduce those data sets, present their characteristics and the meaningful threshold values that each of data sets contain in nature. The analysis on practical data sets with respect to their threshold values may serve as a referential baseline to the future experiments of newly developed algorithms.

Statistical Decision making of Association Threshold in Association Rule Data Mining

  • Park, Hee-Chang;Song, Geum-Min
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.2
    • /
    • pp.115-128
    • /
    • 2002
  • One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We calculate the range of the value that two item sets are occurred simultaneously, and find the minimum confidence threshold values.

  • PDF

Statistical Decision making of Association Threshold in Association Rule Data Mining

  • Park, Hee-Chang;Song, Geum-Min
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2002.06a
    • /
    • pp.169-182
    • /
    • 2002
  • One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We can calculate the range of the value that two item sets are occurred simultaneously, and can find the minimum confidence threshold values.

  • PDF

Establishment of Viscosity Measuring Conditions and Threshold Values for Identifying Irradiated Starches (방사선 조사 전분류의 확인을 위한 점도측정조건 및 threshold values 설정)

  • An, Kyung-A;Choi, Jong-Dong;Kim, Hyun-Ku;Kwon, Joong-Ho
    • Korean Journal of Food Science and Technology
    • /
    • v.36 no.5
    • /
    • pp.693-700
    • /
    • 2004
  • Viscometry was applied to identify irradiated corn starch (CS), sweet potato starch (SS), and potato starch (PS) from non-irradiated controls using Brookfield DV-III programmable rheometer. Effects of starch suspension concentration (7.0-9.5%) and spindle speed (25-125 rpm) were investigated. Established optimal viscosity-measuring conditions showed the highest correlation coefficient between irradiation dose (0-6.0 kGy) and corresponding viscosities for CS, SS, and PS. Threshold values for identifying irradiated starches were suggested. Viscosities of all samples significantly decreased with increasing irradiation dose (p<0.05) and spindle speed, while increased as suspension concentration increased. Optimal conditions for suspension concentration and spindle speed were 7.5% (6.7%, d.b.) and 125rpm in CS, 8.5% (7.3%, d.b.) and 125 rpm in SS, and 9.0% (7.3%, d.b.) and 100rpm in PS, respectively. Under these measuring conditions, threshold values for discriminating unknown samples were 0.313, 0.345, and 0.811 for CS, SS, and PS in 1.5 kGy-irradiated samples, compared with 0.521, 0.798, and 1.693 in non-irradiated samples, respectively, enabling identification of irradiated from non-irradiated starches.