Ping Zhang, Zhen Li,Jianmin Zhou, Quan Chen, Bangsen Tian

Slides:



Advertisements
Similar presentations
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Advertisements

Shapelets Correlated with Surface Normals Produce Surfaces Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
10.1 fourier analysis of signals using the DFT 10.2 DFT analysis of sinusoidal signals 10.3 the time-dependent fourier transform Chapter 10 fourier analysis.
Thursday, October 12, Fourier Transform (and Inverse Fourier Transform) Last Class How to do Fourier Analysis (IDL, MATLAB) What is FFT?? What about.
Let’s go back to this problem: We take N samples of a sinusoid (or a complex exponential) and we want to estimate its amplitude and frequency by the FFT.
Fourier series With coefficients:. Complex Fourier series Fourier transform (transforms series from time to frequency domain) Discrete Fourier transform.
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Digital Signal Processing
EE4H, M.Sc Computer Vision Dr. Mike Spann
Multiplicative Mismatched Filters for Barker Codes
Course 2007-Supplement Part 11 NTSC (1) NTSC: 2:1 interlaced, 525 lines per frame, 60 fields per second, and 4:3 aspect ratio horizontal sweep frequency,
Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Ninth Synthesis Imaging Summer School Socorro, June 15-22, 2004 Cross Correlators Walter Brisken.
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Basic Image Processing January 26, 30 and February 1.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Despeckle Filtering in Medical Ultrasound Imaging
Chapter 4: Sampling of Continuous-Time Signals
FT Representation of DT Signals:
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Discrete-Time and System (A Review)
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
DTFT And Fourier Transform
GCT731 Fall 2014 Topics in Music Technology - Music Information Retrieval Overview of MIR Systems Audio and Music Representations (Part 1) 1.
Presentation Image Filters
The Wavelet Tutorial: Part3 The Discrete Wavelet Transform
CSC361/661 Digital Media Spring 2002
Medical Image Analysis Image Enhancement Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
1/ , Graz, Austria Power Spectral Density of Convolutional Coded Pulse Interval Modulation Z. Ghassemlooy, S. K. Hashemi and M. Amiri Optical Communications.
By Sarita Jondhale1 Signal Processing And Analysis Methods For Speech Recognition.
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
Advanced Digital Signal Processing
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Digital Image Processing Lecture 10: Image Restoration
Vibrationdata 1 Unit 6a The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Fourier Transform.
Two-Dimensional Filters Digital Image Processing Instructor: Dr. Cheng-Chien LiuCheng-Chien Liu Department of Earth Sciences National Cheng Kung University.
2D Fourier Transform.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
M.P. Rupen, Synthesis Imaging Summer School, 18 June Cross Correlators Michael P. Rupen NRAO/Socorro.
Digital Signal Processing Lecture 6 Frequency Selective Filters
LFM Pulse Compression Sidelobe Reduction Techniques
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
DISPLACED PHASE CENTER ANTENNA SAR IMAGING BASED ON COMPRESSED SENSING Yueguan Lin 1,2,3, Bingchen Zhang 1,2, Wen Hong 1,2 and Yirong Wu 1,2 1 National.
Chapter 4 Discrete-Time Signals and transform
Medical Image Analysis
Miguel Tavares Coimbra
Fourier series With coefficients:.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
Unit 5 The Fourier Transform.
Image Enhancement in the
ENG4BF3 Medical Image Processing
Sampling and the Discrete Fourier Transform
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Basic Image Processing
8.6 Autocorrelation instrument, mathematical definition, and properties autocorrelation and Fourier transforms cosine and sine waves sum of cosines Johnson.
Combination of Feature and Channel Compensation (1/2)
Presentation transcript:

Ping Zhang, Zhen Li,Jianmin Zhou, Quan Chen, Bangsen Tian A NEW SAR SUPERRESOLUTION IMAGING ALGORITHM BASED ON ADAPTIVE SIDELOBE REDUCTION Ping Zhang, Zhen Li,Jianmin Zhou, Quan Chen, Bangsen Tian Center for Earth Observation and Digital Earth Chinese Academy of Sciences

Outlines Problem with weighting in SAR 2D ASR method Resolution Enhancement algorithm Based on ASR Results and Analysis Conclusion

Impact of Weighting SAR imagery based on conventional Fourier transform (FT) techniques often requires sidelobe control for the high sidelobes. It has traditionally been accomplished by using window functions such as Taylor, Hanning, Hamming, etc. -80 -60 -40 -20 20 40 60 80 -70 -50 -30 -10 dB Rect Hamming Hanning Blackman However, the lower sidelobes have been achieved at the expense of broadening the mainlobe width, i.e. it degrades the image resolution.

ASR Method DeGraaf S.R. proposed ASR method to suppress sidelobes, which is a nonlinear operator based on cosine-on-pedestal frequency domain weighting functions, accomplished on a pixel-by-pixel basis which allows each pixel in an image to receive its own frequency domain aperture amplitude weighting function from a continuum of possible weighting functions. ASR can effectively suppress sidelobes induced by finite-aperture without broadening the mainlobe of the impulse response. ASR takes advantage of the fact that cosine-on-pedestal weighting functions can be implemented as a multi-point convolution on a Nyquist sampled image.

2D ASR Method The weight function of 2D ASR method is as follow Where is weight coefficient, M is the order of weight coefficients, , is the number of signal samples within the signal bandwidth, , is the oversample number.

2D ASR Method The signal model can be expressed in frequency filed: The signal in time filed is rewritten as

2D ASR Method Where: Let , to be oversample factor can be expressed

2D ASR Method The main idea of ASR is that if the signal sample is sidelobe, it can be identified by the data samples around it, and suppressed using the weights. The optical weights can be obtained by minimizing the output energy of filter. Generally if the oversample factor is noninteger, the signal should be upsample to integer sample number to make the weights efficient.

2D ASR Method The choice of optical weights is derived as followed. Rewrite the time filed signal in matric form In order to enhance the weights degree of freedom, we process the real component and imaginary component of SLC image partly Let and .

2D ASR Method The output of the filter becomes Minimize the output energy of the filter,

2D ASR Method Then we obtain the weights

2D ASR Method In order to obtain the efficient output, consider the norm and norm constraint on the weights, where the parameter in norm and parameter in norm can be adjusted.

Resolution Enhancement algorithm Based on ASR After range direction compression, the time field signal is Sinc function. If the image is integer Nyquist sampled, ASR is then applied to the image domain samples to remove the sidelobes directly. Otherwise the image should be upsampled to integer Nyquist sampled image. Since ASR is a nonlinear operation, the resultant image is no longer band-limited after such processing. When performing an inverse FFT to the ASR image, the resultant Fourier spectral domain data will have greater extent than the original data.

Resolution Enhancement algorithm Based on ASR The nonlinear ASR operation increases the original bandwidth, but introduces a magnitude taper that includes nulls. For an ideal point scatter, this taper corresponds to the FFT of a Sinc mainlobe. An inverse Hamming weight is then applied to equalize the magnitude taper over an aperture to smooth the ASR spectrum in order to approach to the spectrum shape of ideal point target. ASR operation is finally applied to the bandwidth extrapolated Fourier spectral data to obtain a sidelobe reduction image.

Resolution Enhancement algorithm Based on ASR The steps of the algorithm are shown in the following

Results and Analysis Figures show the results of simulated point scatter using different methods. (a) is the unwindowed Fourier image. (b) is the imaging result using the paper’s method. The resolution enhancement can be shown obviously and sidelobes are also suppressed very well. (a) (b)

Azimuth resolution(m) Results and Analysis Table is the performance compared between the conventional method and the paper’s method. We can easily see the improvement in resolution, peak sidelobe ratio (PSLR) and integral sidelobe ratio (ISLR) in two directions. Performance Index Fourier Method Paper’s Method Range resolution(m) 1.0544 0.7983 Range PSLR(dB) -13.4213 -26.9950 Range ISLR(dB) -10.1341 -24.2225 Azimuth resolution(m) 1.1044 0.8270 Azimuth PSLR(dB) -12.3295 -24.3613 Azimuth ISLR(dB) -8.9495 -22.0205

Results and Analysis Figures show the result of SIR-C data using different methods. The data is obtained in 1994 of some city in Taiwan, which data process number is 51581. (a) RD Method (b) The Paper’s Method Compared the two figures, we can see the river edge is clearer in (b). From the middle white circle, the targets docked at the land can be distinguished easily in (b). So the resolution can be enhanced obviously and sidelobes can also be suppressed very well.

Conclusion The paper provides an efficient extrapolation algorithm to enhance resolution as well as reduce sidelobes, which is based on ASR. The processing of algorithm is simple to operate. Simulation experiments show the validity of the algorithm. Comparing to the Fourier method, the proposed algorithm obtains better results. The image characteristics after the processing of the paper’s method should be analyzed in the future.