Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

N level sub-pixel search method based on whole pixel searching result

An integer pixel search and search method technology, which is applied in the field of n-level sub-pixel search methods and devices based on integer pixel search results, can solve the problems of complex filtering functions, increased processing time, large data volume, etc., and achieves increased computing power. Parallelism, the effect of increasing the parallelism of the calculation, and not increasing the computational complexity

Inactive Publication Date: 2010-11-17
ZHEJIANG UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In this way, because the amount of interpolation filtering data is very large and the filtering function is relatively complicated, for the application of high-definition video, the time for encoding each macroblock is very short, such as real-time encoding of 30 frames per second, in the format of 1920×1088, with 1 / For example, 2 pixels need to insert 501350400 pixel values ​​per second, which is already a great challenge for hardware implementation
If the higher precision (such as quarter precision) search serial implementation described by the traditional algorithm is used, the hardware implementation will eventually increase several pipeline levels, which means that the storage unit and the calculation unit are doubled. the price will be huge
[0016] If the hardware design is carried out according to the traditional sub-pixel search strategy, another problem is that when searching with 1 / 4 precision, the 1 / 4 precision pixels need to be interpolated first, which requires a large number of 1 / 2 precision pixel interpolation Results or intermediate results, most of these interpolation results or intermediate results have been obtained in the previous 1 / 2 precision pixel search, so we face two choices: (a) interpolation results or interpolation results during 1 / 2 precision pixel search The intermediate results are stored in the cache, generally in SRAM; (b) the interpolation results or intermediate results that are not stored in 1 / 2 precision pixels are recalculated when doing 1 / 4 precision search; for the first type solution, will increase a large amount of storage area; for the second solution, due to a large number of repetitive calculations, it will directly increase the processing time; how to overcome the shortcomings of the sub-pixel search method in the prior art and solve the high-level sub-pixel search dependence This is one of the problems that the sub-pixel search method needs to solve in order to solve the problem of low-level sub-pixel search results, increase computational parallelism, and improve coding efficiency.

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
  • N level sub-pixel search method based on whole pixel searching result
  • N level sub-pixel search method based on whole pixel searching result
  • N level sub-pixel search method based on whole pixel searching result

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0042] An n-level sub-pixel search method based on integer-pixel search results. In this example, the highest level of sub-pixels is specified to be 1 / 8 precision, that is, the case of n=3, so that a total of 3 levels of sub-pixels need to be searched. It is known that the coordinates of the upper left corner of the best matching block in the reference image are (x, y) for integer pixel search, where x and y are both integers. With (x, y) as the center, perform a 2-level sub-pixel search with variable complexity, such as image 3 shown.

[0043] The search position of the first level includes the search block whose upper left corner pixel is the following coordinate position point:

[0044] (x-0.5, y-0.5), (x, y-0.5), (x+0.5, y-0.5), (x-0.5, y), (x+0.5, y), (x-0.5, y +0.5), (x, y+0.5), (x+0.5, y+0.5)

[0045] The search position of the second level includes the search block whose upper left corner pixel is the following coordinate position point:

[0046] (x-0.25, y-0.25),...

Embodiment 2

[0051]An n-level sub-pixel search method based on integer pixel search results. In this example, for the H.264 video coding standard, the search accuracy is 1 / 4 pixel, so that the sub-pixels that need to be searched in total include 2 levels, that is, n=2 . The minimum block division of the H.264 video coding standard is 4×4, so the n-level sub-pixel search is also based on the 4×4 block size. It is known that the coordinates of the upper left corner of the best matching block in the reference image are (x, y) for integer pixel search, where x and y are both integers. With (x, y) as the center, perform a 2-level sub-pixel search with variable complexity, such as Figure 4 shown.

[0052] The search position of the first level includes a 4×4 search block whose upper left corner pixel is the following coordinate position point:

[0053] (x-0.5, y-0.5), (x, y-0.5), (x+0.5, y-0.5), (x-0.5, y), (x+0.5, y), (x-0.5, y +0.5), (x, y+0.5), (x+0.5, y+0.5)

[0054] The search positio...

Embodiment 3

[0058] An n-level sub-pixel search method based on integer-pixel search results. In this example, for the AVS video coding standard, the search accuracy is 1 / 4 pixel, so that the sub-pixels to be searched in total include 2 levels, that is, n=2. The minimum block division of the AVS video coding standard is 8×8, so the n-level sub-pixel search is also based on the 8×8 block size. It is known that the coordinates of the upper left corner of the best matching block in the reference image are (x, y) for integer pixel search, where x and y are both integers. With (x, y) as the center, perform a 2-level sub-pixel search with variable complexity, such as Figure 5 shown.

[0059] The search position of the first level includes an 8×8 search block whose upper left corner pixel is the following coordinate position point:

[0060] (x-0.5, y-0.5), (x, y-0.5), (x+0.5, y-0.5), (x-0.5, y), (x+0.5, y), (x-0.5, y +0.5), (x, y+0.5), (x+0.5, y+0.5) (x-1.5, y-1.5), (x, y-1.5), (x+1.5, y-1.5)...

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 belongs to the technical field of the digital video code, particularly to a n-level sub-pixel searching method based on the integer-pixel searching result and a device thereof, characterized by selecting the coordinate position of the top left corner pixel besting matching with the integer-pixel in the reference picture as the center, then performing the n-level sub-pixel searching with variable complexity, obtaining the block matching error function value of the corresponding sub-pixel position point and the integer-pixel position point, comparing the block matching error function value of the corresponding sub-pixel position point and the integer-pixel position point, obtaining the optimum coordinate position at the top left corner of the block corresponding with the blockmatching error function value, wherein n is not less than 2 in the n-level sub-pixel searching. According to the invention, the sub-pixel searching with high level is independent of the sub-pixel searching result of the lower level, thereby increasing the computing parallelism, saving the coding time, effectively advancing the computing parallelism between different sub-pixel levels when the hardware implement; while the device based on the method can make full use of the parallelism characteristic between the sub-pixels with different levels to increase the processing speed of the hardware.

Description

technical field [0001] The invention belongs to the technical field of digital video coding, and in particular relates to an n-level sub-pixel search method based on integer-pixel search results and a device thereof. Background technique [0002] The research on digital image and video signal processing and coding technology began in the 1950s, and the coding method initially adopted was differential pulse code modulation (DPCM for short) in the space domain. By the 1970s, transform coding techniques and motion compensation prediction techniques began to appear. In 1974, Ahmed et al. introduced block-based two-dimensional discrete cosine transform (referred to as DCT), which became a core technology in the modern advanced video coding framework. These technologies gradually matured and developed into a practical coding technology in the 1980s, establishing a block-based hybrid coding framework, a traditional hybrid coding framework that integrates predictive coding, transfo...

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 Patents(China)
IPC IPC(8): H04N7/26H04N7/50H04N19/105H04N19/523
Inventor 虞露姚烁
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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