Generation method of group image coding structure based on Zhuliu method and ant colony method
An image coding and group technology, applied in the field of image coding, can solve the problems of not being able to meet the needs of users for instant access to images, the coding efficiency is not high enough, and the cost of spanning trees is high, so as to achieve easy understanding, avoid ants accessing useless edges, and coding efficiency Improved effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0045] Most of the existing methods do not limit the depth of the minimum spanning tree, and cannot realize the real-time reading of images by users, which is not suitable for the real situation. However, for the situation where the correlation difference between group images is small, the cost of the depth-limited minimum spanning tree obtained by the existing HAP method is relatively large, and the coding efficiency is not high enough. For the shortcomings of the above methods, the present invention has been researched and developed. Innovation, proposed a group image coding structure generation method based on Zhu Liu method and ant colony method.
[0046] The present invention is a method for generating a group image coding structure based on the Zhu Liu method and the maximum-minimum ant colony method. figure 1 , including the following steps:
[0047] (1) Construct a weighted directed graph: a group image is an image set in the traditional sense. If the group images are...
Embodiment 2
[0073] The group image coding structure generation method based on Zhu Liu method and ant colony method is the same as embodiment 1, wherein in the step (3d), ring C is carried out to shrink ring processing, carry out as follows:
[0074] (3d1) If i ,v j > is a directed edge e in the shortest incoming edge set P, where node node v j ∈C, shrink the ring C into a new node v c , get the new edge e new =i ,v c >, new edge weight ω(e new )=ω(e)-ω(π(v j ), v j ).
[0075] (3d2) If i ,v j > is a directed edge e in the shortest incoming edge set P, where node v i ∈C, node Then reduce the ring C to a new node v c , get the new edge e new =c ,v j >, new edge weight ω(e new ) = ω(v i ,v j ).
[0076] The present invention adopts the method of shrinking rings in the Zhuliu method, and continuously shrinks the nodes and edges constituting the ring into new nodes until an acyclic spanning tree is obtained, and then expands the shrunken rings to obtain a tree shape with th...
Embodiment 3
[0078] The group image coding structure generation method based on Zhu Liu method and ant colony method is the same as embodiment 1-2, and calculates the depth-limited minimum spanning tree T of the kth ant in step (6d) k (V,E), proceed as follows:
[0079] (6d1) Initialize the minimum spanning tree T of the kth ant k (V,E). Among them, V={v i |dep(v i )≤d max}, E={i ,v j >|i ,v j >∈G 1 (V,E)∩dep(v i )≤d max ∩ dep(v j )≤d max}, that is: the initial minimum spanning tree contains nodes and directed edges that satisfy the depth limit in the minimum spanning tree obtained by Zhu Liu's method.
[0080] (6d2) Select a node in the current node set as the current access node v according to the random principle cur .
[0081] (6d3) Calculate the transition probability according to the following formula Select the next visited node v next , and visit it to judge whether its depth satisfies dep(v cur )max , if satisfied, set v next Added to the current node set.
[00...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More