|
| 1 | +/*========================================================================= |
| 2 | + * |
| 3 | + * Curvature Filter in ITK, please cite following work in you paper! |
| 4 | + * |
| 5 | + ************************************************************************** |
| 6 | + |
| 7 | + @phdthesis{gong:phd, |
| 8 | + title={Spectrally regularized surfaces}, |
| 9 | + author={Gong, Yuanhao}, |
| 10 | + year={2015}, |
| 11 | + school={ETH Zurich, Nr. 22616}, |
| 12 | + note={http://dx.doi.org/10.3929/ethz-a-010438292}} |
| 13 | +
|
| 14 | + *=========================================================================*/ |
| 15 | +//estimate the d_m by different curvature filters |
| 16 | +float GC(float & cur, float & pre, float & rigUp, float & right, float & rigDn, float & next, float & lefDn, float & left, float & lefUp); |
| 17 | +float MC(float & cur, float & pre, float & rigUp, float & right, float & rigDn, float & next, float & lefDn, float & left, float & lefUp); |
| 18 | +float TV(float & cur, float & pre, float & rigUp, float & right, float & rigDn, float & next, float & lefDn, float & left, float & lefUp); |
| 19 | +float (*projection)(float & cur, float & pre, float & rigUp, float & right, float & rigDn, float & next, float & lefDn, float & left, float & lefUp); |
| 20 | +void CurvatureFilter(itk::Image< float, 2 >::Pointer image, int FilterType, int IterationNumber) |
| 21 | +{ |
| 22 | + |
| 23 | + if (FilterType == 0) {projection = TV; std::cout<<"TV filter: with "<<IterationNumber<<" Iterations";} |
| 24 | + if (FilterType == 1) {projection = MC; std::cout<<"MC filter: with "<<IterationNumber<<" Iterations";} |
| 25 | + if (FilterType == 2) {projection = GC; std::cout<<"GC filter: with "<<IterationNumber<<" Iterations";} |
| 26 | + float d, cur; |
| 27 | + //image size and neighbor index |
| 28 | + itk::Image< float, 2 >::SizeType size = image->GetLargestPossibleRegion().GetSize(); |
| 29 | + itk::Image< float, 2 >::IndexType index_cur, index_prev, index_rigUp, index_right, index_rigDn, index_next, index_leftDn, index_left, index_leftUp; |
| 30 | + |
| 31 | + clock_t Tstart, Tend; |
| 32 | + Tstart = clock(); |
| 33 | + |
| 34 | + for(int it = 0; it < IterationNumber; ++it) |
| 35 | + { |
| 36 | + //domain decomposition, four sets |
| 37 | + for (int i = 1; i < size[0]; ++i, ++i) |
| 38 | + for (int j = 1; j < size[1]; ++j, ++j) |
| 39 | + { |
| 40 | + index_leftUp[0] = j-1, index_leftUp[1] = i-1, index_prev[0] = j, index_prev[1] = i-1, index_rigUp[0]=j+1, index_rigUp[1] = i-1; |
| 41 | + index_left[0]=j-1, index_left[1]=i, index_cur[0] = j, index_cur[1] = i, index_right[0]=j+1, index_right[1]=i; |
| 42 | + index_leftDn[0]=j-1, index_leftDn[1]=i+1, index_next[0]=j, index_next[1] = i+1, index_rigDn[0]=j+1, index_rigDn[1] = i+1; |
| 43 | + |
| 44 | + cur = image->GetPixel(index_cur); |
| 45 | + d = (*projection)(cur, image->GetPixel(index_prev), image->GetPixel(index_rigUp), image->GetPixel(index_right), image->GetPixel(index_rigDn), image->GetPixel(index_next), image->GetPixel(index_leftDn), image->GetPixel(index_left), image->GetPixel(index_leftUp)); |
| 46 | + image->SetPixel(index_cur, cur + d); |
| 47 | + } |
| 48 | + for (int i = 2; i < size[0]; ++i, ++i) |
| 49 | + for (int j = 2; j < size[1]; ++j, ++j) |
| 50 | + { |
| 51 | + index_leftUp[0] = j-1, index_leftUp[1] = i-1, index_prev[0] = j, index_prev[1] = i-1, index_rigUp[0]=j+1, index_rigUp[1] = i-1; |
| 52 | + index_left[0]=j-1, index_left[1]=i, index_cur[0] = j, index_cur[1] = i, index_right[0]=j+1, index_right[1]=i; |
| 53 | + index_leftDn[0]=j-1, index_leftDn[1]=i+1, index_next[0]=j, index_next[1] = i+1, index_rigDn[0]=j+1, index_rigDn[1] = i+1; |
| 54 | + |
| 55 | + cur = image->GetPixel(index_cur); |
| 56 | + d = (*projection)(cur, image->GetPixel(index_prev), image->GetPixel(index_rigUp), image->GetPixel(index_right), image->GetPixel(index_rigDn), image->GetPixel(index_next), image->GetPixel(index_leftDn), image->GetPixel(index_left), image->GetPixel(index_leftUp)); |
| 57 | + image->SetPixel(index_cur, cur + d); |
| 58 | + } |
| 59 | + for (int i = 1; i < size[0]; ++i, ++i) |
| 60 | + for (int j = 2; j < size[1]; ++j, ++j) |
| 61 | + { |
| 62 | + index_leftUp[0] = j-1, index_leftUp[1] = i-1, index_prev[0] = j, index_prev[1] = i-1, index_rigUp[0]=j+1, index_rigUp[1] = i-1; |
| 63 | + index_left[0]=j-1, index_left[1]=i, index_cur[0] = j, index_cur[1] = i, index_right[0]=j+1, index_right[1]=i; |
| 64 | + index_leftDn[0]=j-1, index_leftDn[1]=i+1, index_next[0]=j, index_next[1] = i+1, index_rigDn[0]=j+1, index_rigDn[1] = i+1; |
| 65 | + |
| 66 | + cur = image->GetPixel(index_cur); |
| 67 | + d = (*projection)(cur, image->GetPixel(index_prev), image->GetPixel(index_rigUp), image->GetPixel(index_right), image->GetPixel(index_rigDn), image->GetPixel(index_next), image->GetPixel(index_leftDn), image->GetPixel(index_left), image->GetPixel(index_leftUp)); |
| 68 | + image->SetPixel(index_cur, cur + d); |
| 69 | + } |
| 70 | + for (int i = 2; i < size[0]; ++i, ++i) |
| 71 | + for (int j = 1; j < size[1]; ++j, ++j) |
| 72 | + { |
| 73 | + index_leftUp[0] = j-1, index_leftUp[1] = i-1, index_prev[0] = j, index_prev[1] = i-1, index_rigUp[0]=j+1, index_rigUp[1] = i-1; |
| 74 | + index_left[0]=j-1, index_left[1]=i, index_cur[0] = j, index_cur[1] = i, index_right[0]=j+1, index_right[1]=i; |
| 75 | + index_leftDn[0]=j-1, index_leftDn[1]=i+1, index_next[0]=j, index_next[1] = i+1, index_rigDn[0]=j+1, index_rigDn[1] = i+1; |
| 76 | + |
| 77 | + cur = image->GetPixel(index_cur); |
| 78 | + d = (*projection)(cur, image->GetPixel(index_prev), image->GetPixel(index_rigUp), image->GetPixel(index_right), image->GetPixel(index_rigDn), image->GetPixel(index_next), image->GetPixel(index_leftDn), image->GetPixel(index_left), image->GetPixel(index_leftUp)); |
| 79 | + image->SetPixel(index_cur, cur + d); |
| 80 | + } |
| 81 | + } |
| 82 | + |
| 83 | + Tend = clock() - Tstart; |
| 84 | + double time = double(Tend)/(CLOCKS_PER_SEC/1000.0); |
| 85 | + std::cout<<" running time is "<<time<<" milliseconds"<<std::endl; |
| 86 | +} |
| 87 | + |
| 88 | +// *************************** functions ******************************************** |
| 89 | +//estimate d_m (minimal projection signed distance) |
| 90 | +float GC(float & cur, float & prev, float & rigUp, float & right, float & rigDn, float & down, float & lefDn, float & left, float& lefUp) |
| 91 | +{ |
| 92 | + float d_m = (prev + down)/2 - cur; |
| 93 | + float tmp = (left, right)/2 - cur; |
| 94 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 95 | + tmp = (lefUp, rigDn)/2 - cur; |
| 96 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 97 | + tmp = (lefDn, rigUp)/2 - cur; |
| 98 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 99 | + |
| 100 | + //hybrid |
| 101 | + tmp = (left + lefUp + prev)/3 - cur; |
| 102 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 103 | + tmp = (prev + rigUp + right)/3 - cur; |
| 104 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 105 | + tmp = (right + rigDn + down)/3 - cur; |
| 106 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 107 | + tmp = (down + lefDn + left)/3 - cur; |
| 108 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 109 | + |
| 110 | + return d_m; |
| 111 | +} |
| 112 | +float MC(float & cur, float & prev, float & rigUp, float & right, float & rigDn, float & down, float & lefDn, float & left, float& lefUp) |
| 113 | +{ |
| 114 | + float TM = 8*cur; |
| 115 | + |
| 116 | + float d_m = (prev + down)*2.5f - rigUp - rigDn + 5*right - TM; |
| 117 | + float tmp = (prev + down)*2.5f - lefUp - lefDn + 5*left - TM; |
| 118 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 119 | + tmp = (left + right)*2.5f - lefUp - rigUp + 5*prev - TM; |
| 120 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 121 | + tmp = (left + right)*2.5f - lefDn - rigDn + 5*down - TM; |
| 122 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 123 | + |
| 124 | + return d_m/8; |
| 125 | +} |
| 126 | +float TV(float & cur, float & prev, float & rigUp, float & right, float & rigDn, float & down, float & lefDn, float & left, float& lefUp) |
| 127 | +{ |
| 128 | + float TM = 5*cur; |
| 129 | + |
| 130 | + float d_m = prev + down + lefUp + left + lefDn - TM; |
| 131 | + float tmp = prev + down + rigUp + rigDn + right - TM; |
| 132 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 133 | + tmp = left + lefUp + prev + rigUp + right - TM; |
| 134 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 135 | + tmp = left + lefDn + down + rigDn + right - TM; |
| 136 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 137 | + |
| 138 | + //diag |
| 139 | + tmp = lefUp + prev + rigUp + left + lefDn - TM; |
| 140 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 141 | + tmp = lefUp + prev + rigUp + right + rigDn - TM; |
| 142 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 143 | + tmp = lefDn + down + rigDn + left + lefUp - TM; |
| 144 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 145 | + tmp = lefDn + down + rigDn + right + rigUp - TM; |
| 146 | + if (fabs(tmp) < fabs(d_m)) d_m = tmp; |
| 147 | + |
| 148 | + return d_m/5; |
| 149 | +} |
| 150 | + |
0 commit comments