Unlock instant, AI-driven research and patent intelligence for your innovation.

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

Inactive Publication Date: 2014-07-31
SONY CORP
View PDF1 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The patent describes two ways to reduce the amount of data needed for patch matching, which is a way to match parts of an image or video with each other. By using low-bit depth transformation and image processing techniques, the amount of memory and resources needed for patch matching can be minimized. The approach is flexible and can be adjusted for different quality requirements and hardware constraints. The "technical effect" is improved efficiency and reduced computational load for image patch matching.

Problems solved by technology

Due to the large amount of data that needs to be processed typically, applying patch matching for real-time applications is usually difficult without the use of expensive, dedicated hardware.

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
  • Bit depth reduction techniques for low complexity image patch matching
  • Bit depth reduction techniques for low complexity image patch matching
  • Bit depth reduction techniques for low complexity image patch matching

Examples

Experimental program
Comparison scheme
Effect test

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...

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

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. Patch matching is able to be implemented in many different ways, but generally involves matching one area of an image with another area of the same image or another area of a different image (e.g. another video frame) through the use of a matching cost function. Transforming the image data to lower bit depth, image processing techniques are able to be implemented to minimize the needed memory and other resources for patch-matching. 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.

Description

FIELD OF THE INVENTION[0001]The present invention relates to the field of image processing. More specifically, the present invention relates to image patch matching.BACKGROUND OF THE INVENTION[0002]Image patch matching is a fundamental operation that is important in several applications, for example, still image denoising, motion estimation in video coding and stereo vision correspondence matching. Recent methods of image denoising are described in Antoni Buades, Bartomeu Coll, and Jean-Michel Morel, “A Non-Local Algorithm for Image Denoising,” in Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), Vol. 2, pp. 60-65, Washington, DC, USA and K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising by sparse 3D transform-domain collaborative filtering,” IEEE Trans. Image Process., vol. 16, no. 8, pp. 2080-2095, August 2007. The use of patch matching for motion estimation used in video codec standards MPEG-1, MPEG-2,...

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(United States)
IPC IPC(8): G06T7/00G06V10/28
CPCG06T7/00H04N19/51H04N19/85G06T7/337G06V10/28G06V10/7515
Inventor WONG, TAK SHINGBERESTOV, ALEXANDERDONG, XIAOGANG
Owner SONY CORP