Two Modifications of Weight Calculation of the Non-Local Means Denoising Method
|
|
- Ophelia Manning
- 6 years ago
- Views:
Transcription
1 Engineering, 2013, 5, ttp://dx.doi.org/ /eng b107 Publised Online October 2013 (ttp:// Two Modifications of Weigt Calculation of te Non-Local Means Denoising Metod Musab Elkeir Sali, Xuming Zang *, Mingyue Ding Scool of Life Science and Tecnology, Huazong University of Science and Tecnology, Wuan, Cina * xmbosi.zang@gmail.com Received 2013 Abstract Te non-local means (NLM) denoising metod replaces eac pixel by te weigted average of pixels wit te surrounding neigboroods. In tis paper we employ a cosine weigting function instead of te original exponential function to improve te efficiency of te NLM denoising metod. Te cosine function outperforms in te ig level noise more tan low level noise. To increase te performance more in te low level noise we calculate te neigborood similarity weigts in a lower-dimensional subspace using singular value decomposition (SVD). Experimental comparisons between te proposed modifications against te original NLM algoritm demonstrate its superior denoising performance in terms of peak signal to noise ratio (PSNR) and istogram, using various test images corrupted by additive wite Gaussian noise (AWGN). Keywords: Non-Local Means; Singular Value Decomposition; Weigt Calculation 1. Introduction Image denoising is one of te most important tecniques and necessary preprocessing steps in image processing and computer vision. Denoising is to remove unwanted noise to enance and restore te original image. Many metods for image denoising ave been suggested, and a review of tem can be found in [1]. Among tem tat paper also proposes te NLM denoising metod, wic gives state-of-te-art results. Tis metod replaces eac pixel wit a weigted average of oter pixels wit similar neigboroods. Te basic idea is tat images contain repeated structures, and averaging tem will reduce te noise [2]. Tis new concept for image denoising is popular in oter image processing areas, suc as texture syntesis, were a new pixel is syntesized as te weigted average of known image pixels wit similar neigboroods [3-5]. Te issue of measuring similarity between pixels, or patces is a ot topic in many applications of image processing, macine learning, computer vision, information retrieval and document clustering. Document clustering is te measuring of similarity between documents. In tis te document is mapped into te vector space, and similarity is measured by te angles between te vectors using cosine function. Te smaller te angle between two documents, te larger te cosine of te angle is and te iger te similarity is; and vice versa [6]. So te cosine is a decaying function of te angle between two docu- * Corresponding autor. ments. Te original NLM filter uses te exponential decaying function as a weigting function for te similarity measurement and weigt calculation. In compare to cosine function te exponential function decays faster tan cosine function and tis will reduce te effect of averaging of te NLM filter. Because of tis, we proposed a NLM denoising metod using te cosine function. Te outperformance of cosine function mainly appears in ig level noise. To increase te performance more in te low level noise we combine te cosine weigting function and SVD. Te SVD belongs to a class of dimensionality reduction tecniques tat deal wit te uncovering of latent data structures and often associate noise to te least important components. Dimensionality reduction is a noise reduction process. Removing noise before calculate te similarities between patces around te pixels will enance te weigt calculation and increase te performance of NLM algoritm. Te rest of tis paper deals about te following. Section II introduces te classical NLM algoritm. In section III, te proposed metod followed to modify te classical NLM algoritm is introduced. In tis, we use a cosine weigting function for te weigt calculation, ten combine te cosine function wit SVD in te low level noise. Te results & discussions for four test images at various noise levels are sown in Section IV. Section V concludes te paper and proposed future work for more improvement to te NLM denoising metod.
2 M. E. SALIH ET AL Non-Local Means Filter Te NLM metod [1,7] estimates te intensity of eac pixel x in te noisy image u by a weigted average of all of te pixel intensities in te image (as a convention, we will refer to te pixel being denoised at any given time as te pixel of interest (POI), denoted x, and denote all oter pixels as y). Te weigts w(x, y) reflect te probability tat te POI (x) as te same intensity value as te pixel is being compared to (y). Tis probability is based on te similarity between te neigboroods around x and y. Te weigting function can be considered as a decreasing function depending on te similarity of te patces around te POI. If a particular local difference as a large magnitude ten te value of w(x, y) will be small and terefore tat measurement will ave little effect on te output image. A small neigborood, or patc, around eac pixel is used to compute te L2 norm. Te weigting factor w(x, y), is ten a normalized weigted Gaussian function of tis L2 norm. Consider a discrete noisy image u = f + n, in wic n is AWGN. Te NLM filter is written as f ( x,y) = w( x,y) u( y) y little bit dissimilar patces instead of zero or small values. Because of tis, our proposed metod was based on using te cosine function instead of te exponential one. For more investigation of different decay beaviors of te two decreasing functions, we calculated te weigt corresponding to te dissimilarity measurement of all 7 7 patces in searc window around te pixel (20, 20) in te left top smoot sky background region of te ouse image corrupted by wite Gaussian noise, wit standard deviation (σ) = 40, sown in Figures 1(b). It appears tat cosine function as given iger suitable weigt values wile te exponential function as given small weigt values. Tis is te major advantage of using cosine function and results sown in Figures 1(c), (d) proved tis. Tis advantage as an important effect in te weigt calculation of te NLM denoising algoritm, so te cosine function was more robust weigting function, and we used it in NLM algoritm denoising for an efficient implementation of tis algoritm Weigt Calculation in te Reduced Dimensional Space Using Singular Value Decomposition In 1965 G. Golub and W. Kaan introduced te SVD as a were, decomposition tecnique for calculating te singular val- 1 1 ues, pseudo-inverse and rank of a matrix [9]. Te tec- ( ) ( ( )) ( ( )) 2 d d w x, y = exp u N x u N y 2 W ( x ) nique decomposes a matrix A into tree new matrices 2 T A = USV were N d (y) represents te square patc of size (2d + 1) were: (2d + 1) centered at x, and W is a normalizing term, W(x) = wxyu U is a matrix wose columns are te eigenvectors of (, ). Te parameter will be referred v te AA T matrix. Tese are termed te left eigenvectors. to as te filter parameter tat controls te decay of te S is a matrix wose diagonal elements are te singular exponential expression in te weigting sceme. Tis values of A. Tese are ordered in decreasing order along parameter is typically controlled manually in te algoritm. Coosing a very small leads to noisy results identical to te input, wile very large gives an overlysmooted image [8]. 3. Metodology 3.1. Weigt Calculation Using Cosine Function Te L2 norm of te difference between two pixels was used as input to te cosine function instead of te exponential function. Figure 1(a) demonstrates te beavior of te two functions to an arbitrary input. Te exponential function was decayed faster tan cosine function, wic lead to finising te weigt to zero value instantly for dissimilar patces, or to a very small weigt values even for te little bit dissimilar patces. Tis fast decay reduced te effect of averaging and smooting of te NLM filter. On te oter side, te cosine function s decay was slower tan exponential function, and so it gave a considerable weigt values for te dissimilar or te Figure 1. (a) Exponential and cosine weigting function; (b) Dissimilarity measurement of te pixel (20, 20) of ouse image; (c) and (d) Weigt calculation using exponential function and cosine function corresponding to similarity measurement respectively.
3 524 M. E. SALIH ET AL. te diagonal of S, i.e. s 1 > s 2 > s 3 > s n. V is a matrix wose columns are te eigenvectors of te A T A matrix. Tese are termed te rigt eigenvectors. Wen computing te SVD of a matrix is desirable to reduce its dimensions by keeping its first k singular values. T A = U SV K K K K Tis process is termed dimensionality reduction, and A K is referred to as te rank k Approximation of A, or te Reduced SVD of A. If we eliminate dimensions by keeping te tree largest singular values, tis is a rank 3 approximation [10]. Te top k singular values are selected as a mean for developing a latent semantics representation of A tat is now free from noisy dimensions. Tis latent semantics representation is a specific data structure in low-dimensional space in wic documents, terms and queries are embedded and compared. Tis idden or latent data structure is masked by noisy dimensions and becomes evident after te SVD. We replaced te distances by 1 d d u 2 ( N ( x) ) u N ( y) (3) ( ) 2 1 d d u 2 ( P ( x) ) u P ( y) (4) ( ) 2 were P d represents te projections of N d onto te lower-dimensional space determined by te SVD. If Nd is a particular row in A, ten te weigts for N d are just te corresponding row in U multiplied by diagonal elements of S. Te weigts for N d are referred to as projection of N d into te k-dimensional space. Better denoising is obtained wen similarity between pixels is computed using te dimension reduction introduced by te SVD. 4. Experiment Results and Discussions In te experiment, te size of patc, searc window, parameter values and rank k Approximation were selected corresponding to te best PSNR value. Our proposed NLM algoritm was applied on four test images (Lena, Cameraman, Pepper, and House); Using a image size for all te images, and a image size for Lena image. Te test images were corrupted by AWGN wit zero mean at σ = 10 (low noise level), and 40 (ig noise level). Te results were sown using PSNR in decibels (db) and istogram to demonstrate te superior performance of te proposed metod in noise reduction. We used te PSNR measurement defined as 2 PSNR 10log MAX = MSE were, MSE is Mean Square Error, and MAX is maxi- mum intensity value. Table 1 lists Te PSNR comparison results. Using cosine function produces better PSNR values wen compared to te original NLM algoritms for all te different noise levels. Te average performance is ig ( db) for te all images corrupted by a ig level noise, wile it is low ( db) for te all images corrupted by low level noise. Tat means te cosine function outperforms in te ig level noise and tis because of te dissimilarity between patces will increase more tan in te low level of noise te and so te exponential function will give zero or small weigt values wile cosine weigt function will give tem more and suitable weigt values. Tis is useful, and it enances te effect of averaging and smootening of te NLM filter. Te results sow tat te most cosine function superiority, were te performance is (1.12 db), mainly appears in te noisy (AWGN) ouse image, (σ = 40). To increase te average performance for te images corrupted by low level noise, wic is low as we mentioned previously, we combined te SVD wit cosine function to calculate te distances between te pixels in te low dimensional space rater tan te full space. Te results sowed an increased accuracy over using te full space. Te average performance increased form ( db to db). Tis is because te idden or latent data structure is masked by noisy dimensions and becomes evident after te SVD. And similarity computed in lower-dimensional space becomes more accurate because SVD remove noisy dimensions. Altoug we only applied te SVD on images corrupted by low level noise to increase te performance of te algoritm; but also it will work for images corrupted by moderate level noise. Because te noise will increase more tan in te low level of noise but SVD will remove it and te weigt calculation will be more efficiency. Our metod works well for all te images, but it works better for images (House and Pepper) wic ave a smoot region more tan images (Lena and Cameraman) wic ave more details. Table 1. Performance of te original nonlocal means denoising algoritm and te modified algoritm. PSNR Images Exp Cos Cos + SVD Exp Cos Lena Cameraman Pepper House Average Performance
4 M. E. SALIH ET AL. 525 (a) (b) (c) (d) (e) (f) (g) () Figure 2. Histograms of te: (a) Original image (b). Noisy image. (c) and (d) Denoised image by nonlocal means denoising algoritm using exponential and cosine function respectively. Figure 2 sows, tat using exponential or cosine functions wit te NLM filter retrieves a similar istogram and distinguises tree main peaks of te istogram of te original image. However, te cosine function increases te sarpness of te peaks and te contrast between tem, because tere is a small peak appears in te istogram of te filtered image using te cosine function and do not appear wen using exponential function. 5. Conclusion and Future Work Tis work sows tat using cosine weigting function and computing te similarity in lower-dimensional space increases te effect of averaging and denoising performance of te NLM denoising algoritm, in low and ig level noise especially for smoot images. Te next work is seeking for anoter and most appropriate weigting function tat will enance tis filter even for images containing more details. Furtermore, it will be very suitable if we use te weigting function locally instead of globally to suit te structure of te image. By selecting a function preserves te edges for image wit ig details, and for a smoot region coosing a function preserves te smootness. Also a future work is to find anoter robust dimensionality reduction metod to remove te noisy dimensions instead of SVD. Tis will be a good direction to improve te efficiency of NLM algoritm. References [1] A. Buades, B. Coll and J.-M. Morel, A Review of Image Denoising Algoritms, wit a New One, SIAM Journal on Multiscale Modeling and Simulation, Vol. 4, No. 2, 2005, pp ttp://dx.doi.org/ / [2] W. Jin, et al., Fast Non-Local Algoritm for Image Denoising, 2006 IEEE International Conference on Image Processing, 2006, pp [3] A. A. Efros and T. K. Leung, Texture Syntesis by Nonparametric Sampling, Proceedings of te IEEE International Conference on Computer Vision, Corfu, Greece, September 1999, pp ttp://dx.doi.org/ /iccv [4] Y. Wexler, E. Sectman and M. Irani, Space-Time Video Completion, Proceedings of te IEEE International Conference on Computer Vision Pattern Recognition (CVPR), [5] L. Yatziv, G. Sapiro and M. Levoy, Ligt Field Completion, Proceedings of te IEEE International Conference on Image Processing, Singapore, [6] J. Zeng, et al., A Matcing Metod Based on SVD for Image Retrieval, 2009, pp [7] A. Buades, B. Coll and J.-M. Morel, Nonlocal Image
5 526 M. E. SALIH ET AL. and Movie Denoising, International Journal of Computer Vision, 2007, to Appear. [8] J. Orcard, et al., Efficient Nonlocal-Means Denoising Using te SVD, ICIP 2008, 15t IEEE International Conference on Image Processing, 2008, pp [9] G. Golub and W. Kaan, Calculating te Singular Val- ues and Pseudo-Inverse of a Matrix, SIAM Journal on Numerical Analysis, Vol. 2, No. 2, [10] E. Garcia, SVD and LSI Tutorial 3: Computing te Full SVD of a Matrix, ttp:// d-lsi-tutorial-3-full-svd.tml
Numerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationAustralian Journal of Basic and Applied Sciences. Partial Differential Equation Based Denoising Technique for MRI Brain Images
AENSI Journals Australian Journal of Basic and Applied Sciences Journal ome page: www.ajbasweb.com Partial Differential Equation Based Denoising Tecnique for MRI Brain Images 1 S. Jansi and P. Subasini
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationREVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE
International Researc Journal of Engineering and Tecnology (IRJET) e-issn: 2395-0056 REVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE Devendra Kumar 1, Dr. Krisna Raj 2 (Professor in ECE Department
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More informationClassification of Osteoporosis using Fractal Texture Features
Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationA Practical Approach of Selecting the Edge Detector Parameters to Achieve a Good Edge Map of the Gray Image
Journal of Computer Science 5 (5): 355-362, 2009 ISSN 1549-3636 2009 Science Publications A Practical Approac of Selecting te Edge Detector Parameters to Acieve a Good Edge Map of te Gray Image 1 Akram
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationUUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
More informationA Novel QC-LDPC Code with Flexible Construction and Low Error Floor
A Novel QC-LDPC Code wit Flexile Construction and Low Error Floor Hanxin WANG,2, Saoping CHEN,2,CuitaoZHU,2 and Kaiyou SU Department of Electronics and Information Engineering, Sout-Central University
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationA NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON DWT WITH SVD
A NEW ROBUST IMAGE WATERMARKING SCHEME BASED ON WITH S.Shanmugaprabha PG Scholar, Dept of Computer Science & Engineering VMKV Engineering College, Salem India N.Malmurugan Director Sri Ranganathar Institute
More information16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, Switzerland, August 25-29, 2008, copyright by EURASIP
16t European Signal Processing Conference (EUSIPCO 008), Lausanne, Switzerland, August 5-9, 008, copyrigt by EURASIP ADAPTIVE WINDOW FOR LOCAL POLYNOMIAL REGRESSION FROM NOISY NONUNIFORM SAMPLES A. Sreenivasa
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationAN IMPROVED NON-LOCAL DENOISING ALGORITHM
AN IMPROVED NON-LOCAL DENOISING ALGORITHM Bart Goossens, Hiêp Luong, Aleksandra Pižurica and Wilfried Pilips Gent University, Department of Telecommunications and Information Processing (TELIN-IPI-IBBT
More informationwrobot k wwrobot hrobot (a) Observation area Horopter h(θ) (Virtual) horopters h(θ+ θ lim) U r U l h(θ+ θ) Base line Left camera Optical axis
Selective Acquisition of 3-D Information Enoug for Finding Passable Free Spaces Using an Active Stereo Vision System Atsusi Nisikawa, Atsusi Okubo, and Fumio Miyazaki Department of Systems and Human Science
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationAn Interactive X-Ray Image Segmentation Technique for Bone Extraction
An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction Cristina Stolojescu-Crisan and Stefan Holban Politenica University of Timisoara V. Parvan 2, 300223 Timisoara, Romania {cristina.stolojescu@etc.upt.ro
More informationIMA Preprint Series # 2052
FAST IMAGE AND VIDEO DENOISING VIA NON-LOCAL MEANS OF SIMILAR NEIGHBORHOODS By Mona Mahmoudi and Guillermo Sapiro IMA Preprint Series # 2052 ( June 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationImproved Non-Local Means Algorithm Based on Dimensionality Reduction
Improved Non-Local Means Algorithm Based on Dimensionality Reduction Golam M. Maruf and Mahmoud R. El-Sakka (&) Department of Computer Science, University of Western Ontario, London, Ontario, Canada {gmaruf,melsakka}@uwo.ca
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationIMAGE DENOISING USING NL-MEANS VIA SMOOTH PATCH ORDERING
IMAGE DENOISING USING NL-MEANS VIA SMOOTH PATCH ORDERING Idan Ram, Michael Elad and Israel Cohen Department of Electrical Engineering Department of Computer Science Technion - Israel Institute of Technology
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More informationDeveloping an Efficient Algorithm for Image Fusion Using Dual Tree- Complex Wavelet Transform
ISSN(Online): 30-980 ISSN (Print): 30-9798 (An ISO 397: 007 Certified Organization) Vol. 3, Issue 4, April 05 Developing an Efficient Algoritm for Image Fusion Using Dual Tree- Complex Wavelet Transform
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationAn Overview of New Features in
6. LS-DYNA Anwenderforum, Frankental 2007 Optimierung An Overview of New Features in LS-OPT Version 3.3 Nielen Stander*, Tusar Goel*, David Björkevik** *Livermore Software Tecnology Corporation, Livermore,
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationIMAGE ENCRYPTION BASED ON CHAOTIC MAP AND REVERSIBLE INTEGER WAVELET TRANSFORM
Journal of ELECTRICAL ENGINEERING, VOL. 65, NO., 014, 90 96 IMAGE ENCRYPTION BASED ON CHAOTIC MAP AND REVERSIBLE INTEGER WAVELET TRANSFORM Xiaopeng Wei Bin Wang Qiang Zang Cao Ce In recent years, tere
More informationImage Denoising based on Sparse Representation and Dual Dictionary
ISSN: 49 8958, Volume-4 Issue-4, April 015 Image Denoising based on Sparse Representation and Dual Dictionary Anees G Nat, Sreeram G, Sarafudeen K, Sreeraj M C Abstract earning-based image denoising aims
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationOvercomplete Steerable Pyramid Filters and Rotation Invariance
vercomplete Steerable Pyramid Filters and Rotation Invariance H. Greenspan, S. Belongie R. Goodman and P. Perona S. Raksit and C. H. Anderson Department of Electrical Engineering Department of Anatomy
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationDesign of Map Decomposition and Wiimote-based Localization for Vacuuming Robots
Design of Map Decomposition and Wiimote-based Localization for Vacuuming Robots Cia-Pin Kuo, Sy-In Hwang Department of Computer Science and Engineering Yuan Ze University s956007@mail.yzu.edu.tw, syin@cs.yzu.edu.tw
More informationAffine and Projective Transformations
CS 674: Intro to Computer Vision Affine and Projective Transformations Prof. Adriana Kovaska Universit of Pittsburg October 3, 26 Alignment problem We previousl discussed ow to matc features across images,
More informationDenoising an Image by Denoising its Components in a Moving Frame
Denoising an Image by Denoising its Components in a Moving Frame Gabriela Ghimpețeanu 1, Thomas Batard 1, Marcelo Bertalmío 1, and Stacey Levine 2 1 Universitat Pompeu Fabra, Spain 2 Duquesne University,
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More informationResearch Article Applications of PCA and SVM-PSO Based Real-Time Face Recognition System
Hindawi Publising Corporation atematical Problems in Engineering, Article ID 530251, 12 pages ttp://dx.doi.org/10.1155/2014/530251 Researc Article Applications of PCA and SV-PSO Based Real-Time Face Recognition
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationA VOLUME-BASED METHOD FOR DENOISING ON CURVED SURFACES
A VOLUME-BASED METHOD FOR DENOISING ON CURVED SURFACES Harry Biddle Double Negative Visual Effects London, UK b@dneg.com Ingrid von Glen, Colin B. Macdonald, Tomas März Matematical Institute University
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationPedestrian Detection Algorithm for On-board Cameras of Multi View Angles
Pedestrian Detection Algoritm for On-board Cameras of Multi View Angles S. Kamijo IEEE, K. Fujimura, and Y. Sibayama Abstract In tis paper, a general algoritm for pedestrian detection by on-board monocular
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationEfficient Content-Based Indexing of Large Image Databases
Efficient Content-Based Indexing of Large Image Databases ESSAM A. EL-KWAE University of Nort Carolina at Carlotte and MANSUR R. KABUKA University of Miami Large image databases ave emerged in various
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationAnalysis of Various Issues in Non-Local Means Image Denoising Algorithm
Analysis of Various Issues in Non-Local Means Image Denoising Algorithm Sonika 1, Shalini Aggarwal 2, Pardeep kumar 3 Department of Computer Science and Applications, Kurukshetra University, Kurukshetra,
More informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More informationCS 234. Module 6. October 25, CS 234 Module 6 ADT Dictionary 1 / 22
CS 234 Module 6 October 25, 2016 CS 234 Module 6 ADT Dictionary 1 / 22 Case study Problem: Find a way to store student records for a course, wit unique IDs for eac student, were records can be accessed,
More informationComputer Physics Communications. Multi-GPU acceleration of direct pore-scale modeling of fluid flow in natural porous media
Computer Pysics Communications 183 (2012) 1890 1898 Contents lists available at SciVerse ScienceDirect Computer Pysics Communications ournal omepage: www.elsevier.com/locate/cpc Multi-GPU acceleration
More informationLaser Radar based Vehicle Localization in GPS Signal Blocked Areas
International Journal of Computational Intelligence Systems, Vol. 4, No. 6 (December, 20), 00-09 Laser Radar based Veicle Localization in GPS Signal Bloced Areas Ming Yang Department of Automation, Sangai
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationIMAGE DENOISING TO ESTIMATE THE GRADIENT HISTOGRAM PRESERVATION USING VARIOUS ALGORITHMS
IMAGE DENOISING TO ESTIMATE THE GRADIENT HISTOGRAM PRESERVATION USING VARIOUS ALGORITHMS P.Mahalakshmi 1, J.Muthulakshmi 2, S.Kannadhasan 3 1,2 U.G Student, 3 Assistant Professor, Department of Electronics
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationImage Registration via Particle Movement
Image Registration via Particle Movement Zao Yi and Justin Wan Abstract Toug fluid model offers a good approac to nonrigid registration wit large deformations, it suffers from te blurring artifacts introduced
More informationA library of biorthogonal wavelet transforms originated from polynomial splines
A library of biortogonal wavelet transforms originated from polynomial splines Amir Z. Averbuc a and Valery A. Zeludev a a Scool of Computer Science, Tel Aviv University Tel Aviv 69978, Israel ABSTRACT
More informationExtended Synchronization Signals for Eliminating PCI Confusion in Heterogeneous LTE
1 Extended Syncronization Signals for Eliminating PCI Confusion in Heterogeneous LTE Amed H. Zaran Department of Electronics and Electrical Communications Cairo University Egypt. azaran@eecu.cu.edu.eg
More informationA Comparative Analysis of Noise Reduction Filters in Images Mandeep kaur 1, Deepinder kaur 2
A Comparative Analysis of Noise Reduction Filters in Images Mandeep kaur 1, Deepinder kaur 2 1 Research Scholar, Dept. Of Computer Science & Engineering, CT Institute of Technology & Research, Jalandhar,
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationIntegrating Constraints and Metric Learning in Semi-Supervised Clustering
Integrating Constraints and Metric Learning in Semi-Supervised Clustering Mikail Bilenko MBILENKO@CS.UTEXAS.EDU Sugato Basu SUGATO@CS.UTEXAS.EDU Raymond J. Mooney MOONEY@CS.UTEXAS.EDU Department of Computer
More informationFace Recognition using Computer-Generated Database
Face Recognition using Computer-Generated Database Won-Sook LEE Scool of Information Tecnology and Engineering University of Ottawa, 800 King Edward Ave Ottawa, Ontario, K1N 6N5, Canada Tel: (1-613) 562-5800
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationAn Effective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Chiming Huang and Rei-Heng Cheng
An ffective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Ciming Huang and ei-heng Ceng 5 De c e mbe r0 International Journal of Advanced Information Tecnologies (IJAIT),
More informationSingle and Multi-View Reconstruction of Structured Scenes
ACCV2002: Te 5t Asian Conference on Computer Vision 23 25 January 2002 Melbourne Australia 1 Single and Multi-View econstruction of Structured Scenes Etienne Grossmann Diego Ortin and José Santos-Victor
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationOn the Use of Radio Resource Tests in Wireless ad hoc Networks
Tecnical Report RT/29/2009 On te Use of Radio Resource Tests in Wireless ad oc Networks Diogo Mónica diogo.monica@gsd.inesc-id.pt João Leitão jleitao@gsd.inesc-id.pt Luis Rodrigues ler@ist.utl.pt Carlos
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationQuaternion-based color difference measure for removing impulse noise in color images
2014 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS) Quaternion-based color difference measure for removing impulse noise in color images Lunbo Chen, Yicong
More informationICES REPORT Isogeometric Analysis of Boundary Integral Equations
ICES REPORT 5-2 April 205 Isogeometric Analysis of Boundary Integral Equations by Mattias Taus, Gregory J. Rodin and Tomas J. R. Huges Te Institute for Computational Engineering and Sciences Te University
More informationNon-Interferometric Testing
NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault
More informationDimension Reduction CS534
Dimension Reduction CS534 Why dimension reduction? High dimensionality large number of features E.g., documents represented by thousands of words, millions of bigrams Images represented by thousands of
More informationPlayer Number Recognition in Soccer Video using Internal Contours and Temporal Redundancy
Player Number Recognition in Soccer Video using Internal Contours and Temporal Redundancy Matko Šarić, Hroje Dujmić, Vladan Papić, Nikola Rožić and Joško Radić Faculty of electrical engineering, Uniersity
More informationFast Global Kernel Density Mode Seeking with application to Localisation and Tracking
Fast Global Kernel Density Mode Seeking wit application to Localisation and Tracking Cunua Sen, Micael J. Brooks, Anton van den Hengel Scool of Computer Science, University of Adelaide, SA 55, Australia
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationSoft sensor modelling by time difference, recursive partial least squares and adaptive model updating
Soft sensor modelling by time difference, recursive partial least squares adaptive model updating Y Fu 1, 2, W Yang 2, O Xu 1, L Zou 3, J Wang 4 1 Zijiang College, Zejiang University of ecnology, Hangzou
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationFeature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganographic Schemes
Feature-Based Steganalysis for JPEG Images and its Implications for Future Design of Steganograpic Scemes Jessica Fridric Dept. of Electrical Engineering, SUNY Bingamton, Bingamton, NY 3902-6000, USA fridric@bingamton.edu
More informationContent-based Dimensionality Reduction for Recommender Systems
Content-based Dimensionality Reduction for Recommender Systems Panagiotis Symeonidis Aristotle University, Department of Informatics, Thessaloniki 54124, Greece symeon@csd.auth.gr Abstract. Recommender
More informationInference Based on SVARs Identified with Sign and Zero Restrictions: Theory and Applications
FEDERAL RESERVE BANK of ATLANTA WORKING PAPER SERIES Inference Based on SVARs Identified wit Sign and Zero Restrictions: Teory and Applications Jonas E. Arias, Juan F. Rubio-Ramírez, and Daniel F. Waggoner
More information