Skip to main content
. 2021 Feb 6;21(4):1148. doi: 10.3390/s21041148
Algorithm 1. OCD4M
Require:
Camera sensor set S={s1,s2,,sN}, target surface A:f(x,y,z)=0, Observation platform B:g(x,y,z)=0, Photography distance D, sensing angle α
Ensure:
A is covered by the set of C(i):(xyz(s(i)), D, α,di), and the degree of overlap of adjacent C(i) greater than 80%. (1) ACs(1)Cs(2)Cs(N); (2) SCs(i)Cs(i+1)0.8SCs(i); (3) xyz(si)B.
Process:
1: Compute the range of A. AZ=AzmaxAzmin; AX=AxminAxmax,
2: Compute the range of B. BZ=BzmaxBzmin; BX=BxminBxmax,
3: Compute the rang of Ci,
4: Whether to cover the Z direction of Mine Surface A
5: while Cz*K<AZ do
6:    get the number of camera sensors at each point
7:    K++
8: End while
9: Judge the Length relationship of A and B
10: If (BXminAXmin and BXmaxAXmax) do
11:    normal case photography, compute the minimum of camera sensors by Formula (9):
12:    Compute the coordinate of each camera sensor according to the photography
13:    distance by Equation (11),
14:    y=Bymax, z
15: Else
16:    convergent photography (angle θ);
17:    compute the range of camera sensor number by
18:    Equations (9)–(11),
19:    we can get K, N and (si(x, y, z))
20: End If
21: Return number (K*N) and position of sensor (si(x, y, z))