CN102411788A - Area filling algorithm based on four-way scan mode - Google Patents
Area filling algorithm based on four-way scan mode Download PDFInfo
- Publication number
- CN102411788A CN102411788A CN2011102437067A CN201110243706A CN102411788A CN 102411788 A CN102411788 A CN 102411788A CN 2011102437067 A CN2011102437067 A CN 2011102437067A CN 201110243706 A CN201110243706 A CN 201110243706A CN 102411788 A CN102411788 A CN 102411788A
- Authority
- CN
- China
- Prior art keywords
- scanning
- look
- color
- last
- algorithm based
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Image Analysis (AREA)
- Image Processing (AREA)
- Image Generation (AREA)
Abstract
The invention belongs to the digital image processing technology field, concretely relating to an area filling algorithm based on a four-way scan mode. Through setting a specific edge point in a binary edge image as a starting point, the edge image is subjected to scan in four directions, a closed area enclosed by closed edge lines is screened, and other noises in an unclosed area and the edge image are effectively eliminated. A realization mode of the invention is simple, no complex operation is needed, and the closed area can be accurately screened from the complex edge image. The whole algorithm is operated automatically with no need of human intervention and without recursion operation, and is very suitable for parallel realization. Extraction of the closed area in the complex changeable edge image can not be realized in other area filling algorithms, but according to the invention, the extraction of the closed area in the complex changeable edge image is realized. Simultaneously, compared with the other algorithms, the algorithm in the invention has much higher execution efficiency in hardware with parallel operation as main operation.
Description
Technical field
The invention belongs to the digital image processing techniques field, be specifically related to region-filling algorithm based on the four-way scan mode.
Background technology
The enclosed region of edge image often all is a significant part in the image, gets rid of non-enclosed region simultaneously and just can realize complete image Segmentation Technology based on edge image and extract these enclosed region.This partitioning scheme also is simultaneously a kind of based on geological information but not the image Segmentation Technology that colouring information is realized except its parallel characteristics and less this advantage of operand.And often more can reflect the meaningful object in the image on the whole compared with the colouring information geological information, therefore rapidly and accurately the enclosed region of complex edge image being filled to extract has boundless application prospect.
Existing enclosed region filling mode mainly contains se ed filling algorithm, edge completion method, orderly Bian Biaofa, limit notation
[1-4]Se ed filling algorithm specifies a pixel to fill through recursive fashion realization zone as seed points through artificial in enclosed region, because of it needs the man-machine interactively operation, so the algorithm versatility is less.The edge completion method is based on each bar limit of polygon and fills to the right in an orderly manner, and through the continuous negate of filling part is finally realized the filling to enclosed region, this method only is suitable for the few polygon of limit number and fills.Orderly Bian Biaofa; Through obtaining the intersection point of horizontal scan line and enclosed region; The line ordering of going forward side by side is judged the sweep trace of present intra-zone again according to parity, thereby realizes that the zone fills; The fine while algorithm of this algorithm versatility can automatically realize need not manual intervention, thereby but shortcoming is to need cap and sort operation to reduce algorithm efficiency.The limit notation is the improvement to orderly Bian Biaofa, thereby has removed cap from and sort operation has promoted efficient.
Yet these algorithms all have a common deficiency, and they can't handle the edge image that comprises noise and non-enclosed region simultaneously, though promptly these algorithms can correctly be filled enclosed region and also can be filled out non-enclosed region by mistake.And the present invention can address this problem fully, not only can fill simultaneously but also avoid the mistake of non-enclosed region is filled the enclosed region in the complex edge image.Thereby descending to some extent though can occur in the algorithm repeatedly visiting on efficient same pixel, because of its splendid parallel characteristics can remedy this defective fully, is being to carry out among main hardware such as the GPU still high efficient to be arranged with the parallel processing.
List of references:
［1］Pavlidis?T.?Filling?Algorithms?for?Raster?Graphics[J].?Computer?Graphics?Image?Process,?1979,?10(2):?126—141．
［ 2 ］ Zhang Yinghui, Zhang Yulian.A kind of improved edge filling algorithm ［ J ］.University On The Mountain Of Swallows's journal, 2000,24 (1): 47-49.
［ 3 ］ Liu Chun.Fast area filling algorithm ［ J ］ based on boundary scan.Computer programming skill and maintenance, 2010,7:66-68.
［4］ACKLAND?B.D,?WESTE?N.H,?The?edge?flag?algorithm-A?fill?method?for?raster?scan?displays[J].?IEEE?Trans.?Comput.?C-30,?1981,?1:?762-791.。
Summary of the invention
The objective of the invention is to propose a kind of simple, fast, accurately, but executed in parallel realizes regional padding, and non-enclosed region and picture noise are given in the region-filling algorithm of eliminating.
The present invention can be used in the edge image of any complicacy; Rely on simple scanning can't fill these characteristics of breach of non-enclosed region; Inheritance through detecting look and fill color with this breach information after scanning in constantly amplification formation positive feedback; Whole non-enclosed region is excluded; And enclosed region is unaffected, therefore can realize both having kept algorithm between each marginal point, to be carried out by independent parallel, and the while can extract enclosed region on the whole again and get rid of non-enclosed region and noise from edge image.The whole algorithm all operations occurs over just between the marginal point in the outline map; Through the pixel between the marginal point being carried out four direction scanning detects and repeat number time, retain the color of last scanning filling at last and remove all the other fill colors and realize extraction the enclosed region in the complex edge image.
The region-filling algorithm that the present invention proposes is based on based on the four-way scan mode, and concrete steps are following:
Step 3 scans from start edge point from bottom to top;
Step 4 scans to a left side from right from start edge point;
Step 5 repeats 1 ~ 4 step N time;
Step 6 keeps the last Fill Color that scans, and all the other fill colors is changed to the background colour of two-value outline map.
Do further to specifically describe in the face of each step down.
In the step 1, specifying initial edge to detect look by the user earlier, because edge image is a bianry image, is the background colour (black or white) of edge image so initial edge detects look.The initial direction that scans can be any direction of four direction, but has confirmed that 3 direction of scanning after the initial direction must be clockwise or in proper order counterclockwise with the initial direction composition.The present invention is being example as initial direction of scanning from top to bottom; Pixel compartments under all marginal points of elder generation's search binary edge map and the current marginal point; If its color of lattice pixel is that initial edge detects look under the marginal point, then this marginal point is sweep starting point.But Parallel Implementation scan operation between each starting point.
The user also need specify a sweep length parameter L, and the user can specify the common scanning length parameter for the scanning of four direction, and different sweep length parameters is specified in the scanning that also can be respectively four direction, is determined on a case-by-case basis.
From starting point begin along under the pointwise picture element scan; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful; (scanning that this color value also will become next direction detects colour with another kind of color value filled coloring with detecting form and aspect pixel compartments together with scanning in all scanning detections; This numerical value can be arbitrary constant, if can with other value, distinguishes in the edge image so that when scanning, accurately detected next time).Situation for the scanning failure then is left intact, and keeps intact.
In the step 2, carry out scanning direction from left to right, it be the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments of all marginal points of search edge image and current marginal point the right, if marginal point the right one its color of lattice pixel detects look for scanning, then this marginal point is sweep starting point.
Begin along the right pointwise picture element scan of X axis from starting point; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful, during all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2 scanning detect look with another kind of, the situation for the scanning failure then is left intact, and keeps intact.
In the step 3, scan from the bottom to top, it be the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments directly over all marginal points of search edge image and the current marginal point, if its color of lattice pixel detects look for scanning directly over the marginal point, then this marginal point is sweep starting point.
From starting point begin along directly over the pointwise picture element scan; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful; During all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2, step 3 scanning detect look with another kind of; Situation for the scanning failure then is left intact, and keeps intact.
In the step 4, scan from right to left, it be the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments of all marginal points and the current marginal point left side of search edge image, if the marginal point left side one its color of lattice pixel detects look for scanning, then this marginal point is sweep starting point.
Begin along X axis left side pointwise picture element scan from starting point; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm scanning success, and finish from current initial scanning of lighting from current starting point.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful; During all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2, step 3, step 4 scanning detect look with another kind of; Situation for the scanning failure then is left intact, and keeps intact.
In the step 5, repeat 1 ~ 4 and go on foot N time.For the edge image of complicacy, some non-enclosed region can't only be passed through 1 four-way scanning promptly by eliminating fully, need carry out repeatedly could fully non-enclosed region eliminating only being kept enclosed region behind the several; This multiplicity N will be specified by the user; Can be any positive integer, can establish greatly that simple image N value can be established little for complex image N value; Generally speaking, N can get rid of non-arbitrarily enclosed region in the complex edge image at 3 o'clock basically fully.
It is the background colour of binary edge map that the preliminary sweep of circulation beginning detects look; And the last scanning before the loop ends will be retained as the unique tag to the enclosed region that extracts because of the color value of being filled, thus last fill color require not only can not with before used Fill Color also require it to have the processing that certain significance is convenient to the later stage simultaneously.Can be removed the background colour that just is changed to edge image again as for all the other fill colors of in cyclic process, using at last because of it, guarantee different so these color values can use simple continuous integral number to replace.
Step 6, with the fill color of a preserving edge color with last scanning, remaining fill color all is changed to the background colour of original binary edge map like no special circumstances (carrying out the color value that other algorithms retain) in this step.The fill color that stays at last is the enclosed region that is surrounded by the closure edge line in the edge image.
Whole algorithm has two big advantages, and the one, have no arithmetic operator to have only comparison operation fully, also have no recurrence or cap simultaneously, so algorithm can be realized easily all in any hardware extremely simply.The secondth, whole algorithm all is to be that unit carries out with the marginal point; Need not any message exchange between the marginal point or wait for the execution result of other marginal points; Therefore algorithm has very strong parallel characteristics; Though the repeatedly visit to same pixel may occur, the advantage of its parallel characteristics still can remedy the increase that algorithm repeats the operand that brings, so the present invention is very suitable on the hardware that with the concurrent operation is the master, realizing.
Description of drawings
Fig. 1 is that a four-way scanning area is filled implementation procedure figure.
Fig. 2 is the whole algorithm process flow diagram.
Embodiment
Do further description below in conjunction with the accompanying drawing specific embodiments of the invention.
Particular flow sheet for whole algorithm among the present invention shown in Figure 2.
From starting point begin along under the pointwise picture element scan; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For scanning case of successful, with detecting form and aspect pixel compartments together with another kind of color value filled coloring with scanning in all scanning detections.Situation for the scanning failure then is left intact and keeps intact.
Next be step 2, scan from left to right.It is the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments of all marginal points of search edge image and current marginal point the right, if marginal point the right one its color of lattice pixel detects look for scanning, then this marginal point is sweep starting point.
Begin along the right pointwise picture element scan of X axis from starting point; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful, during all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2 scanning detect look with another kind of, the situation for the scanning failure then is left intact and keeps intact.
Step 3 is served as reasons down to enterprising line scanning.It is the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments directly over all marginal points of search edge image and the current marginal point, if its color of lattice pixel detects look for scanning directly over the marginal point, then this marginal point is sweep starting point.
From starting point begin along directly over the pointwise picture element scan; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful; During all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2, step 3 scanning detect look with another kind of; Situation for the scanning failure then is left intact and keeps intact.
Step 4 is to scan to a left side from right.It is the last fill color that scans that the scanning of this scanning detects look, and sweep length L value can scan with the last time identically also can specify in addition.
Pixel compartments of all marginal points and the current marginal point left side of search edge image, if the marginal point left side one its color of lattice pixel detects look for scanning, then this marginal point is sweep starting point.
Begin along X axis left side pointwise picture element scan from starting point; If the pixel color value of scanning detects form and aspect with then continuing scanning with scanning; If find other marginal points in the scanning process or scan the image boundary position; Then confirm from current initial scanning success of lighting, and finish from current initial scanning of lighting.If before running into other marginal points or arriving the image boundary position; Length that scanning element point color and scanning detects look different or scanning has appearred greater than the sweep length parameter L of user's appointment; Then announce from current initial scanning failure of lighting, and finish from current initial scanning of lighting.
For the scanning case of successful; During all scannings are detected with scanning detect form and aspect with pixel compartments be different from the color value filled coloring that step 1, step 2, step 3, step 4 scanning detect look with another kind of; Situation for the scanning failure then is left intact and keeps intact.
Step 5 goes on foot N time for repeating 1 ~ 4, and this multiplicity N will be specified by the user, can establish greatly for complex image N value, and simple image N value can be established little.
Should be noted that it is that the preliminary sweep detection look that circulation begins is the background colour of binary edge map, and last fill color requires to have the processing that certain significance is convenient to the later stage.Can use simple continuous integral number to replace as long as guarantee different as for all the other fill colors of in cyclic process, using.
Last then be the Fill Color that keeps last scanning, all the other fill colors are changed to the background colour of two-value outline map.The fill color that stays at last is the enclosed region that is surrounded by the closure edge line in the edge image.
Fig. 1 is that a four-way scanning area is filled implementation procedure figure, and the redness that retains at last is exactly the enclosed region in the image.
Claims (7)
1. region-filling algorithm based on the four-way scan mode is characterized in that concrete steps are:
Step 1 scans from start edge point from top to bottom;
Step 2 scans from start edge point from left to right;
Step 3 scans from start edge point from bottom to top;
Step 4 scans to a left side from right from start edge point;
Step 5 repeats 1 ~ 4 step N time;
Step 6 keeps the last Fill Color that scans, and all the other fill colors is changed to the background colour of two-value outline map.
2. the region-filling algorithm based on the four-way scan mode according to claim 1 is characterized in that: in the step 1, earlier the background colour of binary edge map is appointed as preliminary sweep and detects look, and specify the sweep length L of this direction by the user; Pixel compartments color is for scanning the marginal point that detects look under searching for it; As sweep starting point; And from sweep starting point along under pointwise carry out the scanning of pixel compartments; The pixel color that before scanning other marginal points or arriving image boundary, is scanned and scanning detect form and aspect with and the length of scanning then scan success less than L, all the other situation then are the scanning failure; After scanning successfully will with the scanography form and aspect with pixel refill paintedly with being different from color value that scanning detects look, any change is not then done to image in the zone of scanning failure.
3. the region-filling algorithm based on the four-way scan mode according to claim 2 is characterized in that: in the step 2, the fill color of step 1 is detected look as the scanning of step 2, and specify the sweep length L of this direction; Have the processing procedure of all fours with step 1, unique difference is that the direction of scanning is for carry out from left to right; Carry out filled coloring for scanning successfully regional other color values that are different from step 1, step 2 scanning detection look of using at last, the scanning failure go-to field does not deal with.
4. the region-filling algorithm based on the four-way scan mode according to claim 3 is characterized in that: in the step 3, the fill color of step 2 is detected look as the scanning of step 3, and specify the sweep length L of this direction; Have the processing procedure of all fours with step 2, unique difference is that the direction of scanning is for carry out from bottom to top; Carry out filled coloring for scanning successfully regional other color values that are different from step 1, step 2, step 3 scanning detection look of using at last, the scanning failure go-to field does not deal with.
5. the region-filling algorithm based on the four-way scan mode according to claim 4 is characterized in that: in the step 4, the fill color of step 3 is detected look as the scanning of step 4, and specify the sweep length L of this direction; Have the processing procedure of all fours with step 3, unique difference is that the direction of scanning is to carry out to a left side from right; Carry out filled coloring for scanning successfully regional other color values that are different from step 1, step 2, step 3, step 4 scanning detection look of using at last, the scanning failure go-to field does not deal with.
6. the region-filling algorithm based on the four-way scan mode according to claim 5 is characterized in that: in the step 5, according to the multiplicity N repeated execution of steps 1 of user's appointment to step 4; Implementation requires the current scanning of carrying out, and it detects the fill color that look is last scanning, and the fill color of each scanning must keep different simultaneously; Preliminary sweep detects the background colour that look is made as edge image, and last scanning filling look is the significant color value of user's appointment before the loop ends.
7. the region-filling algorithm based on the four-way scan mode according to claim 6; It is characterized in that: in the step 6; Last scanning filling look before preserving edge point and the loop ends all is changed to the background colour of former binary edge map with all the other fill colors, finishes all algorithms.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110243706.7A CN102411788B (en) | 2011-08-24 | 2011-08-24 | Area filling algorithm based on four-way scan mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110243706.7A CN102411788B (en) | 2011-08-24 | 2011-08-24 | Area filling algorithm based on four-way scan mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102411788A true CN102411788A (en) | 2012-04-11 |
| CN102411788B CN102411788B (en) | 2014-01-08 |
Family
ID=45913852
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110243706.7A Active CN102411788B (en) | 2011-08-24 | 2011-08-24 | Area filling algorithm based on four-way scan mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102411788B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110246173A (en) * | 2018-08-14 | 2019-09-17 | 浙江大华技术股份有限公司 | A kind of method and apparatus judging shape area |
| CN113284154A (en) * | 2021-05-25 | 2021-08-20 | 武汉钢铁有限公司 | Steel coil end face image segmentation method and device and electronic equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1380543A (en) * | 2001-04-12 | 2002-11-20 | 清华大学 | Image segmentation and identification method in industrial radiation imaging system |
| CN101398894A (en) * | 2008-06-17 | 2009-04-01 | 浙江师范大学 | Automobile license plate automatic recognition method and implementing device thereof |
-
2011
- 2011-08-24 CN CN201110243706.7A patent/CN102411788B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1380543A (en) * | 2001-04-12 | 2002-11-20 | 清华大学 | Image segmentation and identification method in industrial radiation imaging system |
| CN101398894A (en) * | 2008-06-17 | 2009-04-01 | 浙江师范大学 | Automobile license plate automatic recognition method and implementing device thereof |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110246173A (en) * | 2018-08-14 | 2019-09-17 | 浙江大华技术股份有限公司 | A kind of method and apparatus judging shape area |
| CN110246173B (en) * | 2018-08-14 | 2023-11-03 | 浙江大华技术股份有限公司 | Method and device for judging shape area |
| CN113284154A (en) * | 2021-05-25 | 2021-08-20 | 武汉钢铁有限公司 | Steel coil end face image segmentation method and device and electronic equipment |
| CN113284154B (en) * | 2021-05-25 | 2022-04-26 | 武汉钢铁有限公司 | Steel coil end face image segmentation method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102411788B (en) | 2014-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106952271B (en) | A kind of image partition method handled based on super-pixel segmentation and EM/MPM | |
| CN108352083B (en) | 2D image processing for stretching into 3D objects | |
| JPH04296985A (en) | Method and apparatus for hierarchizing density set for data analysis | |
| CN106454372A (en) | Decoder, method of reconstructing array, encoder, encoding method, and data stream | |
| CN105959703A (en) | Cross-plane prediction method | |
| CN106101700A (en) | Sample areas folding | |
| CN109146991A (en) | A kind of picture format conversion method, device, equipment and storage medium | |
| CN104331447A (en) | Cloth color card image retrieval method | |
| CN104809694A (en) | Digital image processing method and digital image processing device | |
| JP7242165B2 (en) | Program, Information Processing Apparatus, and Method | |
| CN109389607A (en) | Ship Target dividing method, system and medium based on full convolutional neural networks | |
| CN102411788A (en) | Area filling algorithm based on four-way scan mode | |
| CN1629888A (en) | A skeletonized object rebuild method | |
| CN104331883B (en) | A kind of image boundary extraction method based on asymmetric inversed placement model | |
| CN105915919A (en) | Trans-plane prediction | |
| CN104809460B (en) | Germ nucleus position drawing generating method and transistor pixel search table generating method | |
| CN101276476A (en) | Process for the separating prospect background of 2D cartoon animation | |
| CN108875073A (en) | A kind of quick grid of remote sensing image turns vector method | |
| CN103745493B (en) | A kind of shadow generation method in two dimension based on image procossing | |
| CN107507276A (en) | The 3-dimensional digital rock core storage method that slabbed core for any direction is shown | |
| CN109377489A (en) | A kind of analysis method and analysis system of the organization construction of woven | |
| CN104195713B (en) | Based on the yarn distribution map generalization method of the shuttle-woven fabric of fabric tissue and the processing of shuttle-woven fabric and outward appearance display methods | |
| Birdal et al. | A novel method for vectorization | |
| CN111611210B (en) | Image processing method based on raster file | |
| Xue et al. | Synthesis texture by tiling s-tiles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |