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
|
/*
* image.c
*
* Handle images and image features
*
* Copyright © 2012 Thomas White <taw@physics.org>
*
* This file is part of CrystFEL.
*
* CrystFEL 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.
*
* CrystFEL 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 CrystFEL. If not, see <http://www.gnu.org/licenses/>.
*
*/
#define _ISOC99_SOURCE
#include <stdlib.h>
#include <assert.h>
#include <math.h>
#include <stdio.h>
#include "image.h"
#include "utils.h"
/**
* SECTION:image
* @short_description: Data structure representing an image
* @title: Image
* @section_id:
* @see_also:
* @include: "image.h"
* @Image:
*
* The <structname>image</structname> structure represents an image, usually one
* frame from a large series of diffraction patterns, which might be from the
* same or different crystals.
*/
struct _imagefeaturelist
{
struct imagefeature *features;
int n_features;
};
void image_add_feature(ImageFeatureList *flist, double fs, double ss,
struct image *parent, double intensity, const char *name)
{
if ( flist->features ) {
flist->features = realloc(flist->features,
(flist->n_features+1)
*sizeof(struct imagefeature));
} else {
assert(flist->n_features == 0);
flist->features = malloc(sizeof(struct imagefeature));
}
flist->features[flist->n_features].fs = fs;
flist->features[flist->n_features].ss = ss;
flist->features[flist->n_features].intensity = intensity;
flist->features[flist->n_features].parent = parent;
flist->features[flist->n_features].name = name;
flist->features[flist->n_features].valid = 1;
flist->n_features++;
}
ImageFeatureList *image_feature_list_new()
{
ImageFeatureList *flist;
flist = malloc(sizeof(ImageFeatureList));
flist->n_features = 0;
flist->features = NULL;
return flist;
}
void image_feature_list_free(ImageFeatureList *flist)
{
if ( !flist ) return;
if ( flist->features ) free(flist->features);
free(flist);
}
struct imagefeature *image_feature_closest(ImageFeatureList *flist,
double fs, double ss,
double *d, int *idx)
{
int i;
double dmin = +HUGE_VAL;
int closest = 0;
for ( i=0; i<flist->n_features; i++ ) {
double ds;
ds = distance(flist->features[i].fs, flist->features[i].ss,
fs, ss);
if ( ds < dmin ) {
dmin = ds;
closest = i;
}
}
if ( dmin < +HUGE_VAL ) {
*d = dmin;
*idx = closest;
return &flist->features[closest];
}
*d = +INFINITY;
return NULL;
}
int image_feature_count(ImageFeatureList *flist)
{
if ( flist == NULL ) return 0;
return flist->n_features;
}
struct imagefeature *image_get_feature(ImageFeatureList *flist, int idx)
{
/* Sanity check */
if ( flist == NULL ) return NULL;
if ( idx >= flist->n_features ) return NULL;
if ( flist->features[idx].valid == 0 ) return NULL;
return &flist->features[idx];
}
void image_remove_feature(ImageFeatureList *flist, int idx)
{
flist->features[idx].valid = 0;
}
|
