📄 jpeg_ls.c
字号:
/* * JPEG-LS encoder and decoder * Copyright (c) 2003 Michael Niedermayer * Copyright (c) 2006 Konstantin Shishkov * * This file is part of FFmpeg. * * FFmpeg is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * FFmpeg is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with FFmpeg; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */#include "golomb.h"/** * @file jpeg_ls.c * JPEG-LS encoder and decoder. */typedef struct JpeglsContext{ AVCodecContext *avctx; AVFrame picture;}JpeglsContext;typedef struct JLSState{ int T1, T2, T3; int A[367], B[367], C[365], N[367]; int limit, reset, bpp, qbpp, maxval, range; int near, twonear; int run_index[3];}JLSState;static const uint8_t log2_run[32]={ 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 9,10,11,12,13,14,15};/** Uncomment this to significantly speed up decoding of broken JPEG-LS* (or test broken JPEG-LS decoder) and slow down ordinary decoding a bit.** There is no Golomb code with length >= 32 bits possible, so check and* avoid situation of 32 zeros, FFmpeg Golomb decoder is painfully slow* on this errors.*///#define JLS_BROKEN/********** Functions for both encoder and decoder **********//** * Calculate initial JPEG-LS parameters */static void ls_init_state(JLSState *state){ int i; state->twonear = state->near * 2 + 1; state->range = ((state->maxval + state->twonear - 1) / state->twonear) + 1; // QBPP = ceil(log2(RANGE)) for(state->qbpp = 0; (1 << state->qbpp) < state->range; state->qbpp++); if(state->bpp < 8) state->limit = 16 + 2 * state->bpp - state->qbpp; else state->limit = (4 * state->bpp) - state->qbpp; for(i = 0; i < 367; i++) { state->A[i] = FFMAX((state->range + 32) >> 6, 2); state->N[i] = 1; }}/** * Calculate quantized gradient value, used for context determination */static inline int quantize(JLSState *s, int v){ //FIXME optimize if(v==0) return 0; if(v < 0){ if(v <= -s->T3) return -4; if(v <= -s->T2) return -3; if(v <= -s->T1) return -2; if(v < -s->near) return -1; return 0; }else{ if(v <= s->near) return 0; if(v < s->T1) return 1; if(v < s->T2) return 2; if(v < s->T3) return 3; return 4; }}/** * Custom value clipping function used in T1, T2, T3 calculation */static inline int iso_clip(int v, int vmin, int vmax){ if(v > vmax || v < vmin) return vmin; else return v;}/** * Calculate JPEG-LS codec values */static void reset_ls_coding_parameters(JLSState *s, int reset_all){ const int basic_t1= 3; const int basic_t2= 7; const int basic_t3= 21; int factor; if(s->maxval==0 || reset_all) s->maxval= (1 << s->bpp) - 1; if(s->maxval >=128){ factor= (FFMIN(s->maxval, 4095) + 128)>>8; if(s->T1==0 || reset_all) s->T1= iso_clip(factor*(basic_t1-2) + 2 + 3*s->near, s->near+1, s->maxval); if(s->T2==0 || reset_all) s->T2= iso_clip(factor*(basic_t2-3) + 3 + 5*s->near, s->T1, s->maxval); if(s->T3==0 || reset_all) s->T3= iso_clip(factor*(basic_t3-4) + 4 + 7*s->near, s->T2, s->maxval); }else{ factor= 256 / (s->maxval + 1); if(s->T1==0 || reset_all) s->T1= iso_clip(FFMAX(2, basic_t1/factor + 3*s->near), s->near+1, s->maxval); if(s->T2==0 || reset_all) s->T2= iso_clip(FFMAX(3, basic_t2/factor + 5*s->near), s->T1, s->maxval); if(s->T3==0 || reset_all) s->T3= iso_clip(FFMAX(4, basic_t3/factor + 6*s->near), s->T2, s->maxval); } if(s->reset==0 || reset_all) s->reset= 64;// av_log(NULL, AV_LOG_DEBUG, "[JPEG-LS RESET] T=%i,%i,%i\n", s->T1, s->T2, s->T3);}/********** Decoder-specific functions **********//** * Decode LSE block with initialization parameters */static int decode_lse(MJpegDecodeContext *s){ int len, id; /* XXX: verify len field validity */ len = get_bits(&s->gb, 16); id = get_bits(&s->gb, 8); switch(id){ case 1: s->maxval= get_bits(&s->gb, 16); s->t1= get_bits(&s->gb, 16); s->t2= get_bits(&s->gb, 16); s->t3= get_bits(&s->gb, 16); s->reset= get_bits(&s->gb, 16);// reset_ls_coding_parameters(s, 0); //FIXME quant table? break; case 2: case 3: av_log(s->avctx, AV_LOG_ERROR, "palette not supported\n"); return -1; case 4: av_log(s->avctx, AV_LOG_ERROR, "oversize image not supported\n"); return -1; default: av_log(s->avctx, AV_LOG_ERROR, "invalid id %d\n", id); return -1; }// av_log(s->avctx, AV_LOG_DEBUG, "ID=%i, T=%i,%i,%i\n", id, s->t1, s->t2, s->t3); return 0;}static void inline downscale_state(JLSState *state, int Q){ if(state->N[Q] == state->reset){ state->A[Q] >>=1; state->B[Q] >>=1; state->N[Q] >>=1; } state->N[Q]++;}static inline int update_state_regular(JLSState *state, int Q, int err){ state->A[Q] += FFABS(err); err *= state->twonear; state->B[Q] += err; downscale_state(state, Q); if(state->B[Q] <= -state->N[Q]) { state->B[Q]= FFMAX(state->B[Q] + state->N[Q], 1-state->N[Q]); if(state->C[Q] > -128) state->C[Q]--; }else if(state->B[Q] > 0){ state->B[Q]= FFMIN(state->B[Q] - state->N[Q], 0); if(state->C[Q] < 127) state->C[Q]++; } return err;}/** * Get context-dependent Golomb code, decode it and update context */static inline int ls_get_code_regular(GetBitContext *gb, JLSState *state, int Q){ int k, ret; for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);#ifdef JLS_BROKEN if(!show_bits_long(gb, 32))return -1;#endif ret = get_ur_golomb_jpegls(gb, k, state->limit, state->qbpp); /* decode mapped error */ if(ret & 1) ret = -((ret + 1) >> 1); else ret >>= 1; /* for NEAR=0, k=0 and 2*B[Q] <= - N[Q] mapping is reversed */ if(!state->near && !k && (2 * state->B[Q] <= -state->N[Q])) ret = -(ret + 1); ret= update_state_regular(state, Q, ret); return ret;}/** * Get Golomb code, decode it and update state for run termination */static inline int ls_get_code_runterm(GetBitContext *gb, JLSState *state, int RItype, int limit_add){ int k, ret, temp, map; int Q = 365 + RItype; temp= state->A[Q]; if(RItype) temp += state->N[Q] >> 1; for(k = 0; (state->N[Q] << k) < temp; k++);#ifdef JLS_BROKEN if(!show_bits_long(gb, 32))return -1;#endif ret = get_ur_golomb_jpegls(gb, k, state->limit - limit_add - 1, state->qbpp); /* decode mapped error */ map = 0; if(!k && (RItype || ret) && (2 * state->B[Q] < state->N[Q])) map = 1; ret += RItype + map; if(ret & 1){ ret = map - ((ret + 1) >> 1); state->B[Q]++; } else { ret = ret >> 1; } /* update state */ state->A[Q] += FFABS(ret) - RItype; ret *= state->twonear; downscale_state(state, Q); return ret;}#define R(a, i ) (bits == 8 ? ((uint8_t*)(a))[i] : ((uint16_t*)(a))[i] )#define W(a, i, v) (bits == 8 ? (((uint8_t*)(a))[i]=v) : (((uint16_t*)(a))[i]=v))/** * Decode one line of image */static inline void ls_decode_line(JLSState *state, MJpegDecodeContext *s, void *last, void *dst, int last2, int w, int stride, int comp, int bits){ int i, x = 0; int Ra, Rb, Rc, Rd; int D0, D1, D2; while(x < w) { int err, pred; /* compute gradients */ Ra = x ? R(dst, x - stride) : R(last, x); Rb = R(last, x); Rc = x ? R(last, x - stride) : last2; Rd = (x >= w - stride) ? R(last, x) : R(last, x + stride); D0 = Rd - Rb; D1 = Rb - Rc; D2 = Rc - Ra; /* run mode */ if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) { int r; int RItype; /* decode full runs while available */ while(get_bits1(&s->gb)) { int r; r = 1 << log2_run[state->run_index[comp]]; if(x + r * stride > w) { r = (w - x) / stride; } for(i = 0; i < r; i++) { W(dst, x, Ra); x += stride; } /* if EOL reached, we stop decoding */ if(r != (1 << log2_run[state->run_index[comp]])) return; if(state->run_index[comp] < 31) state->run_index[comp]++; if(x + stride > w) return; } /* decode aborted run */ r = log2_run[state->run_index[comp]]; if(r) r = get_bits_long(&s->gb, r); for(i = 0; i < r; i++) { W(dst, x, Ra); x += stride; } /* decode run termination value */ Rb = R(last, x); RItype = (FFABS(Ra - Rb) <= state->near) ? 1 : 0; err = ls_get_code_runterm(&s->gb, state, RItype, log2_run[state->run_index[comp]]); if(state->run_index[comp]) state->run_index[comp]--; if(state->near && RItype){ pred = Ra + err; } else { if(Rb < Ra) pred = Rb - err; else pred = Rb + err; } } else { /* regular mode */ int context, sign; context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2); pred = mid_pred(Ra, Ra + Rb - Rc, Rb); if(context < 0){ context = -context; sign = 1; }else{ sign = 0; } if(sign){ pred = clip(pred - state->C[context], 0, state->maxval); err = -ls_get_code_regular(&s->gb, state, context); } else { pred = clip(pred + state->C[context], 0, state->maxval); err = ls_get_code_regular(&s->gb, state, context); } /* we have to do something more for near-lossless coding */ pred += err; } if(state->near){ if(pred < -state->near) pred += state->range * state->twonear; else if(pred > state->maxval + state->near) pred -= state->range * state->twonear; pred = clip(pred, 0, state->maxval); } pred &= state->maxval; W(dst, x, pred); x += stride; }}static int ls_decode_picture(MJpegDecodeContext *s, int near, int point_transform, int ilv){ int i, t = 0; uint8_t *zero, *last, *cur; JLSState *state; int off = 0, stride = 1, width, shift; zero = av_mallocz(s->picture.linesize[0]); last = zero; cur = s->picture.data[0]; state = av_mallocz(sizeof(JLSState)); /* initialize JPEG-LS state from JPEG parameters */ state->near = near; state->bpp = (s->bits < 2) ? 2 : s->bits; state->maxval = s->maxval; state->T1 = s->t1; state->T2 = s->t2; state->T3 = s->t3; state->reset = s->reset; reset_ls_coding_parameters(state, 0); ls_init_state(state); if(s->bits <= 8) shift = point_transform + (8 - s->bits); else shift = point_transform + (16 - s->bits);// av_log(s->avctx, AV_LOG_DEBUG, "JPEG-LS params: %ix%i NEAR=%i MV=%i T(%i,%i,%i) RESET=%i, LIMIT=%i, qbpp=%i, RANGE=%i\n",s->width,s->height,state->near,state->maxval,state->T1,state->T2,state->T3,state->reset,state->limit,state->qbpp, state->range);// av_log(s->avctx, AV_LOG_DEBUG, "JPEG params: ILV=%i Pt=%i BPP=%i, scan = %i\n", ilv, point_transform, s->bits, s->cur_scan); if(ilv == 0) { /* separate planes */ off = s->cur_scan - 1; stride = (s->nb_components > 1) ? 3 : 1; width = s->width * stride; cur += off; for(i = 0; i < s->height; i++) { if(s->bits <= 8){ ls_decode_line(state, s, last, cur, t, width, stride, off, 8); t = last[0]; }else{
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -