CN103914866A - 3D model grouping method based on self-adaptive graph coloring in wireless network - Google Patents
3D model grouping method based on self-adaptive graph coloring in wireless network Download PDFInfo
- Publication number
- CN103914866A CN103914866A CN201410097919.7A CN201410097919A CN103914866A CN 103914866 A CN103914866 A CN 103914866A CN 201410097919 A CN201410097919 A CN 201410097919A CN 103914866 A CN103914866 A CN 103914866A
- Authority
- CN
- China
- Prior art keywords
- centerdot
- summit
- color
- grouping
- model
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000004040 coloring Methods 0.000 title claims abstract description 16
- 238000005516 engineering process Methods 0.000 claims abstract description 11
- 239000003086 colorant Substances 0.000 claims abstract description 4
- 239000012634 fragment Substances 0.000 claims description 19
- 230000005540 biological transmission Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 claims description 2
- 230000000694 effects Effects 0.000 abstract description 3
- 238000000638 solvent extraction Methods 0.000 abstract description 3
- 230000007423 decrease Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Landscapes
- Image Generation (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a 3D model grouping method based on self-adaptive graph coloring in a wireless network. First, an order driving method is adopted for traversing a 3D model so that each vertex can acquire a global traversing index; second, a 3D model partitioning method is adopted for partitioning the whole model into multiple segments; next, each segment is traversed, and all the contained vertexes are marked into different colors with a self-adaptive graph coloring method; at the moment, each segment will be partitioned into multiple groups, and the vertexes contained in each group are the same in color; finally, the groups are selected from different parts according to a certain sequence, and a final grouping sending sequence is formed. Due to the effective grouping technology based on coloring of improved graphs, when the 3D model is transmitted in a high-packet-loss probability network, a better reconstructing effect can still be acquired.
Description
Technical field
The invention belongs to multimedia technology field relevant to portable mobile equipment in wireless network, particularly the three-dimensional model group technology based on self-adaptation graph coloring in a kind of wireless network.
Background technology
Along with the raising of the three-dimensional picture processing power on maturation and the mobile device of wireless network, based on the graphical application of wireless network, as the application such as moving three dimension game, moving three dimension virtual display and roaming and mobile augmented reality system were rapidly developed in recent years.But, relatively limited network, still there is finite bandwidth and compared with the defect of high packet loss, make three-dimensional scenic and the complex model with the strong sense of reality on mobile device, to transmit and to draw by real-time interactive in wireless network.
For overcoming the defect compared with high packet loss in wireless network, researchers have proposed multiple solution.It is Network Based and based on the large class of model two that these methods are divided into conventionally.Be directed to network method, for there being the data of losing in efficient recovery transmission, forward error correction, decile error protection, unequal error protection, mixes unequal error protection and selects the methods such as transmission to be suggested.But these methods all can bring extra mistake to recover redundant information, thereby cause the decline of transmission performance.
Method based on model has adopted another kind of thinking.In general, the method based on model has all been considered the dependency problem existing in model based coding in design.Grouping is a kind of dependence method reducing between model data.Its main thought is to put into same grouping to reduce the impact that packet loss was brought by having the summit being closely related in model.
For wireless network, because network exists shade, decline and interference phenomenon, cause the packet loss of grouping sometimes even to reach more than 60%.Meanwhile, the grouping of loss is usually expressed as sudden and continuity.In the case, in the time selecting group technology, a lot of information of model can be lost and can not normally be recovered, the reconstruct effect that causes mobile client not obtain.In order to minimize the impact bringing due to high packet loss and sudden continuity packet loss, the cross-packet method based on geometric model is distributed to adjacent summit in different groupings according to fixing cross distance.By this cross-packet method, the summit sending in grouping is continuously distributed in whole model more equably.Now, for the message of losing, client can utilize its adjacent grouping of not losing to recover.But the method is an interleaving techniques based on probability, it can only guarantee that part rather than all adjacent vertexs are distributed in different groupings.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, the three-dimensional model group technology based on self-adaptation graph coloring in a kind of wireless network is provided.
The technical solution adopted for the present invention to solve the technical problems is as follows:
First adopt the method traversal three-dimensional model that rank drive to allow each summit obtain an overall traversal index.Secondly, adopt three-dimensional model dividing method that whole model is divided into multiple fragments.Afterwards, each fragment is traveled through, its all summit that comprise is denoted as different colors by self-adaptation graph coloring method.Now, each fragment will be divided into multiple groupings, and the summit that each grouping comprises has identical color.Finally, from different parts, choose grouping according to a definite sequence, form final grouping sending order.
The present invention is compared with background technology, and the useful effect having is: the present invention is that one is applicable to three-dimensional model group technology in wireless lossy networks, can realize the function of still recovering largely model after three-dimensional modeling data is lost in mobile client.
Accompanying drawing explanation
Fig. 1 is model after overall situation traversal;
Fig. 2 is model after virtual dividing.
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described.
First, the method traversal three-dimensional model that adopts rank to drive, each summit obtains an overall traversal call number.Now, each summit will have unique overall situation traversal index value.Meanwhile, in ergodic process, record degree and the geological information on each summit.As shown in Figure 1.
Secondly, execution model dividing method, is divided into multiple fragments by three-dimensional model.In this model dividing method, first select multiple initial Seed Points, each Seed Points starts to increase until reach given threshold value number of vertices to consecutive point separately afterwards.As shown in Figure 2, model is split into two fragments, and each fragment comprises 64 summits, and to be wherein labeled as 1 summit be initial kind of son vertex at outmost turns two ends.
The 3rd, to each fragment after cutting apart, carry out painted grouping algorithm, the summit that each fragment is comprised is assigned to respectively in different groupings.The impact bringing in order to minimize Network Packet Loss, need be distributed to adjacent summit in each different grouping equably.The present invention proposes a kind of group technology based on self-adaptation graph coloring and guarantees that adjacent summit is not in same grouping.
Self-adaptation map colouring problem of the present invention spreads over point problems such as figure.The problem definition of the method is as follows:
A given non-directed graph G=(V, E), wherein | V|=N, V and E are respectively summit and limit, N is the summit quantity in figure.For meeting above-mentioned grouping demand, the target of algorithm is to give C kind color to N summit, meets following condition simultaneously:
1) color category C value is given in advance;
2) number of vertex of every kind of color is all identical;
3) adjacent vertex color is different;
4) guarantee as much as possible same color summit disperse be distributed in grid.
Provide the concrete steps of this self-adaptation graph coloring grouping algorithm below:
The partitioning algorithm of second step is divided into whole model M after L fragment, each fragment M
imiddle vertex set is V
i, number of vertices is threshold value T.According to transmitted in packets requirement, the number of vertices of each grouping is n, and so required grouping number is
wherein front P-1 grouping number of vertices is n, and last grouping number of vertices is T%n.Herein, with i (i=1,2 ... T) represent summit sequence number; Use C
j(j=1,2 ... P) represent color category.
Step 1: according to known P value, use summit precedence diagram colouring algorithm, calculate and meet the optimum topology adjacent range d that P value requires.
Step 2: from vertex set V
imiddle taking-up summit i, composes upper color value in accordance with the following steps successively.
1) consider in the d abutment points of summit i, if do not use the first color C
1, to summit i can consider to be colored as C
1plant color; If color C
1used, continued to consider successively color C below
2, C
3c
pwhether used, if C
2to C
pin certain color do not used and chosen its painted color for summit i.
2) if C
j(j=1,2 ... p) color all uses, and the abutment points scope that i is dwindled in consideration so, as the adjacent range at this d-1 is carried out painted to summit i.Herein, the abutment points scope of i can progressively be dwindled, until complete the coloring process of each summit i.
3) the getting colors in process of above-mentioned two steps, if C
jwhen the number of vertices of kind of color reaches n, this kind of color do not re-use, and jumps to lower a kind of number of vertices and do not reach the color of requirement.
Finally, the present invention picks out in a certain order grouping and their assemblings is formed to final transmission sequence from different fragments.In the present invention, suppose to be divided into l piece, each will be divided into m grouping, tag block x, and y is grouped into:
assembling sequence is: take out respectively the grouping of each middle same sequence number, and they are formed to a transmission sequence:
Such as:
it has shown two final grouping transmission sequences that fragment forms.Obviously, continuous grouping is all to derive from different fragments, can minimize like this impact bringing due to the continuous packet loss of burst of network.
Claims (1)
1. the three-dimensional model group technology based on self-adaptation graph coloring in wireless network, is characterized in that the method comprises the steps:
First, the method traversal three-dimensional model that adopts rank to drive, each summit obtains an overall traversal call number; Now, each summit will have unique overall situation traversal index value; Meanwhile, in ergodic process, record degree and the geological information on each summit;
Secondly, execution model dividing method, is divided into multiple fragments by three-dimensional model; In this model dividing method, first select multiple initial Seed Points, each Seed Points starts to increase until reach given threshold value number of vertices to consecutive point separately afterwards;
Then, to each fragment after cutting apart, carry out painted grouping algorithm, the summit that each fragment is comprised is assigned to respectively in different groupings; The impact bringing in order to minimize Network Packet Loss, need be distributed to adjacent summit in each different grouping equably; Specifically:
If whole model M is divided into after L fragment, each fragment M
imiddle vertex set is V
i, number of vertices is threshold value T; According to transmitted in packets requirement, the number of vertices of each grouping is n, and so required grouping number is
wherein front P-1 grouping number of vertices is n, and last grouping number of vertices is T%n; Represent summit sequence number with i herein; I=1,2 ... T; Use C
jrepresent color category, j=1,2 ... P;
Step 3-1: according to known P value, use summit precedence diagram colouring algorithm, calculate and meet the optimum topology adjacent range d that P value requires;
Step 3-2: from vertex set V
imiddle taking-up summit i, composes upper color value in accordance with the following steps successively;
1) consider in the d abutment points of summit i, if do not use the first color C
1, to summit i can consider to be colored as C
1plant color; If color C
1used, continued to consider successively color C below
2, C
3c
pwhether used, if C
2to C
pin certain color do not used and chosen its painted color for summit i;
2) if C
jcolor all uses, and the abutment points scope that i is dwindled in consideration so, as the adjacent range at this d-1 is carried out painted to summit i; Herein, the abutment points scope of i can progressively be dwindled, until complete the coloring process of each summit i;
3) the getting colors in process of above-mentioned two steps, if C
jwhen the number of vertices of kind of color reaches n, this kind of color do not re-use, and jumps to lower a kind of number of vertices and do not reach the color of requirement;
Finally, from different fragments, pick out grouping and their assemblings are formed to final transmission sequence according to the order of setting; Specifically: suppose to be divided into l piece, each will be divided into m grouping, tag block x, y is grouped into:
assembling sequence is: take out respectively the grouping of each middle same sequence number, and they are formed to a transmission sequence:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410097919.7A CN103914866B (en) | 2014-03-14 | 2014-03-14 | 3D model grouping method based on self-adaptive graph coloring in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410097919.7A CN103914866B (en) | 2014-03-14 | 2014-03-14 | 3D model grouping method based on self-adaptive graph coloring in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103914866A true CN103914866A (en) | 2014-07-09 |
| CN103914866B CN103914866B (en) | 2017-02-15 |
Family
ID=51040519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410097919.7A Expired - Fee Related CN103914866B (en) | 2014-03-14 | 2014-03-14 | 3D model grouping method based on self-adaptive graph coloring in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103914866B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104680174A (en) * | 2015-02-04 | 2015-06-03 | 浙江工商大学 | Mesh animation progressive transmission-orientated frame clustering method |
| CN107743697A (en) * | 2015-06-12 | 2018-02-27 | 微软技术许可有限责任公司 | Choreography in fault-tolerant domain |
| CN108876874A (en) * | 2018-06-11 | 2018-11-23 | 成都大学 | Figure vertex coloring method, processing equipment and storage medium |
| CN111885616A (en) * | 2020-08-03 | 2020-11-03 | 温州职业技术学院 | High-energy-efficiency station grouping method and system under high-density WLAN environment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101984412B (en) * | 2010-10-13 | 2013-01-30 | 北京航空航天大学 | Method for scheduling parallel test tasks based on grouping and tabu search |
-
2014
- 2014-03-14 CN CN201410097919.7A patent/CN103914866B/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104680174A (en) * | 2015-02-04 | 2015-06-03 | 浙江工商大学 | Mesh animation progressive transmission-orientated frame clustering method |
| CN104680174B (en) * | 2015-02-04 | 2018-02-09 | 浙江工商大学 | The frame clustering method of Grid-oriented animation progressive transmission |
| CN107743697A (en) * | 2015-06-12 | 2018-02-27 | 微软技术许可有限责任公司 | Choreography in fault-tolerant domain |
| CN107743697B (en) * | 2015-06-12 | 2021-02-26 | 微软技术许可有限责任公司 | Action orchestration in fault tolerant domains |
| CN108876874A (en) * | 2018-06-11 | 2018-11-23 | 成都大学 | Figure vertex coloring method, processing equipment and storage medium |
| CN111885616A (en) * | 2020-08-03 | 2020-11-03 | 温州职业技术学院 | High-energy-efficiency station grouping method and system under high-density WLAN environment |
| CN111885616B (en) * | 2020-08-03 | 2023-05-16 | 温州职业技术学院 | High-energy-efficiency site grouping method and system in high-density WLAN environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103914866B (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101976455B (en) | Color image three-dimensional reconstruction method based on three-dimensional matching | |
| CN104599315B (en) | The construction method and system of a kind of three-dimensional scenic | |
| CN103914866A (en) | 3D model grouping method based on self-adaptive graph coloring in wireless network | |
| CN1250289B (en) | Progressive 3D lattice encoding method and apparatus | |
| JP2020126607A (en) | Learning method and learning device for integrating image acquired from camera and point cloud map acquired through corresponding radar or lidar for each convolution stage of neural network, and test method and test device utilizing the same | |
| TW201622469A (en) | System and method for green communication for intelligent mobile internet of things | |
| CN101986716B (en) | Quick depth video coding method | |
| CN102447925B (en) | Method and device for synthesizing virtual viewpoint image | |
| CN106504190A (en) | A kind of three-dimensional video-frequency generation method based on 3D convolutional neural networks | |
| CN104956404A (en) | Real-time 3d reconstruction with power efficient depth sensor usage | |
| CN104081701B (en) | Communication means, system and the device of optical network system | |
| CN103840871B (en) | Encoding and reconstruction method of three-dimensional model topological data robust transmission in wireless network | |
| CN110138437A (en) | Satellite communication network critical link sequence detecting method based on delay performance | |
| CN106204719B (en) | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval | |
| CN106254030B (en) | Two-way coding and decoding method without rate Spinal code | |
| CN108900283A (en) | Transmit the method and communication equipment of information | |
| CN104616356B (en) | Sub-compartment boundary three-dimensional visual editing method | |
| CN104143214A (en) | Electronic map polygon triangulation method and device | |
| CN103763558A (en) | Texture image compression method based on image similarities | |
| CN102932012B (en) | A kind of deletion RS code blind identification method for coding parameters of error-tolerant code | |
| CN105208407A (en) | Device and method for processing a stream of video data | |
| CN106850142A (en) | The polar code constructing methods of the code word Optimal Distribution encoded using Homophonic under memory channel | |
| CN105678840A (en) | Rapid generation custom road implement method on the basis of three-dimensional terrain software system | |
| CN101695139B (en) | Gradable block-based virtual viewpoint image drawing method | |
| CN101360077B (en) | Data receiving method for TD-SCDMA system |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200612 Address after: Room 107, 1 / F, building 1, 198 Jiaogong Road, Xihu District, Hangzhou City, Zhejiang Province Patentee after: Hangzhou youchuangxin Agricultural Technology Co.,Ltd. Address before: Hangzhou City, Zhejiang province 310018 Xiasha Higher Education Park is 18 street. Patentee before: ZHEJIANG GONGSHANG University |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170215 |