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
|
/*************************************************************************
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/>.
*************************************************************************/
/*
* Defininition of the ImageBitMap structure, used to specify
* rectangular memory blocks for image representation.
*
* $Id: imagebitmap.hpp,v 1.7 2014/09/30 08:33:17 thor Exp $
*
*
*/
#ifndef TOOLS_IMAGEBITMAP_HPP
#define TOOLS_IMAGEBITMAP_HPP
/// Includes
#include "interface/types.hpp"
#include "tools/rectangle.hpp"
#include "tools/environment.hpp"
#include "std/stddef.hpp"
///
/// Design
/** Design
******************************************************************
** struct ImageBitmap **
** Super Class: none **
** Sub Classes: none **
** Friends: **
******************************************************************
Defines a rectangular array of memory containing image data.
However, this image bitmap is more flexible than a matrix could
be, even though it supports very similar features.
The first difference is that modulo values are counted in bytes
rather than in elements. This is mainly as convenience for the
client. Furthermore, it does not only provide "vertical"
modulo value (add it to the pixel address to get to the pixel
in the line below), but also a horizontal modulo to be added
to an address to advance by one pixel in horizontal direction.
The idea is here that this allows very easy addressing of
"interleaved" image architectures where red, green and blue
are contained in three (or four, plus alpha channel) continuous
bytes in memory.
A pixel type describes wether the data of a single pixel is
signed, unsigned, byte or word sized. It takes the coefficient
type indicator as in bandnotation.hpp.
Furthermore, user data can be stored here.
Image bitmaps are the destination object of bitmap hooks. They
create and fill out ImageBitMaps by parsing the result tag list
of the user callback function. The image bitmap then enters
the color transformer for further operation.
* */
///
/// ImageBitMap
// The image bitmap is a small helper structure that indicates
// where to access a bitmap in memory, i.e. where to get the data
// from or where to place it.
struct ImageBitMap : public JObject {
ULONG ibm_ulWidth; // width and height of the data
ULONG ibm_ulHeight;
BYTE ibm_cBytesPerPixel; // byte offset to get from one pixel to the next
UBYTE ibm_ucPixelType; // type identifier as in bandnotation.hpp
LONG ibm_lBytesPerRow; // byte offset to get down from one row to the next.
APTR ibm_pData; // pointer to the image data
APTR ibm_pUserData; // an ID the client might use for whatever he likes
public:
// Extract a smaller bitmap from
// a larger one by giving a rectangle.
// This will clip correctly to image bitmap coordinates
// and shift ibm_Data accordingly.
void ExtractBitMap(const struct ImageBitMap *source,const RectAngle<LONG> &rect);
//
// Define a bitmap to describe an image of the given dimension at the given rectangle.
void DefineBitMap(APTR buffer,UBYTE type,const RectAngle<LONG> &rect);
//
// Define a bitmap of the given dimension with the given modulo value.
void DefineBitMap(APTR buffer,UBYTE type,const RectAngle<LONG> &rect,ULONG samplesperrow);
//
// Zero out a bitmap such that it is no longer valid
void Blank(void)
{
ibm_ulWidth = 0;
ibm_ulHeight = 0;
ibm_cBytesPerPixel = 0;
ibm_lBytesPerRow = 0;
ibm_ucPixelType = 0;
ibm_pData = NULL;
}
//
// Return a pointer to the data at a given position.
APTR At(ULONG x,ULONG y) const
{
if (ibm_ucPixelType == 0)
return NULL; // Blank bitmaps keep blank
assert(x < ibm_ulWidth && y < ibm_ulHeight);
//
return (((UBYTE *)(ibm_pData)) + (ptrdiff_t(ibm_cBytesPerPixel) * x) + (ptrdiff_t(ibm_lBytesPerRow) * y));
}
//
// Extract by subsampling data from the given source bitmap with the subsampling
// factors as indicated. The offsets define the position within the subsampled pixel
// and shall be between 0..subsampling-1. Length, and modulo values get adjusted
// accordingly.
// IMPORTANT! The caller must guarantee that the subsampling values are all positive
// and not zero.
void SubsampleFrom(const struct ImageBitMap *source,
UBYTE subx,UBYTE suby,UBYTE offsetx,UBYTE offsety);
//
// Advance the line of the data to the next larger Y position. Deliver false in case this
// is not possible (because we went out of data already).
bool NextLine(void)
{
if (ibm_ulHeight == 0)
return false;
ibm_pData = (((UBYTE *)(ibm_pData)) + ibm_lBytesPerRow);
if (--ibm_ulHeight == 0)
return false;
return true;
}
//
// Initialize the bitmap to have a single object as source or target.
void AsSinglePoint(ULONG width,ULONG height)
{
ibm_ulWidth = width;
ibm_ulHeight = height;
ibm_cBytesPerPixel = 0;
ibm_lBytesPerRow = 0;
}
// Similar, but from a rectangle.
void AsSinglePoint(const RectAngle<LONG> &rect)
{
ibm_ulWidth = rect.WidthOf();
ibm_ulHeight = rect.HeightOf();
ibm_cBytesPerPixel = 0;
ibm_lBytesPerRow = 0;
}
//
// Initialize the bitmap to have a single object as source or target,
// keep the height unaltered.
void AsSinglePoint(ULONG width)
{
ibm_ulWidth = width;
ibm_cBytesPerPixel = 0;
ibm_lBytesPerRow = 0;
}
};
///
///
#endif
|
