Speed (sparse)#

This is a speed measuring algorithm built on top of the Sparse service – based on measuring changes in the radar response over time. The algorithm calculates a speed estimate of a target’s radial speed from or towards the sensor.

Plots#

../../../_images/sparse_speed.png

Figure 52 A screenshot of the plots. A target detected with the speed 4.4 m/s can be seen.#

Top plot: The plot shows the normalized power spectral density (PSD) for a frame in dB on the y-axis and speed in m/s on the x-axis. The dotted black line marks the threshold level set in Processing settings.

Lower left plot: The scatter plot shows all points which surpass the threshold in the top plot. The black line marks the point with the greatest speed.

Lower right plot: The plot illustrates the the latest top speeds in a bar graph. There must be approximately 0.5s between two point clusters to make the graph register a new top speed.

Detailed description#

The Sparse service returns data frames in the form of \(N_s\) sweeps, each consisting of \(N_d\) range depth points, normally spaced roughly 6 cm apart. We denote frames captured using the sparse service as \(x(f,s,d)\), where \(f\) denotes the frame index, \(s\) the sweep index and \(d\) the range depth index. As described in the documentation of the Sparse service, small movements within the field of view of the radar appear as sinusoidal movements of the sampling points over time. Thus, for each range depth point, we wish to detect changes between individual point samples occurring in the \(f\) and \(s\) dimensions.

Speed estimation#

The speed estimation algorithm is based on the power spectral density of the radar signal. Welch’s or Bartlett’s method is used to estimate this PSD.

The estimation is carried out by dividing the sweeps for each distance into segments, then forming a windowed periodogram of each segment and averaging all segments together.

The m:th windowed and zero-padded segement from the signal x can be denoted by

\[x_m(n) \triangleq w(n)x(n+mR), \; \; n=0, 1 ... M-1, \;\; m=0, 1, .., K-1\]

where R is defined as the segment size, \(w(n)\) is defined as the window function and K is defined as the number of segments. The periodogram of the m th segment is given by

\[P_{x_m,M}(w_k) = \frac{1}{M}|\text{FFT}_{N,k}(x_m)|² \triangleq \frac{1}{M}\left | \sum_{n=0}^{N-1} x_m(n)e^{-j2\pi nk/N}\right |^2\]

The power spectral density estimation is then given by

\[\hat{S_x}(w_k)\triangleq \frac{1}{K} \sum_{m=0}^{K-1} P_{x_m, M}(w_k)\]

which calculates the average of the periodograms.

In Processing settings the estimation method can be chosen as either Welch’s or Bartlett’s method. In Welch’s method the overlap of the segments are 50% and the used window, \(w(n)\), is a Hann window. In Bartlett’s method the segments does not overlap and \(w(n)\) is a rectangular window, which results in a non-modified periodogram. Welch’s method will result in lower variance, less leakage but decreased resolution compared to Bartlett’s method.

When the estimated PSD is attained by the methods above, the speed can easily be derived from its frequency contents. A period of a sinusoid in the data corresponds to an object having moved a perceived wavelength of the radar, i.e., ~2.5mm. So, for example, if we see a sinusoid with a frequency of 1kHz, we can calculate that this corresponds to a speed of 1000 Hz * 0.0025m = 2.5m/s.

Graphical overview#

digraph { pad=0.1 ranksep=0.3 nodesep=0.3 cellpad=0.5 bgcolor="#ffffff00" fontname=sans fontsize=12 style=rounded node [fontname=sans, fontsize=12, shape=record, style=rounded] subgraph cluster { style=invis subgraph cluster_inter { label="PSD estimation" style=rounded divide_frame -> window_frame -> fft -> periodogram -> periodogram_mean } } in -> {sweep_mean} -> divide_frame periodogram_mean -> norm -> out in [shape=Mdiamond, label="Input frame"] sweep_mean [label="Mean over\nsweeps"] divide_frame [label="Divide into \n segments"] window_frame [label="Multiply each \nsegment with \na window"] fft [label="FFT"] periodogram [label="Calculate periodogram \nof each segment\n by abs(.)^2"] periodogram_mean [label="Mean over \nperiodograms"] norm [label="Normalize with noise"] out [shape=Msquare, label="Output"] }

Configuration parameters#

class acconeer.exptool.a111.algo.speed_sparse._processor.ProcessingConfiguration#
class ProcessingMethod(value)#

An enumeration.

threshold#

The threshold parameter determines how great PSD a point needs to have to be included in the speed estimation. The threshold value is converted to dB when displayed in the Normalized PSD-graph

Type: float
Default value: 4.0
min_speed#

The minimum speed to be displayed.

Type: float
Unit: m/s
Default value: 0.5
fft_oversampling_factor#
Type: int
Default value: 1
processing_method#

In Welch’s method the segments overlap 50% and the periodograms are windowed using a Hann window. In Bartlett’s method there is no overlap between segments and the periodograms are not modified. Welch’s method will result in lower variance and added complexitycompared to Bartlett’s method.

Default value: ProcessingMethod.WELCH
num_segments#

Number of segments used in Welch’s/Bartlett’s method.

Type: int
Default value: 3
shown_speed_unit#
Default value: SpeedUnit.METER_PER_SECOND
show_data_plot#
Type: bool
Default value: False
show_sd_plot#
Type: bool
Default value: True
show_vel_history_plot#
Type: bool
Default value: True
num_shown_sequences#

Number of bars to be displayed in the bar graph

Type: int
Default value: 10