% MagickCore Methods to Reduce the Number of Unique Colors in an Image %
% %
% Software Design %
-% John Cristy %
+% Cristy %
% July 1992 %
% %
% %
-% Copyright 1999-2013 ImageMagick Studio LLC, a non-profit organization %
+% Copyright 1999-2015 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
%
% The algorithm maps this domain onto a tree in which each node
% represents a cube within that domain. In the following discussion
-% these cubes are defined by the coordinate of two opposite vertices:
-% The vertex nearest the origin in RGB space and the vertex farthest from
-% the origin.
+% these cubes are defined by the coordinate of two opposite vertices (vertex
+% nearest the origin in RGB space and the vertex farthest from the origin).
%
% The tree's root node represents the entire domain, (0,0,0) through
% (Cmax,Cmax,Cmax). Each lower level in the tree is generated by
%
% Sr, Sg, Sb: Sums of the red, green, and blue component values for all
% pixels not classified at a lower depth. The combination of these sums
-% and n2 will ultimately characterize the mean color of a set of
+% and n2 will ultimately characterize the mean color of a set of
% pixels represented by this node.
%
% E: the distance squared in RGB space between each pixel contained
Nodes
*node_queue;
+ MemoryInfo
+ *memory_info;
+
ssize_t
*cache;
alpha;
if ((cube_info->associate_alpha == MagickFalse) ||
- (GetPixelAlpha(image,pixel)== OpaqueAlpha))
+ (GetPixelAlpha(image,pixel) == OpaqueAlpha))
{
alpha_pixel->red=(double) GetPixelRed(image,pixel);
alpha_pixel->green=(double) GetPixelGreen(image,pixel);
alpha_pixel->alpha=(double) GetPixelAlpha(image,pixel);
}
-static inline void AssociateAlphaPixelInfo(const Image *image,
- const CubeInfo *cube_info,const PixelInfo *pixel,
- RealPixelInfo *alpha_pixel)
+static inline void AssociateAlphaPixelInfo(const CubeInfo *cube_info,
+ const PixelInfo *pixel,RealPixelInfo *alpha_pixel)
{
double
alpha;
alpha_pixel->alpha=(double) pixel->alpha;
}
-static inline Quantum ClampPixel(const MagickRealType value)
-{
- if (value < 0.0f)
- return(0.0f);
- if (value >= (MagickRealType) QuantumRange)
- return((Quantum) QuantumRange);
-#if !defined(MAGICKCORE_HDRI_SUPPORT)
- return((Quantum) (value+0.5f));
-#else
- return(value);
-#endif
-}
-
static inline size_t ColorToNodeId(const CubeInfo *cube_info,
const RealPixelInfo *pixel,size_t index)
{
return(id);
}
-static MagickBooleanType AssignImageColors(Image *image,CubeInfo *cube_info,
- ExceptionInfo *exception)
+static inline MagickBooleanType PreAssignImageColors(Image *image,
+ CubeInfo *cube_info,ExceptionInfo *exception)
{
-#define AssignImageTag "Assign/Image"
-
- ssize_t
- y;
-
/*
Allocate image colormap.
*/
cube_info->quantize_info->colorspace,exception);
else
if (IssRGBCompatibleColorspace(image->colorspace) == MagickFalse)
- (void) TransformImageColorspace((Image *) image,sRGBColorspace,exception);
+ (void) TransformImageColorspace((Image *) image,sRGBColorspace,
+ exception);
if (AcquireImageColormap(image,cube_info->colors,exception) == MagickFalse)
- ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
- image->filename);
+ return(MagickFalse);
image->colors=0;
cube_info->transparent_pixels=0;
cube_info->transparent_index=(-1);
(void) DefineImageColormap(image,cube_info,cube_info->root);
+ return(MagickTrue);
+}
+
+static inline void PostAssignImageColors(Image *image,CubeInfo *cube_info,
+ ExceptionInfo *exception)
+{
+ if (cube_info->quantize_info->measure_error != MagickFalse)
+ (void) GetImageQuantizeError(image,exception);
+ if ((cube_info->quantize_info->number_colors == 2) &&
+ (cube_info->quantize_info->colorspace == GRAYColorspace))
+ {
+ double
+ intensity;
+
+ register PixelInfo
+ *restrict q;
+
+ register ssize_t
+ i;
+
+ /*
+ Monochrome image.
+ */
+ q=image->colormap;
+ for (i=0; i < (ssize_t) image->colors; i++)
+ {
+ intensity=(double) (GetPixelInfoLuma(q) < (QuantumRange/2.0) ? 0 :
+ QuantumRange);
+ q->red=intensity;
+ q->green=q->red;
+ q->blue=q->red;
+ q++;
+ }
+ }
+}
+
+static MagickBooleanType AssignImageColors(Image *image,CubeInfo *cube_info,
+ ExceptionInfo *exception)
+{
+#define AssignImageTag "Assign/Image"
+
+ ssize_t
+ y;
+
+ if (PreAssignImageColors(image,cube_info,exception) == MagickFalse)
+ ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
+ image->filename);
/*
Create a reduced color image.
*/
- if ((cube_info->quantize_info->dither_method != NoDitherMethod) &&
- (cube_info->quantize_info->dither_method != NoDitherMethod))
+ if (cube_info->quantize_info->dither_method != NoDitherMethod)
(void) DitherImage(image,cube_info,exception);
else
{
Find closest color among siblings and their children.
*/
cube.target=pixel;
- cube.distance=(double) (4.0*(QuantumRange+1.0)*
- (QuantumRange+1.0)+1.0);
+ cube.distance=(double) (4.0*(QuantumRange+1.0)*(QuantumRange+1.0)+
+ 1.0);
ClosestColor(image,&cube,node_info->parent);
index=cube.color_number;
for (i=0; i < (ssize_t) count; i++)
}
image_view=DestroyCacheView(image_view);
}
- if (cube_info->quantize_info->measure_error != MagickFalse)
- (void) GetImageQuantizeError(image,exception);
- if ((cube_info->quantize_info->number_colors == 2) &&
- (cube_info->quantize_info->colorspace == GRAYColorspace))
- {
- double
- intensity;
-
- register PixelInfo
- *restrict q;
-
- register ssize_t
- i;
-
- /*
- Monochrome image.
- */
- q=image->colormap;
- for (i=0; i < (ssize_t) image->colors; i++)
- {
- intensity=(double) ((double) GetPixelInfoIntensity(q) <
- ((double) QuantumRange/2.0) ? 0 : QuantumRange);
- q->red=intensity;
- q->green=intensity;
- q->blue=intensity;
- q++;
- }
- }
+ PostAssignImageColors(image,cube_info,exception);
(void) SyncImage(image,exception);
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
%
% Sr, Sg, Sb : Sums of the red, green, and blue component values for
% all pixels not classified at a lower depth. The combination of
-% these sums and n2 will ultimately characterize the mean color of a
+% these sums and n2 will ultimately characterize the mean color of a
% set of pixels represented by this node.
%
% E: the distance squared in RGB space between each pixel contained
associate_alpha=image->alpha_trait == BlendPixelTrait ? MagickTrue :
MagickFalse;
- if (cube_info->quantize_info->colorspace == TransparentColorspace)
- associate_alpha=MagickFalse;
if ((cube_info->quantize_info->number_colors == 2) &&
(cube_info->quantize_info->colorspace == GRAYColorspace))
associate_alpha=MagickFalse;
node_info=cube_info->root;
for (level=1; level <= MaxTreeDepth; level++)
{
+ double
+ distance;
+
bisect*=0.5;
id=ColorToNodeId(cube_info,&pixel,index);
mid.red+=(id & 1) != 0 ? bisect : -bisect;
*/
node_info->child[id]=GetNodeInfo(cube_info,id,level,node_info);
if (node_info->child[id] == (NodeInfo *) NULL)
- (void) ThrowMagickException(exception,GetMagickModule(),
- ResourceLimitError,"MemoryAllocationFailed","`%s'",
- image->filename);
+ {
+ (void) ThrowMagickException(exception,GetMagickModule(),
+ ResourceLimitError,"MemoryAllocationFailed","`%s'",
+ image->filename);
+ continue;
+ }
if (level == MaxTreeDepth)
cube_info->colors++;
}
error.blue=QuantumScale*(pixel.blue-mid.blue);
if (cube_info->associate_alpha != MagickFalse)
error.alpha=QuantumScale*(pixel.alpha-mid.alpha);
- node_info->quantize_error+=sqrt((double) (count*error.red*error.red+
- count*error.green*error.green+count*error.blue*error.blue+
- count*error.alpha*error.alpha));
+ distance=(double) (error.red*error.red+error.green*error.green+
+ error.blue*error.blue+error.alpha*error.alpha);
+ if (IsNaN(distance) != MagickFalse)
+ distance=0.0;
+ node_info->quantize_error+=count*sqrt(distance);
cube_info->root->quantize_error+=node_info->quantize_error;
index--;
}
Sum RGB for this leaf for later derivation of the mean cube color.
*/
node_info->number_unique+=count;
- node_info->total_color.red+=count*QuantumScale*pixel.red;
- node_info->total_color.green+=count*QuantumScale*pixel.green;
- node_info->total_color.blue+=count*QuantumScale*pixel.blue;
+ node_info->total_color.red+=count*QuantumScale*ClampPixel(pixel.red);
+ node_info->total_color.green+=count*QuantumScale*ClampPixel(pixel.green);
+ node_info->total_color.blue+=count*QuantumScale*ClampPixel(pixel.blue);
if (cube_info->associate_alpha != MagickFalse)
- node_info->total_color.alpha+=count*QuantumScale*pixel.alpha;
+ node_info->total_color.alpha+=count*QuantumScale*ClampPixel(
+ pixel.alpha);
p+=count*GetPixelChannels(image);
}
if (cube_info->colors > cube_info->maximum_colors)
node_info=cube_info->root;
for (level=1; level <= cube_info->depth; level++)
{
+ double
+ distance;
+
bisect*=0.5;
id=ColorToNodeId(cube_info,&pixel,index);
mid.red+=(id & 1) != 0 ? bisect : -bisect;
*/
node_info->child[id]=GetNodeInfo(cube_info,id,level,node_info);
if (node_info->child[id] == (NodeInfo *) NULL)
- (void) ThrowMagickException(exception,GetMagickModule(),
- ResourceLimitError,"MemoryAllocationFailed","%s",
- image->filename);
+ {
+ (void) ThrowMagickException(exception,GetMagickModule(),
+ ResourceLimitError,"MemoryAllocationFailed","%s",
+ image->filename);
+ continue;
+ }
if (level == cube_info->depth)
cube_info->colors++;
}
error.blue=QuantumScale*(pixel.blue-mid.blue);
if (cube_info->associate_alpha != MagickFalse)
error.alpha=QuantumScale*(pixel.alpha-mid.alpha);
- node_info->quantize_error+=sqrt((double) (count*error.red*error.red+
- count*error.green*error.green+count*error.blue*error.blue+
- count*error.alpha*error.alpha));
+ distance=(double) (error.red*error.red+error.green*error.green+
+ error.blue*error.blue+error.alpha*error.alpha);
+ if (IsNaN(distance) != MagickFalse)
+ distance=0.0;
+ node_info->quantize_error+=count*sqrt(distance);
cube_info->root->quantize_error+=node_info->quantize_error;
index--;
}
Sum RGB for this leaf for later derivation of the mean cube color.
*/
node_info->number_unique+=count;
- node_info->total_color.red+=count*QuantumScale*pixel.red;
- node_info->total_color.green+=count*QuantumScale*pixel.green;
- node_info->total_color.blue+=count*QuantumScale*pixel.blue;
+ node_info->total_color.red+=count*QuantumScale*ClampPixel(pixel.red);
+ node_info->total_color.green+=count*QuantumScale*ClampPixel(pixel.green);
+ node_info->total_color.blue+=count*QuantumScale*ClampPixel(pixel.blue);
if (cube_info->associate_alpha != MagickFalse)
- node_info->total_color.alpha+=count*QuantumScale*pixel.alpha;
+ node_info->total_color.alpha+=count*QuantumScale*ClampPixel(
+ pixel.alpha);
p+=count*GetPixelChannels(image);
}
proceed=SetImageProgress(image,ClassifyImageTag,(MagickOffsetType) y,
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace((Image *) image,sRGBColorspace,exception);
- return(MagickTrue);
+ return(y < (ssize_t) image->rows ? MagickFalse : MagickTrue);
}
\f
/*
quantize_info;
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (IsPaletteImage(image,exception) == MagickFalse)
node_info->total_color.red);
q->green=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.green);
- q->blue=(double) ClampToQuantum(alpha*(double) QuantumRange*
+ q->blue=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.blue);
- q->alpha=OpaqueAlpha;
+ q->alpha=(double) OpaqueAlpha;
}
else
{
double
opacity;
- opacity=(double) (alpha*QuantumRange*
- node_info->total_color.alpha);
+ opacity=(double) (alpha*QuantumRange*node_info->total_color.alpha);
q->alpha=(double) ClampToQuantum(opacity);
if (q->alpha == OpaqueAlpha)
{
cube_info->node_queue);
cube_info->node_queue=nodes;
} while (cube_info->node_queue != (Nodes *) NULL);
- if (cube_info->cache != (ssize_t *) NULL)
- cube_info->cache=(ssize_t *) RelinquishMagickMemory(cube_info->cache);
+ if (cube_info->memory_info != (MemoryInfo *) NULL)
+ cube_info->memory_info=RelinquishVirtualMemory(cube_info->memory_info);
cube_info->quantize_info=DestroyQuantizeInfo(cube_info->quantize_info);
cube_info=(CubeInfo *) RelinquishMagickMemory(cube_info);
}
{
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"...");
assert(quantize_info != (QuantizeInfo *) NULL);
- assert(quantize_info->signature == MagickSignature);
- quantize_info->signature=(~MagickSignature);
+ assert(quantize_info->signature == MagickCoreSignature);
+ quantize_info->signature=(~MagickCoreSignature);
quantize_info=(QuantizeInfo *) RelinquishMagickMemory(quantize_info);
return(quantize_info);
}
(void) ResetMagickMemory(pixels,0,number_threads*sizeof(*pixels));
for (i=0; i < (ssize_t) number_threads; i++)
{
- pixels[i]=(RealPixelInfo *) AcquireQuantumMemory(count,
- 2*sizeof(**pixels));
+ pixels[i]=(RealPixelInfo *) AcquireQuantumMemory(count,2*sizeof(**pixels));
if (pixels[i] == (RealPixelInfo *) NULL)
return(DestroyPixelThreadSet(pixels));
}
status=MagickFalse;
continue;
}
- q+=(y & 0x01)*image->columns*GetPixelChannels(image);
cube=(*cube_info);
current=pixels[id]+(y & 0x01)*image->columns;
previous=pixels[id]+((y+1) & 0x01)*image->columns;
ssize_t
u;
- q-=(y & 0x01)*GetPixelChannels(image);
u=(y & 0x01) != 0 ? (ssize_t) image->columns-1-x : x;
- AssociateAlphaPixel(image,&cube,q,&pixel);
+ AssociateAlphaPixel(image,&cube,q+u*GetPixelChannels(image),&pixel);
if (x > 0)
{
pixel.red+=7*current[u-v].red/16;
Find closest color among siblings and their children.
*/
cube.target=pixel;
- cube.distance=(double) (4.0*(QuantumRange+1.0)*(QuantumRange+
- 1.0)+1.0);
+ cube.distance=(double) (4.0*(QuantumRange+1.0)*(QuantumRange+1.0)+
+ 1.0);
ClosestColor(image,&cube,node_info->parent);
cube.cache[i]=(ssize_t) cube.color_number;
}
*/
index=(size_t) cube.cache[i];
if (image->storage_class == PseudoClass)
- SetPixelIndex(image,(Quantum) index,q);
+ SetPixelIndex(image,(Quantum) index,q+u*GetPixelChannels(image));
if (cube.quantize_info->measure_error == MagickFalse)
{
- SetPixelRed(image,ClampToQuantum(image->colormap[index].red),q);
- SetPixelGreen(image,ClampToQuantum(image->colormap[index].green),q);
- SetPixelBlue(image,ClampToQuantum(image->colormap[index].blue),q);
+ SetPixelRed(image,ClampToQuantum(image->colormap[index].red),
+ q+u*GetPixelChannels(image));
+ SetPixelGreen(image,ClampToQuantum(image->colormap[index].green),
+ q+u*GetPixelChannels(image));
+ SetPixelBlue(image,ClampToQuantum(image->colormap[index].blue),
+ q+u*GetPixelChannels(image));
if (cube.associate_alpha != MagickFalse)
- SetPixelAlpha(image,ClampToQuantum(image->colormap[index].alpha),q);
+ SetPixelAlpha(image,ClampToQuantum(image->colormap[index].alpha),
+ q+u*GetPixelChannels(image));
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
/*
Store the error.
*/
- AssociateAlphaPixelInfo(image,&cube,image->colormap+index,&color);
+ AssociateAlphaPixelInfo(&cube,image->colormap+index,&color);
current[u].red=pixel.red-color.red;
current[u].green=pixel.green-color.green;
current[u].blue=pixel.blue-color.blue;
MagickBooleanType
proceed;
-#if defined(MAGICKCORE_OPENMP_SUPPORT)
- #pragma omp critical (MagickCore_FloydSteinbergDither)
-#endif
proceed=SetImageProgress(image,DitherImageTag,(MagickOffsetType) y,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
- q+=((y+1) & 0x01)*GetPixelChannels(image);
}
}
image_view=DestroyCacheView(image_view);
static MagickBooleanType
RiemersmaDither(Image *,CacheView *,CubeInfo *,const unsigned int,
- ExceptionInfo *exception);
+ ExceptionInfo *);
static void Riemersma(Image *image,CacheView *image_view,CubeInfo *cube_info,
const size_t level,const unsigned int direction,ExceptionInfo *exception)
break;
node_info=node_info->child[id];
}
- node_info=node_info->parent;
/*
Find closest color among siblings and their children.
*/
*/
(void) CopyMagickMemory(p->error,p->error+1,(ErrorQueueLength-1)*
sizeof(p->error[0]));
- AssociateAlphaPixelInfo(image,cube_info,image->colormap+index,&color);
+ AssociateAlphaPixelInfo(cube_info,image->colormap+index,&color);
p->error[ErrorQueueLength-1].red=pixel.red-color.red;
p->error[ErrorQueueLength-1].green=pixel.green-color.green;
p->error[ErrorQueueLength-1].blue=pixel.blue-color.blue;
return(MagickTrue);
}
-static inline ssize_t MagickMax(const ssize_t x,const ssize_t y)
-{
- if (x > y)
- return(x);
- return(y);
-}
-
-static inline ssize_t MagickMin(const ssize_t x,const ssize_t y)
-{
- if (x < y)
- return(x);
- return(y);
-}
-
static MagickBooleanType DitherImage(Image *image,CubeInfo *cube_info,
ExceptionInfo *exception)
{
Initialize dither resources.
*/
length=(size_t) (1UL << (4*(8-CacheShift)));
- cube_info->cache=(ssize_t *) AcquireQuantumMemory(length,
- sizeof(*cube_info->cache));
- if (cube_info->cache == (ssize_t *) NULL)
+ cube_info->memory_info=AcquireVirtualMemory(length,sizeof(*cube_info->cache));
+ if (cube_info->memory_info == (MemoryInfo *) NULL)
return((CubeInfo *) NULL);
+ cube_info->cache=(ssize_t *) GetVirtualMemoryBlob(cube_info->memory_info);
/*
Initialize color cache.
*/
- for (i=0; i < (ssize_t) length; i++)
- cube_info->cache[i]=(-1);
+ (void) ResetMagickMemory(cube_info->cache,(-1),sizeof(*cube_info->cache)*
+ length);
/*
Distribute weights along a curve of exponential decay.
*/
y;
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
image->total_colors=GetNumberColors(image,(FILE *) NULL,exception);
break;
for (x=0; x < (ssize_t) image->columns; x++)
{
- index=1UL*GetPixelIndex(image,p);
+ index=GetPixelIndex(image,p);
if (image->alpha_trait == BlendPixelTrait)
{
alpha=(double) (QuantumScale*GetPixelAlpha(image,p));
beta=(double) (QuantumScale*image->colormap[index].alpha);
}
- distance=fabs(alpha*GetPixelRed(image,p)-beta*
- image->colormap[index].red);
+ distance=fabs((double) (alpha*GetPixelRed(image,p)-beta*
+ image->colormap[index].red));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
maximum_error=distance;
- distance=fabs(alpha*GetPixelGreen(image,p)-beta*
- image->colormap[index].green);
+ distance=fabs((double) (alpha*GetPixelGreen(image,p)-beta*
+ image->colormap[index].green));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
maximum_error=distance;
- distance=fabs(alpha*GetPixelBlue(image,p)-beta*
- image->colormap[index].blue);
+ distance=fabs((double) (alpha*GetPixelBlue(image,p)-beta*
+ image->colormap[index].blue));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
quantize_info->dither_method=RiemersmaDitherMethod;
quantize_info->colorspace=UndefinedColorspace;
quantize_info->measure_error=MagickFalse;
- quantize_info->signature=MagickSignature;
+ quantize_info->signature=MagickCoreSignature;
}
\f
/*
%
*/
-static inline ssize_t MagickRound(double x)
+static inline double MagickRound(double x)
{
/*
Round the fraction to nearest integer.
*/
- if (x >= 0.0)
- return((ssize_t) (x+0.5));
- return((ssize_t) (x-0.5));
+ if ((x-floor(x)) < (ceil(x)-x))
+ return(floor(x));
+ return(ceil(x));
}
MagickExport MagickBooleanType PosterizeImage(Image *image,const size_t levels,
y;
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
+ assert(exception != (ExceptionInfo *) NULL);
+ assert(exception->signature == MagickCoreSignature);
if (image->storage_class == PseudoClass)
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
%
*/
+static MagickBooleanType DirectToPseudoClassImage(Image *image,
+ CubeInfo *cube_info,ExceptionInfo *exception)
+{
+ MagickBooleanType
+ status;
+
+ ssize_t
+ y;
+
+ if (cube_info->colors > cube_info->maximum_colors)
+ return(MagickFalse);
+ if (PreAssignImageColors(image,cube_info,exception) == MagickFalse)
+ ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
+ image->filename);
+ status=MagickTrue;
+#if defined(MAGICKCORE_OPENMP_SUPPORT)
+ #pragma omp parallel for schedule(static,4) shared(status) \
+ magick_threads(image,image,image->rows,1)
+#endif
+ for (y=0; y < (ssize_t) image->rows; y++)
+ {
+ register Quantum
+ *restrict q;
+
+ register ssize_t
+ x;
+
+ if (status == MagickFalse)
+ continue;
+ q=GetAuthenticPixels(image,0,y,image->columns,1,exception);
+ if (q == (Quantum *) NULL)
+ {
+ status=MagickFalse;
+ continue;
+ }
+ for (x=0; x < (ssize_t) image->columns; x++)
+ {
+ register ssize_t
+ i;
+
+ for (i=0; i < (ssize_t) image->colors; i++)
+ {
+ if (IsPixelEquivalent(image,q,&image->colormap[i]) == MagickFalse)
+ continue;
+ SetPixelIndex(image,(Quantum) i,q);
+ break;
+ }
+ q+=GetPixelChannels(image);
+ }
+ if (SyncAuthenticPixels(image,exception) == MagickFalse)
+ status=MagickFalse;
+ }
+ image->storage_class=PseudoClass;
+ PostAssignImageColors(image,cube_info,exception);
+ return(status);
+}
+
static MagickBooleanType DirectToColormapImage(Image *image,
ExceptionInfo *exception)
{
maximum_colors;
assert(quantize_info != (const QuantizeInfo *) NULL);
- assert(quantize_info->signature == MagickSignature);
+ assert(quantize_info->signature == MagickCoreSignature);
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
+ assert(exception != (ExceptionInfo *) NULL);
+ assert(exception->signature == MagickCoreSignature);
maximum_colors=quantize_info->number_colors;
if (maximum_colors == 0)
maximum_colors=MaxColormapSize;
{
if ((image->columns*image->rows) <= maximum_colors)
(void) DirectToColormapImage(image,exception);
- if (IsImageGray(image,exception) != MagickFalse)
+ if (SetImageGray(image,exception) != MagickFalse)
(void) SetGrayscaleImage(image,exception);
}
if ((image->storage_class == PseudoClass) &&
(image->colors <= maximum_colors))
- return(MagickTrue);
+ {
+ if ((quantize_info->colorspace != UndefinedColorspace) &&
+ (quantize_info->colorspace != CMYKColorspace))
+ (void) TransformImageColorspace(image,quantize_info->colorspace,
+ exception);
+ return(MagickTrue);
+ }
depth=quantize_info->tree_depth;
if (depth == 0)
{
depth--;
if ((image->alpha_trait == BlendPixelTrait) && (depth > 5))
depth--;
+ if (SetImageGray(image,exception) != MagickFalse)
+ depth=MaxTreeDepth;
}
/*
Initialize color cube.
/*
Reduce the number of colors in the image.
*/
- ReduceImageColors(image,cube_info);
- status=AssignImageColors(image,cube_info,exception);
+ status=DirectToPseudoClassImage(image,cube_info,exception);
+ if (status == MagickFalse)
+ {
+ ReduceImageColors(image,cube_info);
+ status=AssignImageColors(image,cube_info,exception);
+ }
}
DestroyCubeInfo(cube_info);
return(status);
number_images;
assert(quantize_info != (const QuantizeInfo *) NULL);
- assert(quantize_info->signature == MagickSignature);
+ assert(quantize_info->signature == MagickCoreSignature);
assert(images != (Image *) NULL);
- assert(images->signature == MagickSignature);
+ assert(images->signature == MagickCoreSignature);
if (images->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
+ assert(exception != (ExceptionInfo *) NULL);
+ assert(exception->signature == MagickCoreSignature);
if (GetNextImageInList(images) == (Image *) NULL)
{
/*
% %
% %
% %
++ Q u a n t i z e E r r o r F l a t t e n %
+% %
+% %
+% %
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%
+% QuantizeErrorFlatten() traverses the color cube and flattens the quantization
+% error into a sorted 1D array. This accelerates the color reduction process.
+%
+% Contributed by Yoya.
+%
+% The format of the QuantizeErrorFlatten method is:
+%
+% size_t QuantizeErrorFlatten(const Image *image,const CubeInfo *cube_info,
+% const NodeInfo *node_info,const ssize_t offset,
+% double *quantize_error)
+%
+% A description of each parameter follows.
+%
+% o image: the image.
+%
+% o cube_info: A pointer to the Cube structure.
+%
+% o node_info: pointer to node in color cube tree that is current pointer.
+%
+% o offset: quantize error offset.
+%
+% o quantize_error: the quantization error vector.
+%
+*/
+static size_t QuantizeErrorFlatten(const Image *image,const CubeInfo *cube_info,
+ const NodeInfo *node_info,const ssize_t offset,double *quantize_error)
+{
+ register ssize_t
+ i;
+
+ size_t
+ n,
+ number_children;
+
+ if (offset >= (ssize_t) cube_info->nodes)
+ return(0);
+ quantize_error[offset]=node_info->quantize_error;
+ n=1;
+ number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
+ for (i=0; i < (ssize_t) number_children ; i++)
+ if (node_info->child[i] != (NodeInfo *) NULL)
+ n+=QuantizeErrorFlatten(image,cube_info,node_info->child[i],offset+n,
+ quantize_error);
+ return(n);
+}
+\f
+/*
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% %
+% %
+% %
+ R e d u c e %
% %
% %
% o cube_info: A pointer to the Cube structure.
%
*/
+
+static int QuantizeErrorCompare(const void *error_p,const void *error_q)
+{
+ double
+ *p,
+ *q;
+
+ p=(double *) error_p;
+ q=(double *) error_q;
+ if (*p > *q)
+ return(1);
+ if (fabs(*q-*p) <= MagickEpsilon)
+ return(0);
+ return(-1);
+}
+
static void ReduceImageColors(const Image *image,CubeInfo *cube_info)
{
#define ReduceImageTag "Reduce/Image"
span;
cube_info->next_threshold=0.0;
+ if (cube_info->colors > cube_info->maximum_colors)
+ {
+ double
+ *quantize_error;
+
+ /*
+ Enable rapid reduction of the number of unique colors.
+ */
+ quantize_error=(double *) AcquireQuantumMemory(cube_info->nodes,
+ sizeof(*quantize_error));
+ if (quantize_error != (double *) NULL)
+ {
+ (void) QuantizeErrorFlatten(image,cube_info,cube_info->root,0,
+ quantize_error);
+ qsort(quantize_error,cube_info->nodes,sizeof(double),
+ QuantizeErrorCompare);
+ if (cube_info->nodes > (110*(cube_info->maximum_colors+1)/100))
+ cube_info->next_threshold=quantize_error[cube_info->nodes-110*
+ (cube_info->maximum_colors+1)/100];
+ quantize_error=(double *) RelinquishMagickMemory(quantize_error);
+ }
+ }
for (span=cube_info->colors; cube_info->colors > cube_info->maximum_colors; )
{
cube_info->pruning_threshold=cube_info->next_threshold;
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
-% RemapImage() replaces the colors of an image with a dither of the colors
-% provided.
+% RemapImage() replaces the colors of an image with the closest of the colors
+% from the reference image.
%
% The format of the RemapImage method is:
%
Initialize color cube.
*/
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(remap_image != (Image *) NULL);
- assert(remap_image->signature == MagickSignature);
+ assert(remap_image->signature == MagickCoreSignature);
+ assert(exception != (ExceptionInfo *) NULL);
+ assert(exception->signature == MagickCoreSignature);
cube_info=GetCubeInfo(quantize_info,MaxTreeDepth,
quantize_info->number_colors);
if (cube_info == (CubeInfo *) NULL)
status;
assert(images != (Image *) NULL);
- assert(images->signature == MagickSignature);
+ assert(images->signature == MagickCoreSignature);
if (images->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
+ assert(exception != (ExceptionInfo *) NULL);
+ assert(exception->signature == MagickCoreSignature);
image=images;
if (remap_image == (Image *) NULL)
{
%
% The format of the SetGrayscaleImage method is:
%
-% MagickBooleanType SetGrayscaleImage(Image *image,ExceptionInfo *exeption)
+% MagickBooleanType SetGrayscaleImage(Image *image,
+% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
static int IntensityCompare(const void *x,const void *y)
{
+ double
+ intensity;
+
PixelInfo
*color_1,
*color_2;
- ssize_t
- intensity;
-
color_1=(PixelInfo *) x;
color_2=(PixelInfo *) y;
- intensity=(ssize_t) (GetPixelInfoIntensity(color_1)-(ssize_t)
- GetPixelInfoIntensity(color_2));
+ intensity=GetPixelInfoIntensity((const Image *) NULL,color_1)-
+ GetPixelInfoIntensity((const Image *) NULL,color_2);
return((int) intensity);
}
y;
assert(image != (Image *) NULL);
- assert(image->signature == MagickSignature);
+ assert(image->signature == MagickCoreSignature);
if (image->type != GrayscaleType)
(void) TransformImageColorspace(image,GRAYColorspace,exception);
- colormap_index=(ssize_t *) AcquireQuantumMemory(MaxMap+1,
+ colormap_index=(ssize_t *) AcquireQuantumMemory(MaxColormapSize,
sizeof(*colormap_index));
if (colormap_index == (ssize_t *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
if (image->storage_class != PseudoClass)
{
- for (i=0; i <= (ssize_t) MaxMap; i++)
- colormap_index[i]=(-1);
- if (AcquireImageColormap(image,MaxMap+1,exception) == MagickFalse)
+ (void) ResetMagickMemory(colormap_index,(-1),MaxColormapSize*
+ sizeof(*colormap_index));
+ if (AcquireImageColormap(image,MaxColormapSize,exception) == MagickFalse)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
image->colors=0;
image->colormap[i].alpha=(double) i;
qsort((void *) image->colormap,image->colors,sizeof(PixelInfo),
IntensityCompare);
- colormap=(PixelInfo *) AcquireQuantumMemory(image->colors,
- sizeof(*colormap));
+ colormap=(PixelInfo *) AcquireQuantumMemory(image->colors,sizeof(*colormap));
if (colormap == (PixelInfo *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
image_view=DestroyCacheView(image_view);
colormap_index=(ssize_t *) RelinquishMagickMemory(colormap_index);
image->type=GrayscaleType;
- if (IsImageMonochrome(image,exception) != MagickFalse)
+ if (SetImageMonochrome(image,exception) != MagickFalse)
image->type=BilevelType;
return(status);
}
projects / imagemagick / blobdiff