US2009196504A1PendingUtilityA1

Modified propagated last labeling system and method for connected components

Assignee: SULLENDER CRAIGPriority: Feb 4, 2008Filed: Feb 12, 2008Published: Aug 6, 2009
Est. expiryFeb 4, 2028(~1.5 yrs left)· nominal 20-yr term from priority
Inventors:Craig Sullender
G06V 10/267G06T 7/11
44
PatentIndex Score
0
Cited by
0
References
0
Claims

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

exact text as granted — not AI-modified
1 . A method 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, the method comprising:
 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.   
     
     
         2 . The method of  claim 1  further comprising:
 identifying one or more spatial details in the data according to a connectedness identified by the labeling the one or more segments.   
     
     
         3 . The method of  claim 1  wherein the one or more segments are received from raster-organized data arrays wherein the data is image data arranged to display an image. 
     
     
         4 . The method of  claim 1  wherein the one or more segments are received from raster-organized data arrays wherein the data is one or more of text data, numerical data, medical image data, cryptographic de-ciphering data, compressed data, and/or statistical data. 
     
     
         5 . The method of  claim 1  wherein each of the one or more segments is an unbroken sequence of one or more of a data value organized horizontally on a raster line. 
     
     
         6 . The method of  claim 1  wherein the data is one or more of run-length encoded data and/or data encoded by a user-directed application. 
     
     
         7 . A computer program product comprising a computer readable medium configured to perform one or more acts for performing labeling of one or more labels to one or more segments of data received in an incoming segment to a line buffer for propagated component labeling the one or more acts comprising:
 one or more instructions for 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;   one or more instructions for 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;   one or more instructions for 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   one or more instructions for 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.   
     
     
         8 . The computer program product of  claim 7  further comprising:
 one or more instructions for identifying one or more spatial details in the data according to a connectedness identified by the labeling the one or more segments.   
     
     
         9 . The computer program product of  claim 7  wherein the one or more segments are received from raster-organized data arrays wherein the data is image data arranged to display an image. 
     
     
         10 . The computer program product of  claim 7  wherein each of the one or more segments is an unbroken sequence of one or more of a data value organized horizontally on a raster line. 
     
     
         11 . The computer program product of  claim 7  wherein the data is one or more of run-length encoded data and/or data encoded by a user-directed application 
     
     
         12 . A method for propagated last labeling comprising:
 receiving one or more data files holding segmented data;   setting a maximum number of available labels as a function of a number of label locations on a current line of memory;   identifying one or more spaces between at least two segments in the segmented data, the one or more spaces sharing a same region; and   labeling the one or more spaces as a feature of the same region, each feature representing a predetermined property of the same region.   
     
     
         13 . The method of  claim 12  wherein the receiving one or more data files holding segmented data includes:
 receiving the one or more data files as run-length encoded data and/or data encoded by a user-directed application.   
     
     
         14 . The method of  claim 12  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.   
     
     
         15 . The method of  claim 12  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.   
     
     
         16 . The method of  claim 12  wherein the identifying one or more spaces between at least two segments in the segmented data, the one or more spaces sharing a same region includes:
 identifying the one or more spaces according to one or more region properties, the one or more region properties including a color and/or a texture.   
     
     
         17 . The method of  claim 12  wherein labeling the one or more spaces as a feature of the same region, each feature representing a predetermined property of the same region includes:
 labeling the one or more spaces 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.   
     
     
         18 . The method of  claim 12  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.   
     
     
         19 . A computer program product comprising a computer readable medium configured to perform one or more acts for performing propagated last labeling, the one or more acts comprising:
 one or more instructions for receiving one or more data files holding segmented data;   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;   one or more instructions for identifying one or more spaces between at least two segments in the segmented data, the one or more spaces sharing a same region; and   one or more instructions for labeling the one or more spaces as a feature of the same region, each feature representing a predetermined property of the same region.

Join the waitlist — get patent alerts

Track US2009196504A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.