Method for improving digital signal conversion performance, digital signal conversion method and device
A digital signal and performance technology, applied in the direction of digital video signal modification, image communication, electrical components, etc., can solve the problems of large transformation distortion, insufficient core de-correlation, and not good enough, so as to achieve the effect of high transformation performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0096] In an actual 8×8 transformation process, the realization of the transformation has the following requirements: each coefficient in the transformation kernel matrix A is an integer, and the storage space of each coefficient does not exceed 9 bits, namely
[0097] If α=3, β=γ=1, the transformation kernel matrix A must satisfy at the same time:
[0098] (a) [DCT(i,j)×Factor]-2≤A(i,j)≤[DCT(i,j)×Factor]+2
[0099](b) J(A)
[0100] The TH value is obtained according to the following:
[0101] The matrix M is in The matrix obtained by rounding and rounding according to formula (1) is as follows:
[0102]
[0103] Through calculation, J(M)=0.015159 can be obtained. Set the threshold TH=J(M).
[0104] Written in a set form is A∈{S:J(S)<0.015159}, and A satisfies the above condition (a). Through this constraint, several finite transformation kernel matrices can be obtained. An example of a certain transformation kernel matrix A is given below:
[0105]
[0106...
Embodiment 2
[0108] In an actual 16×16 transformation process, the realization of the transformation has the following requirements: each coefficient in the transformation kernel matrix A is an integer, and the storage space of each coefficient does not exceed 8 bits, ie Factor=256.
[0109] If α=2, β=γ=1, the transformation kernel matrix A must satisfy at the same time:
[0110] (a) [DCT(i,j)×Factor]-2≤A(i,j)≤[DCT(i,j)×Factor]+2
[0111] (b) J(A)
[0112] The TH value is obtained according to the following:
[0113] The matrix M is the 16×16 transformation kernel specified in the H.265 standard, as follows:
[0114]
[0115] Through calculation, J(M)=0.13377 can be obtained. Set the threshold TH=J(M).
[0116] Written in a set form is A∈{S:J(S)<0.13377}, and A satisfies the above condition (a). Through this constraint, several finite transformation kernel matrices can be obtained. An example of a certain transformation kernel matrix A is given below:
[0117]
[0118] J(A)...
Embodiment 3
[0120] In an actual 8×8 transformation process, the realization of the transformation has the following requirements: each coefficient in the transformation kernel matrix A is an integer, and the storage space of each coefficient does not exceed 8 bits, namely
[0121] If α=2, β=γ=1, the transformation kernel matrix A must satisfy at the same time:
[0122] (a) [DCT(i,j)×Factor]-2≤A(i,j)≤[DCT(i,j)×Factor]+2
[0123] (b) J(A)
[0124] The TH value is obtained according to the following:
[0125] The matrix M is the 8×8 transformation kernel matrix specified in the H.265 standard, as follows:
[0126]
[0127] Through calculation, J(M)=0.038484 can be obtained. Set the threshold TH=J(M).
[0128] Written in a set form is A∈{S:J(S)<0.038484}, and A satisfies the above condition (a). Through this constraint, several finite transformation kernel matrices can be obtained. An example of a certain transformation kernel matrix A is given below:
[0129]
[0130] Throu...
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