An Interactive X-Ray Image Segmentation Technique for Bone Extraction
|
|
- Joseph Singleton
- 6 years ago
- Views:
Transcription
1 An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction Cristina Stolojescu-Crisan and Stefan Holban Politenica University of Timisoara V. Parvan 2, Timisoara, Romania Abstract. Image segmentation plays a fundamental role in many medical imaging applications by facilitating te contouring of te regions of interest. In tis paper, we propose an accurate interactive metod wic combines two image segmentation tecniques. In te first step, a mean sift segmentation algoritm is used for initial segmentation, followed by an adaptive region merging process based on te maximal similarity between regions, in te second step. Te proposed metod is tested on a set of real X-ray images and te goal is to separate te bones from te rest of te image. Te experimental results on real X-rays sow tat te proposed segmentation algoritm is igly effective, since it as te ability to extract te contour of te desired objects from te image. Keywords: Biomedical imaging, digital images, X-Ray Bone Segmentation, radiograpy 1 Introduction During te recent years, muc attention as been focused on medical imaging due to te appearance of less invasive and more accurate medical devices. Modern medical imaging offers te potential and promise for major advances in science and medicine, as iger fidelity images are produced. Digital images are more and more used by medical practitioners to elp tem during te disease diagnosis and decision making process, because tey display various body organs. Tere are several imaging tecnologies used in radiology to diagnose or treat diseases: X-ray radiograpy, ultrasound, computed tomograpy (CT), nuclear medicine and magnetic resonance imaging (MRI). X-ray images (radiograps) represent one of te oldest and more frequently used noninvasive medical tests tat elp pysicians during various stages of treatment, including fracture diagnosis, skeletal maturation evaluation, ip replacement surgery, or oter bone diseases. Imaging science as expanded primarily along tree distinct, but related lines of investigation: segmentation, registration and visualization [2]. One of te major callenges in medical imaging is te segmentation process, one of te most common operations in image processing. Segmentation allows te partitioning of Proceedings IWBBIO Granada 7-9 April,
2 2 Cristina Stolojescu-Crisan and Stefan Holban an image into regions wit coesive properties. Medical image segmentation is a fundamental problem in image processing and computer vision. Segmentation algoritms play a vital role in many biomedical-imaging applications, suc as diagnosis and treatment planning, localization of patology, study of anatomical structure, and computer-integrated surgery [1]. However, most of te existing articles on medical image segmentation are focused on CT and MRI and less on te segmentation of X-ray images. X-Ray image segmentation tecniques are treated in [3], [4], [5], [6]. Te goal in tese papers is te segmentation of bone structures from te X-ray images. Tis task is considered callenging because tis type of images are complex in nature since te regions delineated by bone contours are igly nonuniform in intensity and texture. Terefore, classical segmentation algoritms suc as tresolding, clustering, region growing, watersed, classifiers, etc are not applicable because tey rely on region omogeneity criteria. Deformable models (snakes, level set based models, or active sape models) can be used for X-ray image segmentation as well, but tey require a good initialization of te model contour and tus, may incorrectly segment te regions. An interesting solution is to combine two or more segmentation tecniques. In tis paper, we aim to segment X-ray images in order to separate te bones from te rest of te image. Te proposed metod automatically merges te regions tat are initially segmented using te mean sift algoritm. After te merging process ends, te object of interest (te bone structure) will be extracted from te background. Tis metod as been proposed in [7] for color image segmentation. In tis paper, we adapted tis metod for X-ray images. 2 Segmentation sceme A large amount of literature in te medical image analysis researc domain is dedicated to te segmentation topic. Some of segmentation tecniques ave acieved an extraordinary success and ave become popular in a wide range of applications. However, it is difficult to decide wic approac is te best for a particular segmentation task. Classical image segmentation algoritms including tresolding, edge detection, or region based tecniques can solve only simple medical image segmentation problems, since tey are sensitive to noise or may ave over-segmentation tendency. In tis paper, we will use a segmentation metod based on te mean-sift algoritm and region merging. Te segmentation scenario implies te following steps [8]: 1. Use an initial segmentation metod to split te entire image region, R, into smaller regions, R i, i = 1...S until tat, for any region R i, P r (R i ) = T RUE, i = 1...S, were P r is a predicate. 2. Coose a criterion for merging two adjacent regions, R j and R k, for wic P r (R j Rk ) = T RUE. 3. Merge all te adjacent regions. Stop if no furter merging is possible. Proceedings IWBBIO Granada 7-9 April,
3 An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction 3 Tere are various low level image segmentation metods tat can be used for initial segmentation. However, te mean-sift algoritm is more robust and produces less over segmentation. 2.1 Mean-sift algoritm Mean-sift algoritm is a powerful clustering procedure tat estimates te gradient of a probability density function using a generalized kernel approac. It as been successfully used for image segmentation in [9], [10], and [11]. Being given a set of n points, x 1...x n, in te d-dimensional Euclidean space, te kernel density estimate is defined as: ˆf(x) = 1 n d K( x x i ), (1) were is te window radius (bandwidt parameter) of te used kernel K(x). Te estimate of te density gradient is defined as te gradient of te kernel density estimate: ˆ f(x) = ˆf(x) = 1 n d K( x x i ). (2) Te kernel K(x) is a function of x 2 : K = c k,d k( x 2 ). k(x) is called te profile of K(x) and c k,d is a normalization constant, wic makes K(x) integrate to one. Tis class of kernels are called radially symmetric kernels. Te density estimator can be rewritten as: ˆ f,k (x) = c k,d n d k( x x i 2 ), (3) Two commonly used kernels are te multivariate Gaussian kernel: and te Epanecnikov kernel: K G (x) = (2π) d/2 e 1 2 x 2 (4) K E (x) = { 1 2 c 1 d (d + 2)(1 x 2 ), 0 x 1 0, x > 1 Te density gradient estimator of f,k (x) is obtained as: (5) ˆ f,k (x) = ˆ f,k (x) = 2c k,d n d+2 (x x i )k ( x x i 2 ), (6) We denote: g(x) = k (x). Using g(x) for profile, te kernel G(x) is defined as: G(x) = c k,g g x 2, (7) Proceedings IWBBIO Granada 7-9 April,
4 4 Cristina Stolojescu-Crisan and Stefan Holban were c k,g is a positive constant (te normalization coefficient). Te kernel K(x) is called te sadow of G(x). Te estimate of te density gradient becomes: ˆ f,k (x) = 2c k,d n d+2 g x x i n 2 n x xi g( )x i x xi g( ) x, (8) Te density estimator computed wit te kernel G(x) can be written as: ˆ f,g (x) = c k,g n d g( x x i ), (9) Te mean sift vector (or sample mean sift) is defined as te difference between te weigted mean using kernel G(x) and x, as te center of te kernel: m(x) = n n x xi g( )x i g( x xi ) x, (10) Te mean sift segmentation is an advanced and versatile tecnique for clustering based segmentation. Te parameters of te mean sift segmentation are: te spatial resolution parameter, (σ r ), te range resolution parameter, (σ s ) and M, te size of te smallest segment. Te use of te mean-sift algoritm for image segmentation requires te selection of (σ r ) and (σ s ). 2.2 Region merging tecnique Te initial segmentation produces a number of small regions. In te following, a region growing/merging algoritm [12] is used to merge tese small regions to larger ones. Region merging tecniques consider two regions to be merged if tey are similar and adjacent or connected to eac oter. Te main segmentation criterion in region growing is te omogeneity of regions. Te criteria for omogeneity include: gray level, color, texture, sape, model, region size, etc. Te region descriptor is compared to te descriptor of an adjacent region. If tey matc, tey are merged into a larger region, if not, te regions are marked as non-matcing. Te merging process of adjacent regions continues between all neigbors, including newly formed ones. If a region cannot be merged wit any of its neigbors, it is marked as final. Te merging process stops wen all regions are marked. Region merging tecniques usually work wit a statistical test to decide te merging of regions. Some examples of statistical test are te Euclidean distance, te Battacaryya coefficient, te Kullback Leibler divergence, or te log-likeliood ratio. Many researcers ave used te Battacaryya similarity measure and found it advantageous. Battacaryya coefficient correlates images using istograms [13] and gives a measure of similarity between te probability density functions of two populations. Being given p(i) and q(i), two multinomial populations of N classes, te Battacaryya coefficient is defined as: ρ(p, q) = N p(i)q(i), (11) Proceedings IWBBIO Granada 7-9 April,
5 An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction 5 were p(i) and q(i) are probability distributions: Np(i) = Nq(i) = 1. (12) Te Battacaryya measure can be used to compare te similarity between two istograms. If two regions ave similar contents, teir istograms will be very similar. We consider two regions Q and R. If H Qi is te normalized istogram of te first region, Q, and H Ri is te normalized istogram of te second region, R, wit i representing te it element of tem, ρ(r, Q) is defined as: ρ(r, Q) = HRi HQi, (13) i is a measure of te similarity between te two regions. Te iger te Battacaryya coefficient between two images is, te iger te similarity between tem is. Te proposed region merging metod starts wit marking te object and background. After object marking, eac region will be labeled as object marker region, background marker region, or non-marker region. Te object/background marker regions represent a small part of te object/background. Te regions tat are not marked by te user sould be identified and merged wit te corresponding regions, based on te similarity between regions. Two regions will be merged if te similarity between tem is maximal (te Battacaryya coefficient as te igest value). Briefly, considering Q a region of te image and S Q te set of all adjacent regions of Q, we compute te similarity between Q and all its adjacent regions (te Battacaryya coefficient). Q will be merged wit te region aving te igest similarity [7]. Tis means: ρ(r, Q) = max...q ρ(q, S Q i ), (14) ten R and Q will be merged. From te initial marker regions, all te non-marker regions will be gradually labeled as eiter object region or background region. In te end, eac region will be labeled as object or background. Tis is equivalent wit extracting te object contour from te background. 3 Segmentation results In te following, we will sow te segmentation results of te previously presented algoritm. We applied te algoritm on nine real X-ray images collected from a local public ospital. Te results for tree of tem are sown in Fig. 1, Fig. 2 and Fig. 3. Green markers are used to mark te object, wile blue markers are used to represent te background. Te initial segmentation using mean-sift algoritm and te positioning of markers are presented in te left image of eac figure, wile te results after region merging are sown in te rigt image. Proceedings IWBBIO Granada 7-9 April,
6 6 Cristina Stolojescu-Crisan and Stefan Holban Fig. 1. Test 1: Te initial segmentation using te mean-sift algoritm and te markers placed by te used (left) and te segmentation results after region merging procedure (rigt). Fig. 2. Test 2: Te initial segmentation using te mean-sift algoritm and te markers placed by te used (left) and te segmentation results after region merging procedure (rigt). Proceedings IWBBIO Granada 7-9 April,
7 An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction 7 Fig. 3. Test 3: Te initial segmentation using te mean-sift algoritm and te markers placed by te used (left) and te segmentation results after region merging procedure (rigt). Te proposed metod is useful if te user is interested in separating a selected object from te rest of te image (background). Analyzing Fig. 1, Fig. 2 and Fig. 3, we can observe tat te bones are perfectly extracted from te background. In [14], we compared various segmentation tecniques, starting wit te most simple and fast metods and increasing te computational complexity and te processing time wit eac presented metod. By visual inspection we can conclude tat te results reported in tis paper are more accurate tan te ones presented in [14]. 4 Conclusions Te goal of tis paper was to separate te bone structures from a set of X-ray images, as X-ray bone segmentation is a vital step in te X-Ray images analysis. Te metod proposed for tis task is based on te mean-sift algoritm, followed by a region merging process, based on te maximal similarity between regions. Tis metod is very simple but it can successfully extract te objects of interest from te image. Te metod as been proposed in [7], were te autors used tis segmentation sceme to extract desired objects from a set of testing color images. In tis paper, we adapted te metod proposed in [7] for medical images. In tis paper, te algoritm (bot initial segmentation and merging process) as been implemented in MATLAB R2008a. Te proposed segmentation metod is interactive, as te user places te markers. More, te wole segmentation process is guided by te markers input by te user. Te execution time also Proceedings IWBBIO Granada 7-9 April,
8 8 Cristina Stolojescu-Crisan and Stefan Holban depends on te markers positioning, but also on te initial segmentation (based on te mean-sift algoritm), and te content of te image. Our work as revealed tat te proposed metod successfully and accurately separates te bones from te background. Tis researc work tus contributes to solving te difficult and callenging problem of segmenting X-ray images. As future work, we aim to reduce te computational speed of segmentation, as well as te amount of manual interaction. References 1. Pam, D. L., Xu, C., Prince, J. L.: Current metods in medical image segmentation. Rev. Biomed. Eng. 2, (2000) 2. Dougerty, G.: Medical Image Processing: Tecniques and Applications (Biological and Medical Pysics, Biomedical Engineering). In: Dougerty, G. (eds.). Springer, New York (2011) 3. Maendran, S. K., Baboo, S. S.: Enanced Automatic X-Ray Bone Image Segmentation using Wavelets and Morpological Operators. In: International Conference on Information and Electronics Engineering, vol. 6, pp Singapore (2011) 4. Feng, D.: Segmentation of Bone Structures in X-ray Images. Tesis proposal to te Scool of Computing National University of Singapore, superviser Dr. Leow Wee Keng, (2006) 5. Seise, M., McKenna, S. J., Ricketts, I. W., Wigderowitz, C. A.: Segmenting Tibia and Femur from Knee X-ray Images. Med. Image Underst. Anal., (2005) 6. Cen, Y., Ee, X., Leow, W. K., Howe, T. S.: Automatic Extraction of Femur Contours from Hip X-ray Images. In: Liu, Y., Jiang, T., Zang, C. (eds.) Computer Vision for Biomedical Image Applications. LNCS, vol.3765, pp Springer, Heidelberg (2005) 7. Ninga, J., Zanga, L., Zanga, D., Wub, C.: Interactive image segmentation by maximal similarity based region merging. J. Pattern Recognition Elsevier 43, (2009) 8. Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis and Macine Vision. In: Tomson-Engineering (2007) 9. Comaniciu, D., Meer, P.: Mean Sift Analysis and Applications. In: 7t IEEE International Conference on Computer Vision, pp Kerkyra, Greece (1999) 10. Comaniciu, D., Meer, P.: Mean Sift: A Robust Approac toward Feature Space Analysis. IEEE Trans. Pattern Analysis Macine Intelligence 24(5), (2002) 11. Raja, S. V. K., Kadir, A. S. A., Amed, S. S. R.: Moving toward region-based image segmentation tecniques: a study. JATIT 5(1), (2009) 12. Suri, J. S., Setaredan, S. K., Sing, S. (eds.) : Advanced Algoritmic Approaces to Medical Image Segmentation: State Of Te Art Applications in Cardiology, Neurology, Mammograpy and Patology. In: Springer, London (2002) 13. Kalid, M. S., Ilyas, M. U., Sarfaraz, M. S., Ajaz, M. A.: Battacaryya Coefficient in Correlation of Gray-Scale Objects. Journ. of Multimedia 1(1), (2006) 14. Stolojescu-Crisan, C., Holban, S: A Comparison of X-Ray Image Segmentation Tecniques. AECE 13(3),85 92 (2013) Proceedings IWBBIO Granada 7-9 April,
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 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 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 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 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 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 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 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 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 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 informationEfficient Mean-Shift Tracking via a New Similarity Measure
Efficient Mean-Sift Tracking via a New Similarity Measure Cangjiang Yang, Ramani Duraiswami and Larry Davis Department of Computer Science, Perceptual Interfaces and Reality Laboratory University of Maryland,
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information3D data segmentation using a non-parametric density estimation approach
Eurograpics Italian Capter Conference (6) G. Gallo and S. Battiato and F. Stanco (Editors) 3D data segmentation using a non-parametric density estimation approac U. Castellani, M. Cristani, V. Murino Dipartimento
More informationA Statistical Approach for Target Counting in Sensor-Based Surveillance Systems
Proceedings IEEE INFOCOM A Statistical Approac for Target Counting in Sensor-Based Surveillance Systems Dengyuan Wu, Decang Cen,aiXing, Xiuzen Ceng Department of Computer Science, Te George Wasington University,
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationA Weighted Kernel-based Hierarchical Classification Method for Zoning of Sensors in Indoor Wireless Networks
A Weigted Kernel-based Hierarcical Classification Metod for Zoning of Sensors in Indoor Wireless Networks Daniel Alsamaa, Fara Mourad-Ceade Institut Carles Delaunay, ROSAS, LM2S Université de Tecnologie
More informationNetwork Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks
Downloaded from vbn.aau.dk on: April 7, 09 Aalborg Universitet etwork Coding to Enance Standard Routing Protocols in Wireless Mes etworks Palevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank;
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 informationReal-Time Wireless Routing for Industrial Internet of Things
Real-Time Wireless Routing for Industrial Internet of Tings Cengjie Wu, Dolvara Gunatilaka, Mo Sa, Cenyang Lu Cyber-Pysical Systems Laboratory, Wasington University in St. Louis Department of Computer
More informationCategory Detection Using Hierarchical Mean Shift
Category Detection Using Hierarcical Mean Sift Pavan Vatturi Scool of EECS 118 Kelley Engineering Center Oregon State University Corvallis, OR 97331 vatturi@eecs.oregonstate.edu Weng-Keen Wong Scool of
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 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 informationAn Analytical Approach to Real-Time Misbehavior Detection in IEEE Based Wireless Networks
Tis paper was presented as part of te main tecnical program at IEEE INFOCOM 20 An Analytical Approac to Real-Time Misbeavior Detection in IEEE 802. Based Wireless Networks Jin Tang, Yu Ceng Electrical
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 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 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 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 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 informationDistributed and Optimal Rate Allocation in Application-Layer Multicast
Distributed and Optimal Rate Allocation in Application-Layer Multicast Jinyao Yan, Martin May, Bernard Plattner, Wolfgang Mülbauer Computer Engineering and Networks Laboratory, ETH Zuric, CH-8092, Switzerland
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 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 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 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 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 informationGeo-Registration of Aerial Images using RANSAC Algorithm
NCTAESD0 GeoRegistration of Aerial Images using RANSAC Algoritm Seema.B.S Department of E&C, BIT, seemabs80@gmail.com Hemant Kumar Department of E&C, BIT, drkar00@gmail.com VPS Naidu MSDF Lab, FMCD,CSIRNAL,
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 informationAutomatic Image Registration
Kalpa Publications in Engineering Volume 1, 2017, Pages 402 411 ICRISET2017. International Conference on Researc and Innovations in Science, Engineering &Tecnology. Selected Papers in Engineering Automatic
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 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 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 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 informationLarge Scale Kernel Machines
Large Scale Kernel Macines Editors: Léon Bottou NEC Labs America Princeton, NJ 08540, USA leon@bottou.org Olivier Capelle capelle@tuebingen.mpg.de Max Planck Institure for Biological Cybernetics 72076
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 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 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 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 informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
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 informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
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 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 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 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 informationAn Anchor Chain Scheme for IP Mobility Management
An Ancor Cain Sceme for IP Mobility Management Yigal Bejerano and Israel Cidon Department of Electrical Engineering Tecnion - Israel Institute of Tecnology Haifa 32000, Israel E-mail: bej@tx.tecnion.ac.il.
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 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 informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
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 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 information