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
|
/*
* image.h
*
* Handle images and image features
*
* (c) 2006-2010 Thomas White <taw@physics.org>
*
* Part of CrystFEL - crystallography with a FEL
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#ifndef IMAGE_H
#define IMAGE_H
#include <stdint.h>
#include <complex.h>
#include <sys/types.h>
#include "utils.h"
#include "cell.h"
#include "detector.h"
#define MAX_CELL_CANDIDATES (32)
/* Structure describing a feature in an image */
struct imagefeature {
struct image *parent;
double x;
double y;
double intensity;
/* Partner for this feature (in another feature list) or NULL */
struct imagefeature_struct *partner;
/* Distance between this feature and its partner, if any. */
double partner_d;
/* Reciprocal space coordinates (m^-1 of course) of this feature */
double rx;
double ry;
double rz;
/* Internal use only */
int valid;
const char *name;
};
/* An opaque type representing a list of image features */
typedef struct _imagefeaturelist ImageFeatureList;
struct reflhit {
signed int h;
signed int k;
signed int l;
double min_distance;
int x;
int y;
};
/* Structure describing an image */
struct image {
float *data;
uint16_t *flags;
double *twotheta;
UnitCell *indexed_cell;
UnitCell *candidate_cells[MAX_CELL_CANDIDATES];
int ncells;
struct detector *det;
const char *filename;
struct reflhit *hits;
int n_hits;
int id; /* ID number of the thread
* handling this image */
/* Information about the crystal */
struct quaternion orientation;
double m; /* Mosaicity in radians */
/* Information about the radiation */
double lambda; /* Wavelength in m */
double div; /* Divergence in radians */
double bw; /* Bandwidth as a fraction */
double f0; /* Incident intensity */
int f0_available; /* 0 if f0 wasn't available
* from the input. */
int width;
int height;
ImageFeatureList *features;
/* DirAx auto-indexing low-level stuff */
int dirax_pty;
pid_t dirax_pid;
char *dirax_rbuffer;
int dirax_rbufpos;
int dirax_rbuflen;
/* DirAx auto-indexing high-level stuff */
int dirax_step;
int dirax_read_cell;
int best_acl;
int best_acl_nh;
int acls_tried[MAX_CELL_CANDIDATES];
int n_acls_tried;
};
/* An opaque type representing a list of images */
typedef struct _imagelist ImageList;
/* Image lists */
extern ImageList *image_list_new(void);
extern int image_add(ImageList *list, struct image *image);
/* Feature lists */
extern ImageFeatureList *image_feature_list_new(void);
extern void image_feature_list_free(ImageFeatureList *flist);
extern void image_add_feature(ImageFeatureList *flist, double x, double y,
struct image *parent, double intensity,
const char *name);
extern void image_remove_feature(ImageFeatureList *flist, int idx);
extern struct imagefeature *image_feature_closest(ImageFeatureList *flist,
double x, double y, double *d,
int *idx);
extern int image_feature_count(ImageFeatureList *flist);
extern struct imagefeature *image_get_feature(ImageFeatureList *flist, int idx);
#endif /* IMAGE_H */
|
