Modified propagated last labeling system and method for connected components

• US 8,811,731 B2
• Filed: 04/12/2013
• Issued: 08/19/2014
• Est. Priority Date: 02/04/2008
• Status: Expired due to Fees

• Current Assignee: Eyep, Inc.
• Original Assignee: Eyep, Inc.
• Inventors: Sullender, Craig
• Primary Examiner(s): BEKELE, MEKONEN T
• Application Number:
  US13/862,332
• Publication Number:
  US 20130236092A1
• Time in Patent Office: 494 Days
• Field of Search: 382/180, 382/176, 382/177, 382/178, 382/179, 382/245, 382/246, 382/164, 382/201, 382/203, 382/163, 382/165, 382/166, 358/2.1, 358/3.08, 358/3.26, 358/462
• US Class Current: 382/164
• CPC Class Codes: G06T 7/11 Region-based segmentation
• CPC Class Codes: G06V 10/267 by performing operations on regions, e.g. growing, shrinking or watersheds

Abstract

Embodiments disclosed include methods and systems for assigning one or more labels to one or more segments of data received in an incoming segment to a line buffer for propagated component labeling, including preventing repeated labels in each line of the line buffer by assigning a different label for each of the one or more segments of data received in each line; labeling the incoming segment of the one or more segments of data by adopting a label of an overlapping segment on a prior received line when the overlapping segment does not overlap any other segment of data; labeling the incoming segment of the one or more segments of data by adopting a label of an overlapping segment on a prior received line when the overlapping segment overlaps more than one segment on the incoming segment when the segment is a first segment in the line buffer; and labeling the incoming segment of the one or more segments of data by adopting a label of a last overlapping segment when more than one segment overlaps the incoming segment.

Claims

1. A method for propagated last labeling using computer readable program codes recorded in a non-transitory computer readable media, comprising:

a. receiving one or more data files holding segmented data into a line buffer;

b. setting a maximum number of available labels as a function of a number of label locations on a current line of memory;

c. identifying one or more segments in the segmented data, the one or more segments sharing a same region; and

d. labeling the one or more segments as a feature of the same region, each feature representing a predetermined property of the same region.

2. The method of claim 1 wherein the receiving one or more data files holding segmented data into a line buffer includes:

receiving the one or more data files as run-length encoded data and/or data encoded by a user-directed application.

3. The method of claim 1 wherein the setting a maximum number of available labels as a function of a number of label locations on a current line of memory includes:

determining the number of label locations on the current line of memory in accordance with a user-directed application and/or in accordance with a predetermined feature in the data file.

4. The method of claim 1 wherein the setting a maximum number of available labels as a function of a number of label locations on a current line of memory includes:

determining the number of label locations on the current line of memory so that the maximum number of available labels is equal to a required number features.

5. The method of claim 1 wherein the identifying one or more segments in the segmented data, the one or more segments sharing a same region includes:

identifying the one or more segments according to one or more region properties, the one or more region properties including a color and/or a texture.

6. The method of claim 1 wherein labeling the one or more segments as a feature of the same region, each feature representing a predetermined property of the same region includes:

labeling the one or more segments as a feature using a label from a dedicated label queue, the maximum number of labels in use being equal to a number of possible label locations on the current memory line.

7. The method of claim 1 wherein labeling includes:

determining a maximum number of unique segments on the current memory line;

setting a number of possible label locations as the maximum number;

for each segment that does not connect to a segment on the line below, closing that segment to enable reuse of an associated feature label and feature memory location;

for each segment that connects to a segment on a line below, and the segment on the line below only connects to one segment, propagating the label resulting in no net alteration in a number in use labels; and

for each segment that connects to more than one segment on a line below, propagating a label for connected segments in the current line of memory.

8. A computer program product comprising:

a. a non-transitory computer readable medium encoded with a computer readable program, the program comprising instructions that when executed by a computer configured to perform one or more acts for performing propagated last labeling;

b. the one or more acts comprising;

i. one or more instructions for receiving one or more data files holding segmented data;

ii. one or more instructions for setting a maximum number of available labels as a function of a number of label locations on a current line of memory;

iii. one or more instructions for identifying one or more segments in the segmented data, the one or more segments sharing a same region; and

iv. one or more instructions for labeling the one or more segments as a feature of the same region, each feature representing a predetermined property of the same region.