Method for fractal coding of video or audio signals
AssigneeDeutsche Thomson-Brandt GmbH
InventorsGerhard Dickopp, Thomas Vaupel
Life of this patent
Estimating the term…
Abstract
In a method for fractal coding of signals, in which a domain block d is investigated for a range block r to be transmitted from an original signal, so that, after using the calculation rule r*=v·d+b, an approximated range block r* is generated, v·d being a linear function and b being an offset vector, the offset vector b in general has different components b=(b1, b2, . . . , bn) the offset vector b preferably being composed of weighted orthogonal basic functions of an orthogonal transformation.
Claims7
Method for fractal coding of signals, in which a domain block d is investigated for a range block r to be transmitted from an original signal, so that, after using the calculation rule r*=v·d+b, an approximated range block r* is generated, v being an amplification factor and b being an offset vector, the offset vector b in general has different components b=(b1, b2, . . . , bn), wherein the offset vector b is composed of weighted orthogonal basic functions tm of an orthogonal transformation, and wherein the mean square error e2 is used to determine the optimum domain block d, in which case the optimum values for the amplification factor v and the coefficients am of the orthogonal basis vectors tm become:
- ν = ∑ i = 1 N R i * · D i * / ∑ i = 1 N ( D i * ) 2
- and
- am=Rm−v·Dm
- where:
- b i = ∑ m = 1 M a m t i , m with b i :
- i - th element of the vector b with N values , t i , m :
- i - th element of the basis vector t m with N values , a m :
- weighting factor of the m - th basis vector t m . and R i * = ∑ k = M + 1 N R k · t k , i , R k = ∑ i = 1 N r i · t k , i or R m = ∑ i = 1 N r i · t m , i , D i * = ∑ k = M + 1 N D k · t k , i , and D k = ∑ i = 1 N d i · t k , i or D m = ∑ i = 1 N d i · t m , i .
Dependencies are inferred from the claim text.