Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for rapid making image connection element

A marking method and a technology of connected elements, which are applied in the directions of instruments, calculations, character and pattern recognition, etc., can solve the problems of large memory usage and time-consuming, and achieve the effect of improving the marking speed

Inactive Publication Date: 2007-09-26
EAST CHINA NORMAL UNIV
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Since connected meta tags are processed at the image pixel level, it is relatively time-consuming and requires a lot of memory

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 rapid making image connection element
  • Method for rapid making image connection element
  • Method for rapid making image connection element

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0067] Further description will now be made in conjunction with FIG. 6 and FIG. 7 . The contents of Figure 6 and Figure 7 should be compared one by one.

[0068] When the scan goes to the jth row, the run length A is found, and this run length is the root node of a new tree, as shown in part (a) of Figure 7.

[0069] When scanning to row j+1, the runs B and C are found, as shown in part (b) of Figure 7, B is connected to A, so A is the parent node of B, and C is another new tree the root node. When continuing to scan to the j+2th row, as shown in part (c) of Figure 7, the runs D, E and F are found, and D and E are connected to B. Therefore, they are children of B, and F is connected to C, so F is a child of C. When scanning to the j+3th row, the run G is found, because both E and F are connected to G, and G is the child node of the leftmost run E. Also, we have to check if E and F belong to the same tree. If they belong to different trees, they must be merged. Here, A is...

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

This invention relates to image technique field and discloses one binary image connection element aim rapid label method, which comprises the following steps: a, processing initial work to direct label j into initial row and total journey number k as 0; b, scanning image j rows of data to get Zj journey for recording; c, testing whether Zj is zero, if yes, then jumping steps d, e for f; d, if not, then recording j row each journey to label to relative tree; e, total journey number adds to Zj; f, row label j plus one; g, testing whether the label is upper image height range with result of no for step b; h, if yes, then outputting journey and tree structure information.

Description

technical field [0001] The invention relates to the technical field of image analysis and recognition, in particular to a fast marking method for connected meta-objects of a binary image. Background technique [0002] In most image analysis and recognition systems, connected meta-tagging is a basic operation and the basis of subsequent processing. The purpose of labeling connected components is to convert binary images into symbolic images, that is, to assign a label to each connected component to distinguish them. [0003] In the prior art, the most commonly used method is to process images sequentially, and establish an equivalence class table to store relevant information of equivalence classes. Each foreground (object) pixel is assigned a temporary label in the first pass based on the values ​​of neighboring pixels. If two adjacent foreground pixels have different labels, these two labels are regarded as equivalence classes and recorded in the equivalence class table. ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06K9/20
Inventor 吕岳
Owner EAST CHINA NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com