A Fast Fractal Model Based ECG Compression Technique Lin Yin 1,a, Fang Yu* 1,b
|
|
- April Morris
- 5 years ago
- Views:
Transcription
1 4th Iteratioal Coferece o Computer, Mechatroics, Cotrol ad Electroic Egieerig (ICCMCEE 2015) A Fast Fractal Model Based ECG Compressio Techique Li Yi 1,a, Fag Yu* 1,b 1 Electroicsad iformatio egieerig college, Togji Uiversity, ShagHai, Chia a fidigsea@163.com, b fagyu@togji.edu.c Keywords: Fractal; Dyamic Compariso Sequece Abstract. ECG moitorig equipmetwill geerate a huge mout of ECG sigals, which causes eormous pressure o server storage ad trasmissio. Therefore, may compressio techiques are proposed to overcome this problem icludig some fractal based lossy ECG compressio techiques. However, basic fractal based techiques caot be used widely o some large-scale applicatios because of its high computatio complexity.i this paper, a improved faster fractal model is proposed to solve this problem. The most importat ad time-cost step i the basic fractal model is the compariso of rage ad domai blocks. Traditioally, the compariso sequece is fixed ad static. I the ew improved fractal model, the sequece is chaged to be dyamic toaccelerate the compressio. It is foud that the improved fractal based techique ca achieve same compressio ratio ad similar Percetage Residual Differece(PRD) error with 4 times faster tha the basic fractal basedtechique. Itroductio The amout of ECG sigal geerated by kids ofmoitor equipmetis huge, so it brigs tremedous pressure o data storage to hospital ad data storage service providers. Meawhile, may e-health applicatios ad healthcare orgaizatios require access to these records, soit brigs pressure o trasmissio. Especially, mobile healthcare is icreasig to a great extet aroud global i recetly years ad itexacerbates these two problems udoubtedly. I order to reduce the pressure o storage ad trasmissio, may ECG compressio techiques have bee created ad implemeted. Geerally, these techiques ca be divided ito two mai categories: lossless ad lossy compressio. Losslesstechiques ca keep the full structure of origi ECG sigal without losig ay iformatio, but its compressio ratio is low ad caot satisfy the requiremet of large applicatios. O the other had, although lossy techique just recostruct approximated versio of the origi ECG sigal, the differeces betwee the origi ECG sigal ad the recostructed ECG sigal are very small, so hospitals ad healthcare sectors still ca use the recostructed sigal o medical research ad diagosis. More importatly, with lossy compressio techique, it is possible to achieve higher compressio ratio. There are two major types i lossy compressio: time domai compressio techiques [1-3] ad trasform domai techiques [4-7]. Wavelet-based techique [4], real-time ECG compressio ad trasmissio techique [5], 1D to 2D compressio techique [6] ad a ECG compressio usig Jpeg2000 algorithm [7]are all wellkow ad excellet ECG compressio techiques. But i the term of compressio ratio, they ca tcompare with fractal based techique.thesetechiques metioed above ca achieve 10 to 30 compressio ratio while fractal based techique ca achieve more tha 40 compressio ratio [8-9].Most of existig compressio techiques o matter time domai or trasform domaiare based o R peak detectio or other ECG parameter detectio [9]. Therefore, they ca ot provide high compressio ratio performace like fractal based techiques sice the fractal model has a huge advatage i dealig with such sigal with self-similarity characteristic.it has bee proved that the periodic self-similarity characteristic of the ECG sigal ca be a powerful feature to be used i fractal based compressio techiques [9]. The proposed techique i this paper is based o fractal model. At preset, the biggest problem i fractal based techiquesis effectiveess. Although usig fractal model ca achieve higher compressio ratio, the process of compressio is so complicated The authors - Published by Atlatis Press 150
2 that whole algorithm requires a lot of time to execute. It is the mai reaso that fractal based techique have t bee used i idustry-level applicatios widely ow. The major goal of this papers is to reduce the executio time of the basic fractal based techique.the most time-cost part of fractal based techiqueis the compariso of rage ad domai blocks. I the compariso process of fractal model, each rage block eeds to compare with each domai block to fid the most similaroe. Fially, the idexes of the most similar domai block ad some related parameters are stored ito the compressed file. I order to improve the fractal based techique, dyamic compariso sequece is proposed i this paper to reduce the umber of compariso of rage ad domai blocks. Dyamic compariso sequecemakes each rage block to fid the domai that meets the requiremet without comparig whole domai blocks.the fractal model usig dyamic domai sequece is implemeted i this paper ad evaluatedby three importat measures: compressio ratio, sigal recostructio error ad compressio executio time. Experimet results shows that the proposed improved fractal based techique ca achieve same compressio ratio ad similar recostructio error with oly ¼ compressio time of the basic fractal based techique. Related work May researchers have coducted ivestigatio o fractal based ECG compressiotechiques. A. Khalaj ad H. Miar Naimi proposed ew efficiet fractal based compressio method for electrocardiogram sigals[8]. Their method is based o the fractal model ad IFS(Iterated Fuctio System). I their model the origi ECG sigal is divided ito o-overlapped blocks called rage ad the dow-sampled copy versio is divided ito overlapped blocks called domai. For each rage block, their method fid the most similar domai the geerates the fractal trasformatio parameters. The fial compressed file store the idexes of rage ad domai blocks ad the parameters. The idexes ad parameters are used to recostructio the ECG sigal. Ayma Ibaida, Dhiah Al-Shammary ad Ibrahim Khalil proposed a cloud eable fractal based ECG compressio techique[9]. Their work is somewhat similar to A. Khalaj ad H. Miar Naimi s, i their method they used two trasformatio parameters whe i A. Khalaj ad H. Miar Naimi s oly oe parameter is used. Their techique ca achieve high compressio ratio with low recostructio error. Accordig to Ayma Ibaida s paper [9], The self-similarity characteristic of ECG sigal is powerful feature that ca be used i fractal model.the improved fractal model proposed i this paper is based o their model ad ca achieve same compressio ratio ad similar recostructio error with less compressio time. The evaluatio sectio shows the compressio performace compariso. The basic coefficiets used to describe the trasformatio relatioship are scale (S) ad offset (O).The scale coefficiet is defied as the greatest differece amog ECG istaces i the rage block divided by the greatest differece amog the ECG istaces i the domai block. Eq. (1) shows the calculatio of scale coefficiet[10]. i=1 D(i)R(i) i=1 R(i) i=1 D(i) S = (1) i=1 i=1 ) 2 D(i) 2 ( D(i) The offset coefficiet is defied as the differece betwee the average ECG istace value i the rage block ad the average ECG istace value i the domai block.eq. (2) shows the calculatio of offset coefficiet[10]. O = 1 ( R(i) S D(i) ) (2) i=1 i=1 Eqs. (3) shows how to use scale ad offset coefficiets ad domai block to geerate the rage block[10]. R S D + O (3) These parameters are calculated for each rage block ad domai blockwhich eed to be compared ad describe the trasformatio relatioship betwee rage ad domai block. 151
3 The basic fractal model proposed i Ayma Ibaida s paper uses static compariso sequece, which meas each rage block eeds to compare with all domai blocks ad calculate the fractal coefficiets for all domai blocks. The compariso process is show i Fig. 1. Fig 1. The compariso process usig static sequece. I ECG sigal, two adjacet rage blocks are similar o the value of some parameters. So whe oe domai block is similar to a rage block greatly, it has a high possibility to be similar to the ext rage block. But this feature is ot used i the fractal model usig static compariso sequece which is show i Fig. 2. These domai blocks i the black boxes are more similar to the curret rage block obviously, but the fractal model usig static compariso sequece does t care about this feature ad it still compares the rage block with all domai blocks oe by oe. Compressio algorithm Fig 2. The defect of static compariso sequece. I our improved fractal model, dyamic compariso sequece is used to reduce the umber of compariso ad accelerate the compariso process. The compariso sequece of curret rage block is geerated by the compariso result of previous rage block. It ca always keep the more similar domai blocks i the frot of the compariso sequece for each rage block ad fid the domai block meetig the requiremet to break the iteratio without comparig with whole domai. The compariso process is show i Fig
4 Fig 3. The compariso process usig dyamic sequece. I the proposed improved fractal based compressio techique, for each rage block algorithm fids the domai block with high similarity. There is a queue storig the idexes of domai block. For each give rage block, the algorithm iterates through domai blocks accordig the idex order stored i the queue ad calculates the fractal coefficiets. Whe the curret domai block is similar to the give rage block greatly, algorithm keeps the correspodig idex i place. Whe the curret domai block is ot similar to the give rage block, algorithm moves the correspodig idex to the tail of the queue. After foud the domai block meetig requiremet, the idexes queue has bee adjusted ad ca be used as the compariso sequeceof the ext rage block. Fractal Root Mea Square (RMS) is used as the similarity measuremet betwee rage block ad domai block.eq. (4) shows the calculatio of the RMS[9]. RRRRRR = 1 [ RR(ii)2 + SS SS DD(ii) 2 2 RR(ii)DD(ii) + 2OO DD(ii) + OO( 2 RR(ii) )] If the curret RMS is less tha the previous stored value, algorithm will store the curret calculated fractal coefficiet i the output parameters ad update the RMS value. If the curret RMS is less tha some threshold, algorithm will break the curret iteratio i advace ad store the correspodig fractal coefficiets to the compressed file. I order to further improve the performace, some codig techiques ca be used.some arrays ca be calculated before the iteratio ad stored i the memory so that program ca ru faster with a little more memory usage. Meawhile, affie trasforms [11] are applied to help to achieve higher similarity betwee the rage ad domai blocks. Four differet kids of affie trasformatios are used i the algorithm ad the affie trasformatio ecodig umber will be store i the fial compressed file. The fial compressed file cotais several rows, each row icludes the fractal coefficiet (scale ad offset), the domai block idex ad the affie trasformatio ecodig umber. Compressio Algorithm INPUTS: R represets the origi ECG sigal bs represets the block size js represets the jump step of the search loop i domai OUTPUTS: so represets the scale value for the selected domai block oo represets the offset value for the selected domai block io represets the idex of the selected domai block (4) 153
5 aff0 represets the affie trasformatio ecodig value for the selected domai block // parameter iitial D=the dow-sampled versio of origi ECG sigal umofrblocks=the umber of rage blocks umofdblocks=the umber of domai blocks queue=oe-dimesioal queue, queue[i] represets the idex of domai block q=0, represets idex of queue // queue iitial while (q< umofdblocks) queue.add(q++) for each rage block Ri i R do: sumr=sum(ri) sumr2=sum(ri.^ 2) rms0=1000 so=0 oo=0 io=0 aff0=0 =bs toappedlist=oe-dimesioal queue storig the elemet reomved from queue for each elemet q i queue do: j=queue[q] for a=0 to 1 do: Dj=jth domai block sumrd=sum(ri * Dj) sumd=sum(dj) sumd2=sum(dj.^ 2) s=(( * sumrd) - (sumr * sumd[j])) / ( * sumd2[j] - sumd[j]^2) s=(sumr - s * sumd[j]) / rms=sqrt((sumr2 + s * (s * sumd2[j] - 2 * sumrd + 2 * o * sumd[j]) + o * ( * o - 2 * sumr)) / ) if rms<rms0: so = s oo = o io = j aff0 = a rms0 = rms ed if ed for if rms0<5.75 do: break ed if if rms0>15 do: remove q from queue add q to toappedlist ed if ed for add toappedlist to queue write so, oo, io, aff0 to compressd file ed for 154
6 Evaluatio Three measuremets are used i this paper to measure theperformace of the proposed improved fractal model ad compare it with the basic fractal model.the compressio ratio (CR) is a very importat measuremet that reflects the ratio betwee the origial sigal ad the compressed sigal. Eq. (5) shows the calculatio of the compressio ratio. tthee ssssssss oooo oooooooooooooooo ffffffff CCCC = (5) tthee ssssssss oooo cccccccccccccccccccc ffffffff The percetage residual differece (PRD) is a importat measure that reflects the differeces betwee the origial sigal ad the recostructed sigal. Eq. (6) shows the calculatio of the percetage residual differece. PPPPPP = NN (RR ii RR rrrrrr ) 2 NN 2 RR ii R represets the origial ECG sigal ad R re represets the recostructed versio. The improved fractal model based algorithm is measured usig the MIT-BIH Arrhythmia Database. Each ECG record is of 30 mi legth ad collected from differet patiets. Due to the limitatios of our equipmet, the test for the improved fractal model i this paper just use 10 secods of each record. If we use loger legth data i the future work, the test result will be better (the value of PRD will be lower). However, eve i the curret situatio, the improved fractal model still achieve good performace. I the improved fractal mode,the block size used is 35 poits ad the jump step is 10 poits.the model ad the algorithm are implemeted by Java laguage ad experimets are executed o the retia MacBook Prowith Mac OS X system. The experimet result ad the performace of the basic model ad other ECG compressio techiques are show i Table 1. The proposed algorithm ca achieve the compressio ratio of 42 with the PRD value less tha 2%. I light of the fact that the similarity with the origial data becomes meaigless whe the PRD value is higher tha 2% [5]. Compared with the basic fractal model, the improved model ca achieve same compressio ratio ad similar PRD error. Table 1 CR ad PRD for differet compressio techiques compared with ours. The improved Data model The basic model[9] [5] [6] [7] [8] CR PRD CR PRD CR PRD CR PRD CR PRD CR PRD (6) 155
7 The compressio time compariso betwee the basic fractal model ad the improved fractal model is show i Table 2 ad Table 3.The legth of the ECG segmet used i the experimet is 10 secods.the uit is millisecod. I this paper, the basic model is implemeted by ourselves accordig to the correspodig paper [9]. Both models use the block size of 35 ad jump step of 10 ad ruo the same machie. As the tables show, the executio time of the improved model ca be faster 4 times tha the basic model. Table 2 Executio time compariso of basic model ad improved model Data The improved model The basic model Table 3 Executio time compariso of basic model ad improved model Data The improved model The basic model Coclusio I this paper, a improved faster fractal model based ECG compressio techique is proposed to reduce the executio time of the basic model. The fractal model has bee proved that ca be used to be a good ECG compressio techique with high compressio ratio ad low PRD error. However, the high computatio complexity ad log executio time makes the basic fractal model be difficult to used i large-scale applicatios. Dyamic sequece techique is used i this paper to optimize the compariso process of the rage ad domai blocks. Fially,the proposed faster fractal model ca achieve same compressio ratio ad similar PRD error with oly ¼ executio time of the basic model. It is possible to reduce the PRD error further which will be studied i the future work. Refereces [1] Aravut Z. ECG sigal compressio based o Burrows-Wheeler trasformatio ad iversio raks of liear predictio[j]. Biomedical Egieerig, IEEE Trasactios o, 2007, 54(3): [2] Fira C M, Goras L. A ECG sigals compressio method ad its validatio usig NNs[J]. Biomedical Egieerig, IEEE Trasactios o, 2008, 55(4): [3] Huag B, Wag Y, Che J. 2-D compressio of ECG sigals usig ROI mask ad coditioal etropy codig[j]. IEEE trasactios o bio-medical egieerig, 2009, 56(4): [4] Ku C T, Hug K C, Wu T C, et al. Wavelet-based ECG data compressio system with liear quality cotrol scheme[j]. Biomedical Egieerig, IEEE Trasactios o, 2010, 57(6): [5] S. Lee, J. Kim, M. Lee, A real-time ECG data compressio ad trasmissio algorithm for a e- health device, IEEE Tras. Biomed. Eg. 58 (9) (2011) [6] N.Rodrigues,E.daSilva,S.deFaria,V.daSilva,M.deCarvalho,etal.,ECGsigal compressio based o DC equalizatio ad complexity sortig, IEEE Tras. Biomed. Eg. 55 (7) (2008) [7] H.-H. Chou, Y.-J. Che, Y.-C. Shiau, T. so Kuo, A effective ad efficiet compressio algorithm for ECG sigals with irregular periods, IEEE Tras. Biomed. Eg. 53 (6) (2006) [8]A. Khalaj, H.M. Naimi, New efficiet fractal based compressio method for electrocardiogram sigals, i: Caadia Coferece o Electrical ad Computer Egieerig, CCECE 09, IEEE, 2009, pp
8 [9]Ibaida A, Al-Shammary D, Khalil I. Cloud eabled fractal based ECG compressio i wireless body sesor etworks[j]. Future Geeratio Computer Systems, 2014, 35: [10]Al-Shammary D, Khalil I. Dyamic fractal clusterig techique for soap web messages[c]//services Computig (SCC), 2011 IEEE Iteratioal Coferece o. IEEE, 2011: [11] The trasform ad data compressio hadbook[m]. CRC press,
3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationLow Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationWavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)
Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationStudy on effective detection method for specific data of large database LI Jin-feng
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationJournal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article
Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationWavelet Based Dual Encoding Lossless Medical Image Compression
avelet Based Dual Ecodig Lossless Medical Image Compressio *V.Maohar, Asst. Professor, SR Egieerig College, aragal, TG, Idia, maoharvu@gmail.com **Dr.G. Laxmiarayaa, Professor, oly Mary Istitute of Techology,
More informationTerm Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.
CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationquality/quantity peak time/ratio
Semi-Heap ad Its Applicatios i Touramet Rakig Jie Wu Departmet of omputer Sciece ad Egieerig Florida Atlatic Uiversity oca Rato, FL 3343 jie@cse.fau.edu September, 00 . Itroductio ad Motivatio. relimiaries
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationwhy study sorting? Sorting is a classic subject in computer science. There are three reasons for studying sorting algorithms.
Chapter 5 Sortig IST311 - CIS65/506 Clevelad State Uiversity Prof. Victor Matos Adapted from: Itroductio to Java Programmig: Comprehesive Versio, Eighth Editio by Y. Daiel Liag why study sortig? Sortig
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationData-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps
Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationTransforming Irregular Algorithms for Heterogeneous Computing - Case Studies in Bioinformatics
Trasformig Irregular lgorithms for Heterogeeous omputig - ase Studies i ioiformatics Jig Zhag dvisor: Dr. Wu Feg ollaborator: Hao Wag syergy.cs.vt.edu Irregular lgorithms haracterized by Operate o irregular
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationSearching a Russian Document Collection Using English, Chinese and Japanese Queries
Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.
More informationExtending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis
Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de
More informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationVIDEO WATERMARKING IN 3D DCT DOMAIN
14th Europea Sigal Processig Coferece (EUSIPCO 06), Florece, Italy, September 4-8, 06, copyright by EURASIP VIDEO WATERMARKING IN 3D DCT DOMAIN M. Carli, R. Mazzeo, ad A. Neri AE Departmet Uiversity of
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationAn Efficient Implementation Method of Fractal Image Compression on Dynamically Reconfigurable Architecture
A Efficiet Implemetatio Method of Fractal Image Compressio o Dyamically Recofigurable Architecture Hidehisa Nagao, Akihiro Matsuura, ad Akira Nagoya NTT Commuicatio Sciece Laboratories 2-4 Hikaridai, Seika-cho,
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationHole Machining Path Planning Optimization Based on Dynamic Tabu Artificial Bee Colony Algorithm
Research Joural of Applied Scieces, Egieerig ad Techology 5(4): 1454-1460, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scietific Orgaizatio, 2013 Submitted: August 17, 2012 Accepted: September 17,
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationPrecise Psychoacoustic Correction Method Based on Calculation of JND Level
Vol. 116 (2009) ACTA PHYSICA POLONICA A No. 3 Optical ad Acoustical Methods i Sciece ad Techology Precise Psychoacoustic Correctio Method Based o Calculatio of JND Level Z. Piotrowski Faculty of Electroics,
More informationA Low Complexity and Efficient Face Recognition Approach in JPEG Compressed Domain Using Quantized Coefficients
00 5th Iteratioal Symposium o Telecommuicatios (IST'00) A Low Complexity ad Efficiet Face Recogitio Approach i JPEG Compressed Domai Usig Quatized Coefficiets Alireza Sepasmoghaddam Islamic Azad Uiversity
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More information