Efficient dilation, erosion, opening, and closing algorithms

被引:118
|
作者
Gil, J [1 ]
Kimmel, R [1 ]
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
关键词
mathematical morphology; running maximum filter; min-max filter; computational efficiency;
D O I
10.1109/TPAMI.2002.1114852
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose an efficient and deterministic algorithm for computing the one-dimensional dilation and erosion (max and min) sliding window filters. For a p-element sliding window, our algorithm computes the 1D filter using 1.5 + o(1) comparisons per sample point. Our algorithm constitutes a deterministic improvement over the best previously known such algorithm, independently developed by van Herk [25] and by Gil and Werman [12] (the HGW algorithm). Also, the results presented in this paper constitute an improvement over the Gevorkian et al. [9] (GAA) variant of the HGW algorithm. The improvement over the GAA variant is also in the computation model. The GAA algorithm makes the assumption that the input is independently and identically distributed (the i.i.d. assumption), whereas our main result is deterministic. We also deal with the problem of computing the dilation and erosion filters simultaneously, as required, e.g., for computing the unbiased morphological edge. In the case of i.i.d. inputs, we show that this simultaneous computation can be done more efficiently then separately computing each. We then turn to the opening filter, defined as the application of the min filter to the max filter and give an efficient algorithm for its computation. Specifically, this algorithm is only slightly slower than the computation of just the max filter. The improved algorithms are readily generalized to two dimensions (for a rectangular window), as well as to any higher finite dimension (for a hyperbox window), with the number of comparisons per window remaining constant. For the sake of concreteness, we also make a few comments on implementation considerations in a contemporary programming language.
引用
收藏
页码:1606 / 1617
页数:12
相关论文
共 50 条
  • [41] Tibial osteotomy valgization: opening or closing
    Hernigou, P.
    REVUE DE CHIRURGIE ORTHOPEDIQUE ET REPARATRICE DE L APPAREIL MOTEUR, 2007, 93 (06): : 170 - 172
  • [42] Opening and closing nano venetian blinds
    Davenport, Matt
    CHEMICAL & ENGINEERING NEWS, 2016, 94 (24) : 9 - 9
  • [43] JAW OPENING AND CLOSING REFLEXES IN MAN
    YAMADA, Y
    ASH, MM
    JOURNAL OF DENTAL RESEARCH, 1980, 59 : 369 - 369
  • [44] MANDIBULAR FLEXURE IN OPENING AND CLOSING MOVEMENTS
    GOODKIND, RJ
    HERINGLAKE, CB
    JOURNAL OF PROSTHETIC DENTISTRY, 1973, 30 (02): : 134 - 138
  • [45] RECORDING THE OPENING AND CLOSING CYCLE OF THE MANDIBLE
    WOOD, GD
    BRITISH DENTAL JOURNAL, 1979, 146 (10) : 305 - 309
  • [46] Saul - Opening, or closing debate? Reply
    Saul, JS
    MONTHLY REVIEW-AN INDEPENDENT SOCIALIST MAGAZINE, 2003, 55 (02) : 47 - 48
  • [47] Blink Pacemaker as opening & closing eyes
    Leon-Sarmiento, Fidias E.
    Gutierrez, Claudia I.
    Contreras, Victor A.
    REVISTA ECUATORIANA DE NEUROLOGIA, 2009, 18 (1-2): : 90 - 93
  • [48] OPENING AND CLOSING SEGMENTS OF A PHONE CALL
    RATH, R
    LILI-ZEITSCHRIFT FUR LITERATURWISSENSCHAFT UND LINGUISTIK, 1995, 25 (99): : 9 - 35
  • [49] CELINIAN I - OPENING, ECSTASY, AND CLOSING
    THIHER, A
    AUSTRALIAN JOURNAL OF FRENCH STUDIES, 1976, 13 : 47 - 54
  • [50] Opening new doors; Closing others
    Moura, Jose
    IEEE SIGNAL PROCESSING MAGAZINE, 2008, 25 (03) : 6 - +