Method for rapidly skeletonizing graph of binary digital image

A digital image, binary image technology, applied in image analysis, image data processing, instruments, etc., can solve the problem of thinning effect attenuation and so on

Active Publication Date: 2013-06-12
SUZHOU QISHUO INFORMATION TECH CO LTD
View PDF4 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Unlike modern thinning algorithms, this algorithm does not use additional, complex data structures to assist the algorithm except for the two-dimensional matrix, nor does it use a lookup table for

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for rapidly skeletonizing graph of binary digital image
  • Method for rapidly skeletonizing graph of binary digital image
  • Method for rapidly skeletonizing graph of binary digital image

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0078] The present invention is described in further detail now in conjunction with accompanying drawing.

[0079] Here is a specific embodiment of the present invention under certain preconditions. Specific preconditions include that the foreground pixel is a non-zero pixel, the background pixel is a zero-valued pixel, the neighborhood size of the foreground pixel is fixed at 3×3, and the unit distance is a positive integer 1. In this embodiment, once a variable is defined, it can be used by all subsequent algorithm steps. For example, suppose the image 3 A variable var is defined in , then Figure 4 and Figure 9 Any step in can read without redefinition, modify the data saved by the variable var, but cannot delete it. For clarity of illustration, the variables involved in the following algorithms are defined.

[0080] Variable binaryImage: a matrix that stores the input binary digital image data.

[0081] Variable maxImage: A matrix storing local maxima.

[0082] Va...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for rapidly skeletonizing a graph of a binary digital image. The method comprises the steps of (1) scanning the image and calculating the local maximum, (2) generating a graph skeleton based on an algorithm of a distance function, and (3) deleting wrong skeleton branches, finding out skeleton endpoints of wrong graph skeleton branches generated by the step two, and deleting the wrong skeleton branches, wherein eight pixels which do not belong to the current skeleton endpoints do not have the local maximum or only have one local maximum, the difference of coordinate values between the eight pixels and the skeleton endpoints of the wrong graph skeleton branches in an image coordinate space is equal to 0 or 1, and the skeleton endpoints only have foreground pixels on one side inside a neighborhood in the binary image coordinate space. The skeleton generated by the algorithm is substantially in accordance with the skeleton generated by a main current international refinement algorithm. The algorithm is simple in structure, convenient to implement and efficient in operation. Computation complexity of the algorithm is O (n2) +O (m2) =O (n2). The algorithm is in accordance with a Davies algorithm. Computational results of the algorithm are remarkably superior to the Davies algorithm.

Description

technical field [0001] The invention belongs to an image processing method for thinning graphics in a binary digital image to obtain its skeleton, in particular to a method for quickly skeletonizing graphics in a binary digital image. Background technique [0002] Similar skeletalization methods at home and abroad are often used in Optical Character Recognition (OCR) and some image processing algorithms based on image shape, such as Hough Transformation (Hough Transformation, HT) image algorithm, so it is used to obtain the thinning algorithm of graphic skeleton It has important industrial application value and academic theoretical significance. [0003] The concept of graphic bones in binary images was first proposed by Blum in 1967. Bones refer to the collection of the centers of the largest inscribed circles that are tangent to the local boundaries of the area in the area composed of foreground pixels. See H. Blum, "A transformation for extracting new descriptors of shap...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T7/60
Inventor 贾靓闵革勇
Owner SUZHOU QISHUO INFORMATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap