The present invention relates to instruments for surveying the environment with scanning sensors in general, such as radars, sonars and medical ultrasound imaging equipment, and in particular to the display of received data in such instruments. Even though the invention will be described in relation to radars, the principle is basically applicable in any system based on acoustical or electromagnetic waves, the last including visible light, infrared radiation or x-ray radiation.
Data from sensors such as radars and sonars are sampled in polar or spherical coordinate systems, i.e. the sensors are scanning the surroundings with an angularly displaced beam. In the past, the received data were also displayed in polar coordinates on Plan Position Indicators using a rotating beam on a cathode ray tube. However, most modern display systems are raster scan devices, which operate in Cartesian coordinate system. The sensor data must therefore be converted into Cartesian coordinates. The conversion is a very processing intensive process, and this is in particular true for sensor systems on a moving mobile platform.
Prior art systems for coordinate transformation are based on one of the following techniques:
The direct mapping approach will miss many pixels in the display system because the mapping is neither a one-to-one nor an onto-mapping. Some interpolation or “spoke filling” is therefore necessary.
The inverse mapping approach will avoid the interpolation problem, but would also be more computer-intensive in the mapping calculations. Using tables will require recalculation of a new mapping table every time the area of display is moved or scaled. In mobile sensor scenarios where the display area is geographically fixed this can require time consuming recalculations of the tables. Hence, this is not an optimal solution for a system needing real-time performance.
It is an object of the present invention to provide a system and method for fast and efficient transformation of data from Cartesian to Polar coordinates, i.e. based on an inverse mapping method. The system and method is in particular applicable in sensor systems located on a fast moving mobile platform.
The inventive method employs an algorithm in which transformation equations are expressed in differential form involving only arithmetic operations. According to a second aspect of the invention, the equations may be further reduced to only multiplications, additions and subtractions by using a simple differential solver method combined with a synthetic division method.
The scope of the inventive system and method appears from the appended claims.
The advantages of the invention will become clear when reading the following description, in which the invention is described in detail in reference to the appended drawings, in which:
In the inverse mapping approach, the system will compute the Polar coordinates that correspond to each position in the Cartesian grid, and retrieve data (e.g. from a memory storing received data values) that appear in said Polar coordinate positions. The Polar coordinates are rounded to the nearest integer and used as addresses for retrieving data from memory.
The computational unit 1 receives polar data from a source 2 (such as a radar sensor) to be converted to Cartesian coordinates. The computational unit 1 calculates the polar coordinates of each point of interest on a grid in the Cartesian system.
The system will perform the following tasks:
The method is based on describing the coordinate transformation of adjacent points as differential equations. A suitable integration method will then efficiently produce the coordinate transformations. Further division can be avoided by using synthetic division.
The algorithm used will only require six multiplications, two additions and two subtractions per coordinate.
The coordinate transformations needed to map the display coordinate(x,y) to the sensor coordinates (r,phi) are:
Differentiate the coordinates with respect to the x direction gives:
Using a differential method solver to calculate the functions along the x-axis will result in simple calculations without time consuming square root and inverse trigonometric function evaluations.
A simple midpoint method shown below is a suited method because it requires a minimum of calculations.
f(x+2h)=f(x)+2hf′(x+h)
This will require the following calculations:
h is normally chosen to be the same as the pixel resolution of the display system.
In order to further speed up the calculations division can be avoided by using synthetic division in a Newton-Ralphson iteration. As an initial value for the inverse the preceding inverse can be used:
rinv(x+h)=rinv(x)*(2−rinv(x)*r(x+h))
where rinv means 1/r.
If further accuracy is required, one more iteration can be performed.
rinv(x+h)=rinv(x+h)*(2−rinv(x+h)*r(x+h))
In practical use with normal accuracy requirements this is not needed.
In
If we return to
In step 400, the position corresponding to the next scanpoint is calculated using the midpoint method as explained above. This is repeated until all scanpoints in a line has been found, step 500.
In steps 600 and 700, a test is made in order to decide if all scanlines have been completed. The outcome of the test decides if the process is to loop back to step 300 or, if all points has been found, to return to loop 100 and await a change in position or scale factor.
The method may also be described in the following pseudo code:
An example of a resultant screen picture is shown in
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/NO05/00292 | 8/17/2005 | WO | 00 | 2/15/2008 |