Patent US5355446A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5355446A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for preparing picture masks

Assignee: Kodak IL Ltd
•
Filing: 1992-08-26
•
Granted: 1994-10-11
•
Expires: 2012-08-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture by: storing a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; and then sequentially selecting regions of search on the rough mask to identify boundary segments, each subsequent region of search being selected by extrapolation from the preceding region of search in the direction of boundary segments identified by the preceding region of search, until the first region of search is met or until a boundary segment is not found in the region of search, whereupon the next region of search is selected by interpolation between the preceding region of search and the closest point on the approximate boundary defined by the rough mask.

Inventors

  • 👤 Lior Maayan

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 06:39
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/20; G06T7/00; G06T7/10; G06T7/12; G06T2207/00; G06T2207/10; G06T2207/10016; G06T2207/20; G06T2207/20092; G06T2207/20104; H; H04; H04N; H04N19/00; H04N19/20

Claims Analysis

Total Claims: 32
Claim 1
Independent Claim 261 words
A method of preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising the operations: (a) storing in storage means a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; (b) selecting a first region of search of predetermined configuration starting with one point on the rough mask; (c) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to identify a boundary segment representing the portion of the boundary within the region of search; (d) selecting the position of the next region of search by extrapolation from the preceding region of search in the direction of the boundary segment identified in the preceding region of search; (e) retrieving picture data within said next region of search from the storage means and processing said retrieved picture data to identify the next boundary segment representing the position of the boundary within said next region of search; and (f) repeating operations (d) and (e), to successively select the next regions of search by extrapolation and to find the boundary segments therein, until the next region of search meets the first region of search, or until encountering the condition that a boundary segment is not found in the region of search, whereupon the next region of search is selected by interpolation between the preceding region of search and the closest point on the approximate boundary defined by the rough mask.
Claim 2
Independent Claim 261 words
A method of preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising the operations: (a) storing in storage means a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; (b) selecting a first region of search of predetermined configuration starting with one point on the rough mask; (c) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to identify a boundary segment representing the portion of the boundary within the region of search; (d) selecting the position of the next region of search by extrapolation from the preceding region of search in the direction of the boundary segment identified in the preceding region of search; (e) retrieving picture data within said next region of search from the storage means and processing said retrieved picture data to identify the next boundary segment representing the position of the boundary within said next region of search; and (f) repeating operations (d) and (e), to successively select the next regions of search by extrapolation and to find the boundary segments therein, until the next region of search meets the first region of search, or until encountering the condition that a boundary segment is not found in the region of search, whereupon the next region of search is selected by interpolation between the preceding region of search and the closest point on the approximate boundary defined by the rough mask.
Claim 3
Dependent Claim 70 words
The method according to claim 1, wherein operations (d) and (e) are repeated per operation (f) until encountering a second condition, that the boundary segment is not found to be in the region of search within a predetermined distance from the approximate boundary defined by the rough mask, whereupon the next region of search is also selected by the same manner of interpolation as when said first condition is encountered.
Claim 4
Dependent Claim 70 words
The method according to claim 2, wherein operations (d) and (e) are repeated per operation (f) until encountering a third condition, that the boundary segment is not found to be in the region of search within a predetermined angle from the approximate boundary defined by the rough mask, whereupon the next region of search is also selected by the same manner of interpolation as when said first condition is encountered.
Claim 5
Dependent Claim 34 words
The method according to claim 1, wherein, whenever a region of search position is selected by interpolation, the region of search for finding a boundary segment is increased in size over said predetermined size.
Claim 6
Dependent Claim 34 words
The method according to claim 4, wherein, whenever a region of search position is selected by interpolation, the region of search for finding a boundary segment is doubled in size over said predetermined size.
Claim 7
Dependent Claim 20 words
The method according to claim 1, including the further operation of converting all the boundary segments to a raster format.
Claim 8
Dependent Claim 77 words
The method according to claim 1, wherein, when a region of search is selected, an examination is performed to determined whether the picture content within the selected region of search is of a spatial frequency higher than a predefined value, and if so, a raster patch is produced in the respective region of search rather than a boundary segment; said raster patch being converted with all the found boundary segments to a raster format following operation (f).
Claim 9
Dependent Claim 25 words
The method according to claim 7, including the further operation of performing a colour transformation for edge detection operation before making the spatial frequency examination.
Claim 10
Dependent Claim 44 words
The method according to claim 7, wherein following the spatial frequency examination, the produced boundary segments in the regions of search having a lower spatial frequency than a predefined value are thinned to produce single-pixel-width edge segments using the rough mask as a guideline.
Claim 11
Dependent Claim 45 words
The method according to claim 9, wherein, following the spatial frequency examination, the pixels in the raster patches produced in the regions of search having a spatial frequency higher than a predefined value are converted to a one-bit value in accordance with a calculated threshold.
Claim 12
Dependent Claim 20 words
The method according to claim 10, including the further operation of converting all the boundary segments to a raster formal.
Claim 13
Dependent Claim 51 words
The method according to claim 11, wherein, in converting all the boundary segments to a raster format, all the edge segments are converted to a raster format by assigning each pixel in the mask a multiple-bit value in accordance with the spatial distance of the pixel from the found edge segment.
Claim 14
Dependent Claim 47 words
The method according to claim 12, wherein, in converting all the boundary segments to a raster format, all the raster patches are converted to a raster format by assigning each pixel in the mask a multiple-bit value in accordance with its colour distance from a calculated threshold.
Claim 15
Independent Claim 210 words
A method of preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising the operations: (a) storing in storage means a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; (b) selecting a first region of search of predetermined configuration starting with one point on the rough mask; (c) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to find a boundary segment representing the portion of the boundary within the region of search; (d) repeating operations (b) and (c) to successively select the next regions of search in order to find and produce the boundary segments therein; (e) in each region of search, examining the picture content within the respective region of search to determine whether the picture content is of a spatial frequency higher than a predefined value, and if so, producing a raster patch in the respective region of search, rather than a boundary segment; and (f) when a subsequent region of search meets the first region of search, converting all the produced boundary segments, and raster patches, to a raster format.
Claim 16
Independent Claim 210 words
A method of preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising the operations: (a) storing in storage means a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; (b) selecting a first region of search of predetermined configuration starting with one point on the rough mask; (c) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to find a boundary segment representing the portion of the boundary within the region of search; (d) repeating operations (b) and (c) to successively select the next regions of search in order to find and produce the boundary segments therein; (e) in each region of search, examining the picture content within the respective region of search to determine whether the picture content is of a spatial frequency higher than a predefined value, and if so, producing a raster patch in the respective region of search, rather than a boundary segment; and (f) when a subsequent region of search meets the first region of search, converting all the produced boundary segments, and raster patches, to a raster format.
Claim 17
Dependent Claim 269 words
Apparatus for preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising: storage means for storing a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; selecting means for selecting a first region of search of predetermined configuration starting with one point on the rough mask; and data processor means programmed for performing the following operations: (1) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to identify a boundary segment representing the portion of the boundary within the region of search; (2) selecting the position of the next region of search by extrapolation from the preceding region of search in the direction of the boundary segment identified in the preceding region of search; (3) retrieving picture data within said next region of search from the storage means and processing said retrieved picture data to identify the next boundary segment representing the position of the boundary within said next region of search; and (4) repeating operations (d) and (e), to successively select the next regions of search by extrapolation and to find the boundary segments therein, until the next region of search meets the first region of search, or until encountering the condition that a boundary segment is not found in the region of search, whereupon the next region of search is selected by interpolation between the preceding region of search and the closest point on the approximate boundary defined by the rough mask.
Claim 18
Dependent Claim 269 words
Apparatus for preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising: storage means for storing a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; selecting means for selecting a first region of search of predetermined configuration starting with one point on the rough mask; and data processor means programmed for performing the following operations: (1) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to identify a boundary segment representing the portion of the boundary within the region of search; (2) selecting the position of the next region of search by extrapolation from the preceding region of search in the direction of the boundary segment identified in the preceding region of search; (3) retrieving picture data within said next region of search from the storage means and processing said retrieved picture data to identify the next boundary segment representing the position of the boundary within said next region of search; and (4) repeating operations (d) and (e), to successively select the next regions of search by extrapolation and to find the boundary segments therein, until the next region of search meets the first region of search, or until encountering the condition that a boundary segment is not found in the region of search, whereupon the next region of search is selected by interpolation between the preceding region of search and the closest point on the approximate boundary defined by the rough mask.
Claim 19
Dependent Claim 75 words
The apparatus according to claim 15, wherein said data processor is preprogrammed to repeat operations (2) and (3) per operation (4) until encountering a second condition, that the boundary segment is not found to be in the region of search within a predetermined distance from the approximate boundary defined by the rough mask, whereupon the next region of search is also selected by the same manner of interpolation as when said first condition is encountered.
Claim 20
Dependent Claim 75 words
The apparatus according to claim 16, wherein said data processor is preprogrammed to repeat operations (2) and (3) per operation (4) until encountering a third condition, that the boundary segment is not found to be in the region of search within a predetermined angle from the approximate boundary defined by the rough mask, whereupon the next region of search is also selected by the same manner of interpolation as when said first condition is encountered.
Claim 21
Dependent Claim 41 words
The apparatus according to claim 15, wherein said data processor is preprogrammed such that, whenever a region of search position is selected by interpolation, the region of search for finding a boundary segment is increased in size over said predetermined size.
Claim 22
Dependent Claim 41 words
The apparatus according to claim 18, wherein said data processor is preprogrammed such that, whenever a region of search position is selected by interpolation, the region of search for finding a boundary segment is doubled in size over said predetermined size.
Claim 23
Dependent Claim 26 words
The apparatus according to claim 15, wherein data processor is preprogrammed to include the further operation of converting all the boundary segments to a raster format.
Claim 24
Dependent Claim 84 words
The apparatus according to claim 15, wherein said data processor is preprogrammed such that, when a region of search is selected, an examination is performed to determined whether the picture content within the selected region of search is of a spatial frequency higher than a predefined value, and if so, a raster patch is produced in the respective region of search rather than a boundary segment; said raster patch being converted with all the found boundary segments to a raster format following operation (f).
Claim 25
Dependent Claim 32 words
The apparatus according to claim 21, wherein said data processor is preprogrammed to include the further operation of performing a colour transformation for edge detection operation before making the spatial frequency examination.
Claim 26
Dependent Claim 51 words
The apparatus according to claim 21, wherein said data processor is preprogrammed such that, following the spatial frequency examination, the produced boundary segments in the regions of search having a lower spatial frequency than a predefined value are thinned to produce single-pixel-width edge segments using the rough mask as a guideline.
Claim 27
Dependent Claim 52 words
The apparatus according to claim 23, wherein said data processor is preprogrammed such that, following the spatial frequency examination, the pixels in the raster patches produced in the regions of search having a spatial frequency higher than a predefined value are converted to a one-bit value in accordance with a calculated threshold.
Claim 28
Dependent Claim 27 words
The apparatus according to claim 24, wherein the data processor is preprogrammed to include the further operation of converting all the boundary segments to a raster formal.
Claim 29
Dependent Claim 55 words
The apparatus according to claim 25, wherein the data processor is preprogrammed such that, in converting all the boundary segments to a raster format, all the edge segments are converted to a raster format by assigning each pixel in the mask a multiple-bit value in accordance with its spatial distance from the found edge segment.
Claim 30
Dependent Claim 54 words
The apparatus according to claim 26, wherein the data processor is preprogrammed such that, in converting all the boundary segments to a raster format, all the raster patches are converted to a raster format by assigning each pixel in the mask a multiple-bit value in accordance with its colour distance from a calculated threshold.
Claim 31
Dependent Claim 218 words
Apparatus for preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising: storage means for storing a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; selecting means for selecting a first region of search of predetermined configuration starting with one point on the rough mask; and data processor means programmed for performing the following operations: (1) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to find a boundary segment representing the portion of the boundary within the region of search; (2) repeating operations (b) and (c) to successively select the next regions of search in order to find and produce the boundary segments therein; (3) in each region of search, examining the picture content within the respective region of search to determine whether the picture content is of a spatial frequency higher than a predefined value, and if so, producing a raster patch in the respective region of search, rather than a boundary segment; and (4) when a subsequent region of search meets the first region of search, converting all the produced boundary segments, and raster patches, to a raster format.
Claim 32
Dependent Claim 218 words
Apparatus for preparing a fine mask of a boundary on a picture of an area of interest to be separated from the remainder of the picture, comprising: storage means for storing a digitized representation of the picture, and of a rough mask defining the approximate boundary of the area of interest; selecting means for selecting a first region of search of predetermined configuration starting with one point on the rough mask; and data processor means programmed for performing the following operations: (1) retrieving picture data within the selected region of search from the storage means and processing said retrieved picture data to find a boundary segment representing the portion of the boundary within the region of search; (2) repeating operations (b) and (c) to successively select the next regions of search in order to find and produce the boundary segments therein; (3) in each region of search, examining the picture content within the respective region of search to determine whether the picture content is of a spatial frequency higher than a predefined value, and if so, producing a raster patch in the respective region of search, rather than a boundary segment; and (4) when a subsequent region of search meets the first region of search, converting all the produced boundary segments, and raster patches, to a raster format.

References Cited (Backward Citations)

EP0173098A2 Cited
US4849911A Cited
US4884224A Cited
US5038291A Cited
EP0427251A2 Cited
US5048099A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-10-10 1998-04-11 1998-10-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-10-10 2002-04-11 2002-10-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-10-10 2006-04-11 2006-10-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag