utils/sofa-info.cpp

   1 /*
   2  * SOFA info utility for inspecting SOFA file metrics and determining HRTF
   3  * utility compatible layouts.
   4  *
   5  * Copyright (C) 2018-2019  Christopher Fitzgerald
   6  *
   7  * This program is free software; you can redistribute it and/or modify
   8  * it under the terms of the GNU General Public License as published by
   9  * the Free Software Foundation; either version 2 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * This program is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License along
  18  * with this program; if not, write to the Free Software Foundation, Inc.,
  19  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Or visit:  http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
  22  */
  23
  24 #include <stdio.h>
  25
  26 #include <array>
  27 #include <cmath>
  28 #include <memory>
  29 #include <vector>
  30
  31 #include <mysofa.h>
  32
  33 #include "win_main_utf8.h"
  34
  35
  36 using uint = unsigned int;
  37 using double3 = std::array<double,3>;
  38
  39 struct MySofaDeleter {
  40     void operator()(MYSOFA_HRTF *sofa) { mysofa_free(sofa); }
  41 };
  42 using MySofaHrtfPtr = std::unique_ptr<MYSOFA_HRTF,MySofaDeleter>;
  43
  44 // Per-field measurement info.
  45 struct HrirFdT {
  46     double mDistance{0.0};
  47     uint mEvCount{0u};
  48     uint mEvStart{0u};
  49     std::vector<uint> mAzCounts;
  50 };
  51
  52 static const char *SofaErrorStr(int err)
  53 {
  54     switch(err)
  55     {
  56     case MYSOFA_OK: return "OK";
  57     case MYSOFA_INVALID_FORMAT: return "Invalid format";
  58     case MYSOFA_UNSUPPORTED_FORMAT: return "Unsupported format";
  59     case MYSOFA_INTERNAL_ERROR: return "Internal error";
  60     case MYSOFA_NO_MEMORY: return "Out of memory";
  61     case MYSOFA_READ_ERROR: return "Read error";
  62     }
  63     return "Unknown";
  64 }
  65
  66 static void PrintSofaAttributes(const char *prefix, struct MYSOFA_ATTRIBUTE *attribute)
  67 {
  68     while(attribute)
  69     {
  70         fprintf(stdout, "%s.%s: %s\n", prefix, attribute->name, attribute->value);
  71         attribute = attribute->next;
  72     }
  73 }
  74
  75 static void PrintSofaArray(const char *prefix, struct MYSOFA_ARRAY *array)
  76 {
  77     PrintSofaAttributes(prefix, array->attributes);
  78
  79     for(uint i{0u};i < array->elements;i++)
  80         fprintf(stdout, "%s[%u]: %.6f\n", prefix, i, array->values[i]);
  81 }
  82
  83 /* Produces a sorted array of unique elements from a particular axis of the
  84  * triplets array.  The filters are used to focus on particular coordinates
  85  * of other axes as necessary.  The epsilons are used to constrain the
  86  * equality of unique elements.
  87  */
  88 static uint GetUniquelySortedElems(const uint m, const double3 *aers, const uint axis,
  89     const double *const (&filters)[3], const double (&epsilons)[3], double *elems)
  90 {
  91     uint count{0u};
  92     for(uint i{0u};i < m;++i)
  93     {
  94         const double elem{aers[i][axis]};
  95
  96         uint j;
  97         for(j = 0;j < 3;j++)
  98         {
  99             if(filters[j] && std::fabs(aers[i][j] - *filters[j]) > epsilons[j])
 100                 break;
 101         }
 102         if(j < 3)
 103             continue;
 104
 105         for(j = 0;j < count;j++)
 106         {
 107             const double delta{elem - elems[j]};
 108
 109             if(delta > epsilons[axis])
 110                 continue;
 111
 112             if(delta >= -epsilons[axis])
 113                 break;
 114
 115             for(uint k{count};k > j;k--)
 116                 elems[k] = elems[k - 1];
 117
 118             elems[j] = elem;
 119             count++;
 120             break;
 121         }
 122
 123         if(j >= count)
 124             elems[count++] = elem;
 125     }
 126
 127     return count;
 128 }
 129
 130 /* Given a list of elements, this will produce the smallest step size that
 131  * can uniformly cover a fair portion of the list.  Ideally this will be over
 132  * half, but in degenerate cases this can fall to a minimum of 5 (the lower
 133  * limit on elevations necessary to build a layout).
 134  */
 135 static double GetUniformStepSize(const double epsilon, const uint m, const double *elems)
 136 {
 137     auto steps = std::vector<double>(m, 0.0);
 138     auto counts = std::vector<uint>(m, 0u);
 139     uint count{0u};
 140
 141     for(uint stride{1u};stride < m/2;stride++)
 142     {
 143         for(uint i{0u};i < m-stride;i++)
 144         {
 145             const double step{elems[i + stride] - elems[i]};
 146
 147             uint j;
 148             for(j = 0;j < count;j++)
 149             {
 150                 if(std::fabs(step - steps[j]) < epsilon)
 151                 {
 152                     counts[j]++;
 153                     break;
 154                 }
 155             }
 156
 157             if(j >= count)
 158             {
 159                 steps[j] = step;
 160                 counts[j] = 1;
 161                 count++;
 162             }
 163         }
 164
 165         for(uint i{1u};i < count;i++)
 166         {
 167             if(counts[i] > counts[0])
 168             {
 169                 steps[0] = steps[i];
 170                 counts[0] = counts[i];
 171             }
 172         }
 173
 174         count = 1;
 175
 176         if(counts[0] > m/2)
 177             break;
 178     }
 179
 180     if(counts[0] > 255)
 181     {
 182         uint i{2u};
 183         while(counts[0]/i > 255 && (counts[0]%i) != 0)
 184             ++i;
 185         counts[0] /= i;
 186         steps[0] *= i;
 187     }
 188     if(counts[0] > 5)
 189         return steps[0];
 190     return 0.0;
 191 }
 192
 193 /* Attempts to produce a compatible layout.  Most data sets tend to be
 194  * uniform and have the same major axis as used by OpenAL Soft's HRTF model.
 195  * This will remove outliers and produce a maximally dense layout when
 196  * possible.  Those sets that contain purely random measurements or use
 197  * different major axes will fail.
 198  */
 199 static void PrintCompatibleLayout(const uint m, const float *xyzs)
 200 {
 201     auto aers = std::vector<double3>(m, double3{});
 202     auto elems = std::vector<double>(m, {});
 203
 204     fprintf(stdout, "\n");
 205
 206     for(uint i{0u};i < m;++i)
 207     {
 208         float aer[3]{xyzs[i*3], xyzs[i*3 + 1], xyzs[i*3 + 2]};
 209         mysofa_c2s(&aer[0]);
 210         aers[i][0] = aer[0];
 211         aers[i][1] = aer[1];
 212         aers[i][2] = aer[2];
 213     }
 214
 215     uint fdCount{GetUniquelySortedElems(m, aers.data(), 2, { nullptr, nullptr, nullptr },
 216         { 0.1, 0.1, 0.001 }, elems.data())};
 217     if(fdCount > (m / 3))
 218     {
 219         fprintf(stdout, "Incompatible layout (inumerable radii).\n");
 220         return;
 221     }
 222
 223     std::vector<HrirFdT> fds(fdCount);
 224     for(uint fi{0u};fi < fdCount;fi++)
 225         fds[fi].mDistance = elems[fi];
 226
 227     for(uint fi{0u};fi < fdCount;fi++)
 228     {
 229         const double dist{fds[fi].mDistance};
 230         uint evCount{GetUniquelySortedElems(m, aers.data(), 1, { nullptr, nullptr, &dist },
 231             { 0.1, 0.1, 0.001 }, elems.data())};
 232
 233         if(evCount > (m / 3))
 234         {
 235             fprintf(stdout, "Incompatible layout (innumerable elevations).\n");
 236             return;
 237         }
 238
 239         double step{GetUniformStepSize(0.1, evCount, elems.data())};
 240         if(step <= 0.0)
 241         {
 242             fprintf(stdout, "Incompatible layout (non-uniform elevations).\n");
 243             return;
 244         }
 245
 246         uint evStart{0u};
 247         for(uint ei{0u};ei < evCount;ei++)
 248         {
 249             double ev{90.0 + elems[ei]};
 250             double eif{std::round(ev / step)};
 251             const uint ev_start{static_cast<uint>(eif)};
 252
 253             if(std::fabs(eif - static_cast<double>(ev_start)) < (0.1/step))
 254             {
 255                 evStart = ev_start;
 256                 break;
 257             }
 258         }
 259
 260         evCount = static_cast<uint>(std::round(180.0 / step)) + 1;
 261         if(evCount < 5)
 262         {
 263             fprintf(stdout, "Incompatible layout (too few uniform elevations).\n");
 264             return;
 265         }
 266
 267         fds[fi].mEvCount = evCount;
 268         fds[fi].mEvStart = evStart;
 269         fds[fi].mAzCounts.resize(evCount);
 270         auto &azCounts = fds[fi].mAzCounts;
 271
 272         for(uint ei{evStart};ei < evCount;ei++)
 273         {
 274             double ev{-90.0 + static_cast<double>(ei)*180.0/static_cast<double>(evCount - 1)};
 275             uint azCount{GetUniquelySortedElems(m, aers.data(), 0, { nullptr, &ev, &dist },
 276                 { 0.1, 0.1, 0.001 }, elems.data())};
 277
 278             if(azCount > (m / 3))
 279             {
 280                 fprintf(stdout, "Incompatible layout (innumerable azimuths).\n");
 281                 return;
 282             }
 283
 284             if(ei > 0 && ei < (evCount - 1))
 285             {
 286                 step = GetUniformStepSize(0.1, azCount, elems.data());
 287                 if(step <= 0.0)
 288                 {
 289                     fprintf(stdout, "Incompatible layout (non-uniform azimuths).\n");
 290                     return;
 291                 }
 292
 293                 azCounts[ei] = static_cast<uint>(std::round(360.0f / step));
 294             }
 295             else if(azCount != 1)
 296             {
 297                 fprintf(stdout, "Incompatible layout (non-singular poles).\n");
 298                 return;
 299             }
 300             else
 301             {
 302                 azCounts[ei] = 1;
 303             }
 304         }
 305
 306         for(uint ei{0u};ei < evStart;ei++)
 307             azCounts[ei] = azCounts[evCount - ei - 1];
 308     }
 309
 310     fprintf(stdout, "Compatible Layout:\n\ndistance = %.3f", fds[0].mDistance);
 311
 312     for(uint fi{1u};fi < fdCount;fi++)
 313         fprintf(stdout, ", %.3f", fds[fi].mDistance);
 314
 315     fprintf(stdout, "\nazimuths = ");
 316     for(uint fi{0u};fi < fdCount;fi++)
 317     {
 318         for(uint ei{0u};ei < fds[fi].mEvCount;ei++)
 319             fprintf(stdout, "%d%s", fds[fi].mAzCounts[ei],
 320                 (ei < (fds[fi].mEvCount - 1)) ? ", " :
 321                 (fi < (fdCount - 1)) ? ";\n           " : "\n");
 322     }
 323 }
 324
 325 // Load and inspect the given SOFA file.
 326 static void SofaInfo(const char *filename)
 327 {
 328     int err;
 329     MySofaHrtfPtr sofa{mysofa_load(filename, &err)};
 330     if(!sofa)
 331     {
 332         fprintf(stdout, "Error: Could not load source file '%s'.\n", filename);
 333         return;
 334     }
 335
 336     /* NOTE: Some valid SOFA files are failing this check. */
 337     err = mysofa_check(sofa.get());
 338     if(err != MYSOFA_OK)
 339         fprintf(stdout, "Warning: Supposedly malformed source file '%s' (%s).\n", filename,
 340             SofaErrorStr(err));
 341
 342     mysofa_tocartesian(sofa.get());
 343
 344     PrintSofaAttributes("Info", sofa->attributes);
 345
 346     fprintf(stdout, "Measurements: %u\n", sofa->M);
 347     fprintf(stdout, "Receivers: %u\n", sofa->R);
 348     fprintf(stdout, "Emitters: %u\n", sofa->E);
 349     fprintf(stdout, "Samples: %u\n", sofa->N);
 350
 351     PrintSofaArray("SampleRate", &sofa->DataSamplingRate);
 352     PrintSofaArray("DataDelay", &sofa->DataDelay);
 353
 354     PrintCompatibleLayout(sofa->M, sofa->SourcePosition.values);
 355 }
 356
 357 int main(int argc, char *argv[])
 358 {
 359     GET_UNICODE_ARGS(&argc, &argv);
 360
 361     if(argc != 2)
 362     {
 363         fprintf(stdout, "Usage: %s <sofa-file>\n", argv[0]);
 364         return 0;
 365     }
 366
 367     SofaInfo(argv[1]);
 368
 369     return 0;
 370 }
 371