Picture processing device

Claim 2

A picture processing device for discriminating to extract out of a plurality of points to be processed on an original picture taken by picturing means points characteristic of the original picture, comprising: DDA computing means comprising a plurality of DDA computing devices of the same structure serially connected; memory means for storing the computation results of the DDA computing means in accordance with the DDA computing devices; and extraction means for extracting points characteristic of the original picture, based on the stored contents of the memory means.

Claim 3

A picture processing device for deriving an approximate straight line of curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, comprising: DDA computing means for computing a rotary motion recurrence formula subsequently every rotation by a set rotation angle in the pipe line system, the rotary recurrence formula being α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) when one point on the circumference of an approximate circle depicted on an α β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) memory means for storing values of at least said β i of the computation results given sequentially by the DDA computer means; and approximate straight line deriving means for deriving the approximate straight line of points of intersections of Hough curves which are given at the respective points to be processed based on the stored contents of the memory means.

Claim 4

A picture processing device for deriving an approximate straight line of curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, comprising: DDA computing means for computing a rotary motion recurrence formula subsequently every rotation by a set rotation angle in the pipe line system, the rotary recurrence formula being α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) when one point on the circumference of an approximate circle depicted on an α β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) memory means for storing values of at least said β i of the computation results given sequentially by the DDA computer means; and approximate straight line deriving means for deriving the approximate straight line of points of intersections of Hough curves which are given at the respective points to be processed based on the stored contents of the memory means.

Claim 5

A picture processing device according to claim 2, wherein the DDA computing means comprises a plurality of computing circuits serially connected which respectively compute said rotary motion recurrence formula every rotation by said rotation angle.

Claim 6

A picture processing device according to claim 2, wherein said rotary motion recurrence formula is α i+1 = α i (1-2 -2m-1 )-2 -m β i β i+1 = 2 -m α i +β i (1-2 -2m-1 ) when said rotation angle is ε=2 -m .

Claim 7

A picture processing device according to claim 2, wherein the memory means stores a value of at least said β i every rotation by said rotation angle.

Claim 8

A picture processing device according to claim 2, wherein the memory means stores brightness value data corresponding to brightnesses of the points to be processed on the original picture or to change ratios of the brightnesses.

Claim 9

A picture processing device according to claim 5, wherein the memory means stores the brightness value data of the points to be processed on the original picture in accordance with every rotation by said rotation angle.

Claim 10

A picture processing device according to claim 2, wherein the approximate straight line deriving means has a peak filter for subjecting data with respect to the points of intersections of the Hough curves to peak filtering.

Claim 11

A picture processing device according to claim 6, wherein the approximate straight line deriving means has a peak filter for multiplexing the brightness value data with data with respect to the points of intersection of the Hough curves and subjecting the multiplexed data to peak filtering.

Claim 12

A picture processing device for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: initial value computing means for computing an initial value based on the points to be processed on the original picture; DDA computing means comprising a plurality of DDA computing devices of the same structure serially connected for performing sequentially computing operations starting with the initial value; memory means for storing computed results of the DDA computing means in accordance with the DDA computing devices; and means for discriminating to extract the curves, based on the contents stored by the memory means.

Claim 13

A picture processing device for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: initial value computing means for computing an initial value based on the points to be processed on the original picture; DDA computing means comprising a plurality of DDA computing devices of the same structure serially connected for performing sequentially computing operations starting with the initial value; memory means for storing computed results of the DDA computing means in accordance with the DDA computing devices; and means for discriminating to extract the curves, based on the contents stored by the memory means.

Claim 14

A picture processing device for deriving an approximate straight line of curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, comprising: initial value computing means for computing coordinates (α i ,β i ) of an initial value in an α-β rectangular coordinates system, based on the points to be processed on the original picture; DDA computing means for computing a rotary motion recurrence formula subsequently every rotation by a set rotation angle from the coordinates (α i ,β i ) of the initial value in the pipe line system, the rotary recurrence formula being α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) memory means for storing values of at least said β i of the computation results given sequentially by the DDA computing means; and approximate straight line deriving means for deriving the approximate straight line of points of intersections of Hough curves which are given at the respective points to be processed based on the stored contents of the memory means.

Claim 15

A picture processing device for deriving an approximate straight line of curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, comprising: initial value computing means for computing coordinates (α i ,β i ) of an initial value in an α-β rectangular coordinates system, based on the points to be processed on the original picture; DDA computing means for computing a rotary motion recurrence formula subsequently every rotation by a set rotation angle from the coordinates (α i ,β i ) of the initial value in the pipe line system, the rotary recurrence formula being α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) memory means for storing values of at least said β i of the computation results given sequentially by the DDA computing means; and approximate straight line deriving means for deriving the approximate straight line of points of intersections of Hough curves which are given at the respective points to be processed based on the stored contents of the memory means.

Claim 16

A picture processing device according to claim 11, wherein when coordinates of the points to be processed are (x p ,y p ) in an x-y rectangular coordinate system, the initial value computing means computes the coordinates of the initial value (α₀,β₀) in the α-β rectangular coordinate system by α₀=-x p sinϑ′+y p cosϑ′ β₀=x p cosϑ′+y p sinϑ′.

Claim 17

A picture processing device according to claim 11, wherein the DDA computing means comprises a plurality of computing circuits serially connected which respectively compute said rotary motion recurrence formula every rotation by said rotation angle.

Claim 18

A picture processing device according to claim 11, wherein said rotary motion recurrence formula is α i+1 = α i (1-2 -2m-1 )-2 -m β i β i+1 = 2 -m α i +β i (1-2 -2m-1 ) when said rotation angle is ε=2 -m .

Claim 19

A picture processing device according to claim 11, wherein the memory means stores a value of at least said β i every rotation by said rotation angle.

Claim 20

A picture processing device according to claim 11, wherein the memory means stores brightness value data corresponding to brightnesses of the points to be processed on the original picture or to change ratios of the brightnesses.

Claim 21

A picture processing device according to claim 15, wherein the memory means stores the brightness value data of the points to be processed on the original picture in accordance with every rotation by said rotation angle.

Claim 22

A picture processing device according to claim 11, wherein the approximate straight line deriving means has a peak filter for subjecting data with respect to the points of intersections of the Hough curves to peak filtering.

Claim 23

A picture processing device according to claim 16, wherein the approximate straight line deriving means has a peak filter for multiplexing the brightness value data with data with respect to the points of intersection of the Hough curves and subjecting the multiplexed data to peak filtering.

Claim 24

A picture processing system for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: a first step computing a rotary motion recurrence formula α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α-β rectangular coordinate system has coordinates (α i ,β i ) and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) sequentially every rotation by said rotation angle or every plural rotations by said rotation angle along the entire circumference of said approximate circle or a part of the circumference thereof to thereby give Hough curves with respect with the respective points to be processd on the original picture; and a second step of deriving approximate straight lines of the curves interconnecting the points to be processed, based on points of intersection between at least two of the Hough curves given in the first step.

Claim 25

A picture processing system for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: a first step computing a rotary motion recurrence formula α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α-β rectangular coordinate system has coordinates (α i ,β i ) and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) sequentially every rotation by said rotation angle or every plural rotations by said rotation angle along the entire circumference of said approximate circle or a part of the circumference thereof to thereby give Hough curves with respect with the respective points to be processd on the original picture; and a second step of deriving approximate straight lines of the curves interconnecting the points to be processed, based on points of intersection between at least two of the Hough curves given in the first step.

Claim 26

A picture processing system for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: a first step of giving coordinates (α₀,β₀) of an initial value in a α-β coordinate system based on the points to be processed on the original picture; a second step of computing a recurrence formula α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α-β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) sequentially every rotation by the rotation angle from the initial value given in the first step; a third step of giving Hough curves with respect to the points to be processed, based on the computed results in the second step; and a fourth step of deriving an approximate straight line of a curve interconnecting the points to be processed, based on points of intersection between at least two of the Hough curves given by repeating the steps 1 to 3 on the respective points to be processed.

Claim 27

A picture processing system for discriminating to extract curves interconnecting a plurality of points to be processed on an original picture taken by picturing means, based on a characteristic of a distribution of the points to be processed thereon, comprising: a first step of giving coordinates (α₀,β₀) of an initial value in a α-β coordinate system based on the points to be processed on the original picture; a second step of computing a recurrence formula α i+1 = f α (α i ,β i ,ε) β i+1 = f β (α i ,β i ,ε) where one point on the circumference of an approximate circle depicted on an α-β rectangular coordinate system has coordinates (α i ,β i ), and a rotation angle from the coordinates to next coordinates (α i+1 ,β i+1 ) on the circumference is represented by ε (but i is a positive integer) sequentially every rotation by the rotation angle from the initial value given in the first step; a third step of giving Hough curves with respect to the points to be processed, based on the computed results in the second step; and a fourth step of deriving an approximate straight line of a curve interconnecting the points to be processed, based on points of intersection between at least two of the Hough curves given by repeating the steps 1 to 3 on the respective points to be processed.

Claim 28

A picture processing system according to claim 21, wherein when coordinates of the points to be processed are (x p ,y p ) in an x-y rectangular coordinate system, the first step gives the coordinates of the initial value (α₀,β₀) in the α-β rectangular coordinate system by α₀=-x p sinϑ′+y p cosϑ′ β₀=x p cosϑ′+y p sinϑ′.

Claim 29

A picture processing system according to claim 21, wherein when coordinates of the points to be processed are (x p ,y p ) in the x-y coordinate system, the first step gives the coordinates (α₀,β₀) of the initial value in the α β coordinate rectangular system.

Claim 30

A picture processing system according to claim 21, wherein the second step computes the recurrence formula α i+1 = α i (1-2 -2m-1 )-2 -m β i β i+1 = 2 -m α i +β i (1-2 -2m-1 ) where the rotation angle is ε=2 -m .

Claim 31

A picture processing system according to claim 21, wherein the third step gives Hough curves weighted by brightness value data based on brightnesses or brightness change ratios of the original picture at the points to be processed, and the fourth step derives the approximate straight line weighted by the brightness value data.

Claim 32

A peak data extracting device for extracting peak data from data present on coordinates of at least a two-­dimensional coordinate system, the extracting device comprising: comparing means for comparing data corresponding to coordinates adjacent to given coordinates of the coordinate system with the data corresponding to the given coordinate; and output means for outputting the values of the given coordinates and the data corresponding to the given coordinates when the comparing means judges the data of the given coordinates to peak data.

Claim 33

A peak data extracting device for extracting peak data from data present on coordinates of at least a two-­dimensional coordinate system, the extracting device comprising: comparing means for comparing data corresponding to coordinates adjacent to given coordinates of the coordinate system with the data corresponding to the given coordinate; and output means for outputting the values of the given coordinates and the data corresponding to the given coordinates when the comparing means judges the data of the given coordinates to peak data.

Claim 34

A peak data extracting device for extracting peak data from data corresponding to coordinates of at least a two-dimensional coordinate system having a first coordinate including a first to an n-th coordinate values (n is an integer above 3), and a second coordinate including a first to an m-th coordinate values (m is an integer above 3), the extracting device comprising: buffer means for temporarily storing data corresponding to nine coordinates which are in i-1-th, i-­th and i+1-th coordinates (i=0≦i≦n-1) in the first coordinate and a j-1-th, j-th, and j+1-th coordinates (j=0≦j≦m-1) in the second coordinate; comparing means for comparing the data corresponding to the i-th coordinates in the first coordinate and to the j-th coordinates in the second coordinate with the data corresponding to the other eight coordinates; and output means for outputting the data corresponding to the i-th coordinates in the first coordinate and to the j-th coordinates in the second coordinate as peak data when the data is maximum.

Claim 35

A peak data extracting device for extracting peak data from data corresponding to coordinates of at least a two-dimensional coordinate system having a first coordinate including a first to an n-th coordinate values (n is an integer above 3), and a second coordinate including a first to an m-th coordinate values (m is an integer above 3), the extracting device comprising: buffer means for temporarily storing data corresponding to nine coordinates which are in i-1-th, i-­th and i+1-th coordinates (i=0≦i≦n-1) in the first coordinate and a j-1-th, j-th, and j+1-th coordinates (j=0≦j≦m-1) in the second coordinate; comparing means for comparing the data corresponding to the i-th coordinates in the first coordinate and to the j-th coordinates in the second coordinate with the data corresponding to the other eight coordinates; and output means for outputting the data corresponding to the i-th coordinates in the first coordinate and to the j-th coordinates in the second coordinate as peak data when the data is maximum.

Claim 36

A peak extracting device according to claim 27 further comprising a sorting unit which has a plurality of sort circuits each including a pair of an input memory and a comparison memory for storing the peak data and the corresponding coordinate values, and which when a peak data of the input memory of a given stage of the sort circuits is higher than that of the comparison memory to the stage, transfers the contents of the input memory to the comparison memory of the stage while transferring the contents of the comparison memory of the stage to the sort circuit of a next stage, and when a peak data of the input memory of a given stage of the sort circuits is lower than that of the comparison memory of the stage, the contents of the input memory of the given stage is transferred to the input memory of a next stage.