| Algorithm 1 Feature vector V_location |
|
Input: positioning point ; collection of all scene boundaries . |
| Procedure: function |
| 1: feature vector |
| 2: For each scene in collection D |
| 3: For each polygon in |
| 4: For each pair of sequential points in |
| 5: calculate the angle between and |
| 6: sum up angles |
| 7: End For |
| 8: If is the outer boundary and equals 2π |
| 9: element in feature vector , where k represents the category of scene |
| 10: Else If is the inner boundary and equals 2π |
| 11: element in feature vector , where k is the category of scene |
| 12: End If |
| 13: End For |
| 14: End For |
| 15: If elements of feature vector all equal to 0 |
| 16: element in feature vector , means the point locates outside all the scenes |
| 17: End If |
| Output: feature vector |