[d00f8ff] | 1 | |
---|
[0997158f] | 2 | ##################################################################### |
---|
| 3 | #This software was developed by the University of Tennessee as part of the |
---|
| 4 | #Distributed Data Analysis of Neutron Scattering Experiments (DANSE) |
---|
| 5 | #project funded by the US National Science Foundation. |
---|
| 6 | #See the license text in license.txt |
---|
| 7 | #copyright 2008, University of Tennessee |
---|
| 8 | ###################################################################### |
---|
[d00f8ff] | 9 | import numpy |
---|
[f867cd9] | 10 | import math |
---|
[a7a5886] | 11 | import logging |
---|
| 12 | import sys |
---|
| 13 | import DataLoader.extensions.smearer as smearer |
---|
[f72333f] | 14 | from DataLoader.smearing_2d import Smearer2D |
---|
[d00f8ff] | 15 | |
---|
[f867cd9] | 16 | def smear_selection(data1D, model = None): |
---|
[d00f8ff] | 17 | """ |
---|
[0997158f] | 18 | Creates the right type of smearer according |
---|
| 19 | to the data. |
---|
| 20 | |
---|
| 21 | The canSAS format has a rule that either |
---|
| 22 | slit smearing data OR resolution smearing data |
---|
| 23 | is available. |
---|
[4fe4394] | 24 | |
---|
[0997158f] | 25 | For the present purpose, we choose the one that |
---|
| 26 | has none-zero data. If both slit and resolution |
---|
| 27 | smearing arrays are filled with good data |
---|
| 28 | (which should not happen), then we choose the |
---|
| 29 | resolution smearing data. |
---|
| 30 | |
---|
| 31 | :param data1D: Data1D object |
---|
[f867cd9] | 32 | :param model: sans.model instance |
---|
[d00f8ff] | 33 | """ |
---|
[4fe4394] | 34 | # Sanity check. If we are not dealing with a SANS Data1D |
---|
| 35 | # object, just return None |
---|
[023c8e2] | 36 | if data1D.__class__.__name__ not in ['Data1D', 'Theory1D']: |
---|
[f72333f] | 37 | if data1D == None: |
---|
| 38 | return None |
---|
| 39 | elif data1D.dqx_data == None or data1D.dqy_data == None: |
---|
| 40 | return None |
---|
| 41 | return Smearer2D(data1D) |
---|
[21d2eb0] | 42 | |
---|
[a7a5886] | 43 | if not hasattr(data1D, "dx") and not hasattr(data1D, "dxl")\ |
---|
| 44 | and not hasattr(data1D, "dxw"): |
---|
[4fe4394] | 45 | return None |
---|
| 46 | |
---|
| 47 | # Look for resolution smearing data |
---|
| 48 | _found_resolution = False |
---|
[a7a5886] | 49 | if data1D.dx is not None and len(data1D.dx) == len(data1D.x): |
---|
[4fe4394] | 50 | |
---|
| 51 | # Check that we have non-zero data |
---|
[a7a5886] | 52 | if data1D.dx[0] > 0.0: |
---|
[4fe4394] | 53 | _found_resolution = True |
---|
[c7ac15e] | 54 | #print "_found_resolution",_found_resolution |
---|
| 55 | #print "data1D.dx[0]",data1D.dx[0],data1D.dxl[0] |
---|
[4fe4394] | 56 | # If we found resolution smearing data, return a QSmearer |
---|
| 57 | if _found_resolution == True: |
---|
[f867cd9] | 58 | return QSmearer(data1D, model) |
---|
[4fe4394] | 59 | |
---|
| 60 | # Look for slit smearing data |
---|
| 61 | _found_slit = False |
---|
[a7a5886] | 62 | if data1D.dxl is not None and len(data1D.dxl) == len(data1D.x) \ |
---|
| 63 | and data1D.dxw is not None and len(data1D.dxw) == len(data1D.x): |
---|
[4fe4394] | 64 | |
---|
| 65 | # Check that we have non-zero data |
---|
[a7a5886] | 66 | if data1D.dxl[0] > 0.0 or data1D.dxw[0] > 0.0: |
---|
[4fe4394] | 67 | _found_slit = True |
---|
| 68 | |
---|
| 69 | # Sanity check: all data should be the same as a function of Q |
---|
| 70 | for item in data1D.dxl: |
---|
| 71 | if data1D.dxl[0] != item: |
---|
| 72 | _found_resolution = False |
---|
| 73 | break |
---|
| 74 | |
---|
| 75 | for item in data1D.dxw: |
---|
| 76 | if data1D.dxw[0] != item: |
---|
| 77 | _found_resolution = False |
---|
| 78 | break |
---|
| 79 | # If we found slit smearing data, return a slit smearer |
---|
| 80 | if _found_slit == True: |
---|
| 81 | return SlitSmearer(data1D) |
---|
| 82 | return None |
---|
| 83 | |
---|
[d00f8ff] | 84 | |
---|
| 85 | class _BaseSmearer(object): |
---|
| 86 | |
---|
| 87 | def __init__(self): |
---|
| 88 | self.nbins = 0 |
---|
[f867cd9] | 89 | self.nbins_low = 0 |
---|
| 90 | self.nbins_high = 0 |
---|
[d00f8ff] | 91 | self._weights = None |
---|
[a3f8d58] | 92 | ## Internal flag to keep track of C++ smearer initialization |
---|
| 93 | self._init_complete = False |
---|
| 94 | self._smearer = None |
---|
[f867cd9] | 95 | self.model = None |
---|
[a3f8d58] | 96 | |
---|
| 97 | def __deepcopy__(self, memo={}): |
---|
| 98 | """ |
---|
[0997158f] | 99 | Return a valid copy of self. |
---|
| 100 | Avoid copying the _smearer C object and force a matrix recompute |
---|
| 101 | when the copy is used. |
---|
[a3f8d58] | 102 | """ |
---|
| 103 | result = _BaseSmearer() |
---|
| 104 | result.nbins = self.nbins |
---|
| 105 | return result |
---|
| 106 | |
---|
[a7a5886] | 107 | def _compute_matrix(self): |
---|
| 108 | """ |
---|
| 109 | """ |
---|
| 110 | return NotImplemented |
---|
[d00f8ff] | 111 | |
---|
[5859862] | 112 | def get_bin_range(self, q_min=None, q_max=None): |
---|
| 113 | """ |
---|
[0997158f] | 114 | |
---|
| 115 | :param q_min: minimum q-value to smear |
---|
| 116 | :param q_max: maximum q-value to smear |
---|
| 117 | |
---|
[5859862] | 118 | """ |
---|
[65883cf] | 119 | # If this is the first time we call for smearing, |
---|
| 120 | # initialize the C++ smearer object first |
---|
| 121 | if not self._init_complete: |
---|
| 122 | self._initialize_smearer() |
---|
[5859862] | 123 | if q_min == None: |
---|
| 124 | q_min = self.min |
---|
| 125 | if q_max == None: |
---|
| 126 | q_max = self.max |
---|
[f867cd9] | 127 | |
---|
[a7a5886] | 128 | _qmin_unsmeared, _qmax_unsmeared = self.get_unsmeared_range(q_min, |
---|
| 129 | q_max) |
---|
[5859862] | 130 | _first_bin = None |
---|
| 131 | _last_bin = None |
---|
| 132 | |
---|
[f867cd9] | 133 | #step = (self.max - self.min) / (self.nbins - 1.0) |
---|
| 134 | # Find the first and last bin number in all extrapolated and real data |
---|
[65883cf] | 135 | try: |
---|
| 136 | for i in range(self.nbins): |
---|
| 137 | q_i = smearer.get_q(self._smearer, i) |
---|
| 138 | if (q_i >= _qmin_unsmeared) and (q_i <= _qmax_unsmeared): |
---|
| 139 | # Identify first and last bin |
---|
| 140 | if _first_bin is None: |
---|
| 141 | _first_bin = i |
---|
| 142 | else: |
---|
| 143 | _last_bin = i |
---|
| 144 | except: |
---|
[a7a5886] | 145 | msg = "_BaseSmearer.get_bin_range: " |
---|
| 146 | msg += " error getting range\n %s" % sys.exc_value |
---|
| 147 | raise RuntimeError, msg |
---|
[f867cd9] | 148 | |
---|
| 149 | # Find the first and last bin number only in the real data |
---|
| 150 | _first_bin, _last_bin = self._get_unextrapolated_bin( \ |
---|
| 151 | _first_bin, _last_bin) |
---|
| 152 | |
---|
[5859862] | 153 | return _first_bin, _last_bin |
---|
| 154 | |
---|
[f867cd9] | 155 | def __call__(self, iq_in, first_bin = 0, last_bin = None): |
---|
[d00f8ff] | 156 | """ |
---|
[0997158f] | 157 | Perform smearing |
---|
[d00f8ff] | 158 | """ |
---|
[a3f8d58] | 159 | # If this is the first time we call for smearing, |
---|
| 160 | # initialize the C++ smearer object first |
---|
| 161 | if not self._init_complete: |
---|
| 162 | self._initialize_smearer() |
---|
[f867cd9] | 163 | |
---|
[a7a5886] | 164 | if last_bin is None or last_bin >= len(iq_in): |
---|
| 165 | last_bin = len(iq_in) - 1 |
---|
[a3f8d58] | 166 | # Check that the first bin is positive |
---|
[a7a5886] | 167 | if first_bin < 0: |
---|
[a3f8d58] | 168 | first_bin = 0 |
---|
[d00f8ff] | 169 | |
---|
[f867cd9] | 170 | # With a model given, compute I for the extrapolated points and append |
---|
| 171 | # to the iq_in |
---|
| 172 | #iq_in_temp = iq_in |
---|
| 173 | if self.model != None: |
---|
| 174 | temp_first, temp_last = self._get_extrapolated_bin( \ |
---|
| 175 | first_bin, last_bin) |
---|
| 176 | iq_in_low = self.model.evalDistribution( \ |
---|
| 177 | self.qvalues[0:self.nbins_low]) |
---|
| 178 | iq_in_high = self.model.evalDistribution( \ |
---|
| 179 | self.qvalues[(len(self.qvalues) - \ |
---|
| 180 | self.nbins_high - 1): -1]) |
---|
| 181 | if self.nbins_low > 0: |
---|
| 182 | iq_in_temp = numpy.append(iq_in_low, iq_in) |
---|
| 183 | if self.nbins_high > 0: |
---|
| 184 | iq_in_temp = numpy.append(iq_in_temp, iq_in_high) |
---|
| 185 | else: |
---|
| 186 | temp_first = first_bin |
---|
| 187 | temp_last = last_bin |
---|
| 188 | iq_in_temp = iq_in |
---|
[a3f8d58] | 189 | # Sanity check |
---|
[f867cd9] | 190 | if len(iq_in_temp) != self.nbins: |
---|
[a7a5886] | 191 | msg = "Invalid I(q) vector: inconsistent array " |
---|
[f867cd9] | 192 | msg += " length %d != %s" % (len(iq_in_temp), str(self.nbins)) |
---|
[a7a5886] | 193 | raise RuntimeError, msg |
---|
[f867cd9] | 194 | |
---|
[a3f8d58] | 195 | # Storage for smeared I(q) |
---|
| 196 | iq_out = numpy.zeros(self.nbins) |
---|
[f867cd9] | 197 | |
---|
| 198 | smear_output = smearer.smear(self._smearer, iq_in_temp, iq_out, |
---|
| 199 | #0, self.nbins - 1) |
---|
| 200 | temp_first, temp_last) |
---|
| 201 | #first_bin, last_bin) |
---|
[65883cf] | 202 | if smear_output < 0: |
---|
[a7a5886] | 203 | msg = "_BaseSmearer: could not smear, code = %g" % smear_output |
---|
| 204 | raise RuntimeError, msg |
---|
[f867cd9] | 205 | |
---|
| 206 | |
---|
| 207 | temp_first += self.nbins_low |
---|
| 208 | temp_last = self.nbins - (self.nbins_high + 1) |
---|
| 209 | |
---|
| 210 | return iq_out[temp_first: (temp_last + 1)] |
---|
[d00f8ff] | 211 | |
---|
[a7a5886] | 212 | def _initialize_smearer(self): |
---|
| 213 | """ |
---|
| 214 | """ |
---|
| 215 | return NotImplemented |
---|
| 216 | |
---|
[f867cd9] | 217 | def set_model(self, model): |
---|
| 218 | """ |
---|
| 219 | Set model |
---|
| 220 | """ |
---|
| 221 | if model != None: |
---|
| 222 | self.model = model |
---|
| 223 | |
---|
| 224 | |
---|
| 225 | def _get_unextrapolated_bin(self, first_bin = 0, last_bin = 0): |
---|
| 226 | """ |
---|
| 227 | Get unextrapolated first bin and the last bin |
---|
| 228 | |
---|
| 229 | : param first_bin: extrapolated first_bin |
---|
| 230 | : param last_bin: extrapolated last_bin |
---|
| 231 | |
---|
| 232 | : return fist_bin, last_bin: unextrapolated first and last bin |
---|
| 233 | """ |
---|
| 234 | # For first bin |
---|
| 235 | if first_bin <= self.nbins_low: |
---|
| 236 | first_bin = 0 |
---|
| 237 | else: |
---|
| 238 | first_bin = first_bin - self.nbins_low |
---|
| 239 | # For last bin |
---|
| 240 | if last_bin >= (self.nbins - self.nbins_high): |
---|
| 241 | last_bin = self.nbins - (self.nbins_high + self.nbins_low + 1) |
---|
| 242 | elif last_bin >= self.nbins_low: |
---|
| 243 | last_bin = last_bin - self.nbins_low |
---|
| 244 | else: |
---|
| 245 | last_bin = 0 |
---|
| 246 | return first_bin, last_bin |
---|
| 247 | |
---|
| 248 | def _get_extrapolated_bin(self, first_bin = 0, last_bin = 0): |
---|
| 249 | """ |
---|
| 250 | Get extrapolated first bin and the last bin |
---|
| 251 | |
---|
| 252 | : param first_bin: unextrapolated first_bin |
---|
| 253 | : param last_bin: unextrapolated last_bin |
---|
| 254 | |
---|
| 255 | : return first_bin, last_bin: extrapolated first and last bin |
---|
| 256 | """ |
---|
| 257 | # For the first bin |
---|
| 258 | if first_bin > 0: |
---|
| 259 | # In the case that doesn't need lower q extrapolation data |
---|
| 260 | first_bin += self.nbins_low |
---|
| 261 | else: |
---|
| 262 | # In the case that needs low extrapolation data |
---|
| 263 | first_bin = 0 |
---|
| 264 | # For last bin |
---|
| 265 | if last_bin >= self.nbins - (self.nbins_high + self.nbins_low + 1): |
---|
| 266 | # In the case that needs higher q extrapolation data |
---|
| 267 | last_bin = self.nbins - 1 |
---|
| 268 | else: |
---|
| 269 | # In the case that doesn't need higher q extrapolation data |
---|
| 270 | last_bin += self.nbins_low |
---|
| 271 | |
---|
| 272 | return first_bin, last_bin |
---|
| 273 | |
---|
[d00f8ff] | 274 | class _SlitSmearer(_BaseSmearer): |
---|
| 275 | """ |
---|
[0997158f] | 276 | Slit smearing for I(q) array |
---|
[d00f8ff] | 277 | """ |
---|
| 278 | |
---|
| 279 | def __init__(self, nbins=None, width=None, height=None, min=None, max=None): |
---|
| 280 | """ |
---|
[0997158f] | 281 | Initialization |
---|
[d00f8ff] | 282 | |
---|
[0997158f] | 283 | :param iq: I(q) array [cm-1] |
---|
| 284 | :param width: slit width [A-1] |
---|
| 285 | :param height: slit height [A-1] |
---|
| 286 | :param min: Q_min [A-1] |
---|
| 287 | :param max: Q_max [A-1] |
---|
| 288 | |
---|
[d00f8ff] | 289 | """ |
---|
[a3f8d58] | 290 | _BaseSmearer.__init__(self) |
---|
[d00f8ff] | 291 | ## Slit width in Q units |
---|
| 292 | self.width = width |
---|
| 293 | ## Slit height in Q units |
---|
| 294 | self.height = height |
---|
| 295 | ## Q_min (Min Q-value for I(q)) |
---|
| 296 | self.min = min |
---|
| 297 | ## Q_max (Max Q_value for I(q)) |
---|
| 298 | self.max = max |
---|
| 299 | ## Number of Q bins |
---|
| 300 | self.nbins = nbins |
---|
| 301 | ## Number of points used in the smearing computation |
---|
[4834cba] | 302 | self.npts = 1000 |
---|
[d00f8ff] | 303 | ## Smearing matrix |
---|
| 304 | self._weights = None |
---|
[65883cf] | 305 | self.qvalues = None |
---|
[d00f8ff] | 306 | |
---|
[a3f8d58] | 307 | def _initialize_smearer(self): |
---|
[d00f8ff] | 308 | """ |
---|
[0997158f] | 309 | Initialize the C++ smearer object. |
---|
| 310 | This method HAS to be called before smearing |
---|
[d00f8ff] | 311 | """ |
---|
[a7a5886] | 312 | #self._smearer = smearer.new_slit_smearer(self.width, |
---|
| 313 | # self.height, self.min, self.max, self.nbins) |
---|
| 314 | self._smearer = smearer.new_slit_smearer_with_q(self.width, |
---|
| 315 | self.height, self.qvalues) |
---|
[a3f8d58] | 316 | self._init_complete = True |
---|
[fe2ade9] | 317 | |
---|
[5859862] | 318 | def get_unsmeared_range(self, q_min, q_max): |
---|
| 319 | """ |
---|
[0997158f] | 320 | Determine the range needed in unsmeared-Q to cover |
---|
| 321 | the smeared Q range |
---|
[5859862] | 322 | """ |
---|
| 323 | # Range used for input to smearing |
---|
| 324 | _qmin_unsmeared = q_min |
---|
| 325 | _qmax_unsmeared = q_max |
---|
| 326 | try: |
---|
| 327 | _qmin_unsmeared = self.min |
---|
| 328 | _qmax_unsmeared = self.max |
---|
| 329 | except: |
---|
| 330 | logging.error("_SlitSmearer.get_bin_range: %s" % sys.exc_value) |
---|
| 331 | return _qmin_unsmeared, _qmax_unsmeared |
---|
[d00f8ff] | 332 | |
---|
| 333 | class SlitSmearer(_SlitSmearer): |
---|
| 334 | """ |
---|
[0997158f] | 335 | Adaptor for slit smearing class and SANS data |
---|
[d00f8ff] | 336 | """ |
---|
| 337 | def __init__(self, data1D): |
---|
| 338 | """ |
---|
[0997158f] | 339 | Assumption: equally spaced bins of increasing q-values. |
---|
| 340 | |
---|
| 341 | :param data1D: data used to set the smearing parameters |
---|
[d00f8ff] | 342 | """ |
---|
| 343 | # Initialization from parent class |
---|
| 344 | super(SlitSmearer, self).__init__() |
---|
| 345 | |
---|
| 346 | ## Slit width |
---|
| 347 | self.width = 0 |
---|
[f867cd9] | 348 | self.nbins_low = 0 |
---|
| 349 | self.nbins_high = 0 |
---|
[a7a5886] | 350 | if data1D.dxw is not None and len(data1D.dxw) == len(data1D.x): |
---|
[d00f8ff] | 351 | self.width = data1D.dxw[0] |
---|
| 352 | # Sanity check |
---|
| 353 | for value in data1D.dxw: |
---|
| 354 | if value != self.width: |
---|
[a7a5886] | 355 | msg = "Slit smearing parameters must " |
---|
| 356 | msg += " be the same for all data" |
---|
| 357 | raise RuntimeError, msg |
---|
[d00f8ff] | 358 | ## Slit height |
---|
| 359 | self.height = 0 |
---|
[a7a5886] | 360 | if data1D.dxl is not None and len(data1D.dxl) == len(data1D.x): |
---|
[d00f8ff] | 361 | self.height = data1D.dxl[0] |
---|
| 362 | # Sanity check |
---|
| 363 | for value in data1D.dxl: |
---|
| 364 | if value != self.height: |
---|
[a7a5886] | 365 | msg = "Slit smearing parameters must be" |
---|
| 366 | msg += " the same for all data" |
---|
| 367 | raise RuntimeError, msg |
---|
[d00f8ff] | 368 | |
---|
| 369 | ## Number of Q bins |
---|
| 370 | self.nbins = len(data1D.x) |
---|
| 371 | ## Minimum Q |
---|
[5859862] | 372 | self.min = min(data1D.x) |
---|
[d00f8ff] | 373 | ## Maximum |
---|
[5859862] | 374 | self.max = max(data1D.x) |
---|
| 375 | ## Q-values |
---|
| 376 | self.qvalues = data1D.x |
---|
| 377 | |
---|
[d00f8ff] | 378 | |
---|
| 379 | class _QSmearer(_BaseSmearer): |
---|
| 380 | """ |
---|
[0997158f] | 381 | Perform Gaussian Q smearing |
---|
[d00f8ff] | 382 | """ |
---|
| 383 | |
---|
| 384 | def __init__(self, nbins=None, width=None, min=None, max=None): |
---|
| 385 | """ |
---|
[0997158f] | 386 | Initialization |
---|
| 387 | |
---|
| 388 | :param nbins: number of Q bins |
---|
| 389 | :param width: array standard deviation in Q [A-1] |
---|
| 390 | :param min: Q_min [A-1] |
---|
| 391 | :param max: Q_max [A-1] |
---|
[d00f8ff] | 392 | """ |
---|
[a3f8d58] | 393 | _BaseSmearer.__init__(self) |
---|
[d00f8ff] | 394 | ## Standard deviation in Q [A-1] |
---|
[a7a5886] | 395 | self.width = width |
---|
[d00f8ff] | 396 | ## Q_min (Min Q-value for I(q)) |
---|
[a7a5886] | 397 | self.min = min |
---|
[d00f8ff] | 398 | ## Q_max (Max Q_value for I(q)) |
---|
[a7a5886] | 399 | self.max = max |
---|
[d00f8ff] | 400 | ## Number of Q bins |
---|
[a7a5886] | 401 | self.nbins = nbins |
---|
[d00f8ff] | 402 | ## Smearing matrix |
---|
| 403 | self._weights = None |
---|
[65883cf] | 404 | self.qvalues = None |
---|
[d00f8ff] | 405 | |
---|
[a3f8d58] | 406 | def _initialize_smearer(self): |
---|
[d00f8ff] | 407 | """ |
---|
[0997158f] | 408 | Initialize the C++ smearer object. |
---|
| 409 | This method HAS to be called before smearing |
---|
[d00f8ff] | 410 | """ |
---|
[a7a5886] | 411 | #self._smearer = smearer.new_q_smearer(numpy.asarray(self.width), |
---|
| 412 | # self.min, self.max, self.nbins) |
---|
| 413 | self._smearer = smearer.new_q_smearer_with_q(numpy.asarray(self.width), |
---|
| 414 | self.qvalues) |
---|
[a3f8d58] | 415 | self._init_complete = True |
---|
[d00f8ff] | 416 | |
---|
[5859862] | 417 | def get_unsmeared_range(self, q_min, q_max): |
---|
| 418 | """ |
---|
[0997158f] | 419 | Determine the range needed in unsmeared-Q to cover |
---|
| 420 | the smeared Q range |
---|
| 421 | Take 3 sigmas as the offset between smeared and unsmeared space |
---|
[5859862] | 422 | """ |
---|
| 423 | # Range used for input to smearing |
---|
| 424 | _qmin_unsmeared = q_min |
---|
| 425 | _qmax_unsmeared = q_max |
---|
| 426 | try: |
---|
[a7a5886] | 427 | offset = 3.0 * max(self.width) |
---|
| 428 | _qmin_unsmeared = max([self.min, q_min - offset]) |
---|
| 429 | _qmax_unsmeared = min([self.max, q_max + offset]) |
---|
[5859862] | 430 | except: |
---|
| 431 | logging.error("_QSmearer.get_bin_range: %s" % sys.exc_value) |
---|
| 432 | return _qmin_unsmeared, _qmax_unsmeared |
---|
| 433 | |
---|
[0997158f] | 434 | |
---|
[d00f8ff] | 435 | class QSmearer(_QSmearer): |
---|
| 436 | """ |
---|
[0997158f] | 437 | Adaptor for Gaussian Q smearing class and SANS data |
---|
[d00f8ff] | 438 | """ |
---|
[f867cd9] | 439 | def __init__(self, data1D, model = None): |
---|
[d00f8ff] | 440 | """ |
---|
[0997158f] | 441 | Assumption: equally spaced bins of increasing q-values. |
---|
| 442 | |
---|
| 443 | :param data1D: data used to set the smearing parameters |
---|
[d00f8ff] | 444 | """ |
---|
| 445 | # Initialization from parent class |
---|
| 446 | super(QSmearer, self).__init__() |
---|
[f867cd9] | 447 | data1d_x = [] |
---|
| 448 | self.nbins_low = 0 |
---|
| 449 | self.nbins_high = 0 |
---|
| 450 | self.model = model |
---|
[c0d9981] | 451 | ## Resolution |
---|
[f867cd9] | 452 | #self.width = numpy.zeros(len(data1D.x)) |
---|
[a7a5886] | 453 | if data1D.dx is not None and len(data1D.dx) == len(data1D.x): |
---|
[4fe4394] | 454 | self.width = data1D.dx |
---|
[d00f8ff] | 455 | |
---|
[f867cd9] | 456 | if self.model == None: |
---|
| 457 | data1d_x = data1D.x |
---|
| 458 | else: |
---|
| 459 | self.nbins_low, self.nbins_high, self.width, data1d_x = \ |
---|
| 460 | get_qextrapolate(self.width, data1D.x) |
---|
| 461 | |
---|
[d00f8ff] | 462 | ## Number of Q bins |
---|
[f867cd9] | 463 | self.nbins = len(data1d_x) |
---|
[d00f8ff] | 464 | ## Minimum Q |
---|
[f867cd9] | 465 | self.min = min(data1d_x) |
---|
[d00f8ff] | 466 | ## Maximum |
---|
[f867cd9] | 467 | self.max = max(data1d_x) |
---|
[5859862] | 468 | ## Q-values |
---|
[f867cd9] | 469 | self.qvalues = data1d_x |
---|
[d00f8ff] | 470 | |
---|
[f867cd9] | 471 | |
---|
| 472 | def get_qextrapolate(width, data_x): |
---|
| 473 | """ |
---|
| 474 | Make fake data_x points extrapolated outside of the data_x points |
---|
| 475 | |
---|
| 476 | : param width: array of std of q resolution |
---|
| 477 | : param Data1D.x: Data1D.x array |
---|
| 478 | |
---|
| 479 | : return new_width, data_x_ext: extrapolated width array and x array |
---|
| 480 | |
---|
| 481 | : assumption1: data_x is ordered from lower q to higher q |
---|
| 482 | : assumption2: len(data) = len(width) |
---|
| 483 | : assumption3: the distance between the data points is more compact |
---|
| 484 | than the size of width |
---|
| 485 | : Todo1: Make sure that the assumptions are correct for Data1D |
---|
| 486 | : Todo2: This fixes the edge problem in Qsmearer but still needs to make |
---|
| 487 | smearer interface |
---|
| 488 | """ |
---|
| 489 | # Length of the width |
---|
| 490 | length = len(width) |
---|
| 491 | max_width = max(width) |
---|
| 492 | # Find bin sizes |
---|
| 493 | bin_size_low = math.fabs(data_x[1] - data_x[0]) |
---|
| 494 | bin_size_high = math.fabs(data_x[length -1] - data_x[length -2]) |
---|
| 495 | # Number of q points required below the 1st data point in order to extend |
---|
| 496 | # them 3 times of the width (std) |
---|
| 497 | nbins_low = math.ceil(3 * max_width / bin_size_low) |
---|
| 498 | # Number of q points required above the last data point |
---|
| 499 | nbins_high = math.ceil(3 * max_width / (bin_size_high)) |
---|
| 500 | # Make null q points |
---|
| 501 | extra_low = numpy.zeros(nbins_low) |
---|
| 502 | extra_high = numpy.zeros(nbins_high) |
---|
| 503 | # Give extrapolated values |
---|
| 504 | ind = 0 |
---|
| 505 | qvalue = data_x[0] - bin_size_low |
---|
| 506 | while(ind < nbins_low): |
---|
| 507 | extra_low[nbins_low - (ind + 1)] = qvalue |
---|
| 508 | qvalue -= bin_size_low |
---|
| 509 | ind += 1 |
---|
| 510 | # Remove the points <= 0 |
---|
| 511 | extra_low = extra_low[extra_low > 0] |
---|
| 512 | nbins_low = len(extra_low) |
---|
| 513 | # Reset ind for another extrapolation |
---|
| 514 | ind = 0 |
---|
| 515 | qvalue = data_x[length -1] + bin_size_high |
---|
| 516 | while(ind < nbins_high): |
---|
| 517 | extra_high[ind] = qvalue |
---|
| 518 | qvalue += bin_size_high |
---|
| 519 | ind += 1 |
---|
| 520 | # Make a new qx array |
---|
| 521 | data_x_ext = numpy.append(extra_low, data_x) |
---|
| 522 | data_x_ext = numpy.append(data_x_ext, extra_high) |
---|
| 523 | # Redefine extra_low and high based on corrected nbins |
---|
| 524 | # And note that it is not necessary for extra_width to be a non-zero |
---|
| 525 | extra_low = numpy.zeros(nbins_low) |
---|
| 526 | extra_high = numpy.zeros(nbins_high) |
---|
| 527 | # Make new width array |
---|
| 528 | new_width = numpy.append(extra_low, width) |
---|
| 529 | new_width = numpy.append(new_width, extra_high) |
---|
[d00f8ff] | 530 | |
---|
[f867cd9] | 531 | return nbins_low, nbins_high, new_width, data_x_ext |
---|
| 532 | |
---|
[d00f8ff] | 533 | if __name__ == '__main__': |
---|
[a7a5886] | 534 | x = 0.001 * numpy.arange(1, 11) |
---|
| 535 | y = 12.0 - numpy.arange(1, 11) |
---|
[d00f8ff] | 536 | print x |
---|
| 537 | #for i in range(10): print i, 0.001 + i*0.008/9.0 |
---|
| 538 | #for i in range(100): print i, int(math.floor( (i/ (100/9.0)) )) |
---|
| 539 | s = _SlitSmearer(nbins=10, width=0.0, height=0.005, min=0.001, max=0.010) |
---|
| 540 | #s = _QSmearer(nbins=10, width=0.001, min=0.001, max=0.010) |
---|
| 541 | s._compute_matrix() |
---|
| 542 | |
---|
| 543 | sy = s(y) |
---|
| 544 | print sy |
---|
| 545 | |
---|
| 546 | if True: |
---|
| 547 | for i in range(10): |
---|
[a7a5886] | 548 | print x[i], y[i], sy[i] |
---|
[d00f8ff] | 549 | #print q, ' : ', s.weight(q), s._compute_iq(q) |
---|
| 550 | #print q, ' : ', s(q), s._compute_iq(q) |
---|
| 551 | #s._compute_iq(q) |
---|
| 552 | |
---|
| 553 | |
---|
| 554 | |
---|
| 555 | |
---|