CN107204776A - A kind of Web3D data compression algorithms based on floating number situation - Google Patents
A kind of Web3D data compression algorithms based on floating number situation Download PDFInfo
- Publication number
- CN107204776A CN107204776A CN201610155329.4A CN201610155329A CN107204776A CN 107204776 A CN107204776 A CN 107204776A CN 201610155329 A CN201610155329 A CN 201610155329A CN 107204776 A CN107204776 A CN 107204776A
- Authority
- CN
- China
- Prior art keywords
- data
- dis
- web3d
- code table
- blocks
- 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
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
Abstract
The invention discloses a kind of Web3D data compression algorithms based on floating number situation, comprise the following steps：（1）3D formatted files are imported into Web3D platform editing machines；（2）The data of its 3D form are extracted automatically inside editing machine；（3）Webgl floating numbers account for 4 byte 32, and constricted zone takes 32kb；（4）Identical data is searched in the range of 32kb since 0, it is incremented by successively；（5）It is identical, then record current data and a upper data the distance between dis, do not repeat, then record tiger；（6）Dis data blocks are obtained after traversal, then huffman coding is done to dis data blocks；（7）Finally again to data code table, dis code tables and tiger do huffman coding again；（8）Decompression, obtains code table, metadata code table and dis blocks is restored according to Huffman, all former data are being gone out with Hofmann decoding carries out 3D to render.The present invention is that 4 bytes are a unit, saves length, because defining 4 bytes, saves the coding of length.
Description
Technical field
The present invention relates to a kind of compression algorithm, specifically a kind of Web3D data compression algorithms based on floating number situation.
Background technology
Data compression refers on the premise of useful information is not lost, reduce data volume to reduce memory space, its transmission, storage and treatment effeciency are improved, or data are reorganized according to certain algorithm, a kind of technical method in the redundancy of data and the space of storage is reduced.
In computer science and information theory, data compression or source code are according to the specific encoding mechanism process that information is represented than un-encoded few data bit element (or the related unit of other information).A kind of popular example of compression be many computers all in the ZIP file form used, it not only provides the function of compression, but also is used as filing instrument (Archiver), can be by the storage of many files into same file.
ZIP, is the algorithm of the compression of a computer documents, and inventor is that Philips blocks hereby (Phil Katz)), he discloses the data of the form in January, 1989.ZIP is usually using suffix name " .zip ", and its MIME forms are application/zip.Zip is that a byte is a unit, and identical bytes, which are greater than 3 bytes, can just record dis, and zip is distance+length to represent.
The content of the invention
It is an object of the invention to provide a kind of Web3D data compression algorithms based on floating number situation, to solve the problems mentioned in the above background technology.
To achieve the above object, the present invention provides following technical scheme：
A kind of Web3D data compression algorithms based on floating number situation, comprise the following steps：
（1）3D formatted files are imported into Web3D platform editing machines；
（2）The data of its 3D form are extracted automatically inside editing machine；
（3）Webgl floating numbers account for 4 byte 32, and constricted zone takes 32kb；
（4）Identical data is searched in the range of 32kb since 0, it is incremented by successively；
（5）If any identical, then record current data and a upper data the distance between dis, if do not repeated, record tiger；
（6）Dis data blocks are obtained after traversal, then huffman coding is done to dis data blocks, i.e., it is at most most short according to occurring；
（7）Finally again to data code table, dis code tables and tiger do huffman coding again；
（8）Decompression, obtains code table, metadata code table and dis blocks is restored according to Huffman, all former data are being gone out with Hofmann decoding carries out 3D to render.
It is used as further scheme of the invention：Step（2）Described in data include summit, normal, face, UV and animation.
Compared with prior art, the beneficial effects of the invention are as follows：The compress mode compression ratio of the invention that use that browsed than autodesk lightweight is high, and great efforts are compressed than zip, and the present invention is that 4 bytes are a unit, saves length, because defining 4 bytes, saves the coding of length.
Embodiment
Below in conjunction with the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under the premise of creative work is not made belongs to the scope of protection of the invention.
In the embodiment of the present invention, a kind of Web3D data compression algorithms based on floating number situation comprise the following steps：
（1）3D formatted files are imported into Web3D platform editing machines；
（2）Automatically by the data of its 3D form inside editing machine（Summit, normal, face, UV, animation）Extract；
（3）Webgl floating numbers typically constitute from 4 bytes（32）, we take 32kb by constricted zone；
（4）Identical data is searched in the range of 32kb since 0, it is incremented by successively；
（5）If any identical, then record current data and a upper data the distance between dis, if do not repeated, record tiger（It is miss）；
（6）Dis data blocks are obtained after traversal, then huffman coding is done to dis data blocks, i.e., it is at most most short according to occurring；
（7）Finally again to data code table, dis code tables and tiger do huffman coding again；
（8）Decompression, obtains code table, metadata code table and dis blocks is restored according to Huffman, all former data are being gone out with Hofmann decoding carries out 3D to render.
The compress mode compression ratio of the invention that use that browsed than autodesk lightweight is high, and great efforts are compressed than zip, and the present invention is that 4 bytes are a unit, saves length, because defining 4 bytes, saves the coding of length.
It is obvious to a person skilled in the art that the invention is not restricted to the details of above-mentioned one exemplary embodiment, and without departing from the spirit or essential characteristics of the present invention, the present invention can be realized in other specific forms.Therefore, no matter from the point of view of which point, embodiment all should be regarded as exemplary, and be nonrestrictive, the scope of the present invention is limited by appended claims rather than described above, it is intended that all changes fallen in the implication and scope of the equivalency of claim are included in the present invention.
In addition, it should be understood that, although the present specification is described in terms of embodiments, but not each embodiment is only comprising an independent technical scheme, this narrating mode of specification is only for clarity, the skilled in the art should refer to the specification as a whole, and the technical solutions in the various embodiments may also be suitably combined, and other embodiments which can be understood by those skilled in the art for formation.
Claims (2)
1. a kind of Web3D data compression algorithms based on floating number situation, it is characterised in that comprise the following steps：
（1）3D formatted files are imported into Web3D platform editing machines；
（2）The data of its 3D form are extracted automatically inside editing machine；
（3）Webgl floating numbers account for 4 byte 32, and constricted zone takes 32kb；
（4）Identical data is searched in the range of 32kb since 0, it is incremented by successively；
（5）If any identical, then record current data and a upper data the distance between dis, if do not repeated, record tiger；
（6）Dis data blocks are obtained after traversal, then huffman coding is done to dis data blocks, i.e., it is at most most short according to occurring；
（7）Finally again to data code table, dis code tables and tiger do huffman coding again；
（8）Decompression, obtains code table, metadata code table and dis blocks is restored according to Huffman, all former data are being gone out with Hofmann decoding carries out 3D to render.
2. the Web3D data compression algorithms according to claim 1 based on floating number situation, it is characterised in that step（2）Described in data include summit, normal, face, UV and animation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610155329.4A CN107204776A (en) | 2016-03-18 | 2016-03-18 | A kind of Web3D data compression algorithms based on floating number situation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610155329.4A CN107204776A (en) | 2016-03-18 | 2016-03-18 | A kind of Web3D data compression algorithms based on floating number situation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107204776A true CN107204776A (en) | 2017-09-26 |
Family
ID=59904013
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610155329.4A Pending CN107204776A (en) | 2016-03-18 | 2016-03-18 | A kind of Web3D data compression algorithms based on floating number situation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107204776A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113689322A (en) * | 2021-08-27 | 2021-11-23 | 支付宝(杭州)信息技术有限公司 | Artificial intelligence model service processing method, device and equipment under drawing protocol |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050048722A (en) * | 2003-11-19 | 2005-05-25 | 정보통신연구진흥원 | The method and technology for image compression and decompression of vm based mobile device without data loss |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| CN101478311A (en) * | 2009-01-22 | 2009-07-08 | 浙江大学 | Hardware accelerated implementation process for bzip2 compression algorithm |
| CN101729076A (en) * | 2008-10-22 | 2010-06-09 | 安凯（广州）软件技术有限公司 | Nonperfect code table based Huffman decoding method for analyzing code length |
| US20110154169A1 (en) * | 2009-12-22 | 2011-06-23 | Vinodh Gopal | System, method, and apparatus for a scalable processor architecture for a variety of string processing applications |
| CN102122960A (en) * | 2011-01-18 | 2011-07-13 | 西安理工大学 | Multi-character combination lossless data compression method for binary data |
| CN102413164A (en) * | 2011-08-31 | 2012-04-11 | 北京华电万通科技有限公司 | Web-based three-dimensional scenic visualized editing device and method |
| CN102687404A (en) * | 2009-12-29 | 2012-09-19 | 国际商业机器公司 | Data value occurrence information for data compression |
| CN104657362A (en) * | 2013-11-18 | 2015-05-27 | 深圳市腾讯计算机系统有限公司 | Method and device for storing and querying data |
| CN104731760A (en) * | 2015-04-17 | 2015-06-24 | 武汉理工大学 | K-means data processing method based on data density and Huffman tree |
| CN104902256A (en) * | 2015-05-21 | 2015-09-09 | 南京大学 | Binocular stereo image coding and decoding method based on motion compensation |
-
2016
- 2016-03-18 CN CN201610155329.4A patent/CN107204776A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050048722A (en) * | 2003-11-19 | 2005-05-25 | 정보통신연구진흥원 | The method and technology for image compression and decompression of vm based mobile device without data loss |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| CN101729076A (en) * | 2008-10-22 | 2010-06-09 | 安凯（广州）软件技术有限公司 | Nonperfect code table based Huffman decoding method for analyzing code length |
| CN101478311A (en) * | 2009-01-22 | 2009-07-08 | 浙江大学 | Hardware accelerated implementation process for bzip2 compression algorithm |
| US20110154169A1 (en) * | 2009-12-22 | 2011-06-23 | Vinodh Gopal | System, method, and apparatus for a scalable processor architecture for a variety of string processing applications |
| CN102687404A (en) * | 2009-12-29 | 2012-09-19 | 国际商业机器公司 | Data value occurrence information for data compression |
| CN102122960A (en) * | 2011-01-18 | 2011-07-13 | 西安理工大学 | Multi-character combination lossless data compression method for binary data |
| CN102413164A (en) * | 2011-08-31 | 2012-04-11 | 北京华电万通科技有限公司 | Web-based three-dimensional scenic visualized editing device and method |
| CN104657362A (en) * | 2013-11-18 | 2015-05-27 | 深圳市腾讯计算机系统有限公司 | Method and device for storing and querying data |
| CN104731760A (en) * | 2015-04-17 | 2015-06-24 | 武汉理工大学 | K-means data processing method based on data density and Huffman tree |
| CN104902256A (en) * | 2015-05-21 | 2015-09-09 | 南京大学 | Binocular stereo image coding and decoding method based on motion compensation |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113689322A (en) * | 2021-08-27 | 2021-11-23 | 支付宝(杭州)信息技术有限公司 | Artificial intelligence model service processing method, device and equipment under drawing protocol |
| CN113689322B (en) * | 2021-08-27 | 2024-02-02 | 支付宝(杭州)信息技术有限公司 | Artificial intelligent model service processing method, device and equipment under drawing protocol |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9390099B1 (en) | Method and apparatus for improving a compression ratio of multiple documents by using templates | |
| CN103384884A (en) | File compression method and device, file decompression method and device, and server | |
| CN107395209B (en) | Data compression method, data decompression method and equipment thereof | |
| CN110518917B (en) | LZW data compression method and system based on Huffman coding | |
| CN103326732A (en) | Method for packing data, method for unpacking data, coder and decoder | |
| KR101610609B1 (en) | Data encoder, data decoder and method | |
| CN103020317A (en) | Device and method for data compression based on data deduplication | |
| CN103248369A (en) | Compression system and method based on FPFA (Field Programmable Gate Array) | |
| CN104467868A (en) | Chinese text compression method | |
| CN103051341B (en) | Data coding device and method, data deciphering device and method | |
| CN104410424B (en) | The fast and lossless compression method of embedded device internal storage data | |
| CN103152430A (en) | Cloud storage method for reducing data-occupied space | |
| CN104125475B (en) | Multi-dimensional quantum data compressing and uncompressing method and apparatus | |
| CN103731154B (en) | Data compression algorithm based on semantic analysis | |
| JP4037875B2 (en) | Computer graphics data encoding device, decoding device, encoding method, and decoding method | |
| CN105515586B (en) | A kind of quick residual quantity compression method | |
| CN102510434A (en) | Image data transmitting and restoring method, device and terminal | |
| Nandi et al. | Modified compression techniques based on optimality of LZW code (MOLZW) | |
| CN107204776A (en) | A kind of Web3D data compression algorithms based on floating number situation | |
| CN104682966B (en) | The lossless compression method of table data | |
| CN103210590A (en) | Compression method and apparatus | |
| Konecki et al. | Efficiency of lossless data compression | |
| JP2016170750A (en) | Data management program, information processor and data management method | |
| CN102651795B (en) | Run-length reduced binary sequence compressed encoding method | |
| CN104301726A (en) | Method for image lossless compression and uncompress |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170926 |
|
| RJ01 | Rejection of invention patent application after publication |