Method of bridging between contour elements in an image
First Claim
1. A digital processing method for bridging facing ends of disjointed contour elements in an image defined by pixel elements having intensity values stored in a digital image memory, comprising the steps of:
- defining a search window in a portion of the digital image memory defining points between each of the facing ends of the disjointed contour elements;
intersecting said points in the portion of the digital image memory defining the search window by lines and columns so as to form a graph for measuring a luminance gradient of the pixel element intensity values stored in the portion of the digital image memory defining points located at crossing points of the lines and columns inside the search window;
forming in the portion of the digital image memory defining said search window an elementary path connecting each crossing point to each of its neighboring crossing points;
computing an elementary coding cost for each elementary path between neighboring crossing points depending on the luminance gradient of the points located in the portion of the digital image memory defining the search window;
computing an optimum path for linking the facing ends of the disjointed contour elements by following, from one end of one contour element, a line linking all elementary paths having a minimum coding cost, and storing the optimum path in the portion of the digital image memory defining said points between facing ends of the digital contour elements.
0 Assignments
0 Petitions
Accused Products
Abstract
A method is provided for bridging between disjointed contour elements in an image by searching for an optimum bridging path between the facing ends of disjointed contour elements in the image. The method of the steps of defining a search window between each of the facing ends of the disjointed controur elements, considering in the window the different image points as nodes on a graph, determining an elementary cost associated with each path connecting each node to its neighboring nodes from amplitude and/or orientation data of the luminance function used for detecting the contours and in determining the optimum path by following, from the costs obtained, a line for which the luminance gradient of the detected points appears to be a maximum.
-
Citations
7 Claims
-
1. A digital processing method for bridging facing ends of disjointed contour elements in an image defined by pixel elements having intensity values stored in a digital image memory, comprising the steps of:
-
defining a search window in a portion of the digital image memory defining points between each of the facing ends of the disjointed contour elements; intersecting said points in the portion of the digital image memory defining the search window by lines and columns so as to form a graph for measuring a luminance gradient of the pixel element intensity values stored in the portion of the digital image memory defining points located at crossing points of the lines and columns inside the search window; forming in the portion of the digital image memory defining said search window an elementary path connecting each crossing point to each of its neighboring crossing points; computing an elementary coding cost for each elementary path between neighboring crossing points depending on the luminance gradient of the points located in the portion of the digital image memory defining the search window; computing an optimum path for linking the facing ends of the disjointed contour elements by following, from one end of one contour element, a line linking all elementary paths having a minimum coding cost, and storing the optimum path in the portion of the digital image memory defining said points between facing ends of the digital contour elements. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
3. A digital processing method as claimed in claim 2, wherein the optimum path computed in said optimum path computing step is determined as a function of the local orientation of the elementary path found at each crossing point j of the graph for causing a shape of a desired path to intervene in the value of the elementary coding cost for each elementary path between neighboring crossing points.
- 4. A digital processing method as claimed in claim 3, wherein the desired path is a rectilinear path and each elementary coding cost Cij is defined by a relationship equal to one of
- space="preserve" listing-type="equation">C.sub.ij =Max-a.sub.j +K.sub.1 ·
|θ
.sub.j -θ
.sub.mean |
and
space="preserve" listing-type="equation">C.sub.ij =Max-a.sub.j,/(K.sub.2 ·
Q)where K1 and K2 are constants, Q=|θ
j -θ
mean | if θ
j ≠
θ
mean or Q=1/K2 if θ
j =θ
mean and θ
j and θ
mean designate respectively the local orientation at crossing point j and the mean of the local orientations at said facing ends. - space="preserve" listing-type="equation">C.sub.ij =Max-a.sub.j +K.sub.1 ·
-
- 5. A digital processing method as claimed in claim 3, wherein the desired path has a local orientation which varies progressively, and each elementary coding cost Cij is defined by a relationship
- space="preserve" listing-type="equation">C.sub.ij =Max-aj/K.sub.2 ·
Q,
where K2 is a constant, Q=|θ
j -θ
i | if θ
j ≠
θ
i and Q=1/K2 if θ
j =θ
i and θ
j and θ
i designate respectively the local orientation at crossing points j and i. - space="preserve" listing-type="equation">C.sub.ij =Max-aj/K.sub.2 ·
Specification