CLUSTERING EDGE VALUES FOR THRESHOLD SELECTION

被引：8
|
作者：
MILGRAM, DL
HERMAN, M
机构：
来源：
COMPUTER GRAPHICS AND IMAGE PROCESSING | 1979年 / 10卷 / 03期
关键词：
D O I：
10.1016/0146-664X(79)90006-6
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：272 / 280
页数：9
相关论文
共 50 条
  • [1] ON THRESHOLD SELECTION USING CLUSTERING CRITERIA
    KITTLER, J
    ILLINGWORTH, J
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (05): : 652 - 655
  • [2] ON THRESHOLD SELECTION USING CLUSTERING CRITERIA.
    Kittler, J.
    Illingworth, J.
    IEEE Transactions on Systems, Man and Cybernetics, 1985, SMC-15 (05): : 652 - 655
  • [3] An intuitive threshold selection based on mountain clustering
    Lin, HJ
    Yang, FW
    PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : A738 - A741
  • [4] Threshold selection by clustering gray levels of boundary
    Wang, LS
    Bai, J
    PATTERN RECOGNITION LETTERS, 2003, 24 (12) : 1983 - 1999
  • [5] Handling Missing Values with Automatic Threshold Selection
    Yin, Xuri
    ICAIE 2009: PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND EDUCATION, VOLS 1 AND 2, 2009, : 36 - 40
  • [6] GENERALIZED THRESHOLD SELECTION FOR EDGE-DETECTION
    HADDON, JF
    PATTERN RECOGNITION, 1988, 21 (03) : 195 - 203
  • [7] A threshold selection method based on edge preserving
    Lou, Liantang
    Dan, Wei
    Chen, Jiaqi
    MIPPR 2015: AUTOMATIC TARGET RECOGNITION AND NAVIGATION, 2015, 9812
  • [8] Threshold Values of Different Classical Edge Detection Algorithms
    Avci, Isa
    TRAITEMENT DU SIGNAL, 2022, 39 (05) : 1775 - 1780
  • [9] A framework for unsupervised selection of indiscernibility threshold in rough clustering
    Hirano, Shoji
    Tsumoto, Shusaku
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2006, 4259 : 872 - +
  • [10] Threshold-Based Edge Selection MPA for SCMA
    da Silva, Bruno Fontana
    Le Ruyet, Didier
    Uchoa-Filho, Bartolomeu F.
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (03) : 2957 - 2966
12345