Bit depth reduction techniques for low complexity image patch matching
a patch matching and low-complexity technology, applied in the field of image processing, can solve the problems that the application of patch matching in real-time applications is usually difficult without the use of expensive, dedicated hardware, etc., and achieve the effect of reducing the computation and hardware requirements of image patch matching, reducing the bit depth of image data, and minimal loss of matching accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017]Two different approaches for reducing the bit depth of the image data so as to reduce the computation and hardware requirement of image patch matching, with minimal loss of matching accuracy are described. The complexity / performance trade-off of the approaches are also adjustable so that they are able to be applied for applications with different quality requirements and hardware constraints.
[0018]Patch matching is an important operation used in many different applications, for example, still image denoising, motion estimation in video coding and stereo vision correspondence matching. The objective is to find other image patches that are similar to any given target patch from within the same image or from other video frames. Patch matching determines which candidate patch or patches are most similar to a target patch. A matching cost function is able to be used to define the similarity or dissimilarity of the patches. Examples of matching cost functions are Sum of Absolute Dif...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


