1 /* SPMG/JPEG-LS IMPLEMENTATION V.2.1
2 =====================================
3 These programs are Copyright (c) University of British Columbia. All rights reserved.
4 They may be freely redistributed in their entirety provided that this copyright
5 notice is not removed. THEY MAY NOT BE SOLD FOR PROFIT OR INCORPORATED IN
6 COMMERCIAL PROGRAMS WITHOUT THE WRITTEN PERMISSION OF THE COPYRIGHT HOLDER.
7 Each program is provided as is, without any express or implied warranty,
8 without even the warranty of fitness for a particular purpose.
10 =========================================================
11 THIS SOFTWARE IS BASED ON HP's implementation of jpeg-ls:
12 =========================================================
14 LOCO-I/JPEG-LS IMPLEMENTATION V.0.90
15 -------------------------------------------------------------------------------
16 (c) COPYRIGHT HEWLETT-PACKARD COMPANY, 1995-1999.
17 HEWLETT-PACKARD COMPANY ("HP") DOES NOT WARRANT THE ACCURACY OR
18 COMPLETENESS OF THE INFORMATION GIVEN HERE. ANY USE MADE OF, OR
19 RELIANCE ON, SUCH INFORMATION IS ENTIRELY AT USER'S OWN RISK.
20 BY DOWNLOADING THE LOCO-I/JPEG-LS COMPRESSORS/DECOMPRESSORS
21 ("THE SOFTWARE") YOU AGREE TO BE BOUND BY THE TERMS AND CONDITIONS
22 OF THIS LICENSING AGREEMENT.
23 YOU MAY DOWNLOAD AND USE THE SOFTWARE FOR NON-COMMERCIAL PURPOSES
24 FREE OF CHARGE OR FURTHER OBLIGATION. YOU MAY NOT, DIRECTLY OR
25 INDIRECTLY, DISTRIBUTE THE SOFTWARE FOR A FEE, INCORPORATE THIS
26 SOFTWARE INTO ANY PRODUCT OFFERED FOR SALE, OR USE THE SOFTWARE
27 TO PROVIDE A SERVICE FOR WHICH A FEE IS CHARGED.
28 YOU MAY MAKE COPIES OF THE SOFTWARE AND DISTRIBUTE SUCH COPIES TO
29 OTHER PERSONS PROVIDED THAT SUCH COPIES ARE ACCOMPANIED BY
30 HEWLETT-PACKARD'S COPYRIGHT NOTICE AND THIS AGREEMENT AND THAT
31 SUCH OTHER PERSONS AGREE TO BE BOUND BY THE TERMS OF THIS AGREEMENT.
32 THE SOFTWARE IS NOT OF PRODUCT QUALITY AND MAY HAVE ERRORS OR DEFECTS.
33 THE JPEG-LS STANDARD IS STILL UNDER DEVELOPMENT. THE SOFTWARE IS NOT A
34 FINAL OR FULL IMPLEMENTATION OF THE STANDARD. HP GIVES NO EXPRESS OR
35 IMPLIED WARRANTY OF ANY KIND AND ANY IMPLIED WARRANTIES OF
36 MERCHANTABILITY AND FITNESS FOR PURPOSE ARE DISCLAIMED.
37 HP SHALL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL, INCIDENTAL,
38 OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE.
39 -------------------------------------------------------------------------------
42 /* global.c --- support and portability routines: error handling, safe memory
45 * Initial code by Alex Jakulin, Aug. 1995
47 * Modified and optimized: Gadiel Seroussi, October 1995 - ...
49 * Modified and added Restart marker and input tables by:
50 * David Cheng-Hsiu Chu, and Ismail R. Ismail march 1999
60 This program is Copyright (c) University of British Columbia.\n\
61 All rights reserved. It may be freely redistributed in its\n\
62 entirety provided that this copyright notice is not removed.\n\
63 It may not be sold for profit or incorporated in commercial programs\n\
64 without the written permission of the copyright holder.\n\
71 FILE *c_in[MAX_COMPONENTS];
72 FILE *c_out[MAX_COMPONENTS];
73 FILE *msgfile = NULL; // = stdout;
75 /* Context quantization thresholds - initially unset */
82 int verbose = 1; /* verbosity level */
83 int nopause = 0; /* whether to pause the legal notice or not */
84 int nolegal = 0; /* whether to print the legal notice or not */
87 /* parameters for LOSSY images */
88 int quant, /* quantization = 2*NEAR+1 */
89 beta, /* size of extended alphabet */
90 qbeta, /* size of quantized alphabet */
91 ceil_half_qbeta, /* ceil(qbeta/2) */
93 alpha1eps; /* alpha-1+NEAR */
95 int NEAR = DEF_NEAR; /* loss tolerance per symbol, fixed at 0 for lossless */
96 int bpp, /* bits per sample */
97 qbpp, /* bits per sample for quantized prediction errors */
98 limit, /* limit for unary part of Golomb code */
99 limit_reduce; /* reduction on above for EOR states */
102 /* define color mode strings */
103 char *plane_int_string = "plane by plane",
104 *line_int_string = "line intlv",
105 *pixel_int_string = "sample intlv";
108 /* function to print out error messages */
109 void error(char *msg) {
110 fprintf(stderr, msg);
115 /* function to safely call malloc */
116 void *safealloc(size_t size) {
121 error("\nsafealloc: Out of memory. Aborting...\n");
126 /* function to safely call calloc **/
127 void *safecalloc(size_t numels, size_t size) {
130 temp = calloc(numels, size);
132 error("\nsafecalloc: Out of memory. Aborting...\n");
147 return (double)clock()/CLOCKS_PER_SEC;
151 /* Set thresholds to default unless specified by header: */
152 int set_thresholds(int alfa, int NEAR, int *T1p, int *T2p, int *T3p)
164 lambda = (alfa+127)/256;
166 lambda = (4096+127)/256;
171 /* compute lossless default */
173 T1 = lambda*(BASIC_T1 - 2) + 2;
174 else { /* alphabet < 8 bits */
175 T1 = BASIC_T1/ilambda;
176 if ( T1 < 2 ) T1 = 2;
178 /* adjust for lossy */
181 /* check that the default threshold is in bounds */
182 if ( T1 < NEAR+1 || T1 > (alfa-1) )
183 T1 = NEAR+1; /* eliminates the threshold */
186 /* compute lossless default */
188 T2 = lambda*(BASIC_T2 - 3) + 3;
190 T2 = BASIC_T2/ilambda;
191 if ( T2 < 3 ) T2 = 3;
193 /* adjust for lossy */
196 /* check that the default threshold is in bounds */
197 if ( T2 < T1 || T2 > (alfa-1) )
198 T2 = T1; /* eliminates the threshold */
201 /* compute lossless default */
203 T3 = lambda*(BASIC_T3 - 4) + 4;
205 T3 = BASIC_T3/ilambda;
206 if ( T3 < 4 ) T3 = 4;
208 /* adjust for lossy */
211 /* check that the default threshold is in bounds */
212 if ( T3 < T2 || T3 > (alfa-1) )
213 T3 = T2; /* eliminates the threshold */
225 /* We first check compatibility with JPEG-LS, then with this implementation */
227 void check_compatibility(jpeg_ls_header *head_frame, jpeg_ls_header *head_scan, int n_s)
230 int number_of_scans,i;
233 /* Check implemented color modes */
234 if ((head_scan->color_mode>PIXEL_INT)) {
235 fprintf(stderr,"Color mode %d not supported\n",head_scan->color_mode);
239 if (head_scan->color_mode==PLANE_INT)
240 number_of_scans=head_frame->comp;
245 /* Test standard compatibility */
247 if (head_frame->columns<=0 || head_frame->rows <=0) {
248 fprintf(stderr,"Image size must be positive for this implementation.\n");
252 if (head_frame->alp<4) {
253 fprintf(stderr,"Alphabet size must be >= 4, got %d\n",head_frame->alp);
258 if (head_scan->T1>head_scan->T2 || head_scan->T2>head_scan->T3 ||
259 head_scan->T1<head_scan->NEAR+1 || head_scan->T3>=head_scan->alp ) {
260 fprintf(stderr,"Bad thresholds: must be %d <= Ta <= Tb <= Tc <= %d\n",
261 head_scan->NEAR+1,head_scan->alp-1);
265 if (head_frame->comp>255) {
266 fprintf(stderr,"Too many components (must be less than 255)\n");
270 if (head_scan->NEAR>=head_scan->alp) {
271 fprintf(stderr,"Error for near-lossless must be smaller than alphabet (%d), got %d",head_scan->alp,head_scan->NEAR);
276 if (head_scan->RES < MINRESET || head_scan->RES >= head_scan->alp ) {
277 fprintf(stderr,"Reset parameter must be between %d and %d\n",
278 MINRESET, head_scan->alp-1);
283 maxreset = (head_scan->alp >= 256)? (head_scan->alp-1):255;
285 if (head_scan->RES < MINRESET || head_scan->RES > maxreset ) {
286 fprintf(stderr,"Reset parameter must be between %d and %d\n",
287 MINRESET, head_scan->alp-1);
291 for (i=0;i<head_frame->comp;i++)
292 if (head_frame->comp_ids[i] != (i+1)) {
293 fprintf(stderr,"Components id in frame not compatible with this implementation.\n");
297 if (number_of_scans == 1) {
298 if (head_frame->comp != head_scan->comp) {
299 fprintf(stderr,"In this implementation, when single scan, all components must be in the scan.\n");
302 for (i=0;i<head_frame->comp;i++)
303 if (head_scan->comp_ids[i] != (i+1)) {
304 fprintf(stderr,"Components id in single scan not compatible with this implementation.\n");
310 if (head_scan->comp != 1) {
311 fprintf(stderr,"Only 1 component per scan for plane interleaved mode\n");
314 if (head_scan->comp_ids[0] != (n_s+1)) {
315 fprintf(stderr,"Components id in multiple scan not compatible with this implementation.\n");
323 /* for writing disclaimer to command line in DOS */
325 char *ttyfilename = "CON";
329 void fprint_disclaimer(FILE *fp, int nopause)
335 nopause = nopause | !isatty(fileno(fp));
337 if ( !nopause && (ttyf=fopen(ttyfilename,"r"))==NULL ) {
341 for ( i=1, p0=disclaimer; ; i++ ) {
343 if ( !nopause && i%PAUSE==0 ) {
345 fprintf(stderr, "--- (press RETURN to continue) ---");
349 for ( p1=p0; (*p1 != '\n') && (*p1 != 0); p1++ );
351 fprintf(fp,"%s\n",p0);
354 fprintf(fp,"\n"); fflush(fp);
355 if ( !nopause) fclose(ttyf);