[300] | 1 | // ----------------------------------------------------------------------- |
---|
| 2 | // areClose.cc: Determine whether two Detections are close enough to |
---|
| 3 | // be merged. |
---|
| 4 | // ----------------------------------------------------------------------- |
---|
| 5 | // Copyright (C) 2006, Matthew Whiting, ATNF |
---|
| 6 | // |
---|
| 7 | // This program is free software; you can redistribute it and/or modify it |
---|
| 8 | // under the terms of the GNU General Public License as published by the |
---|
| 9 | // Free Software Foundation; either version 2 of the License, or (at your |
---|
| 10 | // option) any later version. |
---|
| 11 | // |
---|
| 12 | // Duchamp is distributed in the hope that it will be useful, but WITHOUT |
---|
| 13 | // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
---|
| 14 | // FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
---|
| 15 | // for more details. |
---|
| 16 | // |
---|
| 17 | // You should have received a copy of the GNU General Public License |
---|
| 18 | // along with Duchamp; if not, write to the Free Software Foundation, |
---|
| 19 | // Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA |
---|
| 20 | // |
---|
| 21 | // Correspondence concerning Duchamp may be directed to: |
---|
| 22 | // Internet email: Matthew.Whiting [at] atnf.csiro.au |
---|
| 23 | // Postal address: Dr. Matthew Whiting |
---|
| 24 | // Australia Telescope National Facility, CSIRO |
---|
| 25 | // PO Box 76 |
---|
| 26 | // Epping NSW 1710 |
---|
| 27 | // AUSTRALIA |
---|
| 28 | // ----------------------------------------------------------------------- |
---|
[3] | 29 | #include <math.h> |
---|
[393] | 30 | #include <duchamp/Detection/detection.hh> |
---|
| 31 | #include <duchamp/PixelMap/Scan.hh> |
---|
| 32 | #include <duchamp/PixelMap/Object3D.hh> |
---|
| 33 | #include <duchamp/param.hh> |
---|
[3] | 34 | |
---|
[258] | 35 | using namespace PixelInfo; |
---|
| 36 | |
---|
[378] | 37 | namespace duchamp |
---|
[3] | 38 | { |
---|
[221] | 39 | |
---|
[378] | 40 | bool areAdj(Object2D &obj1, Object2D &obj2); |
---|
| 41 | bool areClose(Object2D &obj1, Object2D &obj2, float threshold); |
---|
[221] | 42 | |
---|
[378] | 43 | bool areClose(Detection &obj1, Detection &obj2, Param &par) |
---|
| 44 | { |
---|
| 45 | |
---|
[528] | 46 | /// A Function to test whether object1 and object2 are within the |
---|
| 47 | /// spatial and velocity thresholds specified in the parameter set par. |
---|
| 48 | /// Returns true if at least one pixel of object1 is close to |
---|
| 49 | /// at least one pixel of object2. |
---|
[3] | 50 | |
---|
[378] | 51 | bool close = false; // this will be the value returned |
---|
[3] | 52 | |
---|
[378] | 53 | // |
---|
| 54 | // First, check to see if the objects are nearby. We will only do |
---|
| 55 | // the pixel-by-pixel comparison if their pixel ranges overlap. |
---|
| 56 | // This saves a bit of time if the objects are big and are nowhere |
---|
| 57 | // near one another. |
---|
| 58 | // |
---|
[3] | 59 | |
---|
[378] | 60 | bool flagAdj = par.getFlagAdjacent(); |
---|
| 61 | float threshS = par.getThreshS(); |
---|
| 62 | float threshV = par.getThreshV(); |
---|
[3] | 63 | |
---|
[378] | 64 | long gap; |
---|
| 65 | if(flagAdj) gap = 1; |
---|
| 66 | else gap = long( ceil(threshS) ); |
---|
[258] | 67 | |
---|
[378] | 68 | Scan test1,test2; |
---|
[258] | 69 | |
---|
[378] | 70 | // Test X ranges |
---|
| 71 | test1.define(0,obj1.getXmin()-gap,obj1.getXmax()-obj1.getXmin()+2*gap+1); |
---|
| 72 | test2.define(0,obj2.getXmin(),obj2.getXmax()-obj2.getXmin()+1); |
---|
| 73 | bool areNear = overlap(test1,test2); |
---|
[3] | 74 | |
---|
[378] | 75 | // Test Y ranges |
---|
| 76 | test1.define(0,obj1.getYmin()-gap,obj1.getYmax()-obj1.getYmin()+2*gap+1); |
---|
| 77 | test2.define(0,obj2.getYmin(),obj2.getYmax()-obj2.getYmin()+1); |
---|
| 78 | areNear = areNear && overlap(test1,test2); |
---|
[3] | 79 | |
---|
[378] | 80 | // Test Z ranges |
---|
| 81 | gap = long(ceil(threshV)); |
---|
| 82 | test1.define(0,obj1.getZmin()-gap,obj1.getZmax()-obj1.getZmin()+2*gap+1); |
---|
| 83 | test2.define(0,obj2.getZmin(),obj2.getZmax()-obj2.getZmin()+1); |
---|
| 84 | areNear = areNear && overlap(test1,test2); |
---|
| 85 | // Scan commonZ = intersect(test1,test2); |
---|
[3] | 86 | |
---|
[378] | 87 | if(areNear){ |
---|
| 88 | // |
---|
| 89 | // If we get to here, the pixel ranges overlap -- so we do a |
---|
| 90 | // pixel-by-pixel comparison to make sure they are actually |
---|
| 91 | // "close" according to the thresholds. Otherwise, close=false, |
---|
| 92 | // and so don't need to do anything else before returning. |
---|
| 93 | // |
---|
[3] | 94 | |
---|
[570] | 95 | std::vector<long> zlist1 = obj1.getChannelList(); |
---|
| 96 | std::vector<long> zlist2 = obj2.getChannelList(); |
---|
[3] | 97 | |
---|
[623] | 98 | for(size_t ct1=0; (!close && (ct1<zlist1.size())); ct1++){ |
---|
[258] | 99 | |
---|
[623] | 100 | for(size_t ct2=0; (!close && (ct2<zlist2.size())); ct2++){ |
---|
[258] | 101 | |
---|
[570] | 102 | if(abs(zlist1[ct1]-zlist2[ct2])<=threshV){ |
---|
[258] | 103 | |
---|
[570] | 104 | Object2D temp1 = obj1.getChanMap(zlist1[ct1]); |
---|
| 105 | Object2D temp2 = obj2.getChanMap(zlist2[ct2]); |
---|
[505] | 106 | |
---|
[378] | 107 | if(flagAdj) gap = 1; |
---|
| 108 | else gap = long( ceil(threshS) ); |
---|
| 109 | test1.define(0, temp1.getXmin()-gap, |
---|
| 110 | temp1.getXmax()-temp1.getXmin()+2*gap+1); |
---|
| 111 | test2.define(0, temp2.getXmin(), |
---|
| 112 | temp2.getXmax()-temp2.getXmin()+1); |
---|
| 113 | areNear = overlap(test1,test2); |
---|
| 114 | test1.define(0, temp1.getYmin()-gap, |
---|
| 115 | temp1.getYmax()-temp1.getYmin()+2*gap+1); |
---|
| 116 | test2.define(0, temp2.getYmin(), |
---|
| 117 | temp2.getYmax()-temp2.getYmin()+1); |
---|
| 118 | areNear = areNear && overlap(test1,test2); |
---|
[258] | 119 | |
---|
[378] | 120 | if(areNear){ |
---|
| 121 | if(flagAdj) close = close || areAdj(temp1,temp2); |
---|
| 122 | else close = close || areClose(temp1,temp2,threshS); |
---|
[258] | 123 | } |
---|
[505] | 124 | |
---|
[378] | 125 | } |
---|
[3] | 126 | |
---|
[258] | 127 | } |
---|
| 128 | |
---|
[378] | 129 | } |
---|
| 130 | |
---|
[3] | 131 | } |
---|
| 132 | |
---|
[378] | 133 | return close; |
---|
| 134 | |
---|
[3] | 135 | } |
---|
| 136 | |
---|
[378] | 137 | bool areClose(Object2D &obj1, Object2D &obj2, float threshold) |
---|
| 138 | { |
---|
| 139 | bool close = false; |
---|
[258] | 140 | |
---|
[378] | 141 | long nscan1 = obj1.getNumScan(); |
---|
| 142 | long nscan2 = obj2.getNumScan(); |
---|
[258] | 143 | |
---|
[378] | 144 | Scan temp1(0, obj1.getYmin()-int(threshold), |
---|
| 145 | obj1.getYmax()-obj1.getYmin()+1+2*int(threshold)); |
---|
| 146 | Scan temp2(0, obj2.getYmin(),obj2.getYmax()-obj2.getYmin()+1); |
---|
[505] | 147 | Scan Yoverlap = intersect(temp1,temp2); |
---|
| 148 | // std::cerr << "\n"<<temp1 <<"\t" << temp2 << "\t" << Yoverlap<<"\n"; |
---|
| 149 | |
---|
| 150 | // Xoverlap has the scans that overlap with a padding of width threshold |
---|
| 151 | // If two pixels are separated in Y by threshold, but have the same X, then they match. |
---|
| 152 | // This is the furthest apart they can be in Y. |
---|
[258] | 153 | |
---|
| 154 | |
---|
[505] | 155 | if(Yoverlap.getXlen()>0){ |
---|
| 156 | // Grow by a pixel in each direction, to take into account the possibility of fractional thresholds (eg. 7.5) |
---|
| 157 | Yoverlap.growLeft(); |
---|
| 158 | Yoverlap.growRight(); |
---|
| 159 | |
---|
| 160 | // Now look at just these scans pixel by pixel |
---|
[258] | 161 | |
---|
[505] | 162 | // Get the scans from object 2 that lie in the overlap region (these haven't been affected by the threshold gap) |
---|
| 163 | for(int scanct2=0; (!close && (scanct2<nscan2)); scanct2++){ |
---|
| 164 | temp2 = obj2.getScan(scanct2); |
---|
| 165 | // std::cerr << temp2.getY() << ":\n"; |
---|
| 166 | if(Yoverlap.isInScan(temp2.getY(),0)){ // if the scan is in the allowed Y range |
---|
[258] | 167 | |
---|
[505] | 168 | for(int scanct1=0; (!close && (scanct1<nscan1)); scanct1++){ |
---|
| 169 | temp1 = obj1.getScan(scanct1); |
---|
| 170 | long y = temp1.getY(); |
---|
| 171 | // std::cerr << temp1.getY() << " "; |
---|
| 172 | if(abs(y-temp2.getY())<threshold){ |
---|
| 173 | // std::cerr << "("<<minSep(temp1,temp2)<<")"; |
---|
[258] | 174 | |
---|
[505] | 175 | close = (minSep(temp1,temp2) < threshold); |
---|
[258] | 176 | |
---|
[505] | 177 | } |
---|
[258] | 178 | |
---|
[505] | 179 | } |
---|
| 180 | // std::cerr << "\n"; |
---|
[258] | 181 | |
---|
[505] | 182 | } |
---|
[258] | 183 | |
---|
[505] | 184 | } |
---|
| 185 | |
---|
| 186 | } |
---|
| 187 | return close; |
---|
[258] | 188 | |
---|
[378] | 189 | } |
---|
[258] | 190 | |
---|
[505] | 191 | |
---|
[378] | 192 | bool areAdj(Object2D &obj1, Object2D &obj2) |
---|
| 193 | { |
---|
| 194 | bool close = false; |
---|
[258] | 195 | |
---|
[378] | 196 | long nscan1 = obj1.getNumScan(); |
---|
| 197 | long nscan2 = obj2.getNumScan(); |
---|
[258] | 198 | |
---|
[378] | 199 | Scan temp1(0, obj1.getYmin()-1,obj1.getYmax()-obj1.getYmin()+3); |
---|
| 200 | Scan temp2(0, obj2.getYmin(),obj2.getYmax()-obj2.getYmin()+1); |
---|
| 201 | Scan temp3; |
---|
| 202 | Scan commonY = intersect(temp1,temp2); |
---|
| 203 | if(commonY.getXlen()>0){ |
---|
| 204 | commonY.growLeft(); |
---|
| 205 | commonY.growRight(); |
---|
| 206 | // std::cerr << temp1 << " " << temp2 << " " << commonY << "\n"; |
---|
[258] | 207 | |
---|
[378] | 208 | for(int scanct1=0;(!close && scanct1 < nscan1);scanct1++){ |
---|
| 209 | temp1 = obj1.getScan(scanct1); |
---|
| 210 | if(commonY.isInScan(temp1.getY(),0)){ |
---|
| 211 | long y1 = temp1.getY(); |
---|
[258] | 212 | |
---|
[378] | 213 | for(int scanct2=0; (!close && scanct2 < nscan2); scanct2++){ |
---|
| 214 | temp2 = obj2.getScan(scanct2); |
---|
| 215 | if(commonY.isInScan(temp2.getY(),0)){ |
---|
| 216 | long dy = abs(y1 - temp2.getY()); |
---|
[258] | 217 | |
---|
[378] | 218 | if(dy<= 1){ |
---|
[258] | 219 | |
---|
[378] | 220 | temp3.define(temp2.getY(),temp1.getX(),temp1.getXlen()); |
---|
| 221 | if(touching(temp3,temp2)) close = true; |
---|
[258] | 222 | |
---|
[378] | 223 | } |
---|
[258] | 224 | } |
---|
[378] | 225 | } // end of for loop over scanct2 |
---|
[258] | 226 | |
---|
[378] | 227 | } |
---|
[258] | 228 | |
---|
[378] | 229 | } // end of for loop over scanct1 |
---|
[258] | 230 | |
---|
[378] | 231 | } |
---|
| 232 | return close; |
---|
[258] | 233 | } |
---|
[378] | 234 | |
---|
[258] | 235 | } |
---|