Classification of Osteoporosis using Fractal Texture Features
|
|
- Roland Howard
- 6 years ago
- Views:
Transcription
1 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, India Article History ABSTRACT Received on: Accepted on: In our proposed metod an automatic Osteoporosis classification Publised on: system is developed. Te input of te system is Lumbar spine digital radiograp, wic is subjected to pre-processing wic includes conversion of grayscale image to binary image and enancement using Keyword Osteoporosis Contrast Limited Adaptive Histogram Equalization tecnique(clahe). Osteopenia Furter Fractal Texture features(sfta) are extracted, ten te image is Lumbar Spine classified as Osteoporosis, Osteopenia and Normal using a Probabilistic CLAHE Neural Network(PNN). A total of 158 images ave been used, out of SFTA PNN wic 86 images are used for training te network and 3 images for testing and 40 images for validation. Te network is evaluated using a confusion matrix and evaluation parameters like Sensitivity, Specificity, precision and Accuracy are computed fractal feature extraction tecniques. Copyrigt 015 International Journal for Modern Trends in Science and Tecnology All rigts reserved. Classification of Osteoporosis using Fractal Texture Features Page 11
2 I. INTRODUCTION Osteoporosis is a progressive bone disease tat is caracterized by a decrease in bone mass and density wic can lead to an increased risk of fracture. In osteoporosis, te Bone Mineral Density (BMD) is reduced, bone micro arcitecture deteriorates, and te amount and variety of proteins in bone are altered. Te form of osteoporosis most common in women after menopause is referred to as primary type 1 or postmenopausal osteoporosis, wic is attributable to te decrease in oestrogen production after menopause. Primary type osteoporosis or senile osteoporosis occurs after age 75 and is seen in bot females and males at a ratio of :1. Secondary osteoporosis may arise at any age and affect men and women equally, tis form results from cronic predisposing medical problems or disease, or prolonged use of medications suc as glucocorticoid, wen te disease is called steroid or glucocorticoid-induced osteoporosis. So in order to detect te presence of osteoporosis we ave to use image processing tecniques on Digital radiograpers contribute to te test values used for training te neural network. Tus Image processing is used to monitor te traits of te X- rays for possible infirmities tat migt occur and provide te necessary data for furter treatment. II. LITERATURE SURVEY According to AlceuFerraz Costa[1], a new and efficient texture feature extraction metod called te Segmentation-based Fractal Texture Analysis, or SFTA is preferred tan Haralick and Gabor filter. Te extraction algoritm consists in decomposing te input image into a set of binary images from wic te fractal dimensions of te resulting regions are computed in order to describe segmented texture patterns. Te decomposition of te input image is acieved by te Two- Tresold Binary Decomposition (TTBD) algoritm, wic we also propose in tis work. Te SFTA is evaluated for te tasks of content-based image retrieval (CBIR) and image classification, comparing its performance to tat of oter widely employed feature extraction metods suc as Haralick and Gabor filter banks. SFTA acieved iger precision and accuracy for CBIR and image classification. Additionally, SFTA was at least 3.7 times faster tan Gabor and 1.6 times faster tan Haralick wit respect to feature extraction time. Histogram equalization, wic stretces te dynamic range of intensity, is te most common metod for enancing te contrast of an image. An adaptive metod to avoid tis drawback is blockbased processing of istogram equalization. In block-based processing, image is divided into subimages or blocks, and istogram equalization is performed to eac sub-images or blocks. Contrast Limited Adaptive Histogram Equalization (CLAHE), proposed by K. Zuierveld, as two key parameters: block size and clip limit. Tese parameters are mainly used to control image quality. In tis paper, a new novel metod was proposed by ByongSeok Min [] to determine two parameters of te CLAHE using entropy of an image. An Automatic Brain Tumor Classification using PNN and Clustering developed by P.Sangeeta [3] describes te Probabilistic Neural Network (PNN) will be employed to classify te various stages of Tumor cut levels suc as Benign, Malignant or Normal. Probabilistic Neural Network wit Radial Basis Function will be applied to implement tumor cells segmentation and classification. Decision sould be made to classify te input image as normal or abnormal cells. Prediction of malignant cells or non-tumor cells can be executed using two variants: i) Feature extraction and ii) classification using Probabilistic Neural Network (PNN). Te ability of teir proposed Brain Tumor Classification metod is demonstrated on te basis of obtained results on Brain Tumor image database. In teir proposed metod, only 5 classes of Brain tumors are considered, wit respect to an example of 0 test images for instance but tis metod can be extended to more classes of Brain tumors. Since medical X-Ray images are grayscale images wit almost te same texture caracteristics, conventional color or texture features cannot be used for appropriate categorization in medical X- Ray image arcives. Terefore, a novel feature is proposed by Seyyed Moammad Moammadi [4] wic is te combination of sape and texture features. Te feature extraction process is started by edge and sape information extraction from original medical X-Ray image. Finally, Gabor filter is used to extract spectral texture features from sape images. In order to study te effect of feature Classification of Osteoporosis using Fractal Texture Features Page 1
3 fusion on te classification performance, different effective features like local binary pattern. It provides low computation complexity and straigtforward implementation. Due to following advantages we can strongly claim tat tese features are te most powerful and reliable features for medical image X-Ray classification. III. PROPOSED METHOD Te proposed approac starts first from preprocessing. It is ten followed by Grayscale Conversion and te image is enanced using a CLAHE filter. Ten te features namely fractal features are extracted from te enanced image and te fractal features are used to determine te category in wic tey fall determined by te PNN classifier for one sample. Tis is repeated for te stock of samples in wic /3 of te samples are taken as Database samples. Metodologies A. Pre-processing B. Grayscale conversion C. Image Enancement. D. Feature Extraction E. PNN Classifier. Test Image Training enancement and resizing. Tese are done in order to make te image more suitable tan an original image for specific applications. B. Grayscale Conversion If te image selected is in tree dimensions, it is converted to a grayscale image using rgbgray conversion command for feature extraction. Ten te intensity variation of gray level image is sown in te grap. Its value varies from 0 to 55.Resizing of image is done for accurate processing of image. Image can be resized to any size of our interest. C, Image Enancement Image enancement is te process of adjusting digital images so tat te results are more suitable for display or furter image analysis. After resizing te image, we go for image enancement. We use CLAHE (Contrast Limited Adaptive Histogram Equalization) tecnique. Tis metod separates te image into a number of tiles, and ten adjusts te contrast suc tat te tile istogram as te desired sape. Te tiles are ten stitced togeter using bilinear interpolation. Te transformation function modifies te pixels based on te gray level content of an image. Tese tecniques are used to enance details over small areas in an image. Input X-Ray image Input X-Ray image Processing(Image Enancement) Pre- Pre- Processing(Image Enancement ) Figure 1. Image after Enancement Feature Extraction( SFTA Features) Classification (PNN Classifier) Normal Osteopenia Feature Extraction(SFTA Features) Features Database Osteoporosis Figure 1.1 Block Diagram of proposed work IV. RESEARCH METHODOLOGY A. Preprocessing Steps wic are done prior to processing of an image are called preprocessing. It includes image D. Feature Extraction Feature is a parameter of interest to describe an image. Transforming te input data into te set of features is called feature extraction. If te features extracted are carefully cosen it is expected tat te features set will extract te relevant information from te input data in order to perform te desired task. Te Segmentation-based Fractal Texture Analysis or SFTA metod is a feature extraction algoritm tat decomposes a given image into a set of binary images troug te application of wat te autors call te Two Tresold Binary Decomposition (TTBD). For eac resulting binary image, fractal dimensions of its Classification of Osteoporosis using Fractal Texture Features Page 13
4 region boundaries are calculated tat describe te texture patterns.ttbd takes an input greyscale image and returns a set of binary images by first computing a set of T tresold values from te gray level distribution information in an input image. Tis is accomplised by recursively applying to eac image region te multilevel Otsu algoritm, an algoritm tat quickly finds te tresold tat minimizes te input image intra-class variance until te desired number of tresolds is obtained. Te input image is decomposed into a set of binary images by selecting pairs of tresolds from T and applying two-tresold segmentation.fractal measurements are used to describe te boundary complexity of objects, wit eac region boundaries of a binary image represented as a border image. Te fractal dimension is computed from eac boarder image using a box counting algoritm. A. Haussdorf fractal dimension Haussdorf dimension serves as a measure of te local size of a set of numbers, taking into account te distance between eac of its members. Te Haussdorf dimension of an n-dimensional inner product space equals n. Tis underlies te earlier statement tat te Haussdorf dimension of a point is zero, of a line is one, etc., and tat irregular sets can ave non integer Haussdorf dimensions. Haussdorf fractal dimension of an object represented by te binary image. Non-zero pixel belongs to an object and zero pixel constitute te background. dim H X = inf {d 0: C H d X 0} (1) Were dim _H(X) is te infimum of te set of d [0, ) suc tat te d-dimensional Haussdorf measure of X is zero. B. OTSU S Segmentation Otsu's metod is used to automatically perform clustering-based image tresolding i.e., te reduction of a graylevel image to a binary image. Te algoritm assumes tat te image contains two classes of pixels following bi-modal istogram, it ten calculates te optimum tresold separating te two classes so tat teir combined spread is minimal.in Otsu's metod, we exaustively searc for te tresold tat minimizes te intra-class variance (te variance witin te class), defined as a weigted sum of variances of te two classes. σ w t = ω 1 t σ 1 t + ω t σ t () Weigts ω_i are te probabilities of te two classes separated by a tresold t and σ_i^variances of tese classes. Otsu tresolding returns a set of tresolds for te input image employing te multilevel Otsu algoritm. Te multilevel Otsu algoritm consist in finding te tresold tat minimizes te input image intraclass variants. Ten, recursively, te Otsu algoritm is applied to eac image region until total tresolds are found. Figure 1.3 Image after OTSU Segmentation C. Edge detection Edge detection is an image processing tecnique for finding te boundaries of objects witin images. It works by detecting discontinuities in brigtness. Edge detection is used for image segmentation and data extraction in areas suc as image processing, computer vision, and macine vision.edge detection returns a binary image wit te regions boundaries of te input image. Te input image must be a binary image. Te returned image takes te value 1 if te corresponding pixel in te image as te value 1 and at least one neigbouring pixel wit value 0. Oterwise takes value 0. E. Artificial Neural Network Artificial neural networks (ANNs) are a family of statistical learning algoritms inspired by biological neural networks. Tey are used to estimate or approximate functions tat can depend on a large number of inputs and are generally unknown. Artificial neural networks are generally presented as systems of interconnected "neurons" wic can compute values from inputs, and are capable of macine learning, as well as pattern recognition tanks to teir adaptive nature. After being weigted and transformed by a function (determined by te network's designer), te activations of tese neurons are ten passed on to oter neurons. Tis process is repeated until finally, an output neuron is activated. A.PNN classifier PNN is a useful neural network arcitecture wit Classification of Osteoporosis using Fractal Texture Features Page 14
5 sligtly different in fundamentals from te back propagation. Te arcitecture is feed forward in nature wic is similar to back propagation, but differs in te way tat learning occurs. PNN is supervised learning algoritm but includes no weigts in its idden layer. x1 x x Input nodes Hidden nodes Class nodes Decision node Figure 1.4 Block Diagram of PNN Classifier. Basically, PNN consists of an input layer, wic represents te input pattern or feature vector. Te input layer is fully interconnected wit te idden layer, wic consists of te example vectors (te training set for te PNN). Te actual example vector serves as te weigts as applied to te input layer. Finally, an output layer represents eac of te possible classes for wic te input data can be classified. Te output class node wit te largest activation represents te winning class. In PNN algoritm, calculating te class-node activations is a simple process. For eac class node, te example vector activations are summed, wic are te sum of te products of te example vector and te input vector. Te idden node activation, sown in te following equation, is simply te product of te two vectors (E is te example vector, and F is te input feature vector). i = E i F (3) Te class output activations are ten defined as: c1 c z cosen troug experimentation. If te smooting factor is too large, details can be lost, but if te smooting factor is too small, te classifier may not generalize well. It's also very easy to add new examples to te network by simply add te new idden node, and its output is used by te particular class node. Tis can be done dynamically as new classified examples are found. Te PNN also generalizes very well, even in te context of noisy data. V. RESULTS AND DISCUSSION Here, totally 158 images ave been used out of wic 86 are taken for training and remaining ave been used for testing and validation. Calculated feature values of various input X-Ray images are tabulated. Results sow tat images are normal, are Osteopenia and osteoporosis. Comparison of various features for normal, Osteopenia and osteoporosis images can be seen. Class Table 1.1 Table Sowing Result Set Number Of Images Normal 55 Osteopenia 46 Osteoporosis 57 Figure 1.5 GUI Result sows Normal c j = ( i 1) N e y i=1 N (4) Were N is te total number of example vectors for tis class, i is te idden-node activation, and γ is a smooting factor. Te smooting factor is Figure 1.6 GUI Result sows Osteopenia Classification of Osteoporosis using Fractal Texture Features Page 15
6 Figure 1.7 GUI Result sows Osteoporosis A. CONFUSION MATRIX Confusion matrix is a specific table layout tat allows visualization of te performance of an algoritm, typically a supervised learning one. Eac column of te matrix represents te instances in a predicted class, wile eac row represents te instances in an actual class. Evaluation parameters suc as Sensitivity, Specificity, Precision and Accuracy are calculated for te confusion matrix. Table 1. Tree Class Confusion Matrix of SFTA Table 1.3 Table Sowing Validation result of SFTA Parameter Formula SFTA VI. CONCLUSION AND FUTURE WORK In tis work, te suitability of texture features in classification of Lumbar spine digital radiograps is analyzed. Te Experimental results during testing and teoretical analysis prove in perspective of time, accuracy of system being a main concern te fractal features are more precise and more accurate. In medical imaging or in diagnosis, te important factor is accuracy rater tan speed, ence present fractal features as a more suitable tecnique for feature extraction. Te results on classification ave a combined accuracy of 93%. Tis value is obtained by validating our practical results wit DEXA results. Hence our system can assist in diagnosis of osteoporosis. In future te work can be implemented for distal and toracic digital radiograp, te system can also be embedded in a Digital radiograpy macine to diagnose osteoporosis on te fly. REFERENCES [1] AlceuFerraz Costa, Gabriel Humpire-Mamani andagmajuci Macado Traina, (01) An Efficient Algoritm for Fractal Analysis of Textures, Conference on Grapics, Patterns and Images (SIBGRAPI), pp [] ByongSeok Min, Dong Kyun Lim, Seung Jong Kim and Joo Heung Lee, (013) A Novel Metod of Determining Parameters of CLAHE Based on Image Entropy, International Journal of Software Engineering and Its Applications, Vol.7, No.5, pp [3] Sangeeta. P, (014) Brain Tumor Classification using PNN and Clustering, International Journal of Innovative Researc in Science, Engineering and Tecnology, Vol. 3, No.3, Mar 014. [4] Seyyed Moammad Moammadi, Moammad SadegHelfrous and Kamran kazemi, (01) Novel sape-texture feature extraction for medical X-Ray image classification, International Journal of Innovation Computing, Information and Control (ICIC), Vol.8, No.1, ISSN Sensitivity TP/ (TP+FN) 88.% Specificity TN/ (FP+TN) 94.% Precision TP/ (TP+FP) 97% Accuracy (TP+TN)/ (TP+TN+FP+FN) 94.3% Classification of Osteoporosis using Fractal Texture Features Page 16
Two Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
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 informationHybrid Approach for MRI Human Head Scans Classification using HTT based SFTA Texture Feature Extraction Technique
Volume 118 No. 17 2018, 691-701 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Hybrid Approach for MRI Human Head Scans Classification using HTT
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 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 informationContent Based Image Retrieval using Combined Features of Color and Texture Features with SVM Classification
Content Based Image Retrieval using Combined Features of Color and Texture Features with SVM Classification R. Usha [1] K. Perumal [2] Research Scholar [1] Associate Professor [2] Madurai Kamaraj University,
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 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 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 informationFRACTAL TEXTURE BASED IMAGE CLASSIFICATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 9, September 2015,
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 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 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 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 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 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 information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
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 information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
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 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 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 informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationCLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS
CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS CHAPTER 4 CLASSIFICATION WITH RADIAL BASIS AND PROBABILISTIC NEURAL NETWORKS 4.1 Introduction Optical character recognition is one of
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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationTuning MAX MIN Ant System with off-line and on-line methods
Université Libre de Bruxelles Institut de Recerces Interdisciplinaires et de Développements en Intelligence Artificielle Tuning MAX MIN Ant System wit off-line and on-line metods Paola Pellegrini, Tomas
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 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 informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
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 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 informationNumerical 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 informationMean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.
Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department
More informationSlidesGen: Automatic Generation of Presentation Slides for a Technical Paper Using Summarization
Proceedings of te Twenty-Second International FLAIRS Conference (2009) SlidesGen: Automatic Generation of Presentation Slides for a Tecnical Paper Using Summarization M. Sravanti, C. Ravindranat Cowdary
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 informationThe navigability variable is binary either a cell is navigable or not. Thus, we can invert the entire reasoning by substituting x i for x i : (4)
A Multi-Resolution Pyramid for Outdoor Robot Terrain Perception Micael Montemerlo and Sebastian Trun AI Lab, Stanford University 353 Serra Mall Stanford, CA 94305-9010 {mmde,trun}@stanford.edu Abstract
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 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 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 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 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 informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationSearch-aware Conditions for Probably Approximately Correct Heuristic Search
Searc-aware Conditions for Probably Approximately Correct Heuristic Searc Roni Stern Ariel Felner Information Systems Engineering Ben Gurion University Beer-Seva, Israel 85104 roni.stern@gmail.com, felner@bgu.ac.il
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 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 informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationProceedings. Seventh ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC 2013) Palm Spring, CA
Proceedings Of te Sevent ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC ) Palm Spring, CA October 9 November st Parameter-Unaware Autocalibration for Occupancy Mapping David Van
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 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 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 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 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 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 informationThe impact of simplified UNBab mapping function on GPS tropospheric delay
Te impact of simplified UNBab mapping function on GPS troposperic delay Hamza Sakidin, Tay Coo Cuan, and Asmala Amad Citation: AIP Conference Proceedings 1621, 363 (2014); doi: 10.1063/1.4898493 View online:
More informationOn the use of FHT, its modification for practical applications and the structure of Hough image
On te use of FHT, its modification for practical applications and te structure of Houg image M. Aliev 1,3, E.I. Ersov, D.P. Nikolaev,3 1 Federal Researc Center Computer Science and Control of Russian Academy
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 informationMAP MOSAICKING WITH DISSIMILAR PROJECTIONS, SPATIAL RESOLUTIONS, DATA TYPES AND NUMBER OF BANDS 1. INTRODUCTION
MP MOSICKING WITH DISSIMILR PROJECTIONS, SPTIL RESOLUTIONS, DT TYPES ND NUMBER OF BNDS Tyler J. lumbaug and Peter Bajcsy National Center for Supercomputing pplications 605 East Springfield venue, Campaign,
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 informationAuthor's personal copy
Autor's personal copy Information Processing Letters 09 (009) 868 875 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl Elastic tresold-based admission
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 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 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 informationUNSUPERVISED HIERARCHICAL IMAGE SEGMENTATION BASED ON THE TS-MRF MODEL AND FAST MEAN-SHIFT CLUSTERING
UNSUPERVISED HIERARCHICAL IMAGE SEGMENTATION BASED ON THE TS-MRF MODEL AND FAST MEAN-SHIFT CLUSTERING Raffaele Gaetano, Giuseppe Scarpa, Giovanni Poggi, and Josiane Zerubia Dip. Ing. Elettronica e Telecomunicazioni,
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 informationTHE EVALUATION CRITERION FOR COLOR IMAGE SEGMENTATION ALGORITHMS
Journal of ELECTRICAL ENGINEERING, VOL. 63, NO. 1, 2012, 13 20 THE EVALUATION CRITERION FOR COLOR IMAGE SEGMENTATION ALGORITHMS Peter Lukáč Róbert Hudec Miroslav Benčo Zuzana Dubcová Martina Zacariášová
More informationMulti-View Clustering with Constraint Propagation for Learning with an Incomplete Mapping Between Views
Multi-View Clustering wit Constraint Propagation for Learning wit an Incomplete Mapping Between Views Eric Eaton Bryn Mawr College Computer Science Department Bryn Mawr, PA 19010 eeaton@brynmawr.edu Marie
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 informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
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 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 informationTruncated Newton-based multigrid algorithm for centroidal Voronoi diagram calculation
NUMERICAL MATHEMATICS: Teory, Metods and Applications Numer. Mat. Teor. Met. Appl., Vol. xx, No. x, pp. 1-18 (200x) Truncated Newton-based multigrid algoritm for centroidal Voronoi diagram calculation
More informationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Multi-Objective Particle Swarm Optimizers: A Survey of te State-of-te-Art Margarita Reyes-Sierra and Carlos A. Coello Coello CINVESTAV-IPN (Evolutionary Computation Group) Electrical Engineering Department,
More informationAn Intuitive Framework for Real-Time Freeform Modeling
An Intuitive Framework for Real-Time Freeform Modeling Mario Botsc Leif Kobbelt Computer Grapics Group RWTH Aacen University Abstract We present a freeform modeling framework for unstructured triangle
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 informationAnalytical CHEMISTRY
ISSN : 974-749 Grap kernels and applications in protein classification Jiang Qiangrong*, Xiong Zikang, Zai Can Department of Computer Science, Beijing University of Tecnology, Beijing, (CHINA) E-mail:
More informationProgramming Real-Time Applications with Signal
Programming Real-Time Applications wit Signal Paul Le Guernic, Tierry Gautier, Micel Le Borgne, Claude Le Maire To cite tis version: Paul Le Guernic, Tierry Gautier, Micel Le Borgne, Claude Le Maire. Programming
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More informationHASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS
HASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS N.G.Bardis Researc Associate Hellenic Ministry of te Interior, Public Administration and Decentralization 8, Dragatsaniou str., Klatmonos S. 0559, Greece
More informationSolutions Manual for Fundamentals of Fluid Mechanics 7th edition by Munson Rothmayer Okiishi and Huebsch
Solutions Manual for Fundamentals of Fluid Mecanics 7t edition by Munson Rotmayer Okiisi and Huebsc Link full download : ttps://digitalcontentmarket.org/download/solutions-manual-forfundamentals-of-fluid-mecanics-7t-edition-by-munson-rotmayer-okiisi-and-uebsc/
More informationA signature analysis based method for elliptical shape
A signature analysis based metod for elliptical sape Ivana Guarneri, Mirko Guarnera, Giuseppe Messina and Valeria Tomaselli STMicroelectronics - AST Imaging Lab, Stradale rimosole 50, Catania, Italy ABSTRACT
More informationTraffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks
Traffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks Peyman Faizian, Md Safayat Raman, Md Atiqul Molla, Xin Yuan Department of Computer Science Florida State University
More informationArrays in a Lazy Functional Language a case study: the Fast Fourier Transform
Arrays in a Lazy Functional Language a case study: te Fast Fourier Transform Pieter H. Hartel and Willem G. Vree Department of Computer Systems University of Amsterdam Kruislaan 403, 1098 SJ Amsterdam,
More informationAsynchronous Power Flow on Graphic Processing Units
1 Asyncronous Power Flow on Grapic Processing Units Manuel Marin, Student Member, IEEE, David Defour, and Federico Milano, Senior Member, IEEE Abstract Asyncronous iterations can be used to implement fixed-point
More informationEconomic design of x control charts considering process shift distributions
J Ind Eng Int (2014) 10:163 171 DOI 10.1007/s40092-014-0086-2 ORIGINAL RESEARCH Economic design of x control carts considering process sift distributions Vijayababu Vommi Rukmini V. Kasarapu Received:
More informationA Graph-Based Framework for Fusion: From Hypothesis Generation to Forensics
A Grap-Based Framewor for Fusion: From ypotesis Generation to Forensics Moises Sudit Center for Multisource Information Fusion University at Buffalo Buffalo, NY, U.S.A. sudit@eng.buffalo.edu Adam Stotz
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 information