CN102158706A - Image compressing storage method on the basis of compressing vertex chain code - Google Patents
Image compressing storage method on the basis of compressing vertex chain code Download PDFInfo
- Publication number
- CN102158706A CN102158706A CN 201110131107 CN201110131107A CN102158706A CN 102158706 A CN102158706 A CN 102158706A CN 201110131107 CN201110131107 CN 201110131107 CN 201110131107 A CN201110131107 A CN 201110131107A CN 102158706 A CN102158706 A CN 102158706A
- Authority
- CN
- China
- Prior art keywords
- code
- chain code
- image
- chain
- codes
- 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.)
- Pending
Links
Images
Landscapes
- Image Analysis (AREA)
Abstract
The invention discloses an image compressing storage method on the basis of compressing vertex chain codes, which comprises the following steps: coding lines, plane curves or area boundary curves in an image, thereby acquiring code values of original vertex chain codes; recoding the acquired code values of original vertex chain codes; if the code values of original vertex chain codes are 1, namely coded as 01, replacing with the codes 10; if the code values of original vertex chain codes are 2, namely coded as 10, replacing with the codes 0; and if the code values of original vertex chain codes are 3, namely coded as 11, keeping the code values; and showing and storing the codes of the recoded lines, plane curves or area boundary curves in the image. By the using of the method for compressing vertex chain codes, the minimum storage space occupied rate for single-point information is realized, the efficiency is higher, the higher compression ratio is realized, and the demand on quick and real-time image transmission property is met.
Description
Technical field
The present invention relates to a kind of based on compression summit chain code image encoded compression and storage method.
Background technology
Chain code is the coding techniques of a kind of expression lines, plane curve and zone boundary that is in daily use in the Image Processing and Pattern Recognition.Chain representation mode has all been used in a lot of practical applications.It is because it can store more information with less data that chain code technology is widely used.Represent that with chain code the method for line patterns is by Freeman (Freeman H.On the encoding of arbitrary geometric configurations.IRE Transactions on Electronic Computers at first, 1961,10:260-268.) put forward in 1961.The Freeman chain code remains a topmost chain code encoding method that is widely used so far.This chain code moves along digital curve or the edge pixel mode with 8 adjacency, each moving direction by set of digits i|i=0,1,2 ... 7} encodes, the 45 ° * i angle of expression and X-axis forward.A chain code can be regarded by a series of little straightways with fixed-direction and length as form.
Sometimes people also use the Freeman chain code 4 in abutting connection with form, promptly chain code moves on 4 directions, with set of digits i|i=0,1,2, the angle of 3} coded representation and X-axis is 90 ° * i.
1992, Bribiesca (Bribiesca E.A geometric structure for two-dimensional shapes and three-dimensional surfaces.Pattern Recognition, 1992,25 (5): 483-496.) proposed a amending method and represented regional shape to the Freeman chain code.This method is encoded to it with the slope of little straightway, promptly uses-3 ,-2 and-1 to replace 5,6 and 7 in the Freeman chain code (4=-4).Like this, each code value (slope) of a closed curve chain code adds up and is exactly 8 or-8.
1999, Bribiesca (Bribiesca E.A new chain code.Pattern Recognition, 1999,32 (2): 235-251.) proposed a new chain code encoding method again and represented region shape, be called " summit chain code " (Vertex Chain Code).This chain code is based on him and Guzman (Bribiesca E, Guzman A.How to describe pure form and how to measure differences in shapes using shape numbers.Pattern Recognition, 1980,12 (1): the 101-112.) notion of " shape number " (the shape numbers) that proposed in 1980.The code value of each yard in the chain code of summit represents that this summit is the summit of several edge pixel.Like this, represent that the border of being made up of the pixel on the square net only needs 1,2 and 3 three code value (as shown in Figure 1).Original summit chain code is a fixed-length coding, and its three code values 1,2 and 3 are represented by binary number 01,10 and 11 respectively and stored.In the process of coding, do not consider the probability of occurrence of code value.In addition, to Freeman chain code, cubic relative more to the required bank bit of Freeman chain code and summit chain code, efficient is lower, influences quick, the real-time transmission performance of image from all directions.
Summary of the invention
The present invention is directed to the proposition of above problem, and develop a kind of probability of occurrence of in the process of coding, considering code value, adopt non-isometric coding, the minimise storage space that realizes single-point information takies, thereby avoided the required bank bit of original vertices chain code more relatively, efficient is lower, influence quick, the real-time transmission performance of image drawback based on compression summit chain code image encoded compression and storage method.The technological means that the present invention adopts is as follows:
A kind of based on compression summit chain code image encoded compression and storage method, it is characterized in that comprising the steps:
(1) the zone boundary curve in lines, plane curve or the image is encoded, obtain the code value of original vertices chain code;
(2) subsequently the code value of the original vertices chain code that obtains is carried out recompile:
If the code value of original vertices chain code is 1, promptly be encoded to 01, it is replaced with coding 10;
If the code value of original vertices chain code is 2, promptly be encoded to 10, it is replaced with coding 0;
If the code value of original vertices chain code is 3, promptly is encoded to 11 and remains unchanged;
(3) zone boundary in the described lines of step (1), plane curve or the image is adopted coding behind step (2) recompile represent and store.
To compare advantage of the present invention with prior art be conspicuous, specifically: on the basis of original vertices chain code, considered the probability that each code value occurs, the coding of the code value of probability of occurrence maximum has been reduced bit, thereby mean code length is shortened.This compression summit chain code encoding method has realized that the minimise storage space of single-point information takies, and efficient is higher, has realized higher compression ratio, can satisfy the requirement of quick, the real-time transmission performance of image.
Description of drawings
Fig. 1 is the original vertices chain code code value schematic diagram of expression shape;
Fig. 2 is the framework schematic diagram of the inventive method;
Fig. 3 is the flow chart of the inventive method;
The ability to express of Fig. 4 code value;
Fig. 5 is the contour images that is used to test 4 scenery in the example.
Embodiment
As shown in Figure 2, provided by the present invention a kind of based on compression summit chain code image encoded compression and storage method, comprise that statistics based on the probability of occurrence of the code value of original vertices chain code is to when replacing coding two parts to the code value of original vertices chain code.Shown in Fig. 2 (a), three code values 1,2 of original vertices chain code and 3 probability of occurrence are added up contrast, according to statistics, determine the coding of compression summit chain code, the probability of occurrence of three code values of statistics contrast, the result shows that the probability of occurrence of code value 2 is greater than other two code values.
Shown in Fig. 2 (b), we replace the coding of three code values of original vertices chain code, realize compression summit chain code coding.
As shown in Figure 3, the zone boundary curve in lines, plane curve or the image is encoded in the beginning of (1) coding, obtains the correspondence coding of the code value (1,2 and 3 three code value is arranged) of original vertices chain code; (2) it is judged and replace:, then replace with coding 0 if original coding is 10; If original coding is 01, then replace with coding 10; Otherwise, illustrate that original coding is 11, then need not to replace.(3) zone boundary in the described lines of step (1), plane curve or the image is adopted coding behind step (2) recompile represent and store.
As seen, the function of compression summit chain code and original vertices chain code is identical, but compressing the summit chain code is non-fixed-length coding.It has a code value to lack than the corresponding code value of original vertices chain code to have used a bit.
The efficient of a kind of chain code of how to evaluate? this paper provides a method.Now we to estimate a kind of chain code mainly be to represent its efficient by the size of its mean code length.In fact, also have an index most important to the efficient of estimating chain code except mean code length, this paper is called " the average ability to express of code value ", and we provide and are defined as follows:
The definition: the average ability to express of a kind of code value of chain code is meant the mean value of the length of the zone boundary (or digital curve) that each code value of this chain code can be represented, with pixel unit as unit of measurement.
In fact, the ability to express of code value has only 1 and 2 two level.If code value is represented is the relation of continuing between the neighbor of limit, the code value 0,2,4 and 6 of Freeman chain code for example, and then its ability to express is 1; If its expression is the relation of continuing between the angle point neighbor, the code value 1,3,5 and 7 of Freeman chain code for example, then its ability to express is 2, (A represents that the ability to express of this code value is 1 as shown in Figure 4; B represents that the ability to express of this code value is 2).Like this, it is as follows that we can provide the formula of the efficient of estimating a kind of chain code:
The efficient that is a kind of chain code is directly proportional with the average ability to express of its code value, is inversely proportional to its mean code length, and its implication is the length on the average represented border of each binary digit.Below we will compare various chain codes with this method.The comparison of chain code is for the situation of each chain code required memory space in practicality relatively, and we are that example is tested each chain code and compared with the profile (border) of 4 scenery in the real image.4 scenery are respectively tiger, butterfly, aircraft and horse.Its profile is shown among Fig. 5, and its size is respectively 191 * 118,235 * 181,447 * 288 and 325 * 323 pixel units.When having listed the profile of 4 scenery in the presentation graphs 5 in the table 1, number of bits that various chain codes are required and comparison thereof.As seen, the required bank bit of compression summit chain code is minimum.
Table 1
The average ability to express of each chain code relatively
Below the calculating of average ability to express be to be based upon on a large amount of statistical work bases:
The four directions is 1 to the code value ability to express of Freeman chain code, original vertices chain code and compression summit chain code, so its average ability to express also is 1.To the Freeman chain code, the ability to express of the code value of the relation of continuing between the neighbor of expression limit is 1 for from all directions; The ability to express of the code value of the relation of continuing between expression angle point neighbor is 2.Our statistics show that the former probability of occurrence is 0.68; The latter's probability of occurrence is 0.32.The average ability to express of code value that therefore can calculate this chain code is:
C＝1×0.68+2×0.32＝1.32
As seen, be the strongest to the average ability to express of the code value of Freeman chain code from all directions.Next is that the four directions is to Freeman chain code, original vertices chain code and compression summit chain code.The mean code length of each chain code relatively has 8 code values to the Freeman chain code from all directions, encodes with 3 bits, and code length is 3/yard;
The four directions is 2/yard to the code length of Freeman chain code and original vertices chain code; The code length of compression summit chain code is that the statistics probability of occurrence of one code value is 0.51; Code length is that the probability of occurrence of two code value is 0.49.Therefore its mean code length can be calculated as follows:
L=1 * 0.51+2 * 0.49=1.49 position/sign indicating number
As seen, the mean code length of compression summit chain code is the shortest.Next is cubic to Freeman chain code and original vertices chain code, is from all directions to the Freeman chain code at last.The final efficient of each chain code has relatively been calculated after the average ability to express and mean code length of each chain code, and it is as shown in table 2 that we just can be calculated the efficient of each chain code by the formula of the efficient of a kind of chain code of evaluation that provides previously.
Table 2
By table 2 as seen, compressing the most effective of summit chain code, secondly is cubic to Freeman chain code and original vertices chain code, is from all directions to the Freeman chain code at last.This theoretical comparative result and above-mentioned experimental result fit like a glove.
The above; only be the preferable embodiment of the present invention; but protection scope of the present invention is not limited thereto; anyly be familiar with those skilled in the art in the technical scope that the present invention discloses; be equal to replacement or change according to technical scheme of the present invention and inventive concept thereof, all should be encompassed within protection scope of the present invention.
Claims (1)
1. one kind based on compression summit chain code image encoded compression and storage method, it is characterized in that comprising the steps:
(1) the zone boundary curve in lines, plane curve or the image is encoded, obtain the code value of original vertices chain code;
(2) subsequently the code value of the original vertices chain code that obtains is carried out recompile:
If the code value of original vertices chain code is 1, promptly be encoded to 01, it is replaced with coding 10;
If the code value of original vertices chain code is 2, promptly be encoded to 10, it is replaced with coding 0;
If the code value of original vertices chain code is 3, promptly is encoded to 11 and remains unchanged;
(3) zone boundary in the described lines of step (1), plane curve or the image is adopted coding behind step (2) recompile represent and store.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110131107 CN102158706A (en) | 2011-05-19 | 2011-05-19 | Image compressing storage method on the basis of compressing vertex chain code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110131107 CN102158706A (en) | 2011-05-19 | 2011-05-19 | Image compressing storage method on the basis of compressing vertex chain code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102158706A true CN102158706A (en) | 2011-08-17 |
Family
ID=44439848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110131107 Pending CN102158706A (en) | 2011-05-19 | 2011-05-19 | Image compressing storage method on the basis of compressing vertex chain code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102158706A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102647541A (en) * | 2012-04-28 | 2012-08-22 | 大连民族学院 | Picture encoding method based on lossy compression chain code |
| CN109035351A (en) * | 2018-06-26 | 2018-12-18 | 北京大学 | A kind of image object boundary expression based on side chain code |
| CN110598156A (en) * | 2019-09-19 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Drawing data processing method, drawing data processing device, terminal, server and storage medium |
| CN111583422A (en) * | 2020-04-17 | 2020-08-25 | 清华大学 | Heuristic editing method and device for three-dimensional human body model |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101493946A (en) * | 2008-10-15 | 2009-07-29 | 华东师范大学 | Mutual conversion method of freemans chain code and vertex chain code |
-
2011
- 2011-05-19 CN CN 201110131107 patent/CN102158706A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101493946A (en) * | 2008-10-15 | 2009-07-29 | 华东师范大学 | Mutual conversion method of freemans chain code and vertex chain code |
Non-Patent Citations (1)
| Title |
|---|
| 《计算机学报》 20070228 刘勇奎 等 压缩链码的研究 第30卷, 第2期 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102647541A (en) * | 2012-04-28 | 2012-08-22 | 大连民族学院 | Picture encoding method based on lossy compression chain code |
| CN102647541B (en) * | 2012-04-28 | 2014-08-20 | 大连民族学院 | Picture encoding method based on lossy compression chain code |
| CN109035351A (en) * | 2018-06-26 | 2018-12-18 | 北京大学 | A kind of image object boundary expression based on side chain code |
| CN109035351B (en) * | 2018-06-26 | 2020-08-28 | 北京大学 | Image target boundary expression method based on edge chain codes |
| CN110598156A (en) * | 2019-09-19 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Drawing data processing method, drawing data processing device, terminal, server and storage medium |
| CN110598156B (en) * | 2019-09-19 | 2022-03-15 | 腾讯科技（深圳）有限公司 | Drawing data processing method, drawing data processing device, terminal, server and storage medium |
| CN111583422A (en) * | 2020-04-17 | 2020-08-25 | 清华大学 | Heuristic editing method and device for three-dimensional human body model |
| CN111583422B (en) * | 2020-04-17 | 2023-03-28 | 清华大学 | Heuristic editing method and device for three-dimensional human body model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210142522A1 (en) | Point cloud attribute compression method based on deleting 0 elements in quantisation matrix | |
| CN112218079B (en) | Point cloud layering method based on spatial sequence, point cloud prediction method and point cloud prediction equipment | |
| JP5512704B2 (en) | 3D mesh model encoding method and apparatus, and encoded 3D mesh model decoding method and apparatus | |
| KR102499355B1 (en) | A shape-adaptive model-based codec for lossy and lossless image compression | |
| JP5456903B2 (en) | Method and apparatus for encoding mesh model, encoded mesh model, and method and apparatus for decoding mesh model | |
| US9819964B2 (en) | Limited error raster compression | |
| CN108335335A (en) | A kind of point cloud genera compression method based on enhancing figure transformation | |
| KR20220029595A (en) | Point cloud encoding and decoding methods, encoders, decoders and computer storage media | |
| JP4672735B2 (en) | Texture coordinate encoding and decoding method of 3D mesh information for effective texture mapping | |
| KR20120036834A (en) | Method for encoding/decoding a 3d mesh model that comprises one or more components | |
| CN102158706A (en) | Image compressing storage method on the basis of compressing vertex chain code | |
| CN107018419B (en) | A kind of image compression encoding method based on AMBTC | |
| CN102663399B (en) | Image local feature extracting method on basis of Hilbert curve and LBP (length between perpendiculars) | |
| CN102300095B (en) | Fast compression coding method for hyperspectral signal and image compression method | |
| WO2021062772A1 (en) | Prediction method, encoder, decoder, and computer storage medium | |
| CN106375762A (en) | Reference frame data compression method and apparatus | |
| CN101990057A (en) | Video denoising method and device based on WT (Wavelet Transform) and block search | |
| CN1545067A (en) | A method for compressing digitalized archive file using computer | |
| CN117354525B (en) | Video coding method and system for realizing efficient storage and transmission of digital media | |
| CN105741221B (en) | CAD engineering drawing reversible water mark method, watermark embedding method and watermark extracting method | |
| CN100553336C (en) | The image area profile coding method of accuracy self-adapting | |
| CN110087076B (en) | Multi-image compression method based on hierarchical block replacement | |
| WO2023179710A1 (en) | Coding method and terminal | |
| CN102158707A (en) | Image compression storage method based on comprehensive vertex chain code coding | |
| CN101364306A (en) | Stationary image compression coding method based on asymmetric inversed placement model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110817 |