[201] | 1 | #include <Cubes/cubes.hh> |
---|
| 2 | #include <ATrous/atrous.hh> |
---|
[213] | 3 | #include <Utils/feedback.hh> |
---|
[201] | 4 | #include <Utils/Hanning.hh> |
---|
| 5 | |
---|
| 6 | void Cube::SmoothCube() |
---|
| 7 | { |
---|
| 8 | /** |
---|
| 9 | * Cube::SmoothCube() |
---|
| 10 | * |
---|
| 11 | * A function that smooths each spectrum in the cube using the |
---|
| 12 | * Hanning smoothing function. The degree of smoothing is given |
---|
| 13 | * by the parameter hannWidth. |
---|
| 14 | */ |
---|
| 15 | |
---|
| 16 | Hanning::Hanning hann(this->par.getHanningWidth()); |
---|
| 17 | |
---|
| 18 | long xySize = this->axisDim[0]*this->axisDim[1]; |
---|
| 19 | long zdim = this->axisDim[2]; |
---|
| 20 | |
---|
| 21 | float *spectrum = new float[this->axisDim[2]]; |
---|
| 22 | |
---|
| 23 | ProgressBar bar; |
---|
[219] | 24 | if(this->par.isVerbose()) { |
---|
| 25 | std::cout<<" Smoothing... "; |
---|
| 26 | bar.init(xySize); |
---|
| 27 | } |
---|
[201] | 28 | |
---|
| 29 | for(int pix=0;pix<xySize;pix++){ |
---|
| 30 | |
---|
[219] | 31 | if( this->par.isVerbose() ) bar.update(pix+1); |
---|
[201] | 32 | |
---|
| 33 | for(int z=0;z<zdim;z++){ |
---|
| 34 | if(this->isBlank(z*xySize+pix)) spectrum[z]=0.; |
---|
| 35 | else spectrum[z] = this->array[z*xySize+pix]; |
---|
| 36 | } |
---|
| 37 | |
---|
| 38 | float *smoothed = hann.smooth(spectrum,zdim); |
---|
| 39 | |
---|
| 40 | for(int z=0;z<zdim;z++){ |
---|
| 41 | if(this->isBlank(z*xySize+pix)) |
---|
| 42 | this->recon[z*xySize+pix]=this->array[z*xySize+pix]; |
---|
| 43 | else |
---|
| 44 | this->recon[z*xySize+pix] = smoothed[z]; |
---|
| 45 | } |
---|
| 46 | delete [] smoothed; |
---|
| 47 | } |
---|
| 48 | this->reconExists = true; |
---|
[219] | 49 | if(this->par.isVerbose()) bar.fillSpace("All Done.\n"); |
---|
[201] | 50 | |
---|
| 51 | delete [] spectrum; |
---|
| 52 | |
---|
| 53 | } |
---|
| 54 | |
---|
| 55 | |
---|
| 56 | void Cube::SmoothSearch() |
---|
| 57 | { |
---|
| 58 | /** |
---|
| 59 | * Cube::SmoothSearch() |
---|
| 60 | * The Cube is first smoothed, using Cube::SmoothCube(). |
---|
| 61 | * It is then searched, using searchReconArray. |
---|
| 62 | * The resulting object list is stored in the Cube, and outputted |
---|
| 63 | * to the log file if the user so requests. |
---|
| 64 | */ |
---|
| 65 | |
---|
| 66 | this->SmoothCube(); |
---|
[219] | 67 | if(this->par.isVerbose()) std::cout << " "; |
---|
[201] | 68 | this->setCubeStats(); |
---|
[219] | 69 | if(this->par.isVerbose()) std::cout << " Searching... " << std::flush; |
---|
[201] | 70 | |
---|
| 71 | this->objectList = search3DArray(this->axisDim,this->recon, |
---|
| 72 | this->par,this->Stats); |
---|
| 73 | |
---|
| 74 | this->updateDetectMap(); |
---|
| 75 | if(this->par.getFlagLog()) this->logDetectionList(); |
---|
| 76 | |
---|
| 77 | |
---|
| 78 | } |
---|