Cargando…
Using the Minimum Spanning Tree to recognize dotted and dashed curves
An important problem in pattern recognition is the organization into two and three-dimensional space curves of data given as points ("dots") or short line segments ("dashes"). This paper describes a general method for recognizing such dotted or dashed space curves employing the M...
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
1973
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1050916 |
_version_ | 1780912879389638656 |
---|---|
author | Zahn, C T |
author_facet | Zahn, C T |
author_sort | Zahn, C T |
collection | CERN |
description | An important problem in pattern recognition is the organization into two and three-dimensional space curves of data given as points ("dots") or short line segments ("dashes"). This paper describes a general method for recognizing such dotted or dashed space curves employing the Minimum Spanning Tree (MST). The use of the MST is motivated by its successful use in grouping two-dimensional point sets in a fashion closely resembling human visual perception. The extension of the method to handle "dashed" curves requires only the definition of a closeness measure between dashes which reflects the directional information as well as positional. It is possible to use the method in a layered hierarchy where the MST of dots is used to detect dashes, the MST of dashes to detect short curves without inflexions, and an MST constructed from these curves is used to detect larger curves with possible inflexions. The method described will be exemplified by its use to recognize particle tracks in streamer chamber photographs. |
id | cern-1050916 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 1973 |
record_format | invenio |
spelling | cern-10509162019-09-30T06:29:59Zhttp://cds.cern.ch/record/1050916engZahn, C TUsing the Minimum Spanning Tree to recognize dotted and dashed curvesComputing and ComputersAn important problem in pattern recognition is the organization into two and three-dimensional space curves of data given as points ("dots") or short line segments ("dashes"). This paper describes a general method for recognizing such dotted or dashed space curves employing the Minimum Spanning Tree (MST). The use of the MST is motivated by its successful use in grouping two-dimensional point sets in a fashion closely resembling human visual perception. The extension of the method to handle "dashed" curves requires only the definition of a closeness measure between dashes which reflects the directional information as well as positional. It is possible to use the method in a layered hierarchy where the MST of dots is used to detect dashes, the MST of dashes to detect short curves without inflexions, and an MST constructed from these curves is used to detect larger curves with possible inflexions. The method described will be exemplified by its use to recognize particle tracks in streamer chamber photographs.CERN-DD-73-24oai:cds.cern.ch:10509161973-08-01 |
spellingShingle | Computing and Computers Zahn, C T Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title | Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title_full | Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title_fullStr | Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title_full_unstemmed | Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title_short | Using the Minimum Spanning Tree to recognize dotted and dashed curves |
title_sort | using the minimum spanning tree to recognize dotted and dashed curves |
topic | Computing and Computers |
url | http://cds.cern.ch/record/1050916 |
work_keys_str_mv | AT zahnct usingtheminimumspanningtreetorecognizedottedanddashedcurves |