Skip to main content
. 2022 Sep 6;22(18):6732. doi: 10.3390/s22186732
Algorithm 1. Spatial-Motion Segmentation
Start
Input: Raw events, set ε1={ek=(xk,yk,tk,pk)}k=1Ne; original images; the number of clusters (Nl).
Output: Event-cluster membership probabilities (P), and motion parameters (θ).
Procedure:
1:For each image, do depth estimation.
        End for;
2: Fork←1 to Ne, do:
            Zk=tk−Tframe1Tframe2−Tframe1|Zframe2−Zframe1|
            Zk[xkyk1]=[f000f0001][XkYkZk]
       End for:
            ε2={ek=(Xk,Yk,Zk,tk,pk)}k=1Ne
3:Forek, do:
           computing θk according to θ=(θx,−a1θx+c1b1,−b3θx+c3a3)T
       End for:
4: Fork←1 to Ne, do:
           warping ek according to xk′=xk−(tk−tref)θ=xk−Δtkθ
       End for:
5: For each warped ek, do weighted accumulate:
            Vj(x)=∑k=1Nepkjδ(x−xkj′)
6: Fori←1 to ∞, do:
           If the variance is not converged, then:
              update the P using pkj=cj(xk′(θj))∑i=1Nlci(xk′(θi))
              update the θ according to SSA-Gradient Ascent:
              computing Var(Vj)=∑a,b,c∈Ω(Vabc−μVj)2
            End if:
            i←i+1
       End for:
End