Additional Information
| Author(s) | Cosma, Ovidiu |
|---|
Optimizing the color space conversion for image compression
Ovidiu Cosma
Abstract
carpathian_2001_17_033_040_abstractFull PDF
carpathian_2001_17_033_040The performance of an image compressio scheme depends on the color space being used. The luminance – chrominance color spaces are widely used, because they enable the speculation of the human eye, color, sensitivity. Some of the exting luminance – chrominance color spaces were developed for analog television , and others for digital applications. This paper presents a method for optimizing the color space transformation, for image compression.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration