📄 minijpegenc.cpp
字号:
/****************************************************************************
* Author: Dr. Tony Lin *
* Email: lintong@cis.pku.edu.cn *
* Release Date: Dec. 2002 *
* *
* Name: mini JPEG class, rewritten from IJG codes *
* Source: IJG v.6a JPEG LIB *
* Purpose: 1. Readable, so reusable *
* 2. Customized Jpeg format, with smallest overhead *
* 3. Standard c++ types, for easily understood *
* *
* Acknowlegement: Thanks for great IJG, and Chris Losinger *
* *
* Legal Issues: (almost same as IJG with followings) *
* *
* 1. We don't promise that this software works. *
* 2. You can use this software for whatever you want. *
* You don't have to pay. *
* 3. You may not pretend that you wrote this software. If you use it *
* in a program, you must acknowledge somewhere. That is, please *
* metion IJG, and Me, Dr. Tony Lin. *
* *
*****************************************************************************/
////////////////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "MiniJpegEnc.h"
////////////////////////////////////////////////////////////////////////////////
CMiniJpegEncoder::CMiniJpegEncoder( )
{
m_nQuality = 50;
InitEncoder( );
}
CMiniJpegEncoder::CMiniJpegEncoder( int nQuality )
{
m_nQuality = nQuality;
InitEncoder( );
}
CMiniJpegEncoder::~CMiniJpegEncoder( )
{
}
////////////////////////////////////////////////////////////////////////////////
// Prepare for all the tables needed,
// eg. quantization tables, huff tables, color convert tables
// 1 <= nQuality <= 100, is used for quantization scaling
// Computing once, and reuse them again and again !!!!!!!
void CMiniJpegEncoder::InitEncoder( )
{
// prepare color convert table, from bgr to ycbcr
InitColorTable( );
// prepare two quant tables, one for Y, and another for CbCr
InitQuantTable( );
// prepare four huffman tables:
InitHuffmanTable( );
}
////////////////////////////////////////////////////////////////////////////////
// Name: CMiniJpegEncoder::InitColorTable()
// Purpose:
// Save RGB->YCC colorspace conversion for reuse, only computing once
// so dont need multiply in color conversion later
/* Notes:
*
* YCbCr is defined per CCIR 601-1, except that Cb and Cr are
* normalized to the range 0 .. 255 rather than -0.5 .. 0.5.
* The conversion equations to be implemented are therefore
*
* Y = 0.29900 * R + 0.58700 * G + 0.11400 * B
* Cb = -0.16874 * R - 0.33126 * G + 0.50000 * B + 128
* Cr = 0.50000 * R - 0.41869 * G - 0.08131 * B + 128
*
* (These numbers are derived from TIFF 6.0 section 21, dated 3-June-92.)
* To avoid floating-point arithmetic, we represent the fractional constants
* as integers scaled up by 2^16 (about 4 digits precision); we have to divide
* the products by 2^16, with appropriate rounding, to get the correct answer.
*/
void CMiniJpegEncoder::InitColorTable( void )
{
int i;
int nScale = 1L << 16; //equal to power(2,16)
int CBCR_OFFSET = 128<<16;
/*
* nHalf is for (y, cb, cr) rounding, equal to (1L<<16)*0.5
* If (R,G,B)=(0,0,1), then Cb = 128.5, should round to 129
* Using these tables will produce 129 too:
* Cb = (int)((RToCb[0] + GToCb[0] + BToCb[1]) >> 16)
* = (int)(( 0 + 0 + 1L<<15 + 1L<<15 + 128 * 1L<<16 ) >> 16)
* = (int)(( 1L<<16 + 128 * 1L<<16 ) >> 16 )
* = 129
*/
int nHalf = nScale >> 1;
for( i=0; i<256; i++ )
{
m_RToY[ i ] = (int)( 0.29900 * nScale + 0.5 ) * i;
m_GToY[ i ] = (int)( 0.58700 * nScale + 0.5 ) * i;
m_BToY[ i ] = (int)( 0.11400 * nScale + 0.5 ) * i + nHalf;
m_RToCb[ i ] = (int)( 0.16874 * nScale + 0.5 ) * (-i);
m_GToCb[ i ] = (int)( 0.33126 * nScale + 0.5 ) * (-i);
m_BToCb[ i ] = (int)( 0.50000 * nScale + 0.5 ) * i +
CBCR_OFFSET + nHalf - 1;
m_RToCr[ i ] = m_BToCb[ i ];
m_GToCr[ i ] = (int)( 0.41869 * nScale + 0.5 ) * (-i);
m_BToCr[ i ] = (int)( 0.08131 * nScale + 0.5 ) * (-i);
}
}
////////////////////////////////////////////////////////////////////////////////
// InitQuantTable will produce customized quantization table into:
// m_tblYQuant[0..63] and m_tblCbCrQuant[0..63]
void CMiniJpegEncoder::InitQuantTable( void )
{
// These are the sample quantization tables given in JPEG spec section K.1.
// The spec says that the values given produce "good" quality, and
// when divided by 2, "very good" quality.
static unsigned short std_luminance_quant_tbl[64] =
{
16, 11, 10, 16, 24, 40, 51, 61,
12, 12, 14, 19, 26, 58, 60, 55,
14, 13, 16, 24, 40, 57, 69, 56,
14, 17, 22, 29, 51, 87, 80, 62,
18, 22, 37, 56, 68, 109, 103, 77,
24, 35, 55, 64, 81, 104, 113, 92,
49, 64, 78, 87, 103, 121, 120, 101,
72, 92, 95, 98, 112, 100, 103, 99
};
static unsigned short std_chrominance_quant_tbl[64] =
{
17, 18, 24, 47, 99, 99, 99, 99,
18, 21, 26, 66, 99, 99, 99, 99,
24, 26, 56, 99, 99, 99, 99, 99,
47, 66, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99
};
/* For AA&N IDCT method, divisors are equal to quantization
* coefficients scaled by scalefactor[row]*scalefactor[col], where
* scalefactor[0] = 1
* scalefactor[k] = cos(k*PI/16) * sqrt(2) for k=1..7
* We apply a further scale factor of 8.
*/
static unsigned short aanscales[64] = {
/* precomputed values scaled up by 14 bits */
16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270,
21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906,
19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315,
16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552,
8867, 12299, 11585, 10426, 8867, 6967, 4799, 2446,
4520, 6270, 5906, 5315, 4520, 3552, 2446, 1247
};
// Safety checking. Convert 0 to 1 to avoid zero divide.
m_nScale = m_nQuality;
if (m_nScale <= 0)
m_nScale = 1;
if (m_nScale > 100)
m_nScale = 100;
// Non-linear map: 1->5000, 10->500, 25->200, 50->100, 75->50, 100->0
if (m_nScale < 50)
m_nScale = 5000 / m_nScale;
else
m_nScale = 200 - m_nScale*2;
// Scale the Y and CbCr quant table, respectively
ScaleQuantTable( m_qtblY, std_luminance_quant_tbl, aanscales );
ScaleQuantTable( m_qtblCbCr, std_chrominance_quant_tbl, aanscales );
}
////////////////////////////////////////////////////////////////////////////////
void CMiniJpegEncoder::ScaleQuantTable(
unsigned short* tblRst, //result quant table
unsigned short* tblStd, //standard quant table
unsigned short* tblAan //scale factor for AAN dct
)
{
int i, temp, half = 1<<10;
for (i = 0; i < 64; i++)
{
// (1) user scale up
temp = (int)(( m_nScale * tblStd[i] + 50 ) / 100 );
// limit to baseline range
if (temp <= 0)
temp = 1;
if (temp > 255)
temp = 255;
// (2) scaling needed for AA&N algorithm
tblRst[i] = (unsigned short)(( temp * tblAan[i] + half )>>11 );
}
}
////////////////////////////////////////////////////////////////////////////////
// Prepare four Huffman tables:
// HUFFMAN_TABLE m_htblYDC, m_htblYAC, m_htblCbCrDC, m_htblCbCrAC;
void CMiniJpegEncoder::InitHuffmanTable( void )
{
// Y dc component
static unsigned char bitsYDC[17] =
{ 0, 0, 1, 5, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0 };
static unsigned char valYDC[] =
{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
// CbCr dc
static unsigned char bitsCbCrDC[17] =
{ 0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0 };
static unsigned char valCbCrDC[] =
{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
// Y ac component
static unsigned char bitsYAC[17] =
{ 0, 0, 2, 1, 3, 3, 2, 4, 3, 5, 5, 4, 4, 0, 0, 1, 0x7d };
static unsigned char valYAC[] =
{ 0x01, 0x02, 0x03, 0x00, 0x04, 0x11, 0x05, 0x12,
0x21, 0x31, 0x41, 0x06, 0x13, 0x51, 0x61, 0x07,
0x22, 0x71, 0x14, 0x32, 0x81, 0x91, 0xa1, 0x08,
0x23, 0x42, 0xb1, 0xc1, 0x15, 0x52, 0xd1, 0xf0,
0x24, 0x33, 0x62, 0x72, 0x82, 0x09, 0x0a, 0x16,
0x17, 0x18, 0x19, 0x1a, 0x25, 0x26, 0x27, 0x28,
0x29, 0x2a, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39,
0x3a, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49,
0x4a, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58, 0x59,
0x5a, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69,
0x6a, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78, 0x79,
0x7a, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89,
0x8a, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98,
0x99, 0x9a, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7,
0xa8, 0xa9, 0xaa, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6,
0xb7, 0xb8, 0xb9, 0xba, 0xc2, 0xc3, 0xc4, 0xc5,
0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xd2, 0xd3, 0xd4,
0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xe1, 0xe2,
0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9, 0xea,
0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8,
0xf9, 0xfa };
// CbCr ac
static unsigned char bitsCbCrAC[17] =
{ 0, 0, 2, 1, 2, 4, 4, 3, 4, 7, 5, 4, 4, 0, 1, 2, 0x77 };
static unsigned char valCbCrAC[] =
{ 0x00, 0x01, 0x02, 0x03, 0x11, 0x04, 0x05, 0x21,
0x31, 0x06, 0x12, 0x41, 0x51, 0x07, 0x61, 0x71,
0x13, 0x22, 0x32, 0x81, 0x08, 0x14, 0x42, 0x91,
0xa1, 0xb1, 0xc1, 0x09, 0x23, 0x33, 0x52, 0xf0,
0x15, 0x62, 0x72, 0xd1, 0x0a, 0x16, 0x24, 0x34,
0xe1, 0x25, 0xf1, 0x17, 0x18, 0x19, 0x1a, 0x26,
0x27, 0x28, 0x29, 0x2a, 0x35, 0x36, 0x37, 0x38,
0x39, 0x3a, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48,
0x49, 0x4a, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58,
0x59, 0x5a, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68,
0x69, 0x6a, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
0x79, 0x7a, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
0x88, 0x89, 0x8a, 0x92, 0x93, 0x94, 0x95, 0x96,
0x97, 0x98, 0x99, 0x9a, 0xa2, 0xa3, 0xa4, 0xa5,
0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xb2, 0xb3, 0xb4,
0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba, 0xc2, 0xc3,
0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xd2,
0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda,
0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9,
0xea, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8,
0xf9, 0xfa };
// Compute four derived Huffman tables
ComputeHuffmanTable( bitsYDC, valYDC, &m_htblYDC );
ComputeHuffmanTable( bitsYAC, valYAC, &m_htblYAC );
ComputeHuffmanTable( bitsCbCrDC, valCbCrDC, &m_htblCbCrDC );
ComputeHuffmanTable( bitsCbCrAC, valCbCrAC, &m_htblCbCrAC );
}
////////////////////////////////////////////////////////////////////////////////
// Compute the derived values for a Huffman table.
/*
* typedef struct {
* unsigned int code[256]; // code for each symbol
* char size[256]; // length of code for each symbol
* // If no code has been allocated for a symbol S, ehufsi[S] contains 0
* } HUFFMAN_TABLE;
*
* HUFFMAN_TABLE m_htblYDC, m_htblYAC, m_htblCbCrDC, m_htblCbCrAC;
*/
void CMiniJpegEncoder::ComputeHuffmanTable(
unsigned char * pBits,
unsigned char * pVal,
HUFFMAN_TABLE * pTbl )
{
int p, i, l, lastp, si;
char huffsize[257];
unsigned int huffcode[257];
unsigned int code;
/* Figure C.1: make table of Huffman code length for each symbol */
/* Note that this is in code-length order. */
p = 0;
for (l = 1; l <= 16; l++) {
for (i = 1; i <= (int) pBits[l]; i++)
huffsize[p++] = (char) l;
}
huffsize[p] = 0;
lastp = p;
/* Figure C.2: generate the codes themselves */
/* Note that this is in code-length order. */
code = 0;
si = huffsize[0];
p = 0;
while (huffsize[p]) {
while (((int) huffsize[p]) == si) {
huffcode[p++] = code;
code++;
}
code <<= 1;
si++;
}
/* Figure C.3: generate encoding tables */
/* These are code and size indexed by symbol value */
/* Set any codeless symbols to have code length 0;
* this allows EmitBits to detect any attempt to emit such symbols.
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -