参考ImageMagick读取jpg图片压缩质量

按照jpg编码的质量映射代码反推量化表得到的质量结果似乎不太精确,这里直接参照ImageMagick来实现精确读取jpg图片质量。

#include <stdio.h>
#include <math.h>

#include "jpeglib.h"
#include <setjmp.h>

// 标准亮度分量量化表
static const unsigned int std_luminance_quant_tbl[DCTSIZE2] = {
    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 const unsigned int std_chrominance_quant_tbl[DCTSIZE2] = {
    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};

// 读取JPG文件的质量参数
int ReadJpegInfo(const char *filename)
{
    FILE *infile = fopen(filename, "rb");
    fseek(infile, 0, SEEK_END); // 把文件指针移到文件末尾
    size_t sz = ftell(infile);  // 获取文件指针相对文件首的偏移数
    fseek(infile, 0, SEEK_SET); // 把文件指针移到文件头
    unsigned char *buffer = new unsigned char[sz];
    fread(buffer, 1, sz, infile);
    fclose(infile);
    // 如果不是JPG格式的文件返回-1
    if (buffer == NULL || sz <= 2 || 0xFF != (unsigned char)buffer[0] || 0xD8 != (unsigned char)buffer[1])
    {
        return -1;
    }
    struct jpeg_decompress_struct cinfo;
    struct jpeg_error_mgr jerr;
    cinfo.err = jpeg_std_error(&jerr);
    jpeg_create_decompress(&cinfo);
    jpeg_mem_src(&cinfo, (unsigned char *)buffer, sz);
    jpeg_save_markers(&cinfo, JPEG_APP0 + 2, 0xFFFF);
    jpeg_read_header(&cinfo, TRUE);

    int tmp_quality = 0;
    int linear_quality = 0;
    const int aver_times = 64;
    int times = 0;
    int aver_quality = 0;
    long temp1 = 0;
    long temp2 = 0;

    // get jpeg file info

    long sum = 0;
    int quality = 0;
    struct jpeg_decompress_struct *jpeg_info = &cinfo;
    for (int i = 0; i < NUM_QUANT_TBLS; i++)
    {
        if (jpeg_info->quant_tbl_ptrs[i] != NULL)
            for (int j = 0; j < DCTSIZE2; j++)
                sum += jpeg_info->quant_tbl_ptrs[i]->quantval[j];
    }
    if ((jpeg_info->quant_tbl_ptrs[0] != NULL) &&
        (jpeg_info->quant_tbl_ptrs[1] != NULL))
    {
        ssize_t hash[101] = {
            1020, 1015, 932, 848, 780, 735, 702, 679, 660, 645,
            632, 623, 613, 607, 600, 594, 589, 585, 581, 571,
            555, 542, 529, 514, 494, 474, 457, 439, 424, 410,
            397, 386, 373, 364, 351, 341, 334, 324, 317, 309,
            299, 294, 287, 279, 274, 267, 262, 257, 251, 247,
            243, 237, 232, 227, 222, 217, 213, 207, 202, 198,
            192, 188, 183, 177, 173, 168, 163, 157, 153, 148,
            143, 139, 132, 128, 125, 119, 115, 108, 104, 99,
            94, 90, 84, 79, 74, 70, 64, 59, 55, 49,
            45, 40, 34, 30, 25, 20, 15, 11, 6, 4,
            0};
        ssize_t sums[101] = {
            32640, 32635, 32266, 31495, 30665, 29804, 29146, 28599, 28104,
            27670, 27225, 26725, 26210, 25716, 25240, 24789, 24373, 23946,
            23572, 22846, 21801, 20842, 19949, 19121, 18386, 17651, 16998,
            16349, 15800, 15247, 14783, 14321, 13859, 13535, 13081, 12702,
            12423, 12056, 11779, 11513, 11135, 10955, 10676, 10392, 10208,
            9928, 9747, 9564, 9369, 9193, 9017, 8822, 8639, 8458,
            8270, 8084, 7896, 7710, 7527, 7347, 7156, 6977, 6788,
            6607, 6422, 6236, 6054, 5867, 5684, 5495, 5305, 5128,
            4945, 4751, 4638, 4442, 4248, 4065, 3888, 3698, 3509,
            3326, 3139, 2957, 2775, 2586, 2405, 2216, 2037, 1846,
            1666, 1483, 1297, 1109, 927, 735, 554, 375, 201,
            128, 0};

        long qvalue = (ssize_t)(jpeg_info->quant_tbl_ptrs[0]->quantval[2] +
                                jpeg_info->quant_tbl_ptrs[0]->quantval[53] +
                                jpeg_info->quant_tbl_ptrs[1]->quantval[0] +
                                jpeg_info->quant_tbl_ptrs[1]->quantval[DCTSIZE2 - 1]);
        for (int i = 0; i < 100; i++)
        {
            if ((qvalue < hash[i]) && (sum < sums[i]))
                continue;
            if (((qvalue <= hash[i]) && (sum <= sums[i])) || (i >= 50))
                quality = (size_t)i + 1;
            printf("Quality: %.20g (%s)\n", (double)quality, (qvalue <= hash[i]) && (sum <= sums[i]) ? "exact" : "approximate");
            break;
        }
    }
    else if (jpeg_info->quant_tbl_ptrs[0] != NULL)
    {
        ssize_t hash[101] =
            {
                510, 505, 422, 380, 355, 338, 326, 318, 311, 305,
                300, 297, 293, 291, 288, 286, 284, 283, 281, 280,
                279, 278, 277, 273, 262, 251, 243, 233, 225, 218,
                211, 205, 198, 193, 186, 181, 177, 172, 168, 164,
                158, 156, 152, 148, 145, 142, 139, 136, 133, 131,
                129, 126, 123, 120, 118, 115, 113, 110, 107, 105,
                102, 100, 97, 94, 92, 89, 87, 83, 81, 79,
                76, 74, 70, 68, 66, 63, 61, 57, 55, 52,
                50, 48, 44, 42, 39, 37, 34, 31, 29, 26,
                24, 21, 18, 16, 13, 11, 8, 6, 3, 2,
                0};
        ssize_t sums[101] =
            {
                16320, 16315, 15946, 15277, 14655, 14073, 13623, 13230, 12859,
                12560, 12240, 11861, 11456, 11081, 10714, 10360, 10027, 9679,
                9368, 9056, 8680, 8331, 7995, 7668, 7376, 7084, 6823,
                6562, 6345, 6125, 5939, 5756, 5571, 5421, 5240, 5086,
                4976, 4829, 4719, 4616, 4463, 4393, 4280, 4166, 4092,
                3980, 3909, 3835, 3755, 3688, 3621, 3541, 3467, 3396,
                3323, 3247, 3170, 3096, 3021, 2952, 2874, 2804, 2727,
                2657, 2583, 2509, 2437, 2362, 2290, 2211, 2136, 2068,
                1996, 1915, 1858, 1773, 1692, 1620, 1552, 1477, 1398,
                1326, 1251, 1179, 1109, 1031, 961, 884, 814, 736,
                667, 592, 518, 441, 369, 292, 221, 151, 86,
                64, 0};

        long qvalue = (ssize_t)(jpeg_info->quant_tbl_ptrs[0]->quantval[2] +
                           jpeg_info->quant_tbl_ptrs[0]->quantval[53]);
        for (int i = 0; i < 100; i++)
        {
            if ((qvalue < hash[i]) && (sum < sums[i]))
                continue;
            if (((qvalue <= hash[i]) && (sum <= sums[i])) || (i >= 50))
                quality = (size_t)i + 1;
            printf("Quality: %.20g (%s)\n", (double)quality, (qvalue <= hash[i]) && (sum <= sums[i]) ? "exact" : "approximate");
            break;
        }
    }
    // 量化表反推,取平均值
    // for(int j = 0; j < 1; ++j)
    // {
    //     if (jpeg_info->quant_tbl_ptrs[j] == NULL)
    //     {
    //         continue;
    //     }
    //     for (int i = 0; i < DCTSIZE2; i++){
    //         long quantval = cinfo.quant_tbl_ptrs[j]->quantval[i];
    //         if (quantval < 32767L && quantval >= 0)
    //         {
    //             long linear_quality = ceil((float)(quantval * 100L - 50L) / std_luminance_quant_tbl[i]); // 100L表示long int
                
    //             long tmp_quality = ceil((float)5000 / linear_quality);
    //             if(tmp_quality >= 50)
    //                 tmp_quality = 100 - ceil((float)linear_quality / 2);
    //             aver_quality += tmp_quality;
    //             times++;
    //             if (aver_times == times)
    //             {
    //                 aver_quality = aver_quality / aver_times;
    //                 break;
    //             }
    //         }
    //     }
    // }

    // for (int i = 0; i < DCTSIZE2; i++)
    // {
    //     temp1 = cinfo.quant_tbl_ptrs[0]->quantval[i];
    //     temp2 = cinfo.quant_tbl_ptrs[1]->quantval[i];
    //     if (temp1 < 32767L && temp1 > 0)
    //     {
    //         linear_quality = ceil((float)(temp1 * 100L - 50L) / std_luminance_quant_tbl[i]); // 100L表示long int
    //         int tmp_quality = ceil((float)5000 / linear_quality);
    //         if(tmp_quality >= 50)
    //             tmp_quality = 100 - ceil((float)linear_quality / 2);
    //         // int q1 = 100 - ceil((float)linear_quality / 2);
    //         // if (linear_quality == 1)
    //         //     tmp_quality = 1;
    //         // else if (linear_quality == 100)
    //         //     tmp_quality = 50;
    //         // else if (linear_quality > 100)
    //         //     tmp_quality = ceil((float)5000 / linear_quality);
    //         // else
    //         //     tmp_quality = 100 - ceil((float)linear_quality / 2);
    //         aver_quality += tmp_quality;
    //         times++;
    //         if (aver_times == times)
    //         {
    //             aver_quality = aver_quality / aver_times;
    //             break;
    //         }
    //     }
    // }

    printf("aver_quality[%d]\n", aver_quality);

    jpeg_destroy_decompress(&cinfo);
    return quality;
}
// g++ -o quality read_jpeg.c -ljpeg
// ./quality xxx.jpg
int main(int argc, char **argv)
{
    if (argc != 2)
    {
        printf("parameter number should set to 2\n");
        return -1;
    }
    ReadJpegInfo(argv[1]);
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值