File: ho_array_hist.c

package info (click to toggle)
hocr 0.10.18-3
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 3,296 kB
  • sloc: ansic: 18,153; sh: 11,473; python: 1,422; makefile: 190; cpp: 19
file content (200 lines) | stat: -rw-r--r-- 3,941 bytes parent folder | download | duplicates (4)
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

/***************************************************************************
 *            ho_array_hist.c
 *
 *  Fri Aug 12 20:13:33 2005
 *  Copyright  2005-2008  Yaacov Zamir
 *  <kzamir@walla.co.il>
 ****************************************************************************/

/*  
 *  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/>.
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>

#ifndef TRUE
#define TRUE -1
#endif
#ifndef FALSE
#define FALSE 0
#endif
#ifndef NULL
#define NULL ((void*)0)
#endif

#include "ho_array_hist.h"

#define square(x) ((x)*(x))

/**
 new ho_array_hist 
 @param size the number of buckets in the histogram
 @return newly allocated ho_array
 */
ho_array_hist *
ho_array_hist_new (const int size)
{
  int x;

  ho_array_hist *hist = NULL;

  /* 
   * allocate memory for histogram 
   */
  hist = (ho_array_hist *) malloc (sizeof (ho_array));
  if (!hist)
  {
    return NULL;
  }

  /* 
   * set header 
   */
  hist->size = size;

  /* 
   * allocate memory for data
   */
  hist->data = malloc (hist->size * sizeof (double));
  if (!(hist->data))
  {
    free (hist);
    return NULL;
  }

  /* init value to 0 */
  for (x = 0; x < hist->size; x++)
  {
    (hist->data)[x] = 0.0;
  }

  return hist;
}

/**
 free an ho_array_hist
 @param hist pointer to an ho_array_hist
 @return FALSE
 */
int
ho_array_hist_free (ho_array_hist * hist)
{
  if (!hist)
    return TRUE;

  if (hist->data)
    free (hist->data);

  free (hist);

  return FALSE;
}

/**
 calculate ho_array_hist from ho_array
 @param hist the histogram to init
 @param ar the ho_array to use
 @return FALSE
 */
unsigned char
ho_array_hist_init (ho_array_hist * hist, const ho_array * ar)
{
  int i, x, y;

  double min, max, range;

  /* get min max values */
  ho_array_minmax (ar, &min, &max);
  range = max - min;

  /* calc accum hist */
  for (x = 0; x < ar->width; x++)
    for (y = 0; y < ar->height; y++)
    {
      i =
        (int) ((hist->size - 1) * ((ar->data)[x + y * ar->width] -
          min) / range);
      ((hist->data)[i])++;
    }

  /* normelize hist */
  for (i = 0; i < hist->size; i++)
    ((hist->data)[i]) /= (double) (ar->width * ar->height);

  return FALSE;
}

/**
 new ho_array_hist 
 @param size the number of buckets in the histogram
 @param ar the ho_array to use
 @return newly allocated ho_array
 */
ho_array_hist *
ho_array_hist_new_from_array (const int size, const ho_array * ar)
{
  ho_array_hist *hist = NULL;

  hist = ho_array_hist_new (size);

  if (!hist)
    return NULL;

  ho_array_hist_init (hist, ar);

  return hist;
}

/**
 get data from a ho_array_hist
 @param hist pointer to a ho_array_hist
 @param i the bucket index
 @return the value of the histogram
 */
double
ho_array_hist_get_at (const ho_array_hist * hist, int i)
{
  return hist->data[i];
}

/**
 new ho_array from ho_array_hist
 @param hist pointer to an ho_array_hist
 @return newly allocated ho_array
 */
ho_array *
ho_array_hist_to_array (const ho_array_hist * hist)
{
  int x, y;

  ho_array *m_out = NULL;

  /* allocate memory */
  m_out = ho_array_new (hist->size, hist->size);
  if (!m_out)
    return NULL;

  /* copy data */
  for (x = 0; x < hist->size; x++)
  {
    y = (int) ((double) hist->size * hist->data[x]);
    ho_array_set (m_out, x, y, 1.0);
  }

  return m_out;
}