Fractal image compression method based on combination of quad tree and neighborhood searching

A technology of neighborhood search and image compression, which is applied in the field of image processing and can solve problems such as affecting the quality of image restoration and increasing the value.

Inactive Publication Date: 2012-07-18
SHANGHAI INST OF APPLIED PHYSICS - CHINESE ACAD OF SCI
View PDF1 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage is that due to the increase in the value of the error function d(Di, Ri) between the domain block and the range block, a "block effect" will appear, which will affect the restoration quality of the image

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fractal image compression method based on combination of quad tree and neighborhood searching
  • Fractal image compression method based on combination of quad tree and neighborhood searching
  • Fractal image compression method based on combination of quad tree and neighborhood searching

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] See attached image 3 , the present invention combines the fractal image compression method based on quadtree and neighborhood search and comprises the following steps:

[0036] Step 1. Set the maximum depth, minimum depth and error threshold of the quadtree, that is, set the minimum size, maximum size and matching block standard of the range block. Usually, the maximum depth of the quadtree is 4×4.

[0037]Step 2, load the image, and divide the original image into multiple non-overlapping value range blocks arranged in matrix form according to the minimum depth. Usually, the minimum depth is (M / 2)×(M / 2), M Indicates the side length of the original image. When the minimum depth is (M / 2)×(M / 2), it means that the original image is divided into four range blocks whose side length is M / 2. At the same time, it is also necessary to divide the original image into multiple overlapping domain blocks arranged in matrix form. All the domain blocks constitute the domain block poo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a fractal image compression method based on the combination of a quad tree and neighborhood searching. The method comprises the following steps of: setting the maximum and minimum depths of the quad tree and an error threshold value; dividing an image into value region blocks according to the minimum depth; extracting a value region block to be matched; searching for a neighborhood definitional domain block corresponding to the value region block to be matched; calculating affinity, matching the affinity and the value region block, and calculating a mean square error of the affinity and the value region block; comparing the mean square error with the threshold value; if the mean square error is small, recording a current value region block, a current definitional domain block and the affinity; if the mean square error is greater, judging whether the current value region block is the maximum depth or not, recording the current value region block, a definitional domain block with the lowest error, and the affinity if the current value region block is the maximum depth, and if the current value region block is not the maximum depth, dividing the value region block into sub-blocks according to the quad tree as value region blocks to be matched, correspondingly reducing the corresponding definitional domain block, and repeating the matching process; and judging whether all the value region blocks to be matched are matched or not, and if not all the value region blocks to be matched are matched, repeating the matching process. Searching time is shortened, and high image recovery quality is ensured.

Description

technical field [0001] The invention belongs to the technical field of image processing, in particular to a fractal image compression method based on the combination of quadtree and neighborhood search. Background technique [0002] Fractal image compression technology takes advantage of the self-similarity of the image itself, and uses local, smaller image area mapping to generate a larger area, thus eliminating redundant information between image areas and reducing the number of bits of the image stored, thereby achieve the purpose of compressing images. The fractal image compression method divides the range block and the domain block based on the original image being a square, and mainly finds a best matching domain block and its affine transformation for each range block. Its general method is as follows: [0003] (1) Divide the original image into blocks, and divide the image into a series of non-overlapping sub-blocks arranged in matrix form. These sub-blocks are cal...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04N7/26H04N19/96
Inventor 祁斌川丁建国
Owner SHANGHAI INST OF APPLIED PHYSICS - CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap