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.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com