KR100867163B1 - Image processing device capable of realtime thinning and method thereof - Google Patents

Abstract

An image processing device is provided to reduce a thinning process time. Binarization data are divided into predetermined image blocks and stored in an input storing unit(120). A thinning unit(140) parallel thins the divided image blocks. An input switch unit(130) connects the input storing unit and the thinning unit. An output storing unit(160) stored the thinned image blocks. An output switch unit(150) connects the thinning unit and the output storing unit. An image data reconfiguration unit(170) combines the thinned image blocks stored in the output storing unit and reconfigures the blocks as thinned image data.

Description

Image processing device capable of realtime thinning and method

1 is a block diagram of an image processing apparatus according to an embodiment of the present invention.

2 is a view showing an embodiment of a deletion mask for thinning the original image data according to an embodiment of the present invention.

3 is a diagram illustrating a process of thinning original image data using a thinning mask;

FIG. 4 is a diagram illustrating a number of miscellaneous branch pixels that may be generated in a process of thinning original image data by a deletion mask; FIG.

5 is a view showing an embodiment of an extension mask for thinning the original image data according to an embodiment of the present invention.

6 is a view showing a connection collapse phenomenon that may appear in the process of thinning the original image data by the deletion mask.

7 is a view showing a process of thinning original image data according to an embodiment of the present invention.

8 is a view showing original image data and thinning image data according to an embodiment of the present invention;

9 is a flowchart illustrating a method for thinning original image data according to an embodiment of the present invention.

<Explanation of symbols for the main parts of the drawings>

110: image data binarization unit

120: input storage unit

120-n: nth input storage unit

130: input switch unit

140: thinning section

140-n: Thinning Unit

150: output switch unit

160: output storage unit

160-n: Output storage unit

170: image data reconstruction unit

The present invention relates to an image processing apparatus and a method thereof, and more particularly, to an image data thinning apparatus and a method thereof.

The image data thinning method extracts only the image skeleton of the input raw data in order to reduce the amount of computation while maintaining an image unique to the image data. The image data thinning method is used for character recognition, fingerprint recognition, and defect inspection of a circuit board. . This is because when the original image data is thinned, only the skeleton of the subject captured in the original image data is extracted (that is, only the characteristics of the coupling relationship of the figures constituting the subject) can significantly reduce the amount of data stored. .

The image data thinning method must satisfy the following requirements.

First, connectivity must be maintained. That is, connectivity of the subject image included in the original image data should be maintained. Second, the thinned subject image should have a thickness of one pixel. Third, the thinned subject image should be located at the center of the original subject image. Finally, the noise of the original image data should not affect the thinned image data.

However, since the thinning method requires an iterative calculation, a method for quickly processing the thinning method is required. Therefore, a method of processing original image data in parallel in units of blocks has emerged. However, the conventional image data parallel thinning method is easy to implement a system because it does not need to consider the previous processing step in the iterative processing, but there is a difficulty in maintaining connectivity, which is one of the basic requirements of thinning. That is, when one subject image is divided into a plurality of blocks and thinned, the thinned image data in units of blocks may have a problem in that connectivity may be broken.

In addition, the conventional image data parallel thinning apparatus cannot process any other original image data continuously inputted while thinning one input original image data. As a result, there is a problem that the thinning processing time becomes long.

In order to solve the above problems, the present invention is to provide an image processing apparatus and method that can maintain the connection of the thinned image data.

In addition, the present invention is to provide an image processing apparatus and method that can reduce the thinning processing time.

According to an embodiment of the present invention, an image processing apparatus for thinning image data includes: an input storage unit for dividing binarized data into predetermined image blocks; A thinning unit for thinning the divided image blocks in parallel; An input switch unit connecting the input storage unit and the thinning unit; An output storage unit for storing the thinned image blocks; An output switch unit connecting the thinning unit and the output storage unit; And an image data reconstructing unit for reconstructing thinning image data by combining the thinning image blocks included in each output storage unit, wherein n is an natural number. Is provided.

The input storage unit may include n input storage units, and the binarization data sequentially input may be stored in corresponding input storage units.

In addition, the input storage unit includes m internal input memory areas each divided, and the binarization data is divided into m video blocks and stored in the corresponding internal input memory areas, respectively, where m is a natural number. have.

The input storage unit may sequentially store the binarization data sequentially input to each of the n input storage units.

In addition, when the input switch unit connects the n-1 input storage unit and the thinning unit, the input switch unit may terminate the thinning of the binarization data stored in the n-1 input storage unit and the nth input storage unit and the thinning unit. You can connect the thinning section.

The thinning unit may include m thinning units for thinning m blocks of the image in parallel.

The thinning unit may thin the image blocks by deleting a pixel to be deleted in the image block, wherein the thinning unit is configured to remove the target pixel if the preset pixel area is the same as a predetermined pixel area at the center of the target pixel. The pixel may be determined as the pixel to be deleted.

Further, the pixel area is a 3X3 (horizontal X vertical) area, the target pixel corresponds to '1', and the erase mask is a 3X3 (horizontal X vertical) area, and is located in a clockwise direction from the top of the target pixel. The pattern of the eight neighboring pixels may be one or more of the following patterns (but list the rows located at the top).

1.0-0-x-1-1-1-x-0

2. 0-0-0-x-1-x-1-x

3.x-0-0-0-x-1-1-1

4. 1-x-0-0-0-x-1-x

5. 1-1-x-0-0-0-x-1

6. 1-x-1-x-0-0-0-x

7.x-1-1-1-x-0-0-0

8. 0-x-1-x-1-x-0-0

Further, when the pattern of the erase mask is 0-0-0-x-1-x-1-x (the second pattern) and the pixel area is the same as the erase mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 4x3 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the deletion target pixel, and the extended pixel area is the pixel. The pixel area of the 4X3 area further includes three pixels on the left side of the area, and the extended mask is a mask of the 4X3 area. The pattern of each pixel (including the target pixel) positioned from the left of each row is one of the following patterns. This can be (but list the rows starting at the top).

1.0-0-0-0, 0-1-1-0, x-x-1-x

2.x-x-0-0, 0-1-1-0, 0-0-1-x

Further, when the pattern of the erasure mask is x-0-0-0-x-1-1-1 (the third pattern) and the pixel area is the same as the erasure mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 4x3 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the deletion target pixel, and the extended pixel area is the pixel. A pixel area of a 4X3 area including three more pixels on the left side of the area, and the extended mask is a mask of the 4X3 area. The pattern of each pixel (including the target pixel) positioned from the left side of each row is 0-1-1. -0, 0-1-1-0, 0-1-1-0, with the top row listed first.

Further, when the erase mask pattern is 1-x-0-0-0-x-1-x (the fourth pattern) and the pixel area is the same as the erase mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 3X4 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the erased pixel, and the extended pixel area is the pixel. A pixel area of a 3X4 area including three more pixels at the top of the area, and the extension mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is 0-0-0. , 1-1-0, 1-1-0, and x-0-0 (listed from the top row).

Further, when the erase mask pattern is 1-x-0-0-0-x-1-x (the fourth pattern) and the pixel area is the same as the erase mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 4x3 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the deletion target pixel, and the extended pixel area is the pixel. The pixel area of the 4X3 area further includes three pixels on the left side of the area, and the extended mask is a mask of the 4X3 area. The pattern of each pixel (including the target pixel) positioned from the left of each row is one of the following patterns. This can be (but list the rows starting at the top).

1.x-1-1-x, 0-1-1-0, 0-0-0-0

2.0-0-1-x, 0-1-1-0, x-1-0-0

Further, when the pattern of the erasure mask is 1-1-x-0-0-0-x-1 (the fifth pattern), and the pixel area is the same as the erasure mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 3X4 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the erased pixel, and the extended pixel area is the pixel. A pixel area of a 3X4 area including three more pixels at the top of the area, and the extension mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is 0-0-0. , 1-1-1, 1-1-1, 0-0-0 (but list at the top).

Further, when the erase mask pattern is 1-x-1-x-0-0-0-x (the sixth pattern) and the pixel area is the same as the erase mask, the thinning unit is the pixel area. Comparing an extended pixel area of a 3X4 area including a preset expansion mask, and if the extended pixel area is not the same as the extended mask, the target pixel is determined as the erased pixel, and the extended pixel area is the pixel. A pixel area of a 3x4 area including three more pixels at the top of the area, and the extended mask is a mask of a 3x4 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is 0-0-x. , 0-1-1, 0-1-1, 0-0-x (but list the top row first).

The thinning unit may thin the image blocks by deleting a deletion target pixel in the image block, which is a target of thinning, wherein the thinning unit is an additional pixel line adjacent to another image block adjacent to the image block. By inserting the image block can be thinned.

In addition, the thinning unit may scan the image block once to delete the pixel to be deleted, and then remove the additional pixel line.

The output storage unit may include n output storage units, and the binarization data inputted sequentially thinning may be stored in corresponding output storage units.

When the input switch unit connects the n-1th input storage unit and the thinning unit, the output switch unit connects the n-1th output storage unit and the thinning unit to the n-1th input storage unit. When thinning of the stored binarization data is completed, the thinned binarized data may be stored in the n-th output storage unit.

The output switch unit may connect the n-th output storage unit and the thinning unit when the thinned binarization data is stored in the n-th output storage unit.

In addition, the output storage unit may include m internal output memory areas each divided, and m image blocks may be thinned by the thinning unit and stored in the corresponding internal output memory areas.

According to another embodiment of the present invention for solving the above problems, an image processing method for thinning image data, the method comprising: dividing the binarization data into predetermined image blocks; Determining whether a pixel area included in each image block and having a target pixel at the center thereof is the same as a preset erase mask; Determining whether the erase mask is a preset extension target mask when the pixel area and the erase mask are the same; Comparing the preset extended pixel area with a preset extended mask when the deletion mask is the same as the extended target mask; And deleting the target pixel if the extension pixel area and the extension mask are not identical to each other.

The image processing method may further include deleting the target pixel if the pixel area and the deletion mask are not the same.

Further, the pixel area is a 3X3 (horizontal X vertical) area, the target pixel corresponds to '1', and the erase mask is a 3X3 (horizontal X vertical) area, and is located in a clockwise direction from the top of the target pixel. The pattern of eight neighboring pixels may be one or more of the following patterns (where x is not considered as do not care).

1.0-0-x-1-1-1-x-0

2. 0-0-0-x-1-x-1-x

3.x-0-0-0-x-1-1-1

4. 1-x-0-0-0-x-1-x

5. 1-1-x-0-0-0-x-1

6. 1-x-1-x-0-0-0-x

7.x-1-1-1-x-0-0-0

8. 0-x-1-x-1-x-0-0

In addition, the extension target mask may be one or more of the following patterns 2 to 6 of the patterns.

In addition, when the pattern of the extension target mask is 0-0-0-x-1-x-1-x (the second pattern), the expansion pixel area further includes three pixels on the left side of the pixel area. The extended mask is a pixel area of a 4X3 area, and the extended mask is a mask of a 4X3 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row may be one or more of the following patterns (a row positioned at the top) Listed).

1.0-0-0-0, 0-1-1-0, x-x-1-x

2.x-x-0-0, 0-1-1-0, 0-0-1-x

 In addition, when the pattern of the extension target mask is x-0-0-0-x-1-1-1 (the third pattern), the expansion pixel area further includes three pixels on the left side of the pixel area. The extended mask is a mask of the 4X3 area, and the extended mask is a mask of the 4X3 area. The pattern of each pixel (including the target pixel) positioned from the left of each row is 0-1-1-0, 0-1-1-0, May be 0-1-1-0, with the top row listed first.

In addition, when the pattern of the extension target mask is 1-x-0-0-0-x-1-x (the fourth pattern), the expansion pixel area further includes three pixels on the upper portion of the pixel area. The extended mask is a 3X4 pixel area, and the extended mask is a mask of the 3X4 area. It can be 0, x-0-0 (listed from the top row).

In addition, when the pattern of the extension target mask is 1-x-0-0-0-x-1-x (the fourth pattern), the expansion pixel area further includes three pixels on the left side of the pixel area. The extended mask is a pixel area of a 4X3 area, and the extended mask is a mask of a 4X3 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row may be one or more of the following patterns (a row positioned at the top) Listed).

1.x-1-1-x, 0-1-1-0, 0-0-0-0

2.0-0-1-x, 0-1-1-0, x-1-0-0

In addition, when the pattern of the expansion target mask is 1-1-x-0-0-0-x-1 (the fifth pattern), the expansion pixel area further includes three pixels on the upper portion of the pixel area. A pixel area of a 3X4 area, and the extension mask is a mask of a 3X4 area. The pattern of each pixel (including the target pixel) located from the left of each row is 0-0-0, 1-1-1, 1-1- May be 1, 0-0-0 (listed from top row).

In addition, when the pattern of the extension target mask is 1-x-1-x-0-0-0-x (the sixth pattern), the expansion pixel region further includes three pixels on the upper portion of the pixel region. A pixel area of a 3X4 area, and the extension mask is a mask of a 3X4 area. The pattern of each pixel (including the target pixel) located from the left of each row is 0-0-x, 0-1-1, 0-1- May be 1, 0-0-x (listed first from the top row).

The determining of whether the pixel area and the erase mask are the same may include: inserting one additional pixel line adjacent to another image block adjacent to the image block; And determining whether a pixel area included in the image block in which the additional pixel line is inserted and the target pixel is the same as the erase mask is the same.

The image processing method may further include removing the additional pixel line after deleting the pixel to be deleted by scanning the image block into which the additional pixel line is inserted once.

As the invention allows for various changes and numerous embodiments, particular embodiments will be illustrated in the drawings and described in detail in the written description. However, this is not intended to limit the present invention to specific embodiments, it should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In the following description of the present invention, if it is determined that the detailed description of the related known technology may obscure the gist of the present invention, the detailed description thereof will be omitted.

Terms such as first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component. The term and / or includes a combination of a plurality of related items or any of a plurality of related items.

When a component is referred to as being "connected" or "connected" to another component, it may be directly connected to or connected to that other component, but it may be understood that other components may be present in between. Should be. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that there is no other component in between.

The terminology used herein is for the purpose of describing particular example embodiments only and is not intended to be limiting of the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "comprise" or "have" are intended to indicate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, and one or more other features. It is to be understood that the present invention does not exclude the possibility of the presence or the addition of numbers, steps, operations, components, components, or a combination thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in the commonly used dictionaries should be construed as having meanings consistent with the meanings in the context of the related art, and shall not be construed in ideal or excessively formal meanings unless expressly defined in this application. Do not. Hereinafter, with reference to the accompanying drawings will be described an embodiment of the present invention.

1 is a block diagram of an image processing apparatus according to an embodiment of the present invention. Referring to FIG. 1, an image processing apparatus 100 according to an exemplary embodiment may include an image data binarization unit 110, an input storage unit 120, an n th input storage unit 120-1, 120-2. ... 120-n, hereinafter referred to collectively as '120-n' (where n is a natural number), input switch unit 130, thinning unit 140, thinning unit 140-1, 140-2. ... 140-n, hereinafter referred to collectively as '140-m' (where m is a natural number), output switch unit 150, output storage unit 160, output storage unit 160-1, 160-2. ... ... 160-n, hereinafter referred to collectively as '160-n' and the image data reconstruction unit 170.

 The image data binarization unit 110 may binarize the input original image data to generate binarized original image data (hereinafter, referred to as 'binarization data') and transmit the same to the input storage unit 120. In this case, the binarization data may be generated by analyzing the contrast value of each pixel of the original image data in the image data binarization unit 110.

For example, the image data binarization unit 110 may adjust to '0' if the contrast value (or luminance value) of each pixel of the original image data is greater than or equal to a preset threshold value, or to the opposite value (1). After generating the binarization data, it can be transmitted to the input storage unit 120.

The input storage unit 120 may divide and store binary data sequentially input into predetermined image blocks. In this case, as shown in FIG. 1, since the input storage unit 120 may include a plurality of input storage units 120-n, the binarized data sequentially input is respectively corresponding to the input storage unit 120-n. ) Can be stored. That is, if the first binarization data is stored in the first input storage unit 120-1, the second binarization data (that is, a frame input following the first binarization data) sequentially input is stored in the second input. It may be stored in the unit (120-2). In addition, it is apparent that the second binarization data input after the second binarization data may be stored in the third input storage unit 120-3.

In this case, it is assumed that the second binarization data is input while the first binarization data is thinned by the thinning unit 140. In this case, the second binarization data may be divided into a plurality of image blocks while the first binarization data is thinned by the thinning unit 140, and may be stored in the second input storage unit 120-2. That is, the conventional thinning apparatus cannot process the second binarization data until the thinning of the first binarization data is completed, but the image processing apparatus 100 according to the present invention thins the first binarization data. The processing for dividing the second binarization data may be performed even before the processing is completed.

In addition, although not shown in FIG. 1, each input storage unit 120-n may include a plurality of internal input memory areas (not shown), and the binarization data may be divided into image blocks to each internal input memory area. (Not shown). That is, as described above, the binarization data may be divided into image blocks, and the image blocks may be respectively stored in an internal input memory area (not shown). Therefore, the input storage unit 120-n may include an internal input memory area (not shown) with the number of image blocks or more. This is because the number of image blocks may be divided into different numbers according to the type and / or method of the input original image data.

In addition, the input storage unit 120 may further include an input control unit (not shown) for dividing the input binarization data and storing it in the corresponding input storage unit 120-n. That is, when the binarization data is sequentially input to the input storage unit 120, the input storage unit 120 may divide the binarization data into a preset number and sequentially store the binarization data in the input storage unit 120-n.

The input switch unit 130 may connect the input storage unit 120 and the thinning unit 140. More specifically, the input switch unit 130 may connect the thinning unit 140 and the input storage unit 120-n in which the most recently stored binarization data is stored. For example, it is assumed that the most recently stored binarization data is first binarization data, and the first binarization data is stored in the first input storage unit 120-1. In this case, the input switch unit 130 may connect the first input storage unit 120-1 and the thinning unit 140.

In addition, when the thinning of the first binarization data is completed, the input switch unit 130 may include a second input storage unit 120-2 and a thinning unit (2-2) in which second binarization data input subsequent to the first binarization data is stored. 140) can be connected. That is, when the binarization data of one frame is thinned, the input switch unit 130 may connect the thinning unit 140 and the input storage unit 120-n in which the binarized data subsequently input is stored.

In addition, the input switch unit 130 determines whether the thinning of any binarization data in the thinning unit 140 is terminated and / or the input storage unit 120-n in which the binarization data subsequently input is stored. It may include an input switch control unit (not shown).

In addition, although it has been described herein as determining the input storage unit 120-n in which the binarization data subsequently inputted by the input switch unit 130 is stored, this may be determined by the input storage unit 120. That is, when the input storage unit 120 receives a signal from the input switch unit 130 that the thinning of the binarization data of one frame is finished, the input storage unit 120- stores the binarization data of the subsequent input frame. n) and the input switch unit 130 may be connected.

In addition, the input switch unit 130 may be omitted when the input storage unit 120 determines the input storage unit 120-n in which binarization data subsequently input is stored. For example, when the input storage control unit (not shown) included in the input storage unit 120 receives a signal indicating that the thinning of the binarization data of one frame is completed from the thinning unit 140, The input storage unit 120-n in which the binarization data is stored may be connected to the thinning unit 130.

The thinning unit 140 may thin the divided image blocks in parallel. In this case, the thinning unit 140 may include a thinning unit 140-m equal to or greater than the number of divided image blocks in order to thin the plurality of image blocks in parallel at the same time. Each thinning unit 140-n may scan each input image block to remove the outermost pixel of the pixel corresponding to the subject line by line. In this case, each thinning unit 140-n may thin the image block by repeatedly performing the operation of comparing the preset pixel area with the preset erasing mask. Hereinafter, the operation of the thinning unit 140 will be described in detail with reference to FIGS. 2 to 7.

2 is a view showing an embodiment of a deletion mask for thinning the original image data according to an embodiment of the present invention.

Referring to FIG. 2, eight embodiments of a preset deletion mask are shown. Here, the erase mask is a mask for determining whether the thinning unit 140 or the thinning unit 140-n (hereinafter, referred to as the thinning unit 140-n) is a target pixel. As a result, the thinning unit 140 or the thinning unit 140-n may determine that the target pixel is the deletion target pixel when the preset pixel area and the deletion mask are the same.

In this case, the pixel area may be an aXa (horizontal X length) area (where a is a natural number) in which the target pixel is located, and it is assumed that the pixel area is a 3X3 area. In addition, the erase mask is a 3X3 region, and the pattern of eight neighboring pixels located clockwise from the top of the target pixel may be one or more of the following patterns (where x is not considered as do not care).

210.0-0-x-1-1-1-x-0

220. 0-0-0-x-1-x-1-x

230. x-0-0-0-x-1-1-1

240. 1-x-0-0-0-x-1-x

250. 1-1-x-0-0-0-x-1

260. 1-x-1-x-0-0-0-x

270.x-1-1-1-x-0-0-0

280. 0-x-1-x-1-x-0-0

In this case, the target pixel corresponds to '1', and the thinning unit 140-n may not compare the erase mask if the target pixel corresponds to '0'. That is, the thinning unit 140-n may compare the pixel area and the erase mask only when the target pixel corresponds to '1'. Further, 'x' means 'do not care', and any value of '0' or '1' may be located at the position of x. That is, the thinning unit 140-n may ignore a value corresponding to the x value of the erase mask among the values of the pixel area.

In this case, when the image data binarization unit 110 generates the binarization data by adjusting the intensity (or luminance value) of each pixel of the original image data to '0' if it is greater than or equal to a preset threshold, and to '1' if it is less than the preset value. Assume That is, it is assumed that the pixel corresponding to the thinning subject image is binarized to correspond to '1'. Therefore, when the original image data is reversed, that is, when the pixel corresponding to the thinning subject image is binarized to correspond to '0', the above-described pattern of the erase mask may be changed.

For example, when the pixel corresponding to the thinning subject image is binarized to correspond to '0', the above-described pattern 210 may be '1-1-x-0-0-0-x-0'. have. Obviously, the remaining 2 to 8 patterns may be changed in the same manner.

3 is a diagram illustrating a process of thinning original image data using a thinning mask.

Referring to FIG. 3, a part of a process of thinning one image block 310 is illustrated. First, the first pixel region 320-1 is not an erase target pixel because the value of the target pixel corresponding to the center pixel corresponds to '0'. Therefore, the thinning unit 140-n may not compare the first pixel area with the erase mask.

However, since the value of the target pixel of the second pixel region 330-1 corresponds to '1', the thinning unit 140-n may compare the second pixel region 330-1 with the erase mask. In this case, it can be seen that the second pixel area 330-1 is the same as the 210 pattern among the erase masks illustrated in FIG. 2. Accordingly, the thinning unit 140-n may determine the target pixel as the deletion target pixel and change the value of the target pixel from '1' to '0'.

Also, the third pixel area 340-1 is not an erase target pixel because the value of the target pixel corresponds to '0'.

That is, the thinning unit 140-n may repeat the above-described process until the pixel to be deleted does not exist to thin the image block. In this case, when the thinning unit 140-n determines whether one target pixel is a deletion target pixel, all of the eight deletion masks described above may be compared with the target pixel.

The conventional image processing apparatus first scans (or subcycles) an image block using one or two deletion masks to determine one pixel to be deleted because of a large amount of computation, and then, among the remaining deletion masks, One or two erase masks were used to scan the image blocks (1-subcycle or 2-subcycle). This scan operation may be repeatedly removed until all of the erase masks are completed to remove the outermost pixel of the erase target pixel included in the image block.

That is, only one erase mask may be used to scan the entire image block a plurality of times before the outermost erase target pixel of a line may be removed. Otherwise, if the target pixel is deleted as soon as the target pixel is determined to be deleted, unnecessary miscellaneous branches may be generated.

FIG. 4 is a diagram illustrating a miscellaneous branch pixel that may be generated in a process of thinning original image data by a deletion mask.

Herein, it is assumed that a conventional image processing apparatus thins an image block into four sub-cycles, and the image block is first scanned using the 210 and 220 erase masks. In this case, it is assumed that a conventional image processing apparatus deletes a target pixel immediately after determining that the target pixel is a deletion target pixel.

In this case, referring to FIG. 4, the fourth pixel region 410-1 in the first image block 410 is not the same as the masks 210 and 220, and the fifth pixel region 410-2 is mask 220. Is the same as That is, the target pixel of the fourth pixel region 410-1 is not the erasing target pixel, and the target pixel of the fifth pixel region 410-2 is the deletion target pixel. Accordingly, a miscellaneous branch such as a large pixel of the sixth pixel area 420-1 in the second image block 420 illustrated in FIG. 4 may be generated.

In this case, it can be seen that the sixth pixel region 420-1 is not the same as the erase mask illustrated in FIG. 2. Therefore, the target pixel of the sixth pixel region 420-1 (ie, the miscellaneous pixels) cannot be deleted using the erase mask illustrated in FIG. 2.

In addition, the fifth pixel region 430-1 and the sixth pixel region 440-1 may also be generated by the above-described method, and are not the same as the erase mask shown in FIG. 2. That is, when the conventional image processing apparatus thins an image block into four sub-cycles, unnecessary miscellaneous branches may be generated.

Accordingly, the image processing apparatus (particularly, the thinning unit 140-n) according to the present invention may use all eight erase masks described above in order to determine one pixel to be deleted. You can scan. That is, the thinning unit 140-n may delete all the pixels to be deleted after determining whether all of the target pixels included in the image block are pixels to be deleted. All eight erase masks can be used (hereinafter, the case where the thinning unit 140-n uses all erase masks when scanning the entire image block once is referred to as 1-subcycle).

That is, the thinning unit 140-n according to the embodiment of the present invention may not generate the pixels of the miscellaneous branches.

5 is an embodiment of an extension mask for thinning the original image data according to an embodiment of the present invention.

5, an embodiment of an extension mask is shown. Here, the extension mask may be a mask for preventing erasing pixels having an even line thickness from being erased by thinning of the thinning unit 140-n. That is, the subject image in the image block may be thinned to a thickness of one pixel. If the thickness of the subject image before thinning is an even line, all of the subject images may be deleted by thinning.

For example, assume that the erased pixels are collectively deleted after being scanned with 1-sub cycle as described above. In this case, when the thickness of the subject image is an even line, all pixels constituting the subject image may be determined as pixels to be deleted. Therefore, if the thickness of the subject image in the image block is an even line, the subject image may be deleted after being scanned with 1-subcycle.

In order to overcome this problem, the thinning unit 140-n may have the same pixel area as any one or more of the following patterns (that is, any one or more of the patterns 2 to 6 described above) among the patterns of the erase mask described above. Can be compared again with the preset extension mask.

220. 0-0-0-x-1-x-1-x,

230. x-0-0-0-x-1-1-1

240. 1-x-0-0-0-x-1-x

250. 1-1-x-0-0-0-x-1

260. 1-x-1-x-0-0-0-x

That is, if the pattern of the erasure mask is 0-0-0-x-1-x-1-x (pattern 220 described above) and the pixel area is the same as the erasure mask of pattern 220, the thinning unit 140- n) may compare the extended pixel area and the extended mask of the 4X3 area including the pixel area, and if the extended pixel area is not the same as the extended mask, the target pixel may be determined to be the erased pixel. In this case, the extended pixel area may be a pixel area of a 4X3 area in which three more pixels are included on the left side of the pixel area, and the extended mask is a mask of the 4X3 area, and the extended mask area of each pixel (including the target pixel) located from the left of each row is included. The pattern may be one or more of the following patterns (ie, pattern 510 and / or pattern 520) (but list them from the top row).

510.0-0-0-0, 0-1-1-0, x-x-1-x

520.x-x-0-0, 0-1-1-0, 0-0-1-x

Further, if the pattern of the erasure mask is x-0-0-0-x-1-1-1 (pattern 230 described above) and the pixel area is the same as the erasure mask of pattern 230, the thinning unit 140- n) may compare the expansion pixel area of the 4X3 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, the target pixel may be determined as the deletion target pixel. In this case, the extended pixel area may be a pixel area of a 4 × 3 area in which three more pixels are included on the left side of the pixel area, and the extended mask is a mask of the 4 × 3 area and includes the pixels of each pixel (including the target pixel) located from the left of each row. The pattern may be the following pattern (ie, pattern 530) (but list the rows located at the top).

530. 0-1-1-0, 0-1-1-0, 0-1-1-0

If the pattern of the erasure mask is 1-x-0-0-0-x-1-x (pattern 240 described above) and the pixel area is the same as the erasure mask of pattern 240, the thinning unit 140- n) compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, the target pixel may be determined as the deletion target pixel. In this case, the extended pixel area may be a pixel area of a 3 × 4 area in which three more pixels are included on the upper part of the pixel area, and the extended mask is a mask of the 3 × 4 area and includes the pixels of each pixel (including the target pixel) located from the left of each row. The pattern may be the following pattern (ie, pattern 540), with the first line listed first.

540. 0-0-0, 1-1-0, 1-1-0, x-0-0

If the pattern of the erasure mask is 1-x-0-0-0-x-1-x (pattern 240 described above) and the pixel area is the same as the erasure mask of pattern 240, the thinning unit 140- n) may compare the expansion pixel area of the 4X3 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, the target pixel may be determined as the deletion target pixel. In this case, the extended pixel area may be a pixel area of a 4 × 3 area in which three more pixels are included on the left side of the pixel area, and the extended mask is a mask of the 4 × 3 area and includes the pixels of each pixel (including the target pixel) located from the left of each row. The pattern may be one or more of the following patterns (ie, pattern 550 and / or pattern 560), but starting from the top row.

550.x-1-1-x, 0-1-1-0, 0-0-0-0

560.0-0-1-x, 0-1-1-0, x-1-0-0

If the pattern of the erasure mask is 1-1-x-0-0-0-x-1 (pattern 250 described above) and the pixel area is the same as the erasure mask of pattern 250, the thinning unit 140- n) compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, the target pixel may be determined as the deletion target pixel. In this case, the extended pixel area may be a pixel area of a 3 × 4 area in which three more pixels are included on the upper part of the pixel area, and the extended mask is a mask of the 3 × 4 area and includes the pixels of each pixel (including the target pixel) located from the left of each row. The pattern may be the following pattern (ie, pattern 570) (but list the rows located at the top).

570. 0-0-0, 1-1-1, 1-1-1, 0-0-0

If the pattern of the erasure mask is 1-x-1-x-0-0-0-x (pattern 260 described above) and the pixel area is the same as the erasure mask of pattern 260, the thinning unit 140- n) compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, the target pixel may be determined as the deletion target pixel. In this case, the extended pixel area may be a pixel area of a 3 × 4 area in which three more pixels are included on the upper part of the pixel area, and the extended mask is a mask of the 3 × 4 area and includes the pixels of each pixel (including the target pixel) located from the left of each row. The pattern may be the following pattern (ie, pattern 580) (listing from the top row).

580.0-0-x, 0-1-1, 0-1-1, 0-0-x

By the above-described method, it is possible to prevent all of the subject images from being deleted. That is, when the pixel area is the same as the pattern 220 to 260 described above, the thinning unit 140-n may compare the expansion pixel area with a preset expansion mask, and when the expansion pixel area is not the same as the expansion mask. Only the target pixel can be determined as the target pixel to be deleted. As a result, when the thinning operation is performed by the 1-sub cycle, all of the subject images may be prevented from being deleted.

FIG. 6 is a diagram illustrating a connection collapse phenomenon that may occur in the process of thinning original image data by a deletion mask.

Referring to FIG. 6, a case where binarization data 610 is divided into two image blocks and thinned respectively is illustrated. Since the thinning unit 140-n deletes the outermost pixel of the subject image (that is, the set of pixels corresponding to the '1' value) in the image block, the connectivity of the thinned subject image as shown in FIG. 6 is reduced. This may collapse (650-1, 650-2).

That is, when one subject image is divided over two or more image blocks, connectivity of the thinned subject image may be collapsed. Hereinafter, a method for preventing the connection collapse phenomenon described above with reference to FIG. 7 will be described in detail.

7 is a diagram illustrating a process of thinning original image data according to an embodiment of the present invention.

Referring to FIG. 7, a case where binarization data is divided into two image blocks and thinned respectively is illustrated. The thinning unit 140-n may thin the image block by deleting a deletion target pixel included in the image block that is the thinning target. In this case, the thinning unit 140-n may thin the image block by inserting one adjacent additional pixel line of another image block adjacent to the image block.

For example, it is assumed that one subject image (that is, a set of pixels corresponding to '1') is divided into two image blocks and thinned in different thinning units 140-n, respectively. In this case, the image block thinned by the first thinning unit 140-1 is called a first image block 710-1, and the image block thinned by the second thinning unit 140-2 is called a second image block. The image block 710-2 is called.

The first thinning unit 140-1 is connected to the second thinning unit 140-2, and is the first of the vertical pixel lines (ie, 'columns') included in the second image block 710-2. The vertical pixel line connected to the image block 710-1 (hereinafter referred to as an “additional pixel line”) may be received and inserted into the first image block 710-1. Referring to FIG. 7, the first thinning unit 140-1 may receive the leftmost vertical pixel line of the second image block 710-2 as an additional pixel line. It can be inserted into the rightmost vertical pixel line in 1).

The second thinning unit 140-2 may receive the rightmost vertical pixel line of the first image block 710-1 as an additional pixel line, and this is the leftmost vertical of the second image block 710-2. Can be inserted into the pixel line.

In addition, the first thinning unit 140-1 and / or the second thinning unit 140-2 may perform the above-described thinning operation after inserting the additional pixel line. Due to the insertion of the additional pixel line, the subject image included in the outermost pixel of each of the image blocks 710-1 and 710-2 may not be determined to be the pixel to be deleted.

Further, the thinning unit 140-n may remove the additional pixel line after performing the thinning of the 1-subcycle (that is, after scanning the image block once) and inserting a new additional pixel line. can do. That is, after removing the additional pixel line, the first thinning unit 140-1 removes the additional pixel line, and thus, the additional pixel line (ie, the outermost pixel) in the second image block 710-2 from the second thinning unit 140-2. Column) and insert it into the first image block 710-1.

Of course, the second thinning unit 140-2 may also receive the additional pixel line from the first thinning unit 140-1 and insert the additional pixel line into the second image block 710-2.

In addition, the thinning unit 140-n may repeat the above-described thinning operation until there is no pixel to be deleted, and the thinning image data 720 generated in this manner is shown in FIG. As such, connectivity is maintained.

At this time, the size of each image block should be the same, and one scan of each image block should be finished at the same moment. Accordingly, the binarization data may be divided into a plurality of image blocks, and the size of each image block may be the same size. This is because, once the image blocks have different sizes, one scan cannot be finished at the same moment. In addition, a clock for the operation of each thinning unit 140-n must be synchronized. As a result, each thinning unit 140-n may start the thinning operation at the same instant, and end the thinning operation at the same instant.

In addition, it has been assumed here that one binarization data is divided into two image blocks. However, this is for convenience of understanding and explanation. Therefore, the number of divided image blocks does not limit the scope of the present invention. Do. That is, even when the binarization data is divided into three or more image blocks, as described above, additional pixel lines of another neighboring image block may be inserted and scanned once, and the inserted additional pixel lines may be removed and thinned. . However, in the case where the binarization data is divided up and down rather than being divided into left and right as shown in FIG. 7, the additional pixel line may be a pixel row rather than a pixel column.

In addition, in the case of a block located in the middle of the binarization data of the image block, four additional pixel lines may be provided (however, the image block is rectangular).

Referring back to FIG. 1, the output switch unit 150 may connect the thinning unit 140 and the output storage unit 160. More specifically, the output switch unit 150 may connect the output storage unit 160-n and the thinning unit 140 to store the most recently thinned binarization data in the output storage unit 160-n. have. That is, the binarization data thinned by the thinning unit 140 may be stored in the output storage unit 160. As described above, since the binarization data may be thinned in parallel in units of image blocks, each image block may be selected. The action of combining is necessary. Therefore, each thinned image block may be temporarily stored in the output storage unit 160.

In this case, the output storage unit 160 may include n output author units 160-n, and the binarization data inputted sequentially thinning may be stored in the corresponding output storage units 160-n, respectively. have. That is, when the first binarization data before thinning is stored in the first input storage unit 120-1, the first binarization data is thinned in the thinning unit 140, so that the first output storage unit 160-1 is thinned. ) Can be stored. In this case, the input switch unit 130 may connect the first input storage unit 120-1 and the thinning unit 140, and the output switch unit 150 may include the first output storage unit 160-1 and the thinning unit. 140 may be connected.

In addition, the second binarization data sequentially input while the first binarization data is thinned may be stored in the second input storage unit 120-2, and the input switch unit 130 thins the first binarization data. When the second input storage unit 120-2 and the thinning unit 140 can be connected as described above. In addition, the output switch unit 150 may connect the thinning unit 140 and the first output storage unit 160-1 when the thinning of the first binarization data ends, and when the thinning of the second binarization data ends. The second output storage unit 160-2 may be connected to the thinning unit 140.

In this case, the thinning unit 140 may transmit a signal (for example, an ACK signal) to inform the output switch unit 150 of the notification when the thinning of the binarization data ends.

In addition, although the output switch unit 150 has been described as determining the output storage unit 160-n in which subsequently thinned binarization data may be stored, this may be determined in the output storage unit 160. . That is, when the output storage unit 160 receives a signal from the output switch unit 150 that the thinning of the binarization data of one frame is finished, the output storage unit 160 connects the corresponding output storage unit 160-n to the thinning unit 140. Can be.

In this case, when the output storage unit 160 determines the output storage unit 160-n in which subsequently thinned binarization data may be stored, the output switch unit 150 may be omitted.

In addition, each output storage unit 160-n may include m internal output memory areas (not shown), and thinned image blocks may be stored in each internal output memory area (not shown). . Therefore, the internal output memory area (not shown) may have more than the number of image blocks.

The image data reconstruction unit 170 may generate one thinning image data by combining the image blocks stored in the output storage unit 160 (particularly, the output storage unit 160-n). The image data may be one image data in which the binarization data are thinned in parallel in units of image blocks and combined again.

When the image block is thinned by the above-described method, real-time thinning of the original image data is possible. That is, the second binarization data sequentially input while the first binarization data is thinned in the thinning unit 140 may be divided into an image block and stored in the input storage unit, and the first binarization data is thinned and thinned. Since the second binarization data may be thinned while being combined with the image data, the image data may be thinned in real time after the time for thinning the binarized data of the first two frames is delayed.

8 illustrates original image data and thinned image data according to an embodiment of the present invention.

Among the images shown in FIG. 8, the left image is binarized original image data (ie, binarization data), and the right image is thinned image data thinned according to the present invention. As shown in FIG. 8, although the thinned image data thinned by the present invention is thinned in parallel, it can be confirmed that connectivity is maintained.

9 is a flowchart illustrating a method of thinning original image data according to an embodiment of the present invention.

9, a method of thinning original image data according to an embodiment of the present invention is shown. More specifically, a method of thinning original image data in parallel is shown. In this case, each step to be described below may be performed in each component included in the image processing apparatus 100 according to the present invention, but is to be performed in the image processing apparatus 100 according to the present invention for the convenience of understanding and description. Collectively. Therefore, the subject performing the following steps can be omitted.

In operation 910, when original image data is input, the original image data may be binarized to generate binarization data (step 920). The binarization data may be generated by analyzing contrast of each pixel of the original image data. For example, if the intensity value (or luminance value) of each pixel of the original image data is greater than or equal to a preset threshold value, it is adjusted to '0' and less than '1' (or vice versa) to generate the binarized data. Can be.

In operation 930, m number of image blocks may be generated by dividing the binarization data into a predetermined number. In this case, each of the divided image blocks may have the same size.

In operation 940, each of the image blocks may be thinned by a preset method. In this case, the pixel to be deleted may be determined by comparing the pixel area included in the image block with a preset deletion mask, and the pixel to be deleted may be deleted to be thinned. In this case, when the pixel area and the erase mask are the same, it may be determined that the target pixel is the target pixel to be deleted.

In addition, the pixel area may be a 3X3 area, and the erasing mask may also be a 3X3 area, and the erasing mask may have a pattern of eight neighboring pixels located clockwise from an upper end of the target pixel. , x is not considered as do not care).

1.0-0-x-1-1-1-x-0

2. 0-0-0-x-1-x-1-x

3.x-0-0-0-x-1-1-1

4. 1-x-0-0-0-x-1-x

5. 1-1-x-0-0-0-x-1

6. 1-x-1-x-0-0-0-x

7.x-1-1-1-x-0-0-0

8. 0-x-1-x-1-x-0-0

In this case, the target pixel corresponds to '1', and if the target pixel corresponds to '0', the target pixel may not be compared with the erase mask, and a value corresponding to the x value of the erase mask among the pixel area may be ignored. Also, the patterns 1 to 8 may be the same as the patterns 210 to 280 shown in FIG. 2.

In addition, it is assumed here that the pixel corresponding to the thinning subject image is binarized to correspond to '1'. Accordingly, as described above, when the original image data is reversed, that is, when the pixel corresponding to the thinning subject image is binarized to correspond to '0', the above-described pattern of the erase mask may be changed.

In addition, when determining whether one target pixel is a target pixel to be deleted, all of the eight deletion masks described above may be compared with the target pixel (1-sub cycle), and the pixel region may include one or more patterns of the following patterns (ie, When the pattern is the same as any one or more of patterns 2 to 6, the expanded pixel area and the extended mask can be compared again. In this case, the extension mask may be the same as the extension mask described with reference to FIG. 5.

2. 0-0-0-x-1-x-1-x,

3.x-0-0-0-x-1-1-1

4. 1-x-0-0-0-x-1-x

5. 1-1-x-0-0-0-x-1

6. 1-x-1-x-0-0-0-x

In addition, in order to solve the connectivity collapse that may occur due to the thinning of each image block in parallel, one additional pixel line of a neighboring image block may be inserted into the image block and thinned. same. In addition, when the one-time scan of the image block is completed, the inserted additional pixel line may be removed, and the above-described operation may be repeated until there is no deletion target pixel.

In addition, in case of thinning each image block, as described above, the start point and the end point at which all the image blocks are scanned once should be the same.

In operation 950, thinning image data may be generated by combining the thinned image blocks.

Preferred embodiments of the present invention described above are disclosed for purposes of illustration, and those skilled in the art will be able to make various modifications, changes, and additions within the spirit and scope of the present invention. Additions should be considered to be within the scope of the following claims.

As described above, according to the present invention, it is possible to provide an image processing apparatus and method capable of maintaining connectivity of thinned image data.

In addition, according to the present invention, an image processing apparatus and method for shortening the thinning processing time may be provided.

Claims (32)

An image processing apparatus for thinning image data, An input storage unit for dividing the binarized data into predetermined image blocks and storing the binarized data; A thinning unit for thinning the divided image blocks in parallel; An input switch unit connecting the input storage unit and the thinning unit; An output storage unit for storing the thinned image blocks; An output switch unit connecting the thinning unit and the output storage unit; And An image data reconstructing unit configured to reconstruct the thinned image data by combining the thinned image blocks included in each output storage unit, The input storage unit includes n (where n is a natural number) input storage units, The binarization data sequentially input is stored in the corresponding input storage unit, respectively. delete The method of claim 1, The input storage unit includes m internal input memory areas each divided into The binarization data is divided into m video blocks and stored in the corresponding internal input memory areas, respectively. And m is a natural number. The method of claim 1, And the input storage unit sequentially stores the binarization data input sequentially in each of the n input storage units. The method of claim 1, When the input switch unit connects the n-1 input storage unit and the thinning unit, And the input switch unit connects the n-th input storage unit and the thinning unit when the thinning of the binarization data stored in the n-1 input storage unit ends. The method of claim 3, And the thinning unit comprises m thinning units for thinning m of the image blocks in parallel. The method of claim 6, The thinning unit deletes the pixel to be deleted in the image block to thin the image blocks, And the thinning unit determines the target pixel as the deletion target pixel when the preset pixel area in which the target pixel is located and the preset deletion mask are the same. The method of claim 7, wherein The pixel area is a 3X3 (width X length) area, and the target pixel corresponds to '1', The erasing mask is a 3x3 (horizontal x vertical) region, and the image processing apparatus wherein the pattern of eight neighboring pixels located clockwise from the top of the target pixel is one or more of the following patterns (where x is do not care). 1.0-0-x-1-1-1-x-0 2. 0-0-0-x-1-x-1-x 3.x-0-0-0-x-1-1-1 4. 1-x-0-0-0-x-1-x 5. 1-1-x-0-0-0-x-1 6. 1-x-1-x-0-0-0-x 7.x-1-1-1-x-0-0-0 8. 0-x-1-x-1-x-0-0 The method of claim 8, If the pattern of the erase mask is 0-0-0-x-1-x-1-x (the second pattern) and the pixel area is the same as the erase mask, The thinning unit compares an extension pixel area of a 4x3 area including the pixel area with a preset expansion mask, and if the extension pixel area is not the same as the extension mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 4 × 3 area in which three pixels are further included on the left side of the pixel area, The extended mask is a mask of a 4 × 3 area, and the image processing apparatus (where the uppermost row is located) is characterized in that the pattern of each pixel (including the target pixel) located from the left of each row is one or more of the following patterns. box). 1.0-0-0-0, 0-1-1-0, x-x-1-x 2.x-x-0-0, 0-1-1-0, 0-0-1-x The method of claim 8, When the pattern of the erasure mask is x-0-0-0-x-1-1-1 (pattern 3) and the pixel area is the same as the erasure mask, The thinning unit compares an extension pixel area of a 4x3 area including the pixel area with a preset expansion mask, and if the extension pixel area is not the same as the extension mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 4 × 3 area in which three pixels are further included on the left side of the pixel area, The extended mask is a mask of a 4X3 region, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-1-1-0, 0-1-1-0, 0-1-1-0 Image processing apparatus, characterized in that the first row is listed first. The method of claim 8, If the pattern of the erase mask is 1-x-0-0-0-x-1-x (the pattern 4) and the pixel area is the same as the erase mask, The thinning unit compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 3 × 4 area in which three pixels are further included on an upper portion of the pixel area, The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-0, 1-1-0, 1-1-0, x-0-0. Image processing apparatus, characterized in that the first row is listed first. The method of claim 8, If the pattern of the erase mask is 1-x-0-0-0-x-1-x (the pattern 4) and the pixel area is the same as the erase mask, The thinning unit compares an extension pixel area of a 4x3 area including the pixel area with a preset expansion mask, and if the extension pixel area is not the same as the extension mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 4 × 3 area in which three pixels are further included on the left side of the pixel area, The extended mask is a mask of a 4 × 3 area, and the image processing apparatus (where the uppermost row is located) is characterized in that the pattern of each pixel (including the target pixel) located from the left of each row is one or more of the following patterns. box). 1.x-1-1-x, 0-1-1-0, 0-0-0-0 2.0-0-1-x, 0-1-1-0, x-1-0-0 The method of claim 8, When the pattern of the erasure mask is 1-1-x-0-0-0-x-1 (the pattern 5) and the pixel area is the same as the erasure mask, The thinning unit compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 3 × 4 area in which three pixels are further included on an upper portion of the pixel area, The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-0, 1-1-1, 1-1-1, 0-0-0. Image processing apparatus, characterized in that the first row is listed first. The method of claim 8, When the pattern of the erasure mask is 1-x-1-x-0-0-0-x (the sixth pattern) and the pixel area is the same as the erasure mask, The thinning unit compares the expansion pixel area of the 3X4 area including the pixel area with a preset expansion mask, and if the expansion pixel area is not the same as the expansion mask, determines the target pixel as the deletion target pixel. , The extended pixel area is a pixel area of a 3 × 4 area in which three pixels are further included on an upper portion of the pixel area, The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-x, 0-1-1, 0-1-1, 0-0-x Image processing apparatus, characterized in that the first row is listed first. The method of claim 6, The thinning unit thins the image blocks by deleting a deletion target pixel in the image block that is a thinning target, And the thinning unit thins the image block by inserting one additional pixel line adjacent to another image block adjacent to the image block. The method of claim 15, And the thinning unit scans the image block once to delete the pixel to be deleted, and then removes the additional pixel line. The method of claim 1, The output storage unit includes n output storage units, And the binarization data which are sequentially thinned and input are stored in the corresponding output storage units, respectively. The method of claim 17, When the input switch unit connects the n-1 input storage unit and the thinning unit, The output switch unit is connected to the n-1 output storage unit and the thinning unit, And when the thinning of the binarization data stored in the n-th input storage unit ends, the thinned binarized data is stored in the n-th output storage unit. The method of claim 18, And the output switch unit connects the n-th output storage unit and the thinning unit when the thinned binarization data is stored in the n-th output storage unit. The method of claim 17, Wherein said output storage unit includes m internal output memory areas each divided; m image blocks are thinned by the thinning unit and stored in the corresponding internal output memory areas. In the image processing method for thinning the image data, Dividing the binarization data into predetermined image blocks; Determining whether a pixel area included in each image block and a target pixel is at the center and a preset erase mask are the same; Determining whether the erase mask is a preset extension target mask when the pixel area and the erase mask are the same; Comparing the preset extended pixel area with a preset extended mask when the deletion mask is the same as the extended target mask; And And deleting the target pixel if the extension pixel area and the extension mask are not identical to each other. The method of claim 21, And deleting the target pixel if the pixel area and the erase mask are not the same. The method of claim 21, The pixel area is a 3X3 (width X length) area, and the target pixel corresponds to '1', The erasing mask is a 3X3 (horizontal X vertical) region, and the image data processing method is characterized in that the pattern of eight neighboring pixels located clockwise from the top of the target pixel is one or more of the following patterns (where x is not considered as do not care). 1.0-0-x-1-1-1-x-0 2. 0-0-0-x-1-x-1-x 3.x-0-0-0-x-1-1-1 4. 1-x-0-0-0-x-1-x 5. 1-1-x-0-0-0-x-1 6. 1-x-1-x-0-0-0-x 7.x-1-1-1-x-0-0-0 8. 0-x-1-x-1-x-0-0 The method of claim 23, wherein The extension target mask is one or more of the following pattern 2 to pattern 6 of the patterns. The method of claim 24, If the pattern of the extension target mask is 0-0-0-x-1-x-1-x (the second pattern), the extension pixel area is a 4X3 area further including three pixels on the left side of the pixel area. The extended mask is a mask of a 4X3 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is one or more of the following patterns. Starting with the line at). 1.0-0-0-0, 0-1-1-0, x-x-1-x 2.x-x-0-0, 0-1-1-0, 0-0-1-x The method of claim 24, If the pattern of the extension target mask is x-0-0-0-x-1-1-1 (the third pattern), the extension pixel area is a 4X3 area further including three pixels on the left side of the pixel area. The extended mask is a mask of a 4X3 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is 0-1-1-0, 0-1-1-0, 0- 1-1-0, wherein the image data processing method (listed from the top row). The method of claim 24, If the pattern of the extension target mask is 1-x-0-0-0-x-1-x (the fourth pattern), the extension pixel area is a 3X4 area further including three pixels on top of the pixel area. The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-0, 1-1-0, 1-1-0, Image data processing method characterized in that x-0-0 (but list from the top row). The method of claim 24, If the pattern of the extension target mask is 1-x-0-0-0-x-1-x (the fourth pattern), the extension pixel area is a 4X3 area further including three pixels on the left side of the pixel area. The extended mask is a mask of a 4X3 area, and the pattern of each pixel (including the target pixel) positioned from the left side of each row is one or more of the following patterns. Starting with the line at). 1.x-1-1-x, 0-1-1-0, 0-0-0-0 2.0-0-1-x, 0-1-1-0, x-1-0-0 The method of claim 24, If the pattern of the extension target mask is 1-1-x-0-0-0-x-1 (pattern 5), the extension pixel area is a 3X4 area further including three pixels on top of the pixel area. The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-0, 1-1-1, 1-1-1, Image data processing method characterized in that 0-0-0 (but list from the top row). The method of claim 24, If the pattern of the extension target mask is 1-x-1-x-0-0-0-x (pattern 6), the extension pixel area is a 3X4 area further including three pixels on top of the pixel area. The extended mask is a mask of a 3X4 area, and the pattern of each pixel (including the target pixel) positioned from the left of each row is 0-0-x, 0-1-1, 0-1-1, Image data processing method characterized in that it is 0-0-x (but list from the top row). The method of claim 21, The determining of whether the pixel area and the erase mask are the same may include: Inserting one additional pixel line adjacent to another image block adjacent to the image block; And And determining whether a pixel area in which the additional pixel line is inserted and in which the target pixel is located is identical to the erase mask. The method of claim 31, wherein And scanning the image block into which the additional pixel line is inserted once to delete the pixel to be deleted, and then removing the additional pixel line.

Images