1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/*************************************************************************
This project implements a complete(!) JPEG (Recommendation ITU-T
T.81 | ISO/IEC 10918-1) codec, plus a library that can be used to
encode and decode JPEG streams.
It also implements ISO/IEC 18477 aka JPEG XT which is an extension
towards intermediate, high-dynamic-range lossy and lossless coding
of JPEG. In specific, it supports ISO/IEC 18477-3/-6/-7/-8 encoding.
Note that only Profiles C and D of ISO/IEC 18477-7 are supported
here. Check the JPEG XT reference software for a full implementation
of ISO/IEC 18477-7.
Copyright (C) 2012-2018 Thomas Richter, University of Stuttgart and
Accusoft. (C) 2019-2020 Thomas Richter, Fraunhofer IIS.
This program is available under two licenses, GPLv3 and the ITU
Software licence Annex A Option 2, RAND conditions.
For the full text of the GPU license option, see README.license.gpl.
For the full text of the ITU license option, see README.license.itu.
You may freely select between these two options.
For the GPL option, please note the following:
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*************************************************************************/
/*
** A sequential scan, also the first scan of a progressive scan,
** Huffman coded.
**
** $Id: sequentialscan.hpp,v 1.60 2024/11/05 06:39:25 thor Exp $
**
*/
#ifndef CODESTREAM_SEQUENTIALSCAN_HPP
#define CODESTREAM_SEQUENTIALSCAN_HPP
/// Includes
#include "tools/environment.hpp"
#include "marker/scan.hpp"
#include "io/bitstream.hpp"
#include "coding/quantizedrow.hpp"
#include "codestream/entropyparser.hpp"
///
/// Forwards
class HuffmanDecoder;
class HuffmanCoder;
class HuffmanStatistics;
class Tables;
class ByteStream;
class DCT;
class Frame;
struct RectangleRequest;
class BlockBuffer;
class BlockCtrl;
class BufferCtrl;
class LineAdapter;
class BitmapCtrl;
///
/// class SequentialScan
// A sequential scan, also the first scan of a progressive scan,
// Huffman coded.
class SequentialScan : public EntropyParser {
//
// Last DC value, required for the DPCM coder.
LONG m_lDC[4];
//
// Number of blocks still to skip over.
// This is only used in the progressive mode.
UWORD m_usSkip[4];
//
// The bitstream from which we read the data.
BitStream<false> m_Stream;
//
// The block control helper that maintains all the request/release
// logic and the interface to the user.
class BlockCtrl *m_pBlockCtrl;
//
// The DC delta values for the DC optimizer.
LONG m_lDCDelta[4];
//
// The critical R/D slope (aka \lambda) buffered for the DC optimizer.
DOUBLE m_dCritical[4];
//
// Dimensions of the block array.
ULONG m_ulBlockWidth[4];
ULONG m_ulBlockHeight[4];
//
// Pointer to the DC buffers. This keeps the DC values for each
// component to allow later optimization.
LONG *m_plDCBuffer[4];
//
// Scan positions.
ULONG m_ulX[4];
//
// The huffman DC tables
class HuffmanDecoder *m_pDCDecoder[4];
//
// The huffman AC tables
class HuffmanDecoder *m_pACDecoder[4];
//
// Ditto for the encoder
class HuffmanCoder *m_pDCCoder[4];
class HuffmanCoder *m_pACCoder[4];
//
// Ditto for the statistics collection.
class HuffmanStatistics *m_pDCStatistics[4];
class HuffmanStatistics *m_pACStatistics[4];
// Scan parameters.
UBYTE m_ucScanStart;
UBYTE m_ucScanStop;
UBYTE m_ucLowBit;
//
// Measure data or encode?
bool m_bMeasure;
//
// Encode a differential scan?
bool m_bDifferential;
//
// Encode a residual scan?
bool m_bResidual;
//
// Progressive mode?
bool m_bProgressive;
//
// Large range DCT mode?
bool m_bLargeRange;
//
// Baseline mode?
bool m_bBaseline;
//
// Encode a single huffman block
void EncodeBlock(const LONG *block,
class HuffmanCoder *dc,class HuffmanCoder *ac,
LONG &prevdc,UWORD &skip);
//
// Decode a single huffman block.
void DecodeBlock(LONG *block,
class HuffmanDecoder *dc,class HuffmanDecoder *ac,
LONG &prevdc,UWORD &skip);
//
// Flush the remaining bits out to the stream on writing.
virtual void Flush(bool final);
//
// Restart the parser at the next restart interval
virtual void Restart(void);
//
// Make a block statistics measurement on the source data.
void MeasureBlock(const LONG *block,
class HuffmanStatistics *dc,class HuffmanStatistics *ac,
LONG &prevdc,UWORD &skip);
//
// Write the marker that indicates the frame type fitting to this scan.
virtual void WriteFrameType(class ByteStream *io);
//
// Code any run of zero blocks here. This is only valid in
// the progressive mode.
void CodeBlockSkip(class HuffmanCoder *ac,UWORD &skip);
//
public:
// Create a sequential scan. The highbit is always ignored as this is
// a valid setting for progressive only
SequentialScan(class Frame *frame,class Scan *scan,UBYTE start,UBYTE stop,
UBYTE lowbit,UBYTE highbit,
bool differential = false,bool residual = false,
bool largerange = false,bool baseline = false);
//
~SequentialScan(void);
//
// Fill in the tables for decoding and decoding parameters in general.
virtual void StartParseScan(class ByteStream *io,class Checksum *chk,class BufferCtrl *ctrl);
//
// Write the default tables for encoding
virtual void StartWriteScan(class ByteStream *io,class Checksum *chk,class BufferCtrl *ctrl);
//
// Measure scan statistics.
virtual void StartMeasureScan(class BufferCtrl *ctrl);
//
// Start making an optimization run to adjust the coefficients.
virtual void StartOptimizeScan(class BufferCtrl *ctrl);
//
// Start a MCU scan. Returns true if there are more rows. False otherwise.
virtual bool StartMCURow(void);
//
// Parse a single MCU in this scan. Return true if there are more
// MCUs in this row.
virtual bool ParseMCU(void);
//
// Write a single MCU in this scan.
virtual bool WriteMCU(void);
//
// Make an R/D optimization for the given scan by potentially pushing
// coefficients into other bins. This runs an optimization for a single
// block and requires external control to run over the blocks.
// component is the component, critical is the critical slope for
// the R/D optimization of the functional J = \lambda D + R, i.e.
// this is lambda.
// Quant are the quantization parameters, i.e. deltas. These are eventually
// preshifted by "preshift".
// transformed are the dct-transformed but unquantized data. These are also pre-
// shifted by "preshift".
// quantized is the quantized data. These are potentially (and likely) adjusted.
virtual void OptimizeBlock(LONG bx,LONG by,UBYTE component,double critical,
class DCT *dct,
LONG quantized[64]);
//
// Make an R/D optimization of the DC scan. This includes all DC blocks in
// total, not just a single block. This is because the coefficients are not
// coded independently.
virtual void OptimizeDC(void);
};
///
///
#endif
|
