/06/$ IEEE 364
|
|
- Randolf Potter
- 5 years ago
- Views:
Transcription
1 006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, Abtract We preent a new method of etimating noie variance. The method i applicable for D and D ignal proceing. The eence of thi method i etimation of the catter of normally ditributed data with high level of outlier. The method i applicable to data with the majority of the data point having no ignal preent. The method i baed on the hortet half ample method. The mean of the hortet half ample (horth and the location of the leat median of quare are among the mot robut meaure of the location of the mode. The length of the hortet half ample ha been ued a the meaurement of the data catter of uncontaminated data. We how that computing the length of everal ub ample of varying ize provide the neceary information to etimate both the catter and the number of uncontaminated data point in a ample. We derive the ytem of equation to olve for the data catter and the number of uncontaminated data point for the Gauian ditribution. The data catter i the meaure of the noie variance. The method can be extended to other ditribution. the ueful noie data. If the number of pure noie data point i greater than the number of noiy ignal data point, then one can apply the method developed below to etimate the noie power without doing any explicit eparation of the noie from the noiy ignal. (a Index Term oie variance etimation, nonlinear filter, robut etimation, catter etimation I. ITRODUCTIO oie etimation i a major tak in all area of ignal proceing, be it peech or image proceing. ignal proceing algorithm for egmentation, clutering, retoration, noie reduction, tatitical inference etc, depend on the knowledge of the noie variance. The literature on the noie variance etimation in peech and image abound []- [7]. WE preent a new algorithm that ue very few aumption about the data, namely that the noie ha Gauian ditribution and that the majority of the data point in the data et have no ignal preent. In ignal proceing in general one deal with noiy data z, where each data point i it i a combination of the clean ignal i i the clean ignal and v i the noie: z i = i + v i. In many application the data contain a number of data point for which the ignal i either not preent or much maller than the noie. In (a (b Figure we how two illutration of uch data: a noiy peech waveform and an atronomical image. The ditribution of the data point conit of the noie ditribution and the noiy ignal ditribution. The noie ditribution in many cae i or can be approximated by the Gauian ditribution. If one to conider thi ditribution from the point of view of etimating the noie power, i.e. the width of the Gauian ditribution, then the noie data point become the ueful data and the noiy peech data point become outlier preent in (b Figure. Example of (ad data and (b D data, in which the number of ignal data point i maller than the number of background noie only data point. In ection II we preent the background on data catter etimation in outlier contaminated data. In ection III we introduce the new method and derive the algorithm for computing the catter of normally ditributed outlier contaminated data. In ection IV we preent reult of the imulation. II. BACKGROUD Etimation of the peak and the catter of data in a ample i a common problem encountered in many divere area of tatitical data proceing. If the data are known to have Gauian ditribution, the mot common etimator of the peak and the catter are the mean and the tandard deviation of the data around the mean. If there are outlier preent in the data ample, mean-baed etimator break down almot immediately; even one outlier can reult in a completely miguided mean. The ame i true about the tandard deviation from the mean a an etimator of the data catter. A more robut etimator of the peak i the median. But even the median erode a the number of outlier i increaing and approache 50% of the ample ize. There exit two general approache in dealing with outlier contaminated data. The firt approach, and our method /06/$ IEEE 364
2 belong to thi group, i to deal with the whole ample and devie robut etimator which are to a great extent inenitive to the preence of outlier. The econd approach i to devie robut method of identifying and excluding outlier and then to treat the uncontaminated ample with the conventional tatitical method. Out method i built on one of the exiting method of mode etimation. The mode a an etimator of the peak of a ditribution i very robut; it i motly inenitive to up to 50% outlier in the data ample. However, wherea computing mean and median i traightforward and both etimator have a unique value for any given data ample, mode etimation i notoriouly difficult and moreover for multimodal ditribution there i no unique mode. There exit a whole cla of mode etimator baed on the notion [8,9] of the hortet half ample. The horth the mean of the hortet half ample - wa propoed in [8]. In [9] it wa hown that the location of the one-dimenional leat median of quare, which i the mean of the minimum and maximum data point of the hortet half ample can be ued a a robut etimator of the mode of a data ample. Thi etimator ha a higher bia than the horth. A low biaed variant of mode etimator wa reported in [0]. It i computed by repeatedly taking the hortet half ample within hortet half ample. In [9] it wa propoed to ue the length of the hortet half ample a a robut etimator of the data catter. However, wherea the middle point of the hortet half ample i not enitive to the preence of outlier in the data ample, the length of the hortet half ample depend on the number of outlier. In the preence of outlier only data point out of the total of actually belong to the parent ditribution. The half ample i only uch with repect to all point in the ample, but it i more than half-ample with repect to the point from the parent ditribution with the outlier excluded. ince the catter etimate depend critically on the fact that the hortet half ample actually encompae half of the uncontaminated data point, it become meaningle in preence of outlier. The novelty of our approach i that we derive a way of imultaneouly etimating both the data catter and the ective ize of the ample. Thi allow u to etimate the data catter for outlier contaminated data. III. METHOD A. Multiple hortet ubample We tart with the noiy data point z i and ort them in the acending order. We will notation x i for the orted data point. Let X = (x x be an ordered ample of ize. In order to find the hortet ub ample coniting of n data point one find i=m that minimize ( xn+ i xi, where i =,, -n. We introduce the fractional ub ample ize r = n/. We etimate the mode by the median of the hortet ub ample Mode(r = x m+n/. The mode etimator Mode(r i applicable for any ditribution. The catter etimator, that we derive here, i applicable only for the data that ha the Gauian ditribution with mean μ and varianceσ : = ( x μ f ( x exp / ( πσ σ ( For the Gauian ditribution the value of Mode(r i an unbiaed etimator of μ. If the hortet ub ample i identified a decribed above, then the length of the hortet ub ample i: r = x m+n -x n The fractional ub ample ize r approximate the integral of the ditribution function from point x n to point x m+n (ee Fig.. Therefore, to the extent that Mode(r give the correct etimate of the peak of the Gauian, the following relation involving the error function erf hold between the ub ample fractional ize r and it length L: r / σ r r = exp( t dt = erf ( π σ 0 The critical fact here i that the normalization factor depend on the ize of the uncontaminated ample, i.e. the outlier hould be excluded from thi count. If one know, for example if there are no outlier, then in order to compute σ one imply invert the equation. f(x r x m x m+n/ x m+n Figure The haded area, defined a the integral of f(x from x m =Mode(r r/ to x m+n =Mode(r r/, i equal to r. If i not known, which i the cae under conideration, one can find r for everal value of r and obtain a ytem of equation to olve for both and σ. We introduce notation Mr for the etimator of the catterσ of the normally ditributed data. (ML tand for multiple hortet length. We will call the et of fractional ize r the upport of the etimator ML (r. B. Derivation of the Equation for catter Etimation ince Mr depend on everal parameter, there i a certain degree of freedom in electing the mot ective way of computing it. The more traightforward way i to find r for value of r and olve the ytem of two equation for two unknown: 365
3 r = u erf r = u erf u ( r ( r ; v σ Factoring out u lead to the following equation for v: r erf ( r = r erf ( r. (4 Another approach to finding and σ i by to perform the leat-quare fit to the data. Quantitie r and r are meaured for ub ample. The following quantity i minimized: ( ru erf ( L r = Minimization with repect to u and v ru erf r v u v = ( ( ( ru erf ( r = 0, = lead to the following et of equation = = r ( r u erf ( r r exp = 0; (3 ( (5 = 0; ( ( r r u erf ( r ( = 0. Again, factoring out u lead to the following equation for v: = r erf r = ( r r r exp( ( r = r exp ( ( r erf ( r = 0. The olution of either ytem of equation 3 or 7 i ubject to the obviou contraint: u. (9 The way we apply thi contraint i to olve the ytem firt, and if u >, then et u = and compute v a erf ( r v = (0 = r Baed on the imulation we concluded that the only gain achieved by uing the econd approach i in the execution time. Below we preent only reult obtained by olving the equation 4. Here i the ummary of the firt approach. One find the length r of the hortet ubet of r data point and r of the hortet ubet of r data point. The value of r, r, r, and r are ued to olve equation (4 for v, which i directly related by equation (3 to the varianceσ. (6 (7 (8 C. Further Refinement-Automated ML Once Mr and are found a further refinement i poible. We how in ection III baed on the reult of imulation, that in general the greater r i, the more accurate are the ML (r and etimator. We do iterative refinement uing the following the trategy. We tart with reaonably mall r, meaure r, and compute Mr and. The value r are incremented and Mr and are recomputed until at leat one of the three topping criteria i met. Two empirical parameter R max and dr min are ued to define topping criteria of the algorithm. The iteration terminate if / exceed R max, or if the change in / between two iteration drop below dr min. Another topping criterion i baed on the aumption that the change in the Mode(r between two conecutive iteration cannot exceed the value of the catter Mr. The mode i found for the bigget r in the et. For example, if the upport i r = (0.4; 0.5, then the mode i found for r = 0.5. We ue notation AMr (automated Mr for the catter etimator obtained uing thi iterative proce. upport r in thi cae refer to the initial et of value of the fractional ub ample ize. The reult of the imulation preented below were obtained uing the following empirical value of the parameter R max = 0.95, dr min = 0.. IV. IMULATIO A. Detail of the imulation In order to tet the etimator derived in the previou ection we generated everal et of clean and contaminated data. The uncontaminated data are zero-mean Gauian with the tandard deviation of. We run our imulation for three ample ize of 30, 00, and 000 data point. In order to compute the average and tandard deviation of the etimator ML and AML we repeated the imulation time for the ample ize 30, for the ample ize of 00, and 0000 time for the ample ize of 000. We generated two kind of outlier that were added to replace the data point from the main ditribution. The firt kind conited of data point uniformly ditributed from 3 to 8. The econd kind conited of data point normally ditributed with the ame tandard deviation of a the main data and the mean of 4 ( percentile. The outlier fraction F=- / ued for the uniformly ditributed data wa 0., 0.3, 0.4, and 0.5. The outlier fraction F ued for the normally ditributed outlier wa 0., 0.3, and 0.4. The ratio of F = 0.5 obviouly could not be ued for the normally ditributed outlier, ince in thi cae they are no longer outlier. In Fig. we how two hitogram for two extreme cae of contaminated data: one ample of data with the uniform outlier with the fraction F = 0.5 and one ample of data the Gauian outlier with the fraction F = 0.4; for the ample ize in both cae i = 000. For comparion we alo computed the median abolute deviation (MAD []. The value of MAD i a meaure of the cale or diperion of a ditribution about the median. It i 366
4 often calculated a the median of the abolute-value ditance of the point about the median: MAD = median{ x_i - median(x } and multiplied by a factor of.486 to achieve conitency with the tandard deviation for aymptotically normal ditribution. f(x f(x x Figure 3 The top figure how a hitogram of a contaminated ample with the uniformly ditributed outlier with the fraction F = 0.5; the bottom figure how a hitogram of a contaminated ample with the normally ditributed outlier with the fraction of F = 0.4. The ample ize in both cae i 000. B. imulation of Contaminated Data ow we conider outlier contaminated data. Firt, in Table we how the reult for the ML a a function of the contamination fraction F. We alo preent the reult for the relative uncontaminated ize T : T = true true = ( F To compute thee quantitie we ue the upport r = (0.4;0.5, which i the bigget upport one can ue with no a priori knowledge of the outlier level, only auming that it doe not exceed 50% of the ample ize. The reult for lower level of contamination diplay a higher bia and diperion. The cloer i the ub ample ize to the ize of the uncontaminated ample, the better are the reult for the ML and T :. The refined etimator AML i devied with the idea of improving the accuracy of etimation for lower level of contamination. A part of the algorithm the upport i increaed to come a cloe a poible to the ize of the uncontaminated data without overtepping that boundary and without including the outlier in the ub ample defined by the upport r. In Table 3 we give the reult of the imulation for the initial upport r = (0.5;0.35. The goal i achieved, a AML i a better etimator for the lower outlier level and i very cloe to the ML for the highet outlier level. We illutrate the reult for the ML and AML etimator in Fig. 4. We alo diplay the value obtained for the MAD etimator for comparion. Only the etimator computed for the uniform outlier ditribution are plotted. The reult for both Gauian and uniform outlier are very imilar, the only difference i that for the uniform outlier the ML and AML etimator can be computed in the extreme cae of 50% outlier. LIMITATIO The method developed here ha certain limitation. One of them i that the equation (4 doe not alway have a olution for a mall ample ize. The failure rate become negligible for the ample ize > 00 data point. The econd limitation i the cae of highly contaminated data with the outlier having a more dene ditribution than the main data. In thi cae the mode of the outlier could be picked over that of the main data. Further invetigation i planned to etablih a well defined limitation of thi method and alo to extend it to the other than Gauian ditribution. COCLUIO We derived a new method of etimating the catter of normally ditributed data with high level of contamination. Our method i very table and perform well for the fraction of outlier of up to 50%. Thi method can be applied to etimating noie variance in noiy data, where the number of data point containing only noie i greater than the number of data point containing both ignal and noie. 367
5 5 Mr T ample Fraction F of Uniform Outlier Fraction F of Gauian Outlier ize ( ( ( ( ( ( ( (0.30 (0.4 (0.5.0 (0..00 ( ( (0.30 ( ( ( ( (0.34 (0.5.0 ( (0.0.0 ( ( ( ( ( ( ( ( ( ( (0.4 (0.5.0 (0..00 ( (0.4 ( ( ( (0.9.0 (0.05 Table. The average (tandard deviation of the catter Mr and relative uncontaminated ize T etimator for outlier contaminated ample. The upport r = (0.4; 0.5. ample Fraction F of Uniform Outlier Fraction F of Gauian Outlier ize AMr (0.33 (0.39 (0.49 (0.65 (0.33 (0.39 ( ( ( ( (0.50 ( (0.34. ( ( (0..0 ( ( ( (0..0 ( T (0.5 (0.8 (0.3 (0.37 (0.5 (0.8 ( (0.. (0.5.5 ( ( (0.. (0.5.7 ( ( (0.7.0 ( ( ( ( (0.4 Table. The average (tandard deviation for the catter AMr and relative uncontaminated ize T etimator computed uing the refined trategy. The initial upport wa r = (0.5;
6 6 catter Etimate catter Etimate ample ize 30 erie AML erie3 ML erie MAD Outlier Fraction F erie AML ample ize 00 erie3 ML erie MAD Outlier Fraction F [4] J.L. tarck and F. Murtagh, Automatic oie Etimation from the Multireolutional upport, Publication of the Atronomical ociety of the Pacific, 0, 93, 998 [5] M. Janen, oie Reduction by Wavelet Threholding, pringer Verlag ew York Inc., 00 [6] A.B. Hamza and H. Krim, Image Denoiing: A onlinear Robut tatitical Approach, IEEE Tranaction on ignal Proceing, 49, 3045, 00 [7] L. Alparone, G. Corini, M. Diani, oie modeling and etimation in image equence from thermal infrared camera, Optic in Atmopheric Propagation and Adaptive ytem VII, Proceeding of the PIE, 5573, 38,004 [8] D.F. Andrew, P.J. Bickel, F.R. Hampel, P.J. Huber, W.H. Roger, and J.W. Tukey, Robut Etimate of Location, Princeton Univerity Pre, Princeton,.J., 97 [9] P.J. Roueeuw and A.M. Leroy, Robut Regreion and Outlier Detection, John Wiley & on, ew York, Y, 987 [0] D. R. Bickel, Robut etimator of the mode and kewne of continuou data, Computational tatitic and Data Analyi 39, (00 0 erie AML erie3 ML erie MAD ample ize 000 catter Etimate Outlier Fraction F 0. Figure 4. Three etimator of the data catter: AML, ML, and MAD a function of the outlier fraction F. ML i computed with the upport r = (0.4; 0.5, and AML i computed with the initial upport r = (0.5; REFERECE [] K.K. Paliwal, Etimation of noie variance from the noiy ar ignal and it application in peech enhancement, IEEE Tranaction on Acoutic, peech and ignal Proceing, 36, 9, 988 [] H. Attia, L. Deng, A. Acero, and J. C. Platt, A new method for peech denoiing and robut peech recognition uing probabilitic model for clean peech and for noie, In Proc. Europeech, 3, 903, 00 [3] K. Kontantinide, B. atarajan, and G.. Yovanof, oie Etimation and Filtering Uing Block-Baed ingular Value Decompoition, IEEE Tranaction of Image Proceing, 6, 479,
MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationResearch on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function
016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationTracking High Speed Skater by Using Multiple Model
Vol. 2, No. 26 Tracing High Speed Sater by Uing Multiple Model Guojun Liu & Xianglong Tang School of Computer Science & Engineering Harbin Intitute of Technology Harbin 5000, China E-mail: hitliu@hit.edu.cn
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationAudio-Visual Voice Command Recognition in Noisy Conditions
Audio-Viual Voice Command Recognition in Noiy Condition Joef Chaloupka, Jan Nouza, Jindrich Zdanky Laboratory of Computer Speech Proceing, Intitute of Information Technology and Electronic, Technical Univerity
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationThe norm Package. November 15, Title Analysis of multivariate normal datasets with missing values
The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationRobust object characterization from lensless microscopy videos
Robut object characterization from lenle microcopy video Olivier Flaeur, Loïc Deni, Corinne Fournier, and Éric Thiébaut Univ Lyon, UJM-Saint-Etienne, CNRS, Intitut d Optique Graduate School, Laboratoire
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationA study on turbo decoding iterative algorithms
Buletinul Ştiinţific al Univerităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 49(63, Facicola 2, 2004 A tudy on turbo decoding
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationLearning-Based Quality Control for Cardiac MR Images
1 Learning-Baed Quality Control for Cardiac MR Image Giacomo Tarroni, Ozan Oktay, Wenjia Bai, Andrea Schuh, Hideaki Suzuki, Jonathan Paerat-Palmbach, Antonio de Marvao, Declan P. O Regan, Stuart Cook,
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationUSING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL
USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL Robert A. Kilmer Department of Sytem Engineering Unite State Military Acaemy Wet Point, NY 1996 Alice E. Smith
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationA TOPSIS based Method for Gene Selection for Cancer Classification
Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information
More information(A)ATSR RE-ANALYSIS FOR CLIMATE - CLOUD CLEARING METHODOLOGY
(A)ATSR RE-ANALYSIS FOR CLIMATE - CLOUD CLEARING METHODOLOGY Chri Old, Chri Merchant Univerity of Edinburgh, The Crew Building, Wet Main Road, Edinburgh, EH9 3JN, United Kingdom Email: cold@ed.ac.uk Email:
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationAn Algebraic Approach to Adaptive Scalable Overlay Network Monitoring
An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationInternational Journal of Engineering Research & Technology (IJERT) ISSN: Vol. 2 Issue 5, May
Intertage Pipeline VLI Architecture for 2-D DWT Ajinkya. Bankar 1,Bhavika. haha 2, P.K. Kadbe 3 E&TC Department, Pune Univerity 1,2,3 VPCOE Baramati Abtract In thi paper, a cheme for the deign of a high-pd
More informationUniversity of Warwick institutional repository:
Univerity of Warwick intitutional repoitory: http://go.warwick.ac.uk/wrap Thi paper i made available online in accordance with publiher policie. Pleae croll down to view the document itelf. Pleae refer
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationLocating Brain Tumors from MR Imagery Using Symmetry
ocating rain Tumor from M magery Uing Symmetry Nilanjan ay aidya Nath Saha and Matthew obert Graham rown {nray1 baidya mbrown}@cualbertaca epartment of Computing Science Univerity of lberta Canada btract
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationIntroduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07
Introduction to PET Image Recontruction Adam Aleio Nuclear Medicine Lecture Imaging Reearch Laboratory Diviion of Nuclear Medicine Univerity of Wahington Fall 2007 http://dept.wahington.edu/nucmed/irl/education.html
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationIMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES
December 01 ADMS 5 P503I1 IMPEMENTATION OF AREA, VOUME AND INE SOURCES The Met. Office (D J Thomon) and CERC 1. INTRODUCTION ADMS model line ource, and area and volume ource with conve polgon bae area.
More informationComputer Aided Drafting, Design and Manufacturing Volume 25, Number 3, September 2015, Page 10
Computer Aided Drafting, Deign and Manufacturing Volume 5, umber 3, September 015, Page 10 CADDM Reearch of atural Geture Recognition and Interactive Technology Compatible with YCbCr and SV Color Space
More informationFinite Elements Method in Split Hopkinson Pressure Bar developing process
6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN
More informationOn the Use of Shadows in Stance Recovery
On the Ue of Shadow in Stance Recovery Alfred M. Brucktein, 1 Robert J. Holt, 1 Yve D. Jean, 2 Arun N. Netravali 1 1 Bell Laboratorie, Lucent Technologie, Murray Hill, NJ 094 2 Avaya Communication, Murray
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationEvolution of Non-Deterministic Incremental Algorithms. Hugues Juille. Volen Center for Complex Systems. Brandeis University. Waltham, MA
Evolution of Non-Determinitic Incremental Algorithm a a New Approach for Search in State Space Hugue Juille Computer Science Department Volen Center for Complex Sytem Brandei Univerity Waltham, MA 02254-9110
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationE-APPLAB #1
E-APPLAB-93-069850 #1 Ultrafat tomography experiment etup at D-1 Beamline at CHESS The experiment etup conit of three major part: x-ray ource, injection chambe and detecto a hown chematically in Fig. EPAPS1a.
More informationA reduced reference image quality metric based on feature fusion and neural networks
Univerity of Wollongong Reearch Online Faculty of Engineering and Information Science - Paper: Part A Faculty of Engineering and Information Science 2011 A reduced reference image quality metric baed on
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationShortest Path Routing in Arbitrary Networks
Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,
More informationThe LLAhclust Package
Verion 0.2-1 Date 2007-31-08 The LLAhclut Package September 1, 2007 Title Hierarchical clutering of variable or object baed on the likelihood linkage analyi method Author Ivan Kojadinovic, Iraël-Céar Lerman,
More informationRESEARCH ON SAR IMAGE MATCHING TECHNOLOGY BASED ON SIFT
RESEARCH ON SAR IMAGE MATCHING TECHNOLOGY BASED ON SIFT LIU Jing-zheng, YU Xu-chu Zhengzhou Intitute of Surveying and Mapping, 66 Longhai Road, Zhengzhou 45005,China-ljzchxy@63.com Commiion I, WG I/ KEY
More informationANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL
ANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL TATSUNORI MATSUMOTO i) PASTSAKORN KITIYODOM ii) EIJI KOJIMA iii) HIROMICHI KUMAGAI iv) SATOSHI NISHIMOTO v) and KOUICHI
More informationDevelopment of an atmospheric climate model with self-adapting grid and physics
Intitute of Phyic Publihing Journal of Phyic: Conference Serie 16 (2005) 353 357 doi:10.1088/1742-6596/16/1/049 SciDAC 2005 Development of an atmopheric climate model with elf-adapting grid and phyic Joyce
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
Thi article appeared in a journal publihed by Elevier. The attached copy i furnihed to the author for internal non-commercial reearch and education ue, including for intruction at the author intitution
More informationKhoirul Umam 1, Agus Zainal Arifin 2 and Dini Adni Navastara 3
I J C T A, 9(-A), 016, pp 763-777 International Science Pre A Novel Strategy of Differential Evolution Algorithm Croover Operator Baed on Graylevel Cluter Similarity for Automatic Multilevel Image Threholding
More informationGray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:
Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital
More informationDistributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II
IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS Ranges
American Journal of Applied Science 4 (5): 300-306, 2007 ISSN 1546-9239 2007 Science Publication Correponding Author: Parallel Approache for Interval Analyi of Variable Statitic in Large and Spare Linear
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More information