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
|
/*************************************************************************
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/>.
*************************************************************************/
/*
**
** This is the abstract description for the predictor of the JPEG
** predictive scan types. They implement, templated by the prediction
** mode, the various lookup types from neighbours.
**
** $Id: predictor.hpp,v 1.3 2017/08/18 11:23:35 thor Exp $
**
*/
#ifndef CODESTREAM_PREDICTOR_HPP
#define CODESTREAM_PREDICTOR_HPP
#if ACCUSOFT_CODE
/// Includes
#include "tools/environment.hpp"
#include "codestream/predictorbase.hpp"
///
/// class Predictor
// This is a templated class that performs the prediction from
// neighbouring samples for the predictive lossless modes.
template<PredictorBase::PredictionMode mode,int preshift>
class Predictor : public PredictorBase {
//
// The neutral grey value, if there is one.
LONG m_lNeutral;
//
public:
Predictor(ULONG neutral = 0)
: m_lNeutral(neutral)
{ }
//
~Predictor(void)
{ }
//
// Predict a sample value depending on the prediction mode.
// lp is the pointer to the current line, pp the one to the previous line.
virtual LONG DecodeSample(LONG v,const LONG *lp,const LONG *pp) const
{
switch(mode) {
case PredictorBase::None:
// This is not a bug, must be signed 16 bit WORD for proper handling of differentials.
return WORD(v) << preshift; // cast to signed, value is used directly.
case PredictorBase::Left: // predict from left
return UWORD(v + (lp[-1] >> preshift)) << preshift;
case PredictorBase::Top: // predict from top
return UWORD(v + (pp[0] >> preshift)) << preshift;
case PredictorBase::LeftTop: // predict from left-top
return UWORD(v + (pp[-1] >> preshift)) << preshift;
case PredictorBase::Linear: // linear interpolation
return UWORD(v + (lp[-1] >> preshift) + (pp[0] >> preshift) - (pp[-1] >> preshift))
<< preshift;
case PredictorBase::WeightA: // linear interpolation with weight on A
return UWORD(v + (lp[-1] >> preshift) + (((pp[0] >> preshift) -
(pp[-1] >> preshift)) >> 1)) << preshift;
case PredictorBase::WeightB: // linear interpolation with weight on B
return UWORD(v + (pp[0] >> preshift) + (((lp[-1] >> preshift) -
(pp[-1] >> preshift)) >> 1)) << preshift;
case PredictorBase::Diagonal: // Only between A and B
return UWORD(v + (((lp[-1] >> preshift) + (pp[0] >> preshift)) >> 1)) << preshift;
case PredictorBase::Neutral:
return UWORD(v + m_lNeutral) << preshift;
}
// Code should not go here.
return m_lNeutral << preshift;
}
//
// Compute a symbol to encode from its value and its prediction based on the
// prediction mode and the previous lines.
virtual LONG EncodeSample(const LONG *lp,const LONG *pp) const
{
switch(mode) {
case PredictorBase::None:
return WORD(lp[0] >> preshift); // cast to signed, value is used directly.
case PredictorBase::Left: // predict from left
return WORD((lp[0] >> preshift) - (lp[-1] >> preshift));
case PredictorBase::Top: // predict from top
return WORD((lp[0] >> preshift) - (pp[0] >> preshift));
case PredictorBase::LeftTop: // predict from left-top
return WORD((lp[0] >> preshift) - (pp[-1] >> preshift));
case PredictorBase::Linear: // linear interpolation
return WORD((lp[0] >> preshift) - (lp[-1] >> preshift) - (pp[0] >> preshift) + (pp[-1] >> preshift));
case PredictorBase::WeightA: // linear interpolation with weight on A
return WORD((lp[0] >> preshift) - (lp[-1] >> preshift) - (((pp[0] >> preshift) -
(pp[-1] >> preshift)) >> 1));
case PredictorBase::WeightB: // linear interpolation with weight on B
return WORD((lp[0] >> preshift) - (pp[0] >> preshift) - (((lp[-1] >> preshift) -
(pp[-1] >> preshift)) >> 1));
case PredictorBase::Diagonal: // Only between A and B
return WORD((lp[0] >> preshift) - (((lp[-1] >> preshift) + (pp[0] >> preshift)) >> 1));
case PredictorBase::Neutral:
return WORD((lp[0] >> preshift) - m_lNeutral);
}
return 0; // Code should not go here.
}
};
///
///
#endif
#endif
|
