utils.cpp 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. #include <iostream>
  2. #include <opencv2/opencv.hpp>
  3. using namespace cv;
  4. using namespace std;
  5. int applyMask(unsigned short* input, unsigned char* pmask, int Width, int Height, unsigned short* output)
  6. {
  7. if (input == nullptr)
  8. {
  9. return 0;
  10. }
  11. if (pmask == nullptr)
  12. {
  13. return 0;
  14. }
  15. Mat src(Size(Width, Height), CV_16U, input);
  16. Mat mask(Size(Width, Height), CV_8U, pmask);
  17. Mat result;
  18. bitwise_and(src, src, result, mask);
  19. if (result.empty() || result.rows != Height || result.cols != Width )
  20. {
  21. return 0;
  22. }
  23. memcpy(output, result.data, Width * Height * sizeof(unsigned short));
  24. return 1;
  25. }
  26. int getMaskRect(unsigned char* pmask, int Width, int Height, int &x,int &y,int &RectWidth,int &RectHeight)
  27. {
  28. if (pmask == nullptr)
  29. {
  30. return 0;
  31. }
  32. Mat mask(Size(Width, Height), CV_8U, pmask);
  33. if (!sum(mask)[0])
  34. {
  35. return 0;
  36. }
  37. cv::Mat nonZeroPoints;
  38. cv::findNonZero(mask, nonZeroPoints);
  39. cv::Rect rect = cv::boundingRect(nonZeroPoints);
  40. x = rect.x;
  41. y = rect.y;
  42. RectWidth = rect.width;
  43. RectHeight = rect.height;
  44. return 1;
  45. }
  46. int cropImg(unsigned short *input, unsigned short *output, int Width, int Height, int x, int y, int RectWidth, int RectHeight)
  47. {
  48. if (input == nullptr)
  49. {
  50. return 0;
  51. }
  52. if (output == nullptr)
  53. {
  54. return 0;
  55. }
  56. Mat src(Size(Width, Height), CV_16U, input);
  57. memcpy(output, src(Rect(x, y, RectWidth, RectHeight)).clone().data, RectWidth * RectHeight * sizeof(unsigned short));
  58. return 1;
  59. }
  60. int applyInvertMask(unsigned short* input, unsigned char* pmask, int Width, int Height, unsigned short* output,int fillvalue = 4095)
  61. {
  62. if (input == nullptr)
  63. {
  64. return 0;
  65. }
  66. if (pmask == nullptr)
  67. {
  68. return 0;
  69. }
  70. #pragma omp parallel for
  71. for (int i = 0; i < Width * Height; i++)
  72. {
  73. if (!pmask[i])
  74. {
  75. output[i] = fillvalue;
  76. }
  77. else
  78. {
  79. output[i] = input[i];
  80. }
  81. }
  82. return 1;
  83. }
  84. //input:rawdata
  85. //pmask:collimatorMask
  86. //output:ForegroundMask 后续计算窗宽窗位传入ForegroundMask
  87. int getForegroundMask(unsigned short* input, unsigned char* pmask, int Width, int Height, unsigned char* output)
  88. {
  89. if (!input || !pmask || !output) {
  90. std::cerr << "Error: Null pointer input!" << std::endl;
  91. return 0;
  92. }
  93. if (Width <= 0 || Height <= 0) {
  94. std::cerr << "Error: Invalid image size!" << std::endl;
  95. return 0;
  96. }
  97. int max_grayv = 65535;
  98. int* h = new int[max_grayv + 1]();
  99. int i, j = { 0 };
  100. double masksum = 0;
  101. double mu = 0;
  102. #pragma omp parallel for
  103. for (i = 0; i < Width* Height; i++)
  104. {
  105. if (pmask[i])
  106. {
  107. h[input[i]]++;
  108. masksum++;
  109. mu += input[i];
  110. }
  111. }
  112. mu /= masksum;
  113. if (masksum < 1e-6) {
  114. std::cerr << "Warning: Mask region is empty." << std::endl;
  115. delete[] h;
  116. std::fill(output, output + Width * Height, 0);
  117. return 0;
  118. }
  119. double mu1 = 0, q1 = 0;
  120. double max_sigma = 0, max_val = 0;
  121. double scale = 1. / masksum;
  122. for (i = 0; i < max_grayv + 1; i++)
  123. {
  124. double p_i, q2, mu2, sigma;
  125. p_i = h[i] * scale;
  126. mu1 *= q1;
  127. q1 += p_i;
  128. q2 = 1. - q1;
  129. if (std::min(q1, q2) < FLT_EPSILON || std::max(q1, q2) > 1. - FLT_EPSILON)
  130. continue;
  131. mu1 = (mu1 + i * p_i) / q1;
  132. mu2 = (mu - q1 * mu1) / q2;
  133. sigma = q1 * q2 * (mu1 - mu2) * (mu1 - mu2);
  134. if (sigma > max_sigma)
  135. {
  136. max_sigma = sigma;
  137. max_val = i;
  138. }
  139. }
  140. delete[]h;
  141. for (i = 0; i < Width * Height; i++)
  142. {
  143. if (pmask[i])
  144. {
  145. if (input[i] < max_val)
  146. {
  147. output[i] = 1;
  148. }
  149. else
  150. {
  151. output[i] = 0;
  152. }
  153. }
  154. else
  155. {
  156. output[i] = 0;
  157. }
  158. }
  159. return 1;
  160. }