Progress In Electromagnetics Research B, Vol. 20, , 2010

Size: px
Start display at page:

Download "Progress In Electromagnetics Research B, Vol. 20, , 2010"

Transcription

1 Progress In Eectromagnetics Research B, Vo. 20, , 2010 TARGET-AIDED SAR IMAGE INTELLIGENT COMPRESSION X.-H. Yuan, Z.-D. Zhu, and G. Zhang Coege of Information Science and Technoogy Nanjing University of Aeronautics and Astronautics Nanjing , China Abstract Inteigent compression is important to image transmission in rea time over bandimited channes for synthetic aperture radar (SAR) payoads depoyed on unmanned aeria vehices (UAV), where target areas are encoded with high fideity, whie background data are encoded with esser fideity. A target-aided SAR image inteigent compression (TAIC) system is presented in this paper, which utiizes robust fixed-rate treis-coded quantization (FRTCQ) to encode target sequences and FRTCQ to encode background sequences. Mutiresoution constant fase aarm rate (CFAR) detector in waveet domain using db4 based on the mutiscae mode of target is embedded. Generic region of interest (ROI) mask is created. In order to achieve better quaity of target areas decoded, ROI mask is modified. The improved performance using TAIC system by compressing target chips from training set and testing set in Moving and Stationary Target Acquisition and Recognition (MSTAR) database is demonstrated. 1. INTRODUCTION Synthetic aperture radar (SAR) payoads depoyed on UAV wi pay an important roe in future warfare, because these systems can operate in a weather conditions at any time of day or night and generate images of ground in rea time [1]. The miitary is interested in automatic detecting and recognizing targets from imagery [2 7] to hep image anaysts perform interpretation. UAV can direct imagery data streams to ground station and image anayst through the use of sateite communications. As sensor resoution increased, more than 1 miion pixes/s wi be produced by SAR system, but sateite communication Corresponding author: X.-H. Yuan (cedar@nuaa.edu.cn).

2 286 Yuan, Zhu, and Zhang channes to transmit image data from UAV are bandimited. For exampe, the commerciay avaiabe T 1 is ony about bit/s. Image data must be compressed on-board, then transmitted to the ground stations anaysis by automatic target recognition (ATR) system or by image interpreters to provide critica and timey information to fied commanders. Conventiona image compression agorithms introduce distortion by coding the entire image uniformy which severey degrades the ATR system s performance, not to mention the perceptua quaity of image from anayst [8]. Recent works have been devoted to devising content-based compression agorithm, where target areas are extracted by an externa on-board ATR agorithm and encoded at a higher bit rate than background with vector quantization or variabe ength entropy coding [9, 10]. However, due to the physica imitations of on-board SAR, an efficient automatic target detection agorithm incorporated into encoder is required. Furthermore, both vector quantization and entropy coding are susceptibe to channe errors. Bonneau has proposed an inteigent compression agorithm using an embedded automatic target detector in [11], but it works ony on simuated SAR image. To reaize extreme compression whie maintaining high quaity of target area for further anaysis, we investigate target-aided SAR image inteigent compression (TAIC) system based on Bonneau s. The research presented in this paper is different from others in threefod. First, we use a-pass fitering to ift up the fixed rate treis quantization (FRTCQ) performance curve of a broad cass of sources to the eve of memoryess Gaussian FRTCQ. This method is referred to as robust FRTCQ. Second, unike the method in [11] where apass fitering is impemented on whoe-image, we ony use robust FRTCQ to encode target sequences, which eads to a much ess compex impementation since targets ony occupy sma parts of SAR image. Third, we determine to use db4 waveet for the TAIC system. Generic ROI mask is generated according to the ifting steps of inverse waveet transform. In order to achieve better quaity of target areas decoded, we modify the ROI mask. It is common in practice to take ogarithm of image intensity vaue reducing the high dynamic range compatibe with the human visua system and transforming mutipicative noise into additive noise. Logdetected SAR image is concerned in this paper.

3 Progress In Eectromagnetics Research B, Vo. 20, TARGET-AIDED SAR IMAGE INTELLIGENT COMPRESSION 2.1. System Description The overa Target-aided SAR image inteigent compression system is shown in Fig. 1. High resoution SAR image is first decomposed into 22 subbands using a 2-D discrete waveet transform (DWT). A standard 4-eve dyadic decomposition is performed, with one additiona eve of decomposition being performed on the highest frequency component foowing the first decomposition eve. ROI is determined by mutiresoution detection agorithm. ROI mask is used to cassify the waveet coefficients in each subband into either a target cass or a background cass. For each subband, the DWT coefficients corresponding to the same cass are grouped into sequences; they are normaized by subtracting their mean and divided by their respective standard deviation. Then target sequences are apass fitered being neary Gaussian distribution to be encoded using FRTCQ, and codebooks are designed in one bit increments from 4 to 8 bits/sampe optimized for Gaussian distribution. The background sequences are encoded with FRTCQ directy, and codebooks are designed in one bit increments from 1 to 4 bits/sampe optimized for the Lapacian distribution, which we have found reasonabe [12]. The side information required to encode consists of the mean of sequences in owest frequency, standard deviations of a sequences, ROI ocation, size, and codebook indices. The tota side information consists of 408 bits. This corresponds to bpp for a image. High resoution SAR image targets bpp Backgroud bpp 22 subband Target Mutiresoution mode ROI mask ROIs determined by mutiresoution CFAR encoder target sequences background sequences a-pass fitering statistic normaiztion rate aocation indices for codebook side information (statistic for each sequence) side information( size position for ROI ) TCQ indices for target sequence indices for background sequence channe Figure 1. Target-aided SAR image inteigent compression system.

4 288 Yuan, Zhu, and Zhang 2.2. Robust FRTCQ Compared with many other quantization schemes, TCQ is moderatey robust to channe errors. Fig. 2 shows the obtained signa-to-noise ratio (SNR) of FRTCQ when encoding the memoryess Gaussian, Lapacian, and generaized Gaussian (with shape parameter ν = 0.5) sources at bit rates of 1 4 bits/sampe. Aso shown are the respective rate-distortion functions (R(D)). From the graph, it is evident that the encoded performance of FRTCQ is opposite to that theoreticay possibe as seen from the rate distortion functions. To address this issue, a robust quantization method is utiized where the signa to be quantized is apass fitered to produce a signa with Gaussian statistics. The a-pass fiter is impemented by using a phase scrambing operation. In this way, the performance curves of a Gaussian-optimized quantizer can be achieved with a broad range of source distributions. Thus, a fixed (Gaussian) rate-distortion performance is guaranteed, independent of the source distribution. To demonstrate the effect of a-pass fitering, Fig. 3 shows the normaized histograms of the Generaized Gaussian (ν = 0.5) 65,535 sampes data and phase-scrambing sequence. For comparison, the histogram of same size sampe data derived from a Gaussian pseudo-random number generator is aso shown. The graph justifies the resuting sequence of phase descrambed generaized Gaussian distribution (GGD) as neary Gaussian distribution. Note that the variance of the phase-scrambed GGD sequence is identica to the variance of the origina GGD sequence due to energy preserve transform [13]. SNR(dB) R(D)-GGD R(D)-Lapacian R(D)-Gaussian FTCQ-Gaussian FTCQ-Lapacian FTCQ-GGD Gaussian GGD a-pass fitering bits/sampe Figure 2. SNR performance of FRTCQ quantization for generaized Gaussian sources Figure 3. Normaized histogram of GGD (shape parameter ν = 0.5) and phase scrambed sequence.

5 Progress In Eectromagnetics Research B, Vo. 20, Tabe 1. SNR s (db) of the robust FRTCQ and FRTCQ for memoryess Generaized Gaussian Distribution sources. GGD (ν = 0.5) Gaussian Rate (bits/sampe) FRTCQ Robust FRTCQ FRTCQ The comparison between the resuting SNR performance and those from the non-robust quantizer of GGD source is shown in Tabe 1. The resuts of robust quantizer for memeoryess generaized Gaussian source at encoding rates of 1 4 bits/sampe are identica to those non-robust quantizer for the memoryess Gaussian source. The same is observed at even higher encoding rates. Impementing the a-pass fitering using the phase scrambing method can be efficienty done by using fast Fourier transforms (FFT s). An efficient M-point one-dimensiona (1-D) FFT requires about M og 2 M compex mutipications and additions. The size of the FFT s (and inverse FFT) is seected to be the same as that of target sequences. As the target ony occupies a sma part of image, robust quantization ony to target sequences can ead to a much ess compex impementation since a reativey few of coefficients need be a-pass fitered Mutiresoution CFAR Detection in Waveet Domain Conventiona compression system contains three buiding bocks: transform, quantization, and coding. ROI must be extracted before quantization in proposed compression system. Two-dimensiona discrete waveet transform is appied to a fu resoution SAR image, and ow frequency subbands LL 1, LL 2,..., LL 4 are created. Each of them is normaized by subtracting its mean vaue forming a mutiresoution waveet coefficient image sequence of I 1, I 2,..., I 4. From coarser to finer scaes, the waveet coefficient image vaues can be predicted by using its coarser-scae ancestor, and scae AR (auto-regressive) modes can be written in the form [11]. I(s) = a 1,m(s) I(s γ)+a 2,m(s) I(s γ 2 )+...+a R,m(s) (s)i(s γ R )+w(s) (1) where s has four offspring denoted sα NW, sα NE, sα SE, sα SW and one parent denoted s γ. m denotes scae, and R is the order of the

6 290 Yuan, Zhu, and Zhang regression. m(s) is the scae of s, and a 1,m(s), a 2,m(s),..., a R,m(s) are the rea, scaar-vaued regression coefficients. w(s) is white driving noise. Defining the vector a k = (a 1,k a 2,k... a R,k ), we can characterize a given object (target) in the image first by soving for the autoregressive coefficients, a 1, a 2,..., and a k by east-square approach: [ a k =arg min I(s) a1,k I(s γ)... a R,k I(s γ R ) ] 2 (2) a k R N { s m(s)=k} These regression coefficients are aowed to be scae varying, but restricted to be shift-invariant. The regression ength R may be seected in a manner to that standard AR mode in time series but imited by the eves of waveet decomposition. We can predict the target signa by using these regression coefficients, the residua between the target signa and input is w(s). w(s) = I(s) [ a 1,m(s) I(s γ) a R,m(s) I(s γ R ) ] (3) For og-detected SAR image, homogenous cutter is predominant when targets occupy sma parts, and waveet coefficients in owest frequency subband can be modeed as Gaussian distribution [14], so is the distribution of predict residua w(s). In fact, target areas in predicted residua image are brighter than remains. We now compute a test statistic based on the residua between the predicted coefficient and any given image coefficient as shown in equation ζ(s) = w(s) µ c σ c (4) where µ c is the average of the expected residua for the object mode, and σ c is the standard deviation of those coefficients. For every scae of residua image, target areas appear much brighter than remains. To make our search criteria for a given object more robust, we buid a compicated test statistic c(s) = [ ζ(s) + ζ(s γ) + ζ(s γ 2 ) ζ(s γ N 2 ) ] / N 1 (5) where N is waveet decomposition eves of 4. When the Gaussian c(s) mode is accurate, and the target occupies a sma part, threshod c(s) at vaue of T eads to a per-pixe fase aarm probabiity of P F A = 1 2 erfc ( T 2 ) (6)

7 Progress In Eectromagnetics Research B, Vo. 20, Assuming Q independent pixes per square kiometer, the corresponding fase aarm rate (FA/km 2 ) is F AR = Q 2 erfc ( T 2 ) (7) To evauate the performance of c(s) with different waveet fiters, we test it on the pubic domain MSTAR database. The database contains target and cutter SAR imagery coected at X- band waveengths. The imagery has a resoution of 1 ft in both the range and azimuth directions. The target data from three different target types BMP2, BTR70, and T72 are divided into a training database of 1622 target chips and a testing database of 1365 chips. The database consists of cutter scenes covering approximatey 10 square kiometers of ground. Both the cutter and target data are stored as magnitude detected imagery. Each pixe in the target chip fies is stored as binary 4 bytes foating point vaue, and each pixe in the cutter scene fies is stored as binary unsigned short integer. We transform the magnitude image into og-detected image and compute mutiresoution detection statistic in waveet domain both on target chips and cutter scenes, where target mutiscae mode is buit using 64 images imaged at a different aspect ange (extracting pixes target chip) from confuser zsu-23-4 training set. Using a broad range of threshods, cutter scenes have been processed with prescreening agorithm to extract the goba FAR. Then, the target testing chips have been processed to estimate the same range of threshods. We obtain receiver operating characteristic (ROC) curves, which represent the number of detections potted against the number of fase aarms at various threshod setting. Fig. 4 shows ROC curves for different detectors over the pubic MSTAR database, where CFAR is referred to two-parameter CFAR detector in image domain; others are mutiresoution CFAR detectors in waveet domain with different waveet basis functions. It iustrates performance of c(s) using db4 waveet outperforms others ROI Mask Threshod is determined according to the required FAR. Compared mutiresoution CFAR vaue to the threshod, a binary image is formed, and ROI is extracted after morphoogica processing. In order to identify the waveet coefficients beonging to the ROI or to the background, ROI mask is generated. ROI mask wi be expanded at each eve of decomposition due to fiter expansion [15]; this can be seen from the foowing inverse waveet transform.

8 292 Yuan, Zhu, and Zhang Figure 4. ROC curves over pubic MSTAR database in og-detected domain. x z 2 2 P% z 1 ( ) T s d P( z) z x Figure 5. Poyphase representation of waveet transform Factoring db4 Waveet Transforms into Lifting Steps Factoring db4 waveet transforms into ifting steps can be summarized as foows: 1) Poyphase representing db4 synthesis fiters h and g, we get synthesis poyphase matrix P (z). Db4 waveet is an orthogona base. Inverse transform uses two synthesis fiters h and g. Under the perfect reconstruction condition here we have [16]: h(z) = h 0 +h 1 z 1 +h 2 z 2 +h 3 z 3 +h 4 z 4 +h 5 z 5 +h 6 z 6 +h 7 z 7 (8) g(z) = h 7 z 6 h 6 z 5 + h 5 z 4 h 4 z 3 + h 3 z 2 h 2 z 1 + h 1 h 0 z 1 (9) Poyphase representation of waveet transforms can be iustrated schematicay in Fig. 5. Poyphase representation of synthesis fiters is given by h(z) = h e (z 2 ) + z 1 h o (z 2 ) (10) g(z) = g e (z 2 ) + z 1 g o (z 2 ) (11) where h e contains the even coefficients, and h o contains the odd coefficients.

9 Progress In Eectromagnetics Research B, Vo. 20, Corresponding synthesis poyphase matrix P (z) is [ ] he (z) g P (z) = e (z) h o (z) g o (z) [ ] h0 +h = 2 z 1 +h 4 z 2 +h 6 z 3 h 7 z 3 +h 5 z 2 +h 3 z+h 1 h 1 +h 3 z 1 +h 5 z 2 +h 7 z 3 h 6 z 3 h 4 z 2 (12) h 2 z h 0 2) Using Eucidean agorithm for Laurent poynomia, factor P (z) into ifting steps. P (z) can be factored into ifting steps ( )( )( )( ) (βz P (z)= 1 +β ) (ηz 1 +η ) ( α 1 )( )( 1 (λ3 z 3 + λ 2 z 2 + λ 1 z + λ 0 ) 0 1 (γz 1 +γ ) )( ) k k 1 (13) where coefficients are shown in Tabe 2. 3) Obtain anaysis poyphase matrix P (z 1 ) T ifting steps. Poyphase matrix P (z) is para-unitary, and the anaysis poyphase matrix is factored as P (z 1 ) T = P (z 1 ) T ( )( )( )( ) k 1 = k 1 (λ 3 z 3 +λ 2 z 2 +λ 1 z 1 +λ 0 ) ( )( )( ) 1 α 1 0 (ηz+η ) 1 )( 1 (γz+γ ) (βz+β ) (14) Tabe 2. Coefficients in ifting steps. k λ 0 1 λ λ λ η γ γ β β α

10 294 Yuan, Zhu, and Zhang This corresponds to the foowing impementation for the forward transform: s (1) = x 2 αx 2+1 d (1) = βs (1) +1 + β s (1) + x 2+1 s (2) = s (1) γd (1) +1 γ d (1) d (2) = ηs (2) +1 + η s (2) + d (1) s (3) = s (2) + d (2) d (3) = s (3) + d (2) d (4) = λ 3 s (3) 3 λ 2s (3) 2 λ 1s (3) 1 + s(3) + d (3) s = k 1 1 s(3) d = k 1 d (4) (15) 4) Derive the inverse transform from the forward by running the scheme backward. The inverse transform foows from reversing the operation above: d (4) s (3) = k 1 1 d = k 1 s d (3) = d (4) + λ 3 s (3) 3 + λ 2s (3) 2 + λ 1s (3) 1 s(3) d (2) = s (3) + d (3) s (2) = s (3) d (2) d (1) = d (2) + ηs (2) +1 η s (2) s (1) = s (2) + γd (1) +1 + γ d (1) x 2+1 = d (1) + βs (1) +1 β s (1) x 2 = s (1) + αx 2+1 where s, d are smoothed vaues and detais. (16)

11 Progress In Eectromagnetics Research B, Vo. 20, Generic ROI Mask Substituting corresponding equations in (16) into x 2 and x 2+1, we have x 2 = s s s s s s +2 x s d d d d +3 (17) = s s s s s s s d d d d +3 (18) From the above expressions, we know that the coefficients necessary to reconstruct x(2) and x(2 + 1) are ow frequency subband coefficients L( 3), L( 2), L( 1), L(), L(+1), L(+2), L(+3) and high frequency subband coefficients H(), H( + 1), H( + 2), H( + 3), as shown in Fig. 6. To simpify ROI shape information and aeviate the computation compexity of ROI mask, we specify a rectanguar region associated with the designated ROI. Thus, the identified ROI is bounded by a rectange. For the rectange, ony two positions need be studied, namey the upper eft and ower right corners. A sampes in between the two corners are considered to beong to the mask. Using the usua L () H () x(2 ) Figure 6. The inverse db4 tansform:the coefficients necessary to reconstruct x(2) and x(2 + 1) are L( 3) to L( + 3) and H() to H( + 3), respectivey.

12 296 Yuan, Zhu, and Zhang Tabe 3. ROI mask support. Generic nsup 3 psup 3 hnsup 0 hpsup 3 Modified ensup 2 onsup 2 epsup 0 opsup 2 hensup 0 hepsup 0 honsup 0 hopsup 2 convention that the origin of the subband coordinates occurs at the top-eft corner of the subband, the ROI in the parent subband covered the coefficients between (x 0, y 0 ) and (x 1, y 1 ), then in the new subband it wi cover (x 0, y 0 ) and (x 1, y 1 ), where x 0 = foor(x 0 /2) nsup, x 1 = foor(x 1 /2) + psup, y 0 = foor(y 0 /2) nsup y 1 = foor(y 1 /2) + psup (19) The choice of nsup and psup wi depend on whether the (x i, y i ) (i = 0, 1) is in the ow or the high frequency subband. Let constants nsup (ow, negative support), psup (ow, positive support), hnsup (high, negative support) and hpsup (high, positive support) denote support under the four situations. They are shown in Tabe 3. We assume that the ROI mask of subband HL 1, LH 1 and HH 1 is the same as that of subband LL Modified ROI Mask Athough higher bit rate is given to ROI, coding performance of target area degrades dramaticay if we mask significant waveet coefficient as formua (19). The reason is that the significant coefficients expand too fast even throughout the whoe image. To mitigate the situation above, in anaysis expression (17), (18) we note that each item has different effect on the reconstruction. Since the absoute maximum of the weight coefficient is about 2.0 ( ), the absoute weighting coefficient vaue smaer than 0.1 can be negigibe compared to it. So we ignore the item whose absoute weighting coefficient is smaer than 0.1, and expression

13 Progress In Eectromagnetics Research B, Vo. 20, L () H () x(2 ) Figure 7. To approximatey reconstruct x(2), the coefficients necessary are L( 2) to L() and H(); To approximatey reconstruct x(2 + 1), the coefficients necessary are L( 2) to L( + 2) and H() to H( + 2). (17), (18) are reformuated: x 2 x s s s d (20) s s s s s d d d +2 (21) We modify ROI mask formua (19) according to approximate reconstruction expressions (20), (21). The choice of nsup, psup wi depend on not ony whether (x 0, y 0 ), (x 1, y 1 ) is in the ow or high frequency subband but aso whether the x i, y i (i = 0, 1) vaue is odd or even. Let constants ensup (ow, even, negative support) etc. denote support under the eight situations. As shown in Tabe 3, mask support engths are shrunk after modification. Now ony ow frequency subband coefficients from L( 2) to L() and high subband coefficients H() are needed to approximatey reconstruct x(2), but ow frequency subband coefficients from L( 2) to L( + 2) and high subband coefficients from H() to H( + 2) are needed to approximatey reconstruct x(2 + 1), as show in Fig Rate Aocation The overa bit rates in bits per pixe for the targets and for the background are either provided by the user or determined by some automated means. Given R 1 bpp for the target and R 2 bpp for

14 298 Yuan, Zhu, and Zhang background, rate aocation procedure can be used to aocate rate in rate-distortion optimization sense for target and background sequences separatey. For target sequences, the rate aocation procedure is summarized as foows: 1) Initia λ and λ h, set the bound of bisection research for λ. 2) Computation λ = λ +λ h 2. 3) Chosen rate aocation vector T = (t 1, t 2,..., t M ), so that min M (α i σi 2E i(t i ) + λα i t i ), where σi 2 is the variance of sequence i, i=1 and E i (t i ) denotes the rate-distortion performance at t i bits/sampe. M is the number of data sequences (that is 22), and α i is a weighting coefficient to account for variabiity in sequence ength. 4) Computation T = M α i t i. If T > R 1, set λ = λ; if T < R 1, i=1 set λ h = λ; jump to (2). Rate aocation for background sequences is simiar to the target sequence, ony minor modification needed: R 1 in step (4) must be modified as R RESULTS To iustrate the performance of target-aided image inteigent compression agorithm, we do experiments on HB from BMP2 training set and HB from T72 testing set in MSTAR data base. Fig. 8(a) and Fig. 9(a) show their og-detected images, both of origina magnitude images are 16 bpp. We use a mutiresoution CFAR threshod of 3.84 [17]. Fig. 8(b) and Fig. 9(b) show ROI extracted and their mask. Studies previousy have shown that SAR (a) (b) (c) (d) (e) Figure 8. (a) HB (b) ROI and its mask. (c) TAIC with modified ROI mask (0.135 bpp, 2 bpp for target area). (d) TAIC with generic ROI mask (0.137 bpp, 2 bpp for target area). (e) JPEG2000 agorithm (0.14 bpp).

15 Progress In Eectromagnetics Research B, Vo. 20, imagery can be compressed by 4 : 1 to 8 : 1 without significanty degrading ATR performance [18]. So we give a arger bit rate of target area from 8 bpp to 2 bpp at step 1 bpp, very ow bit rate ony of 0.01 bpp to background data [19] in order to achieve arge compression. We evauate compression system performance by SNR s of target area (pixes corresponding to rectanguar area), which is defined in (22). Performance resuts are incuded in Tabes 4 and 5 at different bit rates. For comparison, the performance resuts of JPEG2000 agorithm are aso incuded. As verified in two tabes, TAIC agorithm shows exceptiona target area coding efficiency, and modified ROI mask enhances the performance. M N g(i, j) 2 i=1 j=1 SNR = 10 og 10 (22) M N [g(i, j) h(i, j)] 2 i=1 j=1 where g(i, j) is pixe vaue at site (i, j) in og-magnitude image, h(i, j) is accordingy decoded vaue, M and N are the dimensions of the image. Figures 8(c), 9(c) show how TAIC agorithm using modified ROI mask performs, and Figs. 8(d), 9(d) show how the TAIC agorithm using generic ROI mask performs. Figures 8(e), 9(e) show the performance of JPEG2000 agorithm. A of them are working at compression ratio 100 (bit rate for target area is 2 bpp). From these figures, we know TAIC agorithm with modified ROI mask outperforms that with generic ROI mask, and either of them performs better than JPEG2k agorithm. Context information (shadow) is preserved, which is usefu for ATR [20]. The computationa compexity of proposed agorithm is mainy determined by the size of image and target. We decompose the image (a) (b) (c) (d) (e) Figure 9. (a) HB (b) ROI and its mask. (c) TAIC with modified ROI mask (0.153 bpp, 2 bpp for target area). (d) TAIC with generic ROI mask (0.159 bpp, 2 bpp for target area). (e) JPEG2000 agorithm (0.14 bpp).

16 300 Yuan, Zhu, and Zhang Tabe 4. SNR of target area comparing our TAIC agorithm and JPEG2000 compression agorithm for HB bpp TAIC Modified ROI Generic ROI JPEG (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) Tabe 5. SNR of target area comparing our TAIC agorithm and JPEG2000 compression agorithm for HB bpp TAIC Modified ROI Generic ROI JPEG (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) (db) up to 4 eves. Mutiresoution target detection agorithm in waveet domain is much simper than two-parameter CFAR detection agorithm in image domain. ROI mask generation is simpe too. The robust quantizer is ony used to encode target sequences and eads to a much ess compex impementation since targets ony occupy sma parts of SAR image. The number of admissibe quantizers for each sequence is aso a sma constant compared to the size of image. Furthermore, the number of iterations for bisection search of a convex curve is reativey sma. Therefore, the tota computationa compexity of our agorithm is O(MN) for an image of size M N. 4. CONCLUSION We have investigated a target-aided SAR image inteigent compression system with a mutiresoution target detection scheme to designate ROIs, where ROIs are encoded with robust FRTCQ, and the remains are encoded with FRTCQ. We have found that mutiresoution CFAR detector using db4 waveet is more reiabe than others. We create generic ROI mask according to the ifting steps of db4 waveet inverse

17 Progress In Eectromagnetics Research B, Vo. 20, transform. To ameiorate the situation that significance coefficients expand too fast, which resuts in that the coding performance of target area degrades dramaticay, we modified ROI mask with respect to the expression of the inverse waveet transform. As coding resuts iustrate, TAIC agorithm performs better than JPEG2k agorithm, and modified ROI mask enhances the target area coding efficiency. The image coder enabes the transmission of very-high-quaity compressed imagery over imited bandwidth noisy channes without need for entropy coding and its associated compexity and susceptibiity to channe errors. The robust quantizer is ony used to encode target sequences which eads to a much ess compex impementation since targets occupy sma parts of SAR image. REFERENCES 1. Chan, Y. K. and V. C. Koo, An introduction to Synthetic Aperture Radar (SAR), Progress In Eectromagnetics Research B, Vo. 2, 27 60, Li, N.-J., C.-F. Hu, L.-X. Zhang, and J.-D. Xu, Overview of RCS extrapoation techniques to aircraft targets, Progress In Eectromagnetics Research B, Vo. 9, , Zou, B., H. Cai, L. Zhang, and M. Lin, Mode of man-made target beneath foiage using poinsar, Progress In Eectromagnetics Research Letters, Vo. 2, 21 28, Xue, W. and X.-W. Sun, Target detection of vehice voume detecting radar based on wigner-hough transform, Journa of Eectromagnetic Waves and Appications, Vo. 21, No. 11, , Lee, J. H. and H. T. Kim, Radar target discrimination using transient response reconstruction, Journa of Eectromagnetic Waves and Appications, Vo. 19, No. 5, , Jung, J. H., H. T. Kim, and K. T. Kim, Comparisons of four feature extraction approaches based on Fisher s inear discriminant criterion in radar target recognition, Journa of Eectromagnetic Waves and Appications, Vo. 21, No. 2, , Seo, D.-K., K. T. Kim, I. S. Choi, and H. T. Kim, Wideange radar target recognition with subcass concept, Progress In Eectromagnetics Research, PIER 44, , Aan, C., M. Kristo, L. Austin, and L. Margaret, A compression of detected SAR imagery with JPEG2000, SPIE, Vo. 4115, , 2000.

18 302 Yuan, Zhu, and Zhang 9. Zhang, J., Y. Huang, and H. Tian, SAR image compression based on image decomposing and targets extracting, 1st Asian and Pacific Conference on Synthetic Aperture Radar Proceedings, , Venkatraman, M., H. Kwon, and N. M. Nasrabadi, Objectbased SAR image compression using vector quantization, IEEE Transactions on Aerospace and Eectronic Systems, Vo. 36, No. 4, , Bonneau, R. and G. Abouseman, Target-aided fixed-quaity-ofservice compression of SAR imagery for transmission over noisy wireess channes, ICASSP 02, Vo. 4, IV-3413 IV-3416, Tanabe, N. and N. Farvardin, Subband image coding using entropy coded quantization over noisy channes, IEEE Journa Seect. Areas Commun., Vo. 10, , Abouseman, G. P., Waveet-based hyperspectra image coding using robust fixed-rate treis-coded quantization, SPIE, Vo. 3372, 74 85, Birney, K. and T. Fishcher, On the modeing of DCT and subband image data for compression, IEEE Transactions on Image Processing, Vo. 4, No. 2, , Park, K.-H. and H. W. Park, Region-of-interest coding based on set partioning in hierarchica trees, IEEE Transaction on Circuits and Systems for Video Technoogy, Vo. 12, No. 2, , Daubechies, I. and W. Swedens, Factoring waveet transforms into ifting steps, The Journa of Fourier Anaysis and Appications, Vo. 4, No. 3, , Novak, L. and S. Owirka, Effects of poarization and resoution on SAR ATR, IEEE Transactions on Aerospace and Eectronic Systems, Vo. 33, No. 1, , Gorman, J. D., Assessing the impact of image compression on SAR automatic target detection and cueing, Radar Conference, , Kim, A. and H. Krim, Hierarchica stochastic modeing of SAR imagery for segmentation/compression, IEEE Transaction on Signa Processing, Vo. 47, No. 2, , Lombardom, P., M. Sciotti, and L. M. Kapan, SAR prescreening using both target and shadow information, IEEE Radar Conference, , Atanta, USA, 2001.

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

A Robust Voice Activity Detection based on Noise Eigenspace Projection

A Robust Voice Activity Detection based on Noise Eigenspace Projection A Robust Voice Activity Detection based on Noise Eigenspace Projection Dongwen Ying 1, Yu Shi 2, Frank Soong 2, Jianwu Dang 1, and Xugang Lu 1 1 Japan Advanced Institute of Science and Technoogy, Nomi

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

Fast Blind Recognition of Channel Codes

Fast Blind Recognition of Channel Codes Fast Bind Recognition of Channe Codes Reza Moosavi and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the origina artice. 213 IEEE. Persona use of this materia is permitted.

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK

ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK ESTIMATION OF SAMPLING TIME MISALIGNMENTS IN IFDMA UPLINK Aexander Arkhipov, Michae Schne German Aerospace Center DLR) Institute of Communications and Navigation Oberpfaffenhofen, 8224 Wessing, Germany

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient

More information

SydU STAT3014 (2015) Second semester Dr. J. Chan 18

SydU STAT3014 (2015) Second semester Dr. J. Chan 18 STAT3014/3914 Appied Stat.-Samping C-Stratified rand. sampe Stratified Random Samping.1 Introduction Description The popuation of size N is divided into mutuay excusive and exhaustive subpopuations caed

More information

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA) 1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

Approach to Identifying Raindrop Vibration Signal Detected by Optical Fiber

Approach to Identifying Raindrop Vibration Signal Detected by Optical Fiber Sensors & Transducers, o. 6, Issue, December 3, pp. 85-9 Sensors & Transducers 3 by IFSA http://www.sensorsporta.com Approach to Identifying Raindrop ibration Signa Detected by Optica Fiber ongquan QU,

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

Improved Min-Sum Decoding of LDPC Codes Using 2-Dimensional Normalization

Improved Min-Sum Decoding of LDPC Codes Using 2-Dimensional Normalization Improved Min-Sum Decoding of LDPC Codes sing -Dimensiona Normaization Juntan Zhang and Marc Fossorier Department of Eectrica Engineering niversity of Hawaii at Manoa Honouu, HI 968 Emai: juntan, marc@spectra.eng.hawaii.edu

More information

Target Location Estimation in Wireless Sensor Networks Using Binary Data

Target Location Estimation in Wireless Sensor Networks Using Binary Data Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344

More information

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

Melodic contour estimation with B-spline models using a MDL criterion

Melodic contour estimation with B-spline models using a MDL criterion Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex

More information

BICM Performance Improvement via Online LLR Optimization

BICM Performance Improvement via Online LLR Optimization BICM Performance Improvement via Onine LLR Optimization Jinhong Wu, Mostafa E-Khamy, Jungwon Lee and Inyup Kang Samsung Mobie Soutions Lab San Diego, USA 92121 Emai: {Jinhong.W, Mostafa.E, Jungwon2.Lee,

More information

Componentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems

Componentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

Traffic data collection

Traffic data collection Chapter 32 Traffic data coection 32.1 Overview Unike many other discipines of the engineering, the situations that are interesting to a traffic engineer cannot be reproduced in a aboratory. Even if road

More information

Multi-Scale Analysis of Long Range Dependent Traffic for Anomaly Detection in Wireless Sensor Networks

Multi-Scale Analysis of Long Range Dependent Traffic for Anomaly Detection in Wireless Sensor Networks 20 50th IEEE Conference on Decision and Contro and European Contro Conference (CDC-ECC) Orando FL USA December 2-5 20 Muti-Scae Anaysis of Long Range Dependent Traffic for Anomay Detection in Wireess Sensor

More information

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017 In-pane shear stiffness of bare stee deck through she finite eement modes G. Bian, B.W. Schafer June 7 COLD-FORMED STEEL RESEARCH CONSORTIUM REPORT SERIES CFSRC R-7- SDII Stee Diaphragm Innovation Initiative

More information

Study on Fusion Algorithm of Multi-source Image Based on Sensor and Computer Image Processing Technology

Study on Fusion Algorithm of Multi-source Image Based on Sensor and Computer Image Processing Technology Sensors & Transducers 3 by IFSA http://www.sensorsporta.com Study on Fusion Agorithm of Muti-source Image Based on Sensor and Computer Image Processing Technoogy Yao NAN, Wang KAISHENG, 3 Yu JIN The Information

More information

A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS

A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS A GENERAL METHOD FOR EVALUATING OUTAGE PROBABILITIES USING PADÉ APPROXIMATIONS Jack W. Stokes, Microsoft Corporation One Microsoft Way, Redmond, WA 9852, jstokes@microsoft.com James A. Ritcey, University

More information

WATERMARKING BASED ON THE HYPERANALYTIC WAVELET TRANSFORM

WATERMARKING BASED ON THE HYPERANALYTIC WAVELET TRANSFORM Voume 49, Number, 8 Eectronics and Teecommunications WATERMARKING BASED ON THE HYPERANALYTIC WAVELET TRANSFORM Corina NAFORNITA Aeandru ISAR Eectronics and Communications Facuty, Poitehnica University,

More information

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

Effective Appearance Model and Similarity Measure for Particle Filtering and Visual Tracking

Effective Appearance Model and Similarity Measure for Particle Filtering and Visual Tracking Effective Appearance Mode and Simiarity Measure for Partice Fitering and Visua Tracking Hanzi Wang David Suter and Konrad Schinder Institute for Vision Systems Engineering Department of Eectrica and Computer

More information

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM

DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

More information

Seasonal Time Series Data Forecasting by Using Neural Networks Multiscale Autoregressive Model

Seasonal Time Series Data Forecasting by Using Neural Networks Multiscale Autoregressive Model American ourna of Appied Sciences 7 (): 372-378, 2 ISSN 546-9239 2 Science Pubications Seasona Time Series Data Forecasting by Using Neura Networks Mutiscae Autoregressive Mode Suhartono, B.S.S. Uama and

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

International Journal of Mass Spectrometry

International Journal of Mass Spectrometry Internationa Journa of Mass Spectrometry 280 (2009) 179 183 Contents ists avaiabe at ScienceDirect Internationa Journa of Mass Spectrometry journa homepage: www.esevier.com/ocate/ijms Stark mixing by ion-rydberg

More information

Computing Spherical Transform and Convolution on the 2-Sphere

Computing Spherical Transform and Convolution on the 2-Sphere Computing Spherica Transform and Convoution on the 2-Sphere Boon Thye Thomas Yeo ythomas@mit.edu May, 25 Abstract We propose a simpe extension to the Least-Squares method of projecting sampes of an unknown

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

CONCHOID OF NICOMEDES AND LIMACON OF PASCAL AS ELECTRODE OF STATIC FIELD AND AS WAVEGUIDE OF HIGH FREQUENCY WAVE

CONCHOID OF NICOMEDES AND LIMACON OF PASCAL AS ELECTRODE OF STATIC FIELD AND AS WAVEGUIDE OF HIGH FREQUENCY WAVE Progress In Eectromagnetics Research, PIER 30, 73 84, 001 CONCHOID OF NICOMEDES AND LIMACON OF PASCAL AS ELECTRODE OF STATIC FIELD AND AS WAVEGUIDE OF HIGH FREQUENCY WAVE W. Lin and Z. Yu University of

More information

The influence of temperature of photovoltaic modules on performance of solar power plant

The influence of temperature of photovoltaic modules on performance of solar power plant IOSR Journa of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vo. 05, Issue 04 (Apri. 2015), V1 PP 09-15 www.iosrjen.org The infuence of temperature of photovotaic modues on performance

More information

Multiple Beam Interference

Multiple Beam Interference MutipeBeamInterference.nb James C. Wyant 1 Mutipe Beam Interference 1. Airy's Formua We wi first derive Airy's formua for the case of no absorption. ü 1.1 Basic refectance and transmittance Refected ight

More information

Some Measures for Asymmetry of Distributions

Some Measures for Asymmetry of Distributions Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria

More information

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance

Radar/ESM Tracking of Constant Velocity Target : Comparison of Batch (MLE) and EKF Performance adar/ racing of Constant Veocity arget : Comparison of Batch (LE) and EKF Performance I. Leibowicz homson-csf Deteis/IISA La cef de Saint-Pierre 1 Bd Jean ouin 7885 Eancourt Cede France Isabee.Leibowicz

More information

Packet Fragmentation in Wi-Fi Ad Hoc Networks with Correlated Channel Failures

Packet Fragmentation in Wi-Fi Ad Hoc Networks with Correlated Channel Failures Packet Fragmentation in Wi-Fi Ad Hoc Networks with Correated Channe Faiures Andrey Lyakhov Vadimir Vishnevsky Institute for Information Transmission Probems of RAS B. Karetny 19, Moscow, 127994, Russia

More information

Haar Decomposition and Reconstruction Algorithms

Haar Decomposition and Reconstruction Algorithms Jim Lambers MAT 773 Fa Semester 018-19 Lecture 15 and 16 Notes These notes correspond to Sections 4.3 and 4.4 in the text. Haar Decomposition and Reconstruction Agorithms Decomposition Suppose we approximate

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE Yury Iyushin and Anton Mokeev Saint-Petersburg Mining University, Vasiievsky Isand, 1 st ine, Saint-Petersburg,

More information

Color Seamlessness in Multi-Projector Displays using Constrained Gamut Morphing

Color Seamlessness in Multi-Projector Displays using Constrained Gamut Morphing Coor Seamessness in Muti-Projector Dispays using Constrained Gamut Morphing IEEE Transactions on Visuaization and Computer Graphics, Vo. 15, No. 6, 2009 Behzad Sajadi, Maxim Lazarov, Aditi Majumder, and

More information

Polar Snakes: a fast and robust parametric active contour model

Polar Snakes: a fast and robust parametric active contour model Poar Snakes: a fast and robust parametric active contour mode Christophe Coewet To cite this version: Christophe Coewet. Poar Snakes: a fast and robust parametric active contour mode. IEEE Int. Conf. on

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

Centralized Coded Caching of Correlated Contents

Centralized Coded Caching of Correlated Contents Centraized Coded Caching of Correated Contents Qianqian Yang and Deniz Gündüz Information Processing and Communications Lab Department of Eectrica and Eectronic Engineering Imperia Coege London arxiv:1711.03798v1

More information

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,

More information

Wavelet Methods for Time Series Analysis. Wavelet-Based Signal Estimation: I. Part VIII: Wavelet-Based Signal Extraction and Denoising

Wavelet Methods for Time Series Analysis. Wavelet-Based Signal Estimation: I. Part VIII: Wavelet-Based Signal Extraction and Denoising Waveet Methods for Time Series Anaysis Part VIII: Waveet-Based Signa Extraction and Denoising overview of key ideas behind waveet-based approach description of four basic modes for signa estimation discussion

More information

Higher dimensional PDEs and multidimensional eigenvalue problems

Higher dimensional PDEs and multidimensional eigenvalue problems Higher dimensiona PEs and mutidimensiona eigenvaue probems 1 Probems with three independent variabes Consider the prototypica equations u t = u (iffusion) u tt = u (W ave) u zz = u (Lapace) where u = u

More information

Soft Clustering on Graphs

Soft Clustering on Graphs Soft Custering on Graphs Kai Yu 1, Shipeng Yu 2, Voker Tresp 1 1 Siemens AG, Corporate Technoogy 2 Institute for Computer Science, University of Munich kai.yu@siemens.com, voker.tresp@siemens.com spyu@dbs.informatik.uni-muenchen.de

More information

Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR

Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SIR 1 Maximizing Sum Rate and Minimizing MSE on Mutiuser Downink: Optimaity, Fast Agorithms and Equivaence via Max-min SIR Chee Wei Tan 1,2, Mung Chiang 2 and R. Srikant 3 1 Caifornia Institute of Technoogy,

More information

HYDROGEN ATOM SELECTION RULES TRANSITION RATES

HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOING PHYSICS WITH MATLAB QUANTUM PHYSICS Ian Cooper Schoo of Physics, University of Sydney ian.cooper@sydney.edu.au HYDROGEN ATOM SELECTION RULES TRANSITION RATES DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS

More information

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

Interconnect effects on performance of Field Programmable Analog Array

Interconnect effects on performance of Field Programmable Analog Array nterconnect effects on performance of Fied Programmabe Anaog Array D. Anderson,. Bir, O. A. Pausinsi 3, M. Spitz, K. Reiss Motoroa, SPS, Phoenix, Arizona, USA, University of Karsruhe, Karsruhe, Germany,

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

MVS. Multichannel Verification System

MVS. Multichannel Verification System MVS Mutichanne Verification System Increase iquid handing quaity with easy, reiabe performance verification. Are your iquid handers transferring critica voumes accuratey and precisey? Woud you know if

More information

Wavelet shrinkage estimators of Hilbert transform

Wavelet shrinkage estimators of Hilbert transform Journa of Approximation Theory 163 (2011) 652 662 www.esevier.com/ocate/jat Fu ength artice Waveet shrinkage estimators of Hibert transform Di-Rong Chen, Yao Zhao Department of Mathematics, LMIB, Beijing

More information

Supporting Information for Suppressing Klein tunneling in graphene using a one-dimensional array of localized scatterers

Supporting Information for Suppressing Klein tunneling in graphene using a one-dimensional array of localized scatterers Supporting Information for Suppressing Kein tunneing in graphene using a one-dimensiona array of ocaized scatterers Jamie D Was, and Danie Hadad Department of Chemistry, University of Miami, Cora Gabes,

More information

An Information Geometrical View of Stationary Subspace Analysis

An Information Geometrical View of Stationary Subspace Analysis An Information Geometrica View of Stationary Subspace Anaysis Motoaki Kawanabe, Wojciech Samek, Pau von Bünau, and Frank C. Meinecke Fraunhofer Institute FIRST, Kekuéstr. 7, 12489 Berin, Germany Berin

More information

Global sensitivity analysis using low-rank tensor approximations

Global sensitivity analysis using low-rank tensor approximations Goba sensitivity anaysis using ow-rank tensor approximations K. Konaki 1 and B. Sudret 1 1 Chair of Risk, Safety and Uncertainty Quantification, arxiv:1605.09009v1 [stat.co] 29 May 2016 ETH Zurich, Stefano-Franscini-Patz

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Formulas for Angular-Momentum Barrier Factors Version II

Formulas for Angular-Momentum Barrier Factors Version II BNL PREPRINT BNL-QGS-06-101 brfactor1.tex Formuas for Anguar-Momentum Barrier Factors Version II S. U. Chung Physics Department, Brookhaven Nationa Laboratory, Upton, NY 11973 March 19, 2015 abstract A

More information

Paragraph Topic Classification

Paragraph Topic Classification Paragraph Topic Cassification Eugene Nho Graduate Schoo of Business Stanford University Stanford, CA 94305 enho@stanford.edu Edward Ng Department of Eectrica Engineering Stanford University Stanford, CA

More information

FORECASTING TELECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODELS

FORECASTING TELECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODELS FORECASTING TEECOMMUNICATIONS DATA WITH AUTOREGRESSIVE INTEGRATED MOVING AVERAGE MODES Niesh Subhash naawade a, Mrs. Meenakshi Pawar b a SVERI's Coege of Engineering, Pandharpur. nieshsubhash15@gmai.com

More information

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu

More information

arxiv: v1 [cs.ds] 12 Nov 2018

arxiv: v1 [cs.ds] 12 Nov 2018 Quantum-inspired ow-rank stochastic regression with ogarithmic dependence on the dimension András Giyén 1, Seth Loyd Ewin Tang 3 November 13, 018 arxiv:181104909v1 [csds] 1 Nov 018 Abstract We construct

More information

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection FFTs in Graphics and Vision Spherica Convoution and Axia Symmetry Detection Outine Math Review Symmetry Genera Convoution Spherica Convoution Axia Symmetry Detection Math Review Symmetry: Given a unitary

More information

Inductive Bias: How to generalize on novel data. CS Inductive Bias 1

Inductive Bias: How to generalize on novel data. CS Inductive Bias 1 Inductive Bias: How to generaize on nove data CS 478 - Inductive Bias 1 Overfitting Noise vs. Exceptions CS 478 - Inductive Bias 2 Non-Linear Tasks Linear Regression wi not generaize we to the task beow

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

TWO DISTRIBUTED ALGORITHMS FOR THE DECONVOLUTION OF LARGE RADIO-INTERFEROMETRIC MULTISPECTRAL IMAGES

TWO DISTRIBUTED ALGORITHMS FOR THE DECONVOLUTION OF LARGE RADIO-INTERFEROMETRIC MULTISPECTRAL IMAGES WO DISRIBUED ALGORIHMS FOR HE DECONVOLUION OF LARGE RADIO-INERFEROMERIC MULISPECRAL IMAGES Céine Meiier, Pasca Bianchi, Waid Hachem LCI, CNRS, eecom Paristech, Université Paris-Sacay, 73, Paris, France

More information

Emmanuel Abbe Colin Sandon

Emmanuel Abbe Colin Sandon Detection in the stochastic bock mode with mutipe custers: proof of the achievabiity conjectures, acycic BP, and the information-computation gap Emmanue Abbe Coin Sandon Abstract In a paper that initiated

More information

How the backpropagation algorithm works Srikumar Ramalingam School of Computing University of Utah

How the backpropagation algorithm works Srikumar Ramalingam School of Computing University of Utah How the backpropagation agorithm works Srikumar Ramaingam Schoo of Computing University of Utah Reference Most of the sides are taken from the second chapter of the onine book by Michae Nieson: neuranetworksanddeepearning.com

More information

Appendix A: MATLAB commands for neural networks

Appendix A: MATLAB commands for neural networks Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');

More information

Two Kinds of Parabolic Equation algorithms in the Computational Electromagnetics

Two Kinds of Parabolic Equation algorithms in the Computational Electromagnetics Avaiabe onine at www.sciencedirect.com Procedia Engineering 9 (0) 45 49 0 Internationa Workshop on Information and Eectronics Engineering (IWIEE) Two Kinds of Paraboic Equation agorithms in the Computationa

More information

TRAVEL TIME ESTIMATION FOR URBAN ROAD NETWORKS USING LOW FREQUENCY PROBE VEHICLE DATA

TRAVEL TIME ESTIMATION FOR URBAN ROAD NETWORKS USING LOW FREQUENCY PROBE VEHICLE DATA TRAVEL TIME ESTIMATIO FOR URBA ROAD ETWORKS USIG LOW FREQUECY PROBE VEHICLE DATA Erik Jeneius Corresponding author KTH Roya Institute of Technoogy Department of Transport Science Emai: erik.jeneius@abe.kth.se

More information

Reconstructions that Combine Cell Average Interpolation with Least Squares Fitting

Reconstructions that Combine Cell Average Interpolation with Least Squares Fitting App Math Inf Sci, No, 7-84 6) 7 Appied Mathematics & Information Sciences An Internationa Journa http://dxdoiorg/8576/amis/6 Reconstructions that Combine Ce Average Interpoation with Least Squares Fitting

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

Multilayer Kerceptron

Multilayer Kerceptron Mutiayer Kerceptron Zotán Szabó, András Lőrincz Department of Information Systems, Facuty of Informatics Eötvös Loránd University Pázmány Péter sétány 1/C H-1117, Budapest, Hungary e-mai: szzoi@csetehu,

More information

Limited magnitude error detecting codes over Z q

Limited magnitude error detecting codes over Z q Limited magnitude error detecting codes over Z q Noha Earief choo of Eectrica Engineering and Computer cience Oregon tate University Corvais, OR 97331, UA Emai: earief@eecsorstedu Bea Bose choo of Eectrica

More information

A Land Cover Mapping Algorithm Based on a Level Set Method

A Land Cover Mapping Algorithm Based on a Level Set Method Kasetsart J. (Nat. Sci.) 47 : 953-966 (03) A Land Cover Mapping Agorithm Based on a Leve Set Method eerasit Kasetkasem, *, Settaporn Sriwiai, hitiporn Chanwimauang and suyoshi Isshiki 3 Abstract A nove

More information

Utilization of multi-dimensional sou correlation in multi-dimensional sin check codes. Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad

Utilization of multi-dimensional sou correlation in multi-dimensional sin check codes. Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad JAIST Reposi https://dspace.j Tite Utiization of muti-dimensiona sou correation in muti-dimensiona sin check codes Izhar, Mohd Azri Mohd; Zhou, Xiaobo; Author(s) Tad Citation Teecommunication Systems,

More information

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes

12.2. Maxima and Minima. Introduction. Prerequisites. Learning Outcomes Maima and Minima 1. Introduction In this Section we anayse curves in the oca neighbourhood of a stationary point and, from this anaysis, deduce necessary conditions satisfied by oca maima and oca minima.

More information

Worst Case Analysis of the Analog Circuits

Worst Case Analysis of the Analog Circuits Proceedings of the 11th WSEAS Internationa Conference on CIRCUITS, Agios Nikoaos, Crete Isand, Greece, Juy 3-5, 7 9 Worst Case Anaysis of the Anaog Circuits ELENA NICULESCU*, DORINA-MIOARA PURCARU* and

More information

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees

Improving the Accuracy of Boolean Tomography by Exploiting Path Congestion Degrees Improving the Accuracy of Booean Tomography by Expoiting Path Congestion Degrees Zhiyong Zhang, Gaoei Fei, Fucai Yu, Guangmin Hu Schoo of Communication and Information Engineering, University of Eectronic

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

Path planning with PH G2 splines in R2

Path planning with PH G2 splines in R2 Path panning with PH G2 spines in R2 Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru To cite this version: Laurent Gajny, Richard Béarée, Eric Nyiri, Oivier Gibaru. Path panning with PH G2 spines

More information