CN108961333A

CN108961333A - Efficient calculation method for pixel area of image area

Info

Publication number: CN108961333A
Application number: CN201810641311.4A
Authority: CN
Inventors: 刘瑜
Original assignee: Hangzhou Jingyi Intelligent Science and Technology Co Ltd
Current assignee: Zhejiang Ruitest Technology Co ltd
Priority date: 2018-06-21
Filing date: 2018-06-21
Publication date: 2018-12-07
Anticipated expiration: 2038-06-21
Also published as: CN108961333B

Abstract

Discloses an efficient calculation method for the pixel area of an image region, namely, the center point C (x) of the image region in a known binary image I_c,y_c) 1, setting a linked list L = { a =_i(p, q) } and a table-tail pointer ep; 2. the center point C (x)_c,y_c) storing the pixel points around the chain list L, 3, judging the quadrant position of the elements in the chain list L relative to the central point C, entering the corresponding step, if the pointer ep of the table tail is 0, obtaining the pixel area value s of the image area, ending the process, 4, searching from the center to the outside in the first quadrant, accumulating the pixel number, 5, searching from the center to the outside in the second quadrant, accumulating the pixel number, 6, storing the pixel number in the second quadrant, and finally, obtaining the pixel area value of the image areaSearching the third quadrant from the center to the outside, and accumulating the number of pixels; 7. searching from the center outwards in the fourth quadrant, the number of pixels is accumulated.

Description

A kind of efficient calculation method of image-region elemental area

Technical field

The present invention relates to a kind of efficient calculation methods of image-region elemental area, belong to field of image processing.

Background technique

Computer vision is using more and more extensive, from simple videograph, develops as image recognition and analysis, than Such as Car license recognition, recognition of face, human body tracking and binocular stereo vision etc..Therefore the importance of image processing algorithm highlights Come, promote image denoising, image transformation, image segmentation, compression of images, image enhancement, image Fuzzy Processing scheduling algorithm it is fluffy It is vigorous fast-developing.

Summary of the invention

The present invention provides a kind of efficient calculation method of image-region elemental area, and the program is set out using central point, spiral shell The method for searching for the area pixel point outside rotation direction, this method have detection reliable, and algorithm arithmetic speed is fast, calculate accurate excellent Point.

The technical solution adopted by the present invention to solve the technical problems is:

A kind of efficient calculation method of image-region elemental area, it is known that bianry image I (x, y), wherein x=1 ~ M, y=1 ~ N, M For the maximum pixel number in x-axis direction, N is the maximum pixel number on y-axis direction, image-region I (x, y) be equal to 1, x=1 ~ M, y=1 ~ N, M are the maximum pixel number in x-axis direction, and N is the maximum pixel number on y-axis direction, and central point is C (x_c, y_c), it is achieved by the steps of:

(1) chained list L={ a is set_i, wherein a_i=(p, q), i=1,2,3......, table tail pointer ep is set, is directed toward in chained list L The elemental area s in interest region, initial value 1 is arranged in the position of latest data, initial value 0；

(2) chained list L is initialized, if I (x_c+1,y_c) be equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c+1,y_c), I (x_c+1, y_c)=0；If I (x_c,y_c+ 1) it is equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c,y_c+ 1), I (x_c,y_c+1)=0；If I (x_c-1, y_c) be equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c-1,y_c), I (x_c-1,y_c)=0；If I (x_c,y_c- 1) it is equal to 1, then s=s+1, Ep=ep+1, a_ep=(x_c,y_c- 1), I (x_c,y_c-1)=0；

(3) is calculated by completion, the pixel faces product value s of image-region is obtained, terminates the mistake if ep is equal to 0 by chained list L Journey；If a_ep.p-x_c> 0, and a_ep.q-y_c>=0, execute step 4；If a_ep.p-x_c≤ 0, and a_ep.q-y_c> 0, execute step Rapid 5；If a_ep.p-x_c< 0, and a_ep.q-y_c≤ 0, execute step 6；If a_ep.p-x_c>=0, and a_ep.q-y_c< 0, execute step Rapid 7；

(4) temporary variable (m, n) is established, m=a is enabled_ep.P, n=a_ep.Q, then ep=ep-1；If I (m+1, n) is equal to 1, then s=s + 1, ep=ep+1, a_ep=(m+1, n), I (m+1, n)=0；If I (m, n+1) is equal to 1, then s=s+1, ep=ep+1, a_ep=(m,n+ 1), I (m, n+1)=0；Return step 3；

(5) temporary variable (m, n) is established, m=a is enabled_ep.P, n=a_ep.Q, then ep=ep-1；If I (m-1, n) is equal to 1, then s=s + 1, ep=ep+1, a_ep=(m-1, n), I (m-1, n)=0；If I (m, n+1) is equal to 1, then s=s+1, ep=ep+1, a_ep=(m,n+ 1), I (m, n+1)=0；Return step 3；

(6) temporary variable (m, n) is established, m=a is enabled_ep.P, n=a_ep.Q, then ep=ep-1；If I (m-1, n) is equal to 1, then s=s + 1, ep=ep+1, a_ep=(m-1, n), I (m-1, n)=0；If I (m, n-1) is equal to 1, then s=s+1, ep=ep+1, a_ep=(m,n- 1), I (m, n-1)=0；Return step 3；

(7) temporary variable (m, n) is established, m=a is enabled_ep.X, n=a_ep.Y, then ep=ep-1；If I (m+1, n) is equal to 1, then s=s + 1, ep=ep+1, a_ep=(m+1, n), I (m+1, n)=0；If I (m, n-1) is equal to 1, then s=s+1, ep=ep+1, a_ep=(m,n- 1), I (m, n-1)=0；Return step 3.

Beneficial effects of the present invention are mainly manifested in: 1, method is simple, high-efficient, therefore arithmetic speed is fast；2, knot is calculated Fruit is accurate, and error is small.

Detailed description of the invention

Fig. 1 is the schematic diagram of the efficient calculation method of image-region elemental area.

Specific embodiment

The invention will be further described below in conjunction with the accompanying drawings:

Referring to Fig.1, a kind of efficient calculation method of image-region elemental area, it is known that bianry image I (x, y), wherein x=1 ~ M, Y=1 ~ N, M are the maximum pixel number in x-axis direction, and N is the maximum pixel number on y-axis direction, image-region I (x, y) etc. In 1, other regions I (x, y) is equal to 0, and central point is C (x_c,y_c).The efficient calculation method is achieved by the steps of:

(1) chained list L={ a is set_i, wherein a_i=(x, y), i=1,2,3......, table tail pointer ep is set, is directed toward in chained list L The elemental area s in interest region, initial value 1 is arranged in the position of latest data, initial value 0；

Step 1 is that subsequent calculating is prepared.Chained list L is used to store the outermost pixel from center radiation search around.

(2) chained list L is initialized, if I (x_c+1,y_c) be equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c+1,y_c), I (x_c+ 1,y_c)=0；If I (x_c,y_c+ 1) it is equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c,y_c+ 1), I (x_c,y_c+1)=0；If I (x_c- 1,y_c) be equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c-1,y_c), I (x_c-1,y_c)=0；If I (x_c,y_c- 1) it is equal to 1, then s=s+ 1, ep=ep+1, a_ep=(x_c,y_c- 1), I (x_c,y_c-1)=0；

In step 2, with central point C (x_c,y_c) be core, be to establish initiation search path, centered on point C (x_c,y_c) left up and down Right consecutive points.

(3) is calculated by completion, the pixel faces product value s of image-region is obtained, terminates this if ep is equal to 0 by chained list L Process；If a_ep.p-x_c> 0, and a_ep.q-y_c>=0, execute step 4；If a_ep.p-x_c≤ 0, and a_ep.q-y_c> 0, it executes Step 5；If a_ep.p-x_c< 0, and a_ep.q-y_c≤ 0, execute step 6；If a_ep.p-x_c>=0, and a_ep.q-y_c< 0, it executes Step 7；

Step 3 is the entrance of cyclic search, therefore carries out the judgement of termination condition first, if ep is equal to 0, completes image The calculating of the elemental area s in region, terminates the process；Otherwise, the position of latest data in chained list L is judged, according to place Relative to central point C (x_c,y_c) quadrant position select different steps to be handled.

(4) temporary variable (m, n) is established, m=a is enabled_ep.P, n=a_ep.Q, then ep=ep-1；If I (m+1, n) is equal to 1, Then s=s+1, ep=ep+1, a_ep=(m+1, n), I (m+1, n)=0；If I (m, n+1) is equal to 1, then s=s+1, ep=ep+1, a_ep= (m, n+1), I (m, n+1)=0；Return step 3；

(7) temporary variable (m, n) is established, m=a is enabled_ep.P, n=a_ep.Q, then ep=ep-1；If I (m+1, n) is equal to 1, then s=s + 1, ep=ep+1, a_ep=(m+1, n), I (m+1, n)=0；If I (m, n-1) is equal to 1, then s=s+1, ep=ep+1, a_ep=(m,n- 1), I (m, n-1)=0；Return step 3.

Step 4 is the searching method of first quartile, first upward again to the right；Step 5 is the searching method of the second quadrant, first to It is left upward again；Step 6 is the searching method of third quadrant, first to the left still further below；Step 7 is the searching method of fourth quadrant, first To the right still further below.When all paths reach the outermost of image-region, then the data in chained list L are deleted one by one, without new Data are added, then final ep is equal to 0, terminate calculating process.

Claims

1. a kind of efficient calculation method of image-region elemental area, it is known that bianry image I (x, y), wherein x=1 ~ M, y=1 ~ N, M is the maximum pixel number in x-axis direction, and N is the maximum pixel number on y-axis direction, and image-region I (x, y) is equal to 1, x=1 ~ M, y=1 ~ N, M are the maximum pixel number in x-axis direction, and N is the maximum pixel number on y-axis direction, and central point is C (x_c, y_c), it is characterised in that: it is achieved by the steps of:

(1) chained list L={ a is set_i, wherein a_i=(p, q), i=1,2,3......, table tail pointer ep is set, is directed toward in chained list L most The elemental area s in interest region, initial value 1 is arranged in the position of new data, initial value 0；

(2) chained list L is initialized, if I (x_c+1,y_c) be equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c+1,y_c), I (x_c+1,y_c) =0；If I (x_c,y_c+ 1) it is equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c,y_c+ 1), I (x_c,y_c+1)=0；If I (x_c-1,y_c) Equal to 1, then s=s+1, ep=ep+1, a_ep=(x_c-1,y_c), I (x_c-1,y_c)=0；If I (x_c,y_c- 1) it is equal to 1, then s=s+1, ep= Ep+1, a_ep=(x_c,y_c- 1), I (x_c,y_c-1)=0；