Pattern Recognition by Unknown

Author:Unknown
Language: eng
Format: epub, pdf
ISBN: 9783030490768
Publisher: Springer International Publishing

3.2 Segment Splitting

Starting with the segmentation induced by labelling the connected components in C, the segment splitting procedure is applied to wide segments as follows. For each selected segment one of the connection in the connectivity matrix is eliminated and the process repeated until either no more wide segments are available or the maximum number of iterations has been reached.

Segments are considered to be wide if its diameter is greater than a maximum allowed diameter (), whereas segment diameter is computed by averaging the ranges of projections along four directions: , 45, 90 and 135. Such diameter computation must be based on high points, i.e., the points with z-coordinates greater than threshold (). In addition, segments with lower number of points than a threshold () are not considered candidates for splitting.

The segment splitting consists in eliminating, at most, one edge per connected component, where selected edge fulfill three conditions: 1.Large horizontal distance

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.