An Approximate Algorithm and Its Application of the Morphological Templates Decomposition
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, an approximate algorithm of obtaining morphological templates is described, and the bi-directional orthogonal decomposition of the two dimensional morphological templates is realized. The decomposition of morphological templates is a useful technique for enhancing the computational efficiency of morphological image processing operations. The recognition algorithm of the intersection points and the end points of the lines in engineering drawings based on the morphological templates is also proposed in this paper.

    Reference
    Related
    Cited by
Get Citation

邹荣金,蔡士杰,张福炎.形态模板分解的逼近算法与应用.软件学报,1999,10(9):925-930

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 20,1997
  • Revised:September 25,1998
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063