Surely both should work with the same set of functions. Why is only cosine transform used in JPEG? Why not sine? It seems that using fourier transform rather than cosine transform would result in complex numbers, but why should that even be a problem at all, surely we know how to do maths with complex numbers and they are not uselss.
2026-03-25 02:59:24.1774407564
Is there a difference between cosine and sine transform?
2.1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in FOURIER-ANALYSIS
- An estimate in the introduction of the Hilbert transform in Grafakos's Classical Fourier Analysis
- Verifying that translation by $h$ in time is the same as modulating by $-h$ in frequency (Fourier Analysis)
- How is $\int_{-T_0/2}^{+T_0/2} \delta(t) \cos(n\omega_0 t)dt=1$ and $\int_{-T_0/2}^{+T_0/2} \delta(t) \sin(n\omega_0 t)=0$?
- Understanding Book Proof that $[-2 \pi i x f(x)]^{\wedge}(\xi) = {d \over d\xi} \widehat{f}(\xi)$
- Proving the sharper form of the Lebesgue Differentiation Theorem
- Exercise $10$ of Chapter $4$ in Fourier Analysis by Stein & Shakarchi
- Show that a periodic function $f(t)$ with period $T$ can be written as $ f(t) = f_T (t) \star \frac{1}{T} \text{comb}\bigg(\frac{t}{T}\bigg) $
- Taking the Discrete Inverse Fourier Transform of a Continuous Forward Transform
- Is $x(t) = \sin(3t) + \cos\left({2\over3}t\right) + \cos(\pi t)$ periodic?
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
Related Questions in TRANSFORMATION
- $\int \ x\sqrt{1-x^2}\,dx$, by the substitution $x= \cos t$
- Functions on $\mathbb{R}^n$ commuting with orthogonal transformations
- How do you prove that an image preserving barycentric coordinates w.r.t two triangles is an affine transformation?
- Non-logarithmic bijective function from $\mathbb{R}^+$ into $\mathbb{R}$
- Where does this "magical" transformatiom come from?
- Calculate the convolution: $\frac{\sin(4t)}{\pi t}*( \cos(t)+\cos(6t) )$ using Fourier transform
- Find all $x \in\mathbb R^4$ that are mapped into the zero vector by the transformation $x \mapsto Ax$
- Linear transformation $f (ax+by)=$?
- Is a conformal transformation also a general coordinate transformation?
- Infinite dimensional analysis
Related Questions in COMPRESSION
- Getting the compression ratio
- compressing random permutation of N
- Can you help me find a Fourier transform-able approximation function basis for compression?
- compressive sensing and biorthogonal wavelet matrix
- Constraint on number of codes of maximum length in a binary Huffman code.
- Is compressed sensing for digital signals or could also be applied for discrete time signals?
- Does Ramsey theory prove that all sufficiently long random sequences can be slightly compressed?
- Manual Text Compression Algorithm (done by hand)
- How much BPS(Bits per symbol) is enough to call a compression algorithm good, with respect to entropy?
- Compressing the primes using simple addition?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
As was said in comments, cosines and sines differ only by phase shift. The difference in their performance arises from their boundary behavior. On an interval $[0,\ell]$, the sine system $\left\{\sin \frac{2\pi n }{\ell}\right\}$ satisfies the Dirichlet boundary condition, attaining zero value at $0,\ell$.
A generic function, e.g., one describing the brightness of an image, need not take zero values on the boundary (or satisfy any other boundary condition we may be thinking of). Thus, it cannot be uniformly approximate by a linear combination of sines.
On the other hand, the cosine system $\left\{\cos \frac{2\pi n }{\ell}\right\}$ satisfies the Neumann boundary condition, having zero derivative at $0,\ell$. The boundary values are not pinned down as they are for sines. This makes it possible to uniformly approximate (reasonable*) continuous functions by a cosine Fourier series; the fact that we can't uniformly approximate the derivative is not nearly as damaging.
For illustration, here is $e^x$ approximated by sines and by cosines (after the interval shift from $[-1,1]$ to $[0,2]$), with the same number of terms of Fourier series used (taken from my blog):
Sines
Cosines
* It's hard to construct a continuous function for which the cosine Fourier series fails to converge to it uniformly on the interval of approximation. It's safe to say that a "naturally occurring" continuous function won't be such a counterexample.