[go: up one dir, main page]

CN102313886B - Coordinate conversion method in pulsed radar imaging - Google Patents

Coordinate conversion method in pulsed radar imaging Download PDF

Info

Publication number
CN102313886B
CN102313886B CN 201110241144 CN201110241144A CN102313886B CN 102313886 B CN102313886 B CN 102313886B CN 201110241144 CN201110241144 CN 201110241144 CN 201110241144 A CN201110241144 A CN 201110241144A CN 102313886 B CN102313886 B CN 102313886B
Authority
CN
China
Prior art keywords
array
rectangular coordinate
coordinate
memory
add
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN 201110241144
Other languages
Chinese (zh)
Other versions
CN102313886A (en
Inventor
李宏波
李�浩
田丹
罗长阳
鄢林
敬洁
冉元进
陈闹
陶吉怀
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NINGBO CHENGDIAN TAIKE ELECTRONIC INFORMATION TECHNOLOGY DEVELOPMENT Co Ltd
Original Assignee
NINGBO CHENGDIAN TAIKE ELECTRONIC INFORMATION TECHNOLOGY DEVELOPMENT Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NINGBO CHENGDIAN TAIKE ELECTRONIC INFORMATION TECHNOLOGY DEVELOPMENT Co Ltd filed Critical NINGBO CHENGDIAN TAIKE ELECTRONIC INFORMATION TECHNOLOGY DEVELOPMENT Co Ltd
Priority to CN 201110241144 priority Critical patent/CN102313886B/en
Publication of CN102313886A publication Critical patent/CN102313886A/en
Application granted granted Critical
Publication of CN102313886B publication Critical patent/CN102313886B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Radar Systems Or Details Thereof (AREA)
  • Image Processing (AREA)

Abstract

The invention discloses a coordinate conversion method in pulsed radar imaging. According to the invention, a novel look-up table is established; a dead point situation is indicated by additional information; when a coordinate is output, additional point processing is carried out on the dead point according to the additional information to improve a radar imaging quality; the established look-up table only records conversion from polar coordinates from 0 degrees to 45 degrees to a rectangular coordinate; in a circumference, conversion from other polar coordinates to the rectangular coordinate are completed by a mapping formula, a table look up method, and a conversion formula, so that a storage space needed by the look-up table is reduced; and a storage space in chip is saved for a processor by utilizing an offchip memory. The method provided in the invention can be applied to a pulsed radar image display based on FPGA hardware platform and pulsed radar image display based on PC; besides, the method provided in the invention can also be applied to various polar coordinate software and hardware display system.

Description

Coordinate transformation method in a kind of pulsed radar imaging
Technical field
The present invention relates to the disposal route that a kind of pulsed radar image shows, especially relate to the coordinate transformation method in a kind of pulsed radar imaging.
Background technology
Pulsed radar is having a wide range of applications in fields such as civil navigation, investigations.Display is as the direct reaction of radar information, and display effect often directly affects radar effect and ship safety.The scan mode of display is lining by line scan or staggered scanning from left to right, the mode that belongs to rectangular coordinate, and being the circular radial scan mode, the information that radar obtains belongs to polar coordinate mode, at first the polar coordinates information of radar to be converted to rectangular coordinate information and deposit video memory in so realize the demonstration of radar data, from video memory, read and show in the mode of frame scan again.
What at present polar coordinates mainly adopted to the conversion of rectangular coordinate in the radar imagery is look-up table, this method is saved in look-up table with polar coordinates by the rectangular coordinate that trigonometric function calculates, then with look-up table stores in storage space, after in processor, inputting the radar scanning line, angle value addressable storage space according to the radar scanning line obtains one group of rectangular coordinate corresponding to all analyzing spots on this radar scanning line, realized the quick conversion of polar coordinates to rectangular coordinate, but on the rectangular coordinate in rectangular coordinate system that this method calculates by trigonometric function the polar coordinates of analyzing spot and the radar display screen rectangular coordinate of pixel in rectangular coordinate system one to one problem do not process, " dead point " can appear when video picture, some pixel did not have pixel to show when " dead point " was the display screen video picture, caused imaging unintelligible; And the look-up table record is rectangular coordinate corresponding to all polar coordinates in the circumference range, and used storage space is larger.
Summary of the invention
The present invention is directed to above technical matters by the coordinate transformation method in the pulsed radar imaging that a kind of imaging clearly is provided, solved well " dead point " problem, only use a small amount of storage space simultaneously.
Technical scheme of the present invention is the coordinate transformation method in a kind of pulsed radar imaging, comprises following treatment step:
S1. the sweep trace in one week of radar scanning adds up to N, and analyzing spot M is arranged on the every radar scanning line, and n is n bar sweep trace, in 0 °~45 ° scopes of radar scanning circumference, the polar coordinates (r, θ) of the analyzing spot of all radar scanning lines is passed through formula x i = r cos ( θ ) y i = r sin ( θ ) Calculate corresponding rectangular coordinate (x i, y i), form array { (x i, y i), wherein, N, M, n, i, r are integer, and n ∈ [0, N/8], i ∈ [0, MN/8), r ∈ [0, M),
Figure BDA0000085056150000012
S2. will be positioned at 0 °~45 ° scopes of rectangular coordinate system first quartile and satisfy condition y ≤ x x 2 + y 2 ≤ M 2 All rectangular coordinate points (x, y) find out, form array { (x, y) }, again with each the rectangular coordinate point in the array { (x, y) } respectively with array { (x i, y i) in each rectangular coordinate point relatively, if satisfy condition y = y i x = x i , Then with the deletion from the array { (x, y) } of this coordinate points (x, y), garbled array { (x, y) } is redefined be array { (x ', y ') } at last;
S3. select array { (x i, y i) in i rectangular coordinate point, i=0,1,2 ..., MN/8-1 travels through array { (x ', y ') } again, finds out to satisfy condition y ′ ≤ y i x ′ ≤ x i All rectangular coordinates form new array { (x Ij', y Ij') and from array { (x ', y ') } deletion, wherein (x Ij', y Ij') expression array { (x i, y i) in satisfy condition around i coordinate points y ′ ≤ y i x ′ ≤ x i J coordinate points, j is that [0, J), J represents array { (x for integer and j ∈ Ij', y Ij') in contained element number;
With rectangular coordinate (x i, y i) horizontal ordinate x iDeduct respectively array { (x Ij', y Ij') in the horizontal ordinate x of each rectangular coordinate Ij', rectangular coordinate (x i, y i) ordinate y iDeduct respectively array { (x Ij', y Ij') in the ordinate y of each rectangular coordinate Ij' obtain (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), the binary number add that is 2J*k bit with a width again represents (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), method for expressing is: 0~(k-1) bit of binary number add represents numerical value x i-x I1', binary number add k~(2k-1) bit represents numerical value y i-y I1', 2k~(3k-1) bit represents numerical value x i-x I2', binary number add 3k~(4k-1) bit represents numerical value y i-y I2' ..., (2 (j-1) * k)~((2j-1) * k-1) bit of binary number add represents numerical value x i-x Ij', ((2j-1) * k)~((2j * k)-1) bit of binary number add represents numerical value y i-y Ij', wherein k is all x i-x Ij' and y i-y IjMaximization in the ' numerical value is the bit wide behind the binary number;
With rectangular coordinate (x i, y i) and corresponding add value save as (x, y, add) i, (x, y, add) iRepresented rectangular coordinate (x i, y i) and array { (x Ij', y Ij');
S4. repeat s3, i value 0,1,2 successively wherein ..., MN/8-1 is again with all (x, y, add) iBe saved in look-up table;
S5. processor n in receiving radar scanning circumference range 1Behind bar sweep trace and the corresponding half-tone information thereof, with n 1The bar sweep trace is transformed into respective scan line n in 0 °~45 ° scopes by the mapping formula;
Wherein, n 1[0, N), the mapping formula is ∈ n = n 1 , 0 &le; n 1 &le; N / 8 n = N / 4 - n 1 , N / 8 < n 1 &le; N / 4 n = n 1 - N / 4 , N / 4 < n 1 &le; 3 N / 8 n = N / 2 - n 1 , 3 N / 8 < n 1 &le; N / 2 n = n 1 - N / 2 , N / 2 < n 1 &le; 5 N / 8 n = 3 N / 4 - n 1 , 5 N / 8 < n 1 &le; 3 N / 4 n = n 1 - 3 N / 4 , 3 N / 4 < n 1 &le; 7 N / 8 n = N - n 1 , 7 N / 8 < n 1 < N ;
Obtain M corresponding to a sweep trace n number of scan points certificate by the addressing look-up table, with this M number of scan points according to forming array
Figure BDA0000085056150000032
n 1∈ [0, N);
S6. the array that s5 is obtained
Figure BDA0000085056150000033
Be saved in the first memory of processor, with n 1The gray-scale value that each analyzing spot is corresponding on the bar sweep trace is saved in the second memory of processor;
S7. from first memory, take out n 1R number of scan points certificate on the bar sweep trace
Figure BDA0000085056150000034
R ∈ [0, M), and from second memory read with
Figure BDA0000085056150000035
Corresponding gray-scale value; According to
Figure BDA0000085056150000036
In rectangular coordinate
Figure BDA0000085056150000037
And the add value obtains array
Figure BDA0000085056150000038
With rectangular coordinate
Figure BDA0000085056150000039
And array
Figure BDA00000850561500000310
In each coordinate element substitution conversion formula obtain rectangular coordinate With
Figure BDA00000850561500000312
Wherein, conversion formula is x 1 = x , y 1 = y , 0 &le; n 1 &le; N / 8 x 1 = y , y 1 = x , N / 8 < n 1 &le; N / 4 x 1 = - y , y 1 = x , N / 4 < n 1 &le; 3 N / 8 x 1 = - x , y 1 = y , 3 N / 8 < n 1 &le; N / 2 x 1 = - x , y 1 = - y , N / 2 < n 1 &le; 5 N / 8 x 1 = - y , y 1 = - x , 5 N / 8 < n 1 &le; 3 N / 4 x 1 = y , y 1 = - x , 3 N / 4 < n 1 &le; 7 N / 8 x 1 = x , y 1 = - y , 7 N / 8 < n 1 < N ;
With rectangular coordinate
Figure BDA0000085056150000041
With
Figure BDA0000085056150000042
Corresponding gray-scale value outputs to video memory together;
With array In each rectangular coordinate respectively with
Figure BDA0000085056150000044
Corresponding gray-scale value outputs to video memory together.
Described step s4 saves as readable documents with look-up table and stores on the external memorizer of processor, when processor starts, look-up table is copied to the internal memory from external memorizer; First memory among described step s6, the described step s7 and second memory are the on-chip memory of processor.
Described processor adopting FPGA.
Described external memorizer adopts NANDFLASH, and described internal memory adopts SDRAM, and described on-chip memory adopts the FIFO storer.
Compared with prior art, the invention has the advantages that and set up the novel look-up table that comprises rectangular coordinate and additional information, indicate " dead point " situation by additional information, when rectangular coordinate is exported, by additional information a processing is mended at the dead point, improved the radar imagery quality; The look-up table of setting up has only recorded 0 °~45 ° polar coordinates to the conversion of rectangular coordinate, and other polar coordinates are finished by mapping, look-up table and conversion process to the conversion of rectangular coordinate in the circumference, reduced the storage area of look-up table needs; Saved storage space in the sheet by using chip external memory as processor.
Description of drawings
Fig. 1 is that look-up table of the present invention generates schematic diagram;
Fig. 2 is pulsed radar coordinate conversion realization flow schematic diagram of the present invention;
Fig. 3 is the design sketch that actual measurement radar image of the present invention shows.
Embodiment
Below in conjunction with accompanying drawing, provide specific embodiments of the invention.
Instance parameter is: the processor adopting FPGA of radar imagery, the external memorizer of FPGA adopts NANDFLASH, the internal memory of FPGA adopts SDRAM, the on-chip memory of FPGA adopts the FIFO storer, and one week of radar scanning is that 384 polar coordinates, LCD size are arranged is that 15 cun, radar image viewing area are 768 * 768 for 2048 sweep traces, every sweep trace.Specifically be unfolded as follows.
S1. the polar coordinates (r, θ) with the analyzing spot on all radar scanning lines in 0 °~45 ° scopes pass through formula x = r cos ( &theta; ) y = r sin ( &theta; ) Calculate corresponding rectangular coordinate (x, y), form array { (x, y) }, n is n bar sweep trace, and n, r are integer and n ∈ [0,256], r ∈ [0,384),
Figure BDA0000085056150000046
S2. will be positioned at 0 °~45 ° scopes of rectangular coordinate system first quartile and satisfy condition y &le; x x 2 + y 2 &le; 383 2 All rectangular coordinate points (x, y) find out, form array { (x, y) }, again with each the rectangular coordinate point in the array { (x, y) } respectively with array { (x i, y i) in each rectangular coordinate point relatively, if satisfy condition y = y i x = x i Then with the deletion from the array { (x, y) } of this coordinate points (x, y), garbled array { (x, y) } is redefined be array { (x ', y ') } at last;
S3. select array { (x i, y i) in i rectangular coordinate point, i=0,1,2 ..., 98303, travel through again array { (x ', y ') }, find out and satisfy condition y &prime; &le; y i x &prime; &le; x i All rectangular coordinates form new array { (x Ij', y Ij'), again with array { (x Ij', y Ij') deletion from array { (x ', y ') } of the rectangular coordinate point that contains, avoid these coordinate points to be repeated to find out, wherein (x Ij', y Ij') expression array { (x i, y i) in satisfy condition around i coordinate points y &prime; &le; y i x &prime; &le; x i J coordinate points, j is that [0, J), J represents array { (x for integer and j ∈ Ij', y Ij') in contained element number;
With rectangular coordinate (x i, y i) horizontal ordinate x iDeduct respectively array { (x Ij', y Ij') in the horizontal ordinate x of each rectangular coordinate Ij', rectangular coordinate (x i, y i) ordinate y iDeduct respectively array { (x Ij', y Ij') in the ordinate y of each rectangular coordinate Ij' obtain (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), the binary number add that is 2J*k bit with a width again represents (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), method for expressing is: 0~(k-1) bit of binary number add represents numerical value x i-x I1', binary number add k~(2k-1) bit represents numerical value y i-y I1', 2k~(3k-1) bit represents numerical value x i-x I2', binary number add 3k~(4k-1) bit represents numerical value y i-y I2' ..., (2 (j-1) * k)~((2j-1) * k-1) bit of binary number add represents numerical value x i-x Ij', ((2j-1) * k)~((2j*k)-1) bit of binary number add represents numerical value y i-y Ij', wherein k is all x i-x Ij' and y i-y IjMaximization in the ' numerical value is the bit wide behind the binary number;
With rectangular coordinate (x i, y i) and corresponding add value save as (x, y, add) i, (x, y, add) iRepresented rectangular coordinate (x i, y i) and array { (x Ij', y Ij');
S4. repeat s3, i value 0,1,2 successively wherein ..., 98303, again with all (x, y, add) iBe saved in look-up table; Look-up table is sent to processor by serial ports, and processor deposits look-up table in external memorizer; When processor starts, the look-up table in the external memorizer is deposited in the internal memory;
S5. input n 1During bar radar scanning line data, polar coordinates (r, n that each analyzing spot in the radar scanning line is corresponding 1) being converted to polar coordinates (r, n) by the mapping formula, polar coordinates (r, n) obtain corresponding data by the addressing look-up table and are designated as
Figure BDA0000085056150000061
Wherein, n 1, n is integer and n 1∈ [0,2047], n ∈ [0,256],
The mapping formula is: n = n 1 , 0 &le; n 1 &le; N / 8 n = N / 4 - n 1 , N / 8 < n 1 &le; N / 4 n = n 1 - N / 4 , N / 4 < n 1 &le; 3 N / 8 n = N / 2 - n 1 , 3 N / 8 < n 1 &le; N / 2 n = n 1 - N / 2 , N / 2 < n 1 &le; 5 N / 8 n = 3 N / 4 - n 1 , 5 N / 8 < n 1 &le; 3 N / 4 n = n 1 - 3 N / 4 , 3 N / 4 < n 1 &le; 7 N / 8 n = N - n 1 , 7 N / 8 < n 1 < N ;
S6. will
Figure BDA0000085056150000063
Deposit in the first memory; Be (r, n with polar coordinates 1) the half-tone information of analyzing spot deposit in the second memory, first memory and second memory are the on-chip memory of processor in the present embodiment;
S7. from first memory, take out n 1R number of scan points certificate on the bar sweep trace
Figure BDA0000085056150000064
R be integer and r ∈ [0,384), and from second memory read with
Figure BDA0000085056150000065
Corresponding gray-scale value; According to
Figure BDA0000085056150000066
In rectangular coordinate
Figure BDA0000085056150000067
And the add value obtains array
Figure BDA0000085056150000068
With rectangular coordinate And array
Figure BDA00000850561500000610
In each coordinate element substitution conversion formula obtain rectangular coordinate
Figure BDA00000850561500000611
With
Figure BDA00000850561500000612
Conversion formula is x 1 = x , y 1 = y , 0 &le; n 1 &le; N / 8 x 1 = y , y 1 = x , N / 8 < n 1 &le; N / 4 x 1 = - y , y 1 = x , N / 4 < n 1 &le; 3 N / 8 x 1 = - x , y 1 = y , 3 N / 8 < n 1 &le; N / 2 x 1 = - x , y 1 = - y , N / 2 < n 1 &le; 5 N / 8 x 1 = - y , y 1 = - x , 5 N / 8 < n 1 &le; 3 N / 4 x 1 = y , y 1 = - x , 3 N / 4 < n 1 &le; 7 N / 8 x 1 = x , y 1 = - y , 7 N / 8 < n 1 < N ;
With rectangular coordinate
Figure BDA0000085056150000072
With
Figure BDA0000085056150000073
Corresponding gray-scale value outputs to video memory together, with array
Figure BDA0000085056150000074
In each rectangular coordinate respectively with Corresponding gray-scale value outputs to video memory together.

Claims (4)

1. the coordinate transformation method in the pulsed radar imaging is characterized in that comprising following treatment step:
S1. the sweep trace in one week of radar scanning adds up to N, and analyzing spot M is arranged on the every radar scanning line, and n is n bar sweep trace, in 0 °~45 ° scopes of radar scanning circumference, the polar coordinates (r, θ) of the analyzing spot of all radar scanning lines is passed through formula x i = r cos ( &theta; ) y i = r sin ( &theta; ) Calculate corresponding rectangular coordinate (x i, y i), form array { (x i, y i), wherein, N, M, n, i, r are integer, and n ∈ [0, N/8], i ∈ [0, MN/8), r ∈ [0, M),
Figure FDA0000085056140000012
S2. will be positioned at 0 °~45 ° scopes of rectangular coordinate system first quartile and satisfy condition y &le; x x 2 + y 2 &le; M 2 All rectangular coordinate points (x, y) find out, form array { (x, y) }, again with each the rectangular coordinate point in the array { (x, y) } respectively with array { (x i, y i) in each rectangular coordinate point relatively, if satisfy condition y = y i x = x i , Then with the deletion from the array { (x, y) } of this coordinate points (x, y), garbled array { (x, y) } is redefined be array { (x ', y ') } at last;
S3. select array { (x i, y i) in i rectangular coordinate point, i=0,1,2 ..., MN/8-1 travels through array { (x ', y ') } again, finds out to satisfy condition y &prime; &le; y i x &prime; &le; x i All rectangular coordinates form new array { (x Ij', y Ij') and from array { (x ', y ') } deletion, wherein (x Ij', y Ij') expression array { (x i, y j) in satisfy condition around i coordinate points y &prime; &le; y i x &prime; &le; x i J coordinate points, j is that [0, J), J represents array { (x for integer and j ∈ Ij', y Ij') in contained element number;
With rectangular coordinate (x i, y i) horizontal ordinate x iDeduct respectively array { (x Ij', y Ij') in the horizontal ordinate x of each rectangular coordinate Ij', rectangular coordinate (x i, y i) ordinate y iDeduct respectively array { (x Ij', y Ij') in the ordinate y of each rectangular coordinate Ij' obtain (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), the binary number add that is 2J*k bit with a width again represents (x i-x I1', y i-y I1'), (x i-x I2', y i-y I2') ... (x i-x Ij', y i-y Ij'), method for expressing is: 0~(k-1) bit of binary number add represents numerical value x i-x I1', binary number add k~(2k-1) bit represents numerical value y i-y I1', 2k~(3k-1) bit represents numerical value x i-x I2', binary number add 3k~(4k-1) bit represents numerical value y i-y I2' ..., (2 (j-1) * k)~((2j-1) * k-1) bit of binary number add represents numerical value x i-x Ij', ((2j-1) * k)~((2j*k)-1) bit of binary number add represents numerical value y i-y Ij', wherein k is all x i-x Ij' and y i-y IjMaximization in the ' numerical value is the bit wide behind the binary number;
With rectangular coordinate (x i, y i) and corresponding add value save as (x, y, add) i, (x, y, add) iRepresented rectangular coordinate (x i, y i) and array { (x Ij', y Ij');
S4. repeat s3, i value 0,1,2 successively wherein ..., MN/8-1 is again with all (x, y, add) iBe saved in look-up table;
S5. processor n in receiving radar scanning circumference range 1Behind bar sweep trace and the corresponding half-tone information thereof, with n 1The bar sweep trace is transformed into respective scan line n in 0 °~45 ° scopes by the mapping formula;
Wherein, n 1[0, N), the mapping formula is ∈ n = n 1 , 0 &le; n 1 &le; N / 8 n = N / 4 - n 1 , N / 8 < n 1 &le; N / 4 n = n 1 - N / 4 , N / 4 < n 1 &le; 3 N / 8 n = N / 2 - n 1 , 3 N / 8 < n 1 &le; N / 2 n = n 1 - N / 2 , N / 2 < n 1 &le; 5 N / 8 n = 3 N / 4 - n 1 , 5 N / 8 < n 1 &le; 3 N / 4 n = n 1 - 3 N / 4 , 3 N / 4 < n 1 &le; 7 N / 8 n = N - n 1 , 7 N / 8 < n 1 < N ;
Obtain M corresponding to a sweep trace n number of scan points certificate by the addressing look-up table, with this M number of scan points according to forming array
Figure FDA0000085056140000022
n 1∈ [0, N);
S6. the array that s5 is obtained
Figure FDA0000085056140000023
Be saved in the first memory of processor, with n 1The gray-scale value that each analyzing spot is corresponding on the bar sweep trace is saved in the second memory of processor;
S7. from first memory, take out n 1R number of scan points certificate on the bar sweep trace
Figure FDA0000085056140000024
R ∈ [0, M), and from second memory read with
Figure FDA0000085056140000025
Corresponding gray-scale value; According to
Figure FDA0000085056140000026
In rectangular coordinate
Figure FDA0000085056140000027
And the add value obtains array
Figure FDA0000085056140000028
With rectangular coordinate
Figure FDA0000085056140000029
And array
Figure FDA00000850561400000210
In each coordinate element substitution conversion formula obtain rectangular coordinate With
Figure FDA00000850561400000212
Wherein, conversion formula is x 1 = x , y 1 = y , 0 &le; n 1 &le; N / 8 x 1 = y , y 1 = x , N / 8 < n 1 &le; N / 4 x 1 = - y , y 1 = x , N / 4 < n 1 &le; 3 N / 8 x 1 = - x , y 1 = y , 3 N / 8 < n 1 &le; N / 2 x 1 = - x , y 1 = - y , N / 2 < n 1 &le; 5 N / 8 x 1 = - y , y 1 = - x , 5 N / 8 < n 1 &le; 3 N / 4 x 1 = y , y 1 = - x , 3 N / 4 < n 1 &le; 7 N / 8 x 1 = x , y 1 = - y , 7 N / 8 < n 1 < N ;
With rectangular coordinate
Figure FDA0000085056140000032
With
Figure FDA0000085056140000033
Corresponding gray-scale value outputs to video memory together;
With array
Figure FDA0000085056140000034
In each rectangular coordinate respectively with
Figure FDA0000085056140000035
Corresponding gray-scale value outputs to video memory together.
2. the coordinate transformation method in a kind of pulsed radar imaging according to claim 1, it is characterized in that described step s4 is kept at look-up table in the external memorizer of processor, when processor starts, look-up table is copied to the internal memory from external memorizer; First memory among described step s6, the described step s7 and second memory are the on-chip memory of processor.
3. the coordinate transformation method in a kind of pulsed radar imaging according to claim 2 is characterized in that described processor adopting FPGA.
4. the coordinate transformation method in a kind of pulsed radar imaging according to claim 3 is characterized in that described external memorizer adopts NANDFLASH, and described internal memory adopts SDRAM, and described on-chip memory adopts the FIFO storer.
CN 201110241144 2011-08-22 2011-08-22 Coordinate conversion method in pulsed radar imaging Expired - Fee Related CN102313886B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110241144 CN102313886B (en) 2011-08-22 2011-08-22 Coordinate conversion method in pulsed radar imaging

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110241144 CN102313886B (en) 2011-08-22 2011-08-22 Coordinate conversion method in pulsed radar imaging

Publications (2)

Publication Number Publication Date
CN102313886A CN102313886A (en) 2012-01-11
CN102313886B true CN102313886B (en) 2013-04-03

Family

ID=45427214

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110241144 Expired - Fee Related CN102313886B (en) 2011-08-22 2011-08-22 Coordinate conversion method in pulsed radar imaging

Country Status (1)

Country Link
CN (1) CN102313886B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107192988B (en) * 2017-05-17 2019-08-02 中国电子科技集团公司第二十八研究所 A kind of radar hardware scanning changing image grade interpolation goes dead point method
CN115494457A (en) * 2022-09-21 2022-12-20 雷海(南京)信息科技有限公司 Radar terminal scanning transformation dead point removing method, system, storage medium and equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4241412A (en) * 1979-03-16 1980-12-23 Diasonics, Inc. Polar to cartesian mapping apparatus and method
US5530450A (en) * 1995-01-11 1996-06-25 Loral Corporation Radar scan converter for PPI rectangular and PPI offset rectangular modes
US5554992A (en) * 1995-06-05 1996-09-10 Lockheed Martin Corporation Radar scan converter for producing an aggregate radial scan pattern that is a function of hyperbolically-based resolution boundaries
US6140955A (en) * 1998-12-28 2000-10-31 Lockheed Martin Corporation Ruler algorithm for PPI rectangular radar scan converter with staircase line drawing
CN101303409A (en) * 2008-04-16 2008-11-12 深圳市亿威尔信息技术有限公司 Method for positioning radar PPI image pixel and implementing circuit thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4241412A (en) * 1979-03-16 1980-12-23 Diasonics, Inc. Polar to cartesian mapping apparatus and method
US5530450A (en) * 1995-01-11 1996-06-25 Loral Corporation Radar scan converter for PPI rectangular and PPI offset rectangular modes
US5554992A (en) * 1995-06-05 1996-09-10 Lockheed Martin Corporation Radar scan converter for producing an aggregate radial scan pattern that is a function of hyperbolically-based resolution boundaries
US6140955A (en) * 1998-12-28 2000-10-31 Lockheed Martin Corporation Ruler algorithm for PPI rectangular radar scan converter with staircase line drawing
CN101303409A (en) * 2008-04-16 2008-11-12 深圳市亿威尔信息技术有限公司 Method for positioning radar PPI image pixel and implementing circuit thereof

Also Published As

Publication number Publication date
CN102313886A (en) 2012-01-11

Similar Documents

Publication Publication Date Title
CN103226807B (en) For image rotating method and the device of lattice display equipment
CN102313886B (en) Coordinate conversion method in pulsed radar imaging
Awan et al. Underwater image restoration through color correction and UW-Net
WO2022247394A1 (en) Image splicing method and apparatus, and storage medium and electronic device
Huo et al. A high-capacity and high-security image steganography network based on chaotic mapping and generative adversarial networks
Zhang et al. JSH-Net: joint semantic segmentation and height estimation using deep convolutional networks from single high-resolution remote sensing imagery
Li et al. A real-time incremental video mosaic framework for UAV remote sensing
Cortinhal et al. Semantics-aware LiDAR-only pseudo point cloud generation for 3D object detection
Jiang et al. Fast 3d reconstruction of uav images based on neural radiance field
Ngo et al. A symmetric multiprocessor system-on-a-chip-based solution for real-time image dehazing
Fang et al. ModelNet-O: A large-scale synthetic dataset for occlusion-aware point cloud classification
Qin et al. Multi-degradation super-resolution reconstruction for remote sensing images with reconstruction features-guided kernel correction
He et al. A Lightweight CNN Based on Axial Depthwise Convolution and Hybrid Attention for Remote Sensing Image Dehazing
CN100578605C (en) Image rotation processing method, device and multimedia processor
Jang et al. Dual-modality cross-interaction-based hybrid full-frame video stabilization
Chan et al. Regional contextual information modeling for small object detection on highways
CN101908121B (en) Two-dimensional coordinate scanning device for bar code image processing
Yu et al. Lossless reversible data hiding in encrypted image for multiple data hiders based on pixel value order and secret sharing
Kiruluta et al. Novel change detection framework in remote sensing imagery using diffusion models and structural similarity index (SSIM)
Wu et al. Experimental study of ghost imaging in underwater environment
Chang et al. SC-AOF: A sliding camera and asymmetric optical-flow-based blending method for image stitching
Feng et al. Applications of deep learning-based super-resolution networks for AMSR2 Arctic sea ice images
Chen et al. Bathymetry-guided multi-source remote sensing image domain adaptive coral reef benthic habitat classification
Qi et al. Combined multi-level context aggregation and attention mechanism method for photovoltaic panel extraction from high resolution remote sensing images
Dey et al. Pixelator v2: A Novel Perceptual Image Comparison Method with LAB Colour Space and Sobel Edge Detection for Enhanced Security Analysis

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130403

Termination date: 20170822