Spatially-Variant Morphological Restoration and Skeleton Representation

Size: px
Start display at page:

Download "Spatially-Variant Morphological Restoration and Skeleton Representation"

Transcription

1 IEEE TRANSACTIONS ON IMAGE PROCESSING 1 Spatially-Variat Morphological Restoratio ad Skeleto Represetatio Nidhal Bouayaya, Studet Member, IEEE, Mohammed Charif-Chefchaoui ad Da Schofeld, Seior Member, IEEE. Abstract The theory of spatially-variat (SV) mathematical morphology is used to exted ad aalyze two importat image processig applicatios: morphological image restoratio ad skeleto represetatio of biary images. For morphological image restoratio, we propose the SV alteratig sequetial filters ad SV media filters. We establish the relatio of SV media filters to the basic SV morphological operators (i.e., SV erosios ad SV dilatios). For skeleto represetatio, we preset a geeral framework for the SV morphological skeleto represetatio of biary images. We study the properties of the SV morphological skeleto represetatio ad derive coditios for its ivertibility. We also develop a algorithm for the implemetatio of the SV morphological skeleto represetatio of biary images. The latter algorithm is based o the optimal costructio of the spatially-variat structurig elemet mappig desiged to miimize the cardiality of the SV morphological skeleto represetatio. Experimetal results show the dramatic improvemet i the performace of the SV morphological restoratio ad SV morphological skeleto represetatio algorithms i compariso to their traslatio-ivariat couterparts. I. INTRODUCTION Over the past few decades, morphological operators have gaied icreasig popularity i the implemetatio of sigal ad image processig systems [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]. The iheret parallelism of the class of morphological filters allows the implemetatio of very efficiet ad low-complexity algorithms for sigal ad image processig applicatios [1], [2], [6], [9], [10], [11], [13], [14], [15], [16]. The basic cocepts ad aalytic tools i mathematical morphology ca be foud, for biary images, i set theory ad itegral geometry [6], [9]. I mathematical morphology, a biary image is represeted as a subset of the 2D Euclidea space, R 2 or its digitized equivalet Z 2, ad image processig trasformatios are represeted as set mappigs betwee collectios of subsets. Erosios ad dilatios are the two fudametal morphological operators [1], [2], [17], [18], [19], [20], [21]. They are characterized by a subset called the structurig elemet that is used to probe the image. Mathero has captured the ubiquity of morphological operators by demostratig that ay icreasig (i.e., operators which preserve sigal orderig) ad traslatio-ivariat operators ca be represeted as uios (resp., itersectios) of erosios (resp., dilatios) [6]. I most applicatios of mathematical morphology, the structurig elemet remais costat i shape ad size as the image is probed. Hece, the focus of mathematical morphology has bee mostly devoted to traslatio-ivariat operators. A extesio of the theory to spatially-variat operators has emerged due to the requiremets of some applicatios, such as traffic spatial- measuremets [22] ad rage imagery [23]. For example, i the aalysis of images from traffic cotrol cameras i [11], vehicles at the bottom of the image are closer ad appear larger tha those higher i the image. Hece, the structurig elemet size should vary liearly with the vertical positio i the image. I rage imagery, the value of each pixel is related to the distace to the imagig device. Cosequetly, the apparet height of a object is a fuctio of the object s itesity rage. Hece, oe ca process (e.g., extract or elimiate) differetly-scaled objects of iterest i the image by adaptig the size of the structurig elemet(s) to the local itesity rage [23]. Differet techiques ad algorithms to spatially adapt the structurig elemet i a image have bee proposed i [23], [24], [25], [26], [27] ad [28]. Roerdik [29], [30] itroduced the theoretical backgroud for a mathematical morphology that is ot based o traslatio-ivariat trasformatios i the Euclidea space. The proposed approach, however, is restricted by various rigid algebraic costructios such as polar morphology ad costraied perspective morphology. I [31], a ew class of morphological operatios, which allow oe to select varyig shapes ad orietatios of structurig elemets, is preseted. However, the sweep erosio ad dilatio do ot satisfy the basic properties of mathematical morphology. I particular, they are ot icreasig operators i geeral ad the sweep dilatio operator does ot commute with the uio. A uified theory of spatially-variat mathematical morphology requires a further abstractio of the basic otios of traslatio-ivariat mathematical morphology. A fudametal result i lattice morphology 1 that provides the represetatio of a large class of oliear ad o-ecessarily traslatio-ivariat operators i terms of lattice erosios ad dilatios has bee preseted i [33]. This represetatio, however, does ot posses the geometric iterpretatio, captured by the structurig elemet, that is crucial i sigal ad image processig. A separate approach to the represetatio of spatially-variat mathematical morphology, which preserves the geometrical structurig elemet, i the Euclidea space, has bee itroduced by Serra i [11]. Serra defied the cocept of a structurig fuctio, which associates to each poit i the space a structurig elemet. Charif-Chefchaoui ad Schofeld [34], [35] pursued 1 Lattice morphology, itroduced by Serra [11], is a powerful tool for the abstractio of mathematical morphology based o lattice theory, a topic devoted to the ivestigatio of the algebraic properties of partially-ordered sets [32].

2 IEEE TRANSACTIONS ON IMAGE PROCESSING 2 the ivestigatio of spatially-variat mathematical morphology i a systematic way. They itroduced the basic spatially-variat morphological operators ad ivestigated their properties. A comprehesive developmet of the theory of spatially-variat mathematical morphology i the Euclidea space has bee preseted i [36]. This paper elaborates o the theory ad applicatios of spatially-variat mathematical morphology preseted i [36]. We illustrate the power of the theory of spatially-variat mathematical morphology for two importat image processig applicatios: morphological image restoratio ad skeleto represetatio. Morphological Image restoratio is a importat problem i image processig ad aalysis applicatios. It requires the developmet of a efficiet filterig procedure which restores a image from its oisy versio [4], [5], [11], [37], [8], [38]. I order to devise such a filterig procedure, we have to cosider two fudametal issues: (a) the restoratio filter should be effective i elimiatig the oise degradatio; ad, (b) it should be able to restore various importat aspects of the shape-size cotet of the oise-free image uder cosideratio, as well as preserve its crucial geometrical ad topological structure. The effectiveess of morphological filters i the restoratio of oisy images has bee demostrated repeatedly [4], [8], [38], [9], [11], [22], [37], [39], [40], [41]. For example, Maragos ad Schafer [4] have demostrated a strog relatioship betwee the alteratig filter ad the media filter. Sterberg [37] itroduced alteratig sequetial filters (ASF) ad experimetally showed their oise removal capability. Moreover, Schofeld ad Goutsias [8] have show that the class of alteratig sequetial filters is a set of smoothig morphological filters which best preserve the crucial structure of iput images, i the least-mea-differece sese. Traslatioivariat morphological filters ca be used to remove oise structures that are smaller tha the size of the structurig elemet. However, some importat features of the sigal might be removed as well. May researchers cosidered adaptive morphological filterig i order to deal with this problem [24], [25], [26]. For example, Che et al. [24], developed a algorithm for adaptive sigal smoothig by spatially varyig the filterig scales depedig o the local property of each poit i the sigal. To achieve this goal, they itroduced the progressive umbra-fillig (PUF) procedure. Their experimetal results have show that this approach ca successfully elimiate oise without oversmoothig the importat features of a sigal. It ca be easily established that the morphological operators proposed i [24] are the gray-level extesios of the spatially-variat biary morphological operators [42]. I this paper, we show that the theory of spatially-variat mathematical morphology uifies may classical morphological filters that use spatially-variat structurig elemets, which are suitable for adaptive image processig applicatios. We itroduce spatially-variat alteratig sequetial filters ad spatially-variat media filters for the restoratio of images from their oisy versios. We derive the basic properties of spatially-variat alteratig sequetial filters. We also derive a kerel represetatio of spatially-variat media filters, which establishes the relatio betwee the SV media filters ad the basic SV morphological operators. We also demostrate the power of the theory of spatiallyvariat mathematical morphology by geeralizig the morphological skeleto represetatio to the spatially-variat morphological skeleto represetatio. The morphological skeleto has bee ivestigated by may researchers [9], [43], [44], [45], [46], maily for the purpose of image codig ad shape recogitio. I [44], a geeral theory for the morphological represetatio of discrete biary images was preseted. The basis of this theory relies upo the geeratio of a set of o-overlappig segmets of a image, which produce a decompositio that guaratees exact recostructio of the origial image. Decreasig the cardiality of the morphological skeleto represetatio by reducig its redudacy has bee explored by may authors [43], [44], [46]. I this paper, We exted the morphological skeleto represetatio framework preseted i [44] to the spatially-variat case. We study the properties of the spatially-variat morphological skeleto represetatio ad derive coditios for its ivertibility. We also propose a algorithm for the implemetatio of the SV morphological skeleto. This algorithm miimizes the cardiality of the image represetatio by derivig a optimal uiversal algorithm for the costructio of a spatially-variat structurig elemet mappig. This paper is orgaized as follows: I Sectio II, we provide a brief overview of spatially-variat mathematical morphology. Specifically, we preset the basic spatially-variat morphological operators. We summarize the spatially-variat kerel represetatio, which shows that ay icreasig operator that fixes the etire space ca be represeted as a uio (resp., itersectio) of SV erosios (resp., SV dilatios). This result demostrates the ubiquity of the basic SV morphological operators (i.e., SV erosios ad SV dilatios). I Sectio III, we illustrate the impact of spatially-variat mathematical morphology o image restoratio applicatios. I particular, we address morphological image restoratio by itroducig the SV alteratig sequetial filters ad SV media filters. We also provide a example for selectio of the spatially-variat structurig elemet mappig for image restoratio applicatios. We experimetally show the superior oise removal capabilities of these filters compared to their traslatio-ivariat couterparts. I Sectio IV, we demostrate the power of spatiallyvariat mathematical morphology i skeleto represetatio applicatios. Specifically, we propose the SV morphological skeleto represetatio, develop some of its properties ad derive coditios for its ivertibility. We further propose a uiversal algorithm for the implemetatio of the SV morphological skeleto represetatio. We provide simulatio results which demostrate the eormous improvemet of the spatiallyvariat morphological skeleto represetatio i compariso to its traslatio-ivariat couterpart. Fially, i Sectio V, we preset a brief summary of our results ad discuss our pla for future work. The proofs of all theoretical results that are ew cotributios i this paper are preseted i the appedices.

3 IEEE TRANSACTIONS ON IMAGE PROCESSING 3 II. SPATIALLY-VARIANT MATHEMATICAL MORPHOLOGY Notatio: We cosider a o-empty set ξ = R or Z. The set P(ξ) deotes the set of all subsets of ξ. Elemets of the set ξ will be deoted by lower-case letters; e.g., a,b,c. Elemets of the set P(ξ) will be deoted by upper-case letters; e.g., A,B,C. A order o P(ξ) is imposed by the iclusio. We use ad to deote the uio ad itersectio i P(ξ), respectively. X c deotes the complemet of X P(ξ). The set differece X 1 X 2 of sets X 1 ad X 2 is defied by X 1 X 2 = X 1 X c 2. The traslatio X + {y} also deoted by X y of a set X P(ξ) by y ξ is defied by X + {y} = X y = {z : z = x+y, x X}. The cardiality X of a set X is the total umber of elemets cotaied i the set. We use O = P(ξ) P(ξ) to deote the set of all operators mappig P(ξ) ito itself. Elemets of the set O will be deoted by lower case Greek letters; e.g., α,β,γ. A order o O is imposed by the iclusio ; i.e., α β if ad oly if α(x) β(x), for every X P(ξ). We shall restrict our attetio to o-degeerate operators; i.e., α(x) ξ ad α(x) for some X P(ξ) ad α( ) =, for every α O ( the set P(ξ) is used to deote the empty set). A mappig ψ O is icreasig if X Y = ψ(x) ψ(y ), for all X,Y P(ξ). traslatio-ivariat if ψ(x a ) = (ψ(x)) a, for every X P(ξ) ad every a ξ. extesive (res. ati-extesive) if X ψ(x) (resp. ψ(x) X), for all X P(ξ). idempotet if ψ(ψ(x)) = ψ(x), for all X P(ξ). The mappig ψ O is the dual of the mappig ψ O iff ψ (X) = (ψ(x c )) c (X P(ξ)). A. Spatially-Variat Morphological Operators We shall ow preset a overview of the basic defiitios ad properties of spatially-variat mathematical morphology itroduced by Charif-Chefchaoui ad Schofeld [34] [35]. For a more comprehesive itroductio to spatially-variat mathematical morphology refer to [36]. 2 1) SV erosios ad SV dilatios: The spatially-variat structurig elemet θ is a mappig from ξ ito P(ξ). The trasposed spatially-variat structurig elemet θ is a mappig from ξ ito P(ξ) give by θ (y) = {z ξ : y θ(z)} (y ξ). (1) I traslatio-ivariat mathematical morphology, θ is the traslatio mappig by a fixed set B P(ξ), i.e., θ(z) = B + z, z ξ. Hece, the trasposed structurig elemet correspods to the traslatio by the trasposed set ˇB = { b : b B}. The spatially-variat erosio E θ O is give by E θ (X) = {z ξ : θ(z) X} = θ c (y) (X P(ξ)). y X c 2 Some of the results preseted i this sectio have bee exteded to the gray-level case by Che et al. [24], [25]. (2) The spatially-variat dilatio D θ O is give by D θ (X) = {z ξ : θ(z) X } = θ (y) (X P(ξ)). y X (3) The SV erosios ad dilatios satisfy the basic properties of traslatio-ivariat erosios ad dilatios. Below we list the mai properties that we eed i the sequel. 2) Properties of SV erosios ad SV dilatios: a) Adjuctio: For every mappig θ from ξ to P(ξ) the pair (E θ, D θ ) defies a adjuctio o P(ξ). I other words, D θ (X) Y X E θ (Y ) (X,Y P(ξ)). (4) This result states that E θ ad D θ are a erosio ad a dilatio, respectively, i the sese that these operators are distributive over itersectio ad uio, respectively, i.e., E θ ( X i ) = E θ (X i ), ad D θ ( X i ) = D θ (X i ), i I i I i I i I (5) for a arbitrary collectio of sets {X i P(ξ) : i I}. These idetities ca also be derived easily without referece to the framework of adjuctios. b) Duality: The SV erosio E θ ad the SV dilatio D θ are dual operators, i.e., E θ (X) = D θ (X) (X P(ξ)). (6) This relatio states that dilatig a set X by the mappig θ is equivalet to erodig its complemet X c by the same mappig ad complemetig the result. c) Icreasig: For a give mappig θ, the SV erosio E θ ad the SV dilatio D θ are icreasig operators, i.e., X Y = E θ (X) E θ (Y ), ad D θ (X) D θ (Y ). (7) Icreasig operators preserve order (cotrast) i the sese that they prohibit extractio of iformatio from occluded regios. This property is cosistet with the models of the huma visual system which have bee ivestigated i the field of cogitive psychology. Specifically, the high-level visio models of gestalt psychology state that the perceptual processes uderlyig the visual iterpretatio of a scee are icreasig operators [9], [47], [48]. d) Extesivity ad Ati-extesivity: If z θ(z) for every z ξ, the the SV erosio E θ is ati-extesive ad the SV dilatio D θ is extesive, i.e., E θ (X) X, ad X D θ (X) (X P(ξ)). (8) e) Serial Compositio: Let us use E θ1 (θ 2 ) ad D θ1 (θ 2 ) to deote the mappigs from ξ ito P(ξ) give by (E θ1 (θ 2 ))(z) = E θ1 (θ 2 (z)) ad (D θ1 (θ 2 ))(z) = D θ1 (θ 2 (z)), for every z ξ. Successively SV erodig (resp. SV dilatig) a set first by θ 1 ad the by θ 2 is equivalet to SV erodig (resp. SV dilatig) by the dilated mappig D θ (θ 2 ), i.e., we 1 have ad E θ2 (E θ1 (X)) = E Dθ (θ 2)(X) (X P(ξ)), (9) 1 D θ2 (D θ1 (X)) = D Dθ (θ 2)(X) (X P(ξ)). (10) 1

4 IEEE TRANSACTIONS ON IMAGE PROCESSING 4 3) SV opeigs ad SV closigs: We shall ow preset the spatially-variat opeigs ad closigs ad review their mai properties. The spatially-variat opeig Γ θ O is give by Γ θ (X) = D θ (E θ (X)) (X P(ξ)). (11) The spatially-variat closig Φ θ O is give by Φ θ (X) = E θ (D θ (X)) (X P(ξ)). (12) The SV opeig ad SV closig have ice geometrical iterpretatios. Let us refer to θ(z) by the local structurig elemet at poit z. The SV opeig of a set X is the domai swept out by all local structurig elemets which are icluded i X. By duality, a poit z belogs to the SV closig if ad oly if all the local structurig elemets cotaiig z hit X. Formally, we have the followig equivalet defiitios for the SV opeig ad SV closig: Γ θ (X) = {θ(y) : θ(y) X ; y ξ}, (13) Φ θ (X) = {z ξ : θ(y) X 0, for every θ(y) : z θ(y)}, (14) for every X P(ξ). 4) Properties of SV opeigs ad SV closigs: a) Duality: The SV opeig Γ θ ad the SV closig Φ θ are dual operators, i.e., Γ θ(x) = Φ θ (X) (X P(ξ)). (15) b) Icreasig: For a give θ, the SV opeig Γ θ ad the SV closig Φ θ are icreasig operators o P(ξ), i.e., X Y = Γ θ (X) Γ θ (Y ), ad Φ θ (X) Φ θ (Y ). (16) c) Extesivity ad Ati-extesivity: For every mappig θ, the SV opeig (resp. SV closig) is ati-extesive (resp. extesive). We have Γ θ (X) X, ad Φ θ (X) X (X P(ξ)). (17) d) Idempotece: The SV opeig Γ θ ad SV closig Φ θ are idempotet operators, i.e., for every X P(ξ), Γ θ (Γ θ (X)) = Γ θ (X), ad Φ θ (Φ θ (X)) = Φ θ (X). (18) e) Fixed poits: It was show i [6] ad [49] that the traslatio-ivariat opeig ad closig ca be completely specified from their fixed poits. The framework of fixed poits ca be exteded to the spatially variat case by defiig θ-ope ad θ-closed sets as follows: Defiitio 1: X P(ξ) is θ-ope (resp., θ-closed) if Γ θ (X) = X (resp., Φ θ (X) = X). A useful characterizatio of θ-ope ad θ-closed sets is give by the followig propositio; Propositio 1: [36] X P(ξ) is θ-ope (resp., θ-closed) if ad oly if there exists Y P(ξ) such that X = D θ (Y ) (resp., X = E θ (Y )). The cocept of θ-ope ad θ-closed sets was further exteded to mappigs as follows. Cosider mappigs θ 1 ad θ 2 from ξ ito P(ξ). The mappig θ 1 is θ 2 -ope (resp., θ 2 closed) if θ 1 (z) is θ 2 -ope (resp., θ 2 -closed), for every z ξ. We the have the followig result: If θ 1 is θ 2 -ope, the Γ θ1 (X) Γ θ2 (X), ad Φ θ2 (X) Φ θ1 (X) (X P(ξ)). (19) ad f) Sievig structure: If θ 1 is θ 2 ope, the we have Γ θ1 (Γ θ2 (X)) = Γ θ1 (X); Γ θ2 (Γ θ1 (X)) = Γ θ1 (X), (20) Φ θ1 (Φ θ2 (X)) = Φ θ1 (X); Φ θ2 (Φ θ1 (X)) = Φ θ1 (X), (21) for every X P(ξ). B. Spatially-Variat Kerel Represetatio A importat otio related to set mappigs is that of the kerel, itroduced by Mathero [6] for traslatio-ivariat mappigs. Mathero subsequetly showed that every icreasig ad traslatio-ivariat operator ca be writte as a uio of traslatio-ivariat erosios, or, alteratively, as a itersectio of traslatio-ivariat dilatios. This result was exteded to SV operators i [36]. To state the correspodig theorem, we eed the otio of a SV kerel. Let ψ O. The spatially-variat kerel Ker(ψ) of ψ is give by Ker (ψ) = {θ : z ψ(θ(z)), for every z ξ}. (22) A operator ψ O is a coverig operator (abbreviated as C-operator) if ψ is icreasig ad satisfies ψ(ξ) = ξ. A importat property of C-operators is that their kerel is o-trivial ad is uique. I other words, the mappig which associates to each C-operator its kerel is a oe-to-oe mappig. [36]. The kerel represetatio of C-operators is give by the followig theorem; Theorem 1: [36] A operator ψ O is a C-operator if ad oly if ψ(x) = E θ (X) = D θ (X), (23) θ Ker (ψ) θ Ker (ψ ) for every X P(ξ). Theorem 1 is ot oly iterestig theoretically but also for practical applicatios. For some C-operators, a subset of the kerel, called a basis, is sufficiet for its represetatio i terms of SV erosios or SV dilatios. Therefore, if the kerel of a C-operator or oe of its basis has a fiite umber of mappigs the the C-operator ca be exactly represeted as a fiite uio of SV erosios, or equivaletly, as a fiite itersectio of SV dilatios. This represetatio ca tremedously simplify the aalysis ad implemetatio of the o-liear C-operator. We will show later that the adaptive media filter has a fiite kerel represetatio. Hece, it ca be exactly expressed via a closed formula ivolvig oly itersectios ad uios of sets without requirig ay sortig. I the followig sectios, we apply the geeral theory of spatially-variat mathematical morphology to two image processig applicatios: morphological restoratio of oisy images ad morphological skeleto represetatio. III. SPATIALLY-VARIANT MORPHOLOGICAL RESTORATION We shall cosider SV Alteratig Sequetial Filters (SVASF) ad adaptive media filters for spatially-variat or adaptive image restoratio.

5 IEEE TRANSACTIONS ON IMAGE PROCESSING 5 A. SV Alteratig Sequetial Filters 1) Theoretical Aspects: Alteratig Sequetial Filters (ASF) were itroduced by Sterberg [37] ad were extesively studied by Serra [11]. Basically, a alteratig sequetial filter is a compositio of opeigs ad closigs by structurig elemets of icreasig sizes. I this sectio, we shall exted the class of ASF to the spatially-variat case. I our work A B ad A B deote the traslatio-ivariat erosio ad dilatio, respectively, betwee the sets A ad B P(ξ). We use AF ad ASF to deote the traslatio-ivariat Alteratig Filter ad traslatio-ivariat Alteratig Sequetial Filter, respectively. SVAF ad SVASF will deote the spatially variat Alteratig Filter ad spatially variat Alteratig Sequetial Filter, respectively. Give a biary image X, let us assume that the trasformatio Θ( ) produces a degraded biary image Y give by where N i = Y = Θ(X) = (X N 1 ) N 2, (24) =1,2, C i, + {x i, }, i = 1,2. (25) The model give by Eq. (25) is kow as the germ-grai model [8], [9], [50]. I this case {C i,, = 1,2, } is a sequece of sets, kow as the primary grais, whereas {x i,, = 1,2, } is a sequece of sites, kow as the germs, which are radomly distributed i Z 2 ; e.g., a Berouilli poit process. 3 Observe that the sequece of germs {x i,, = 1,2, } idicates the ceters of the primary grais {C i,, = 1,2, } i the oise process N i, i = 1,2. The SV Alteratig Filter by the structurig elemet mappig θ is defied as the compoud SV ope-close; SVAF θ (X) = Φ θ (Γ θ (X)) (X P(ξ)). (26) A spatially-variat alteratig sequetial filter is a iterative applicatio of spatially-variat alteratig filters; SVASF N (X) = SVAF θn SVAF θn 1 SVAF θ1 (X), (27) where X P(ξ),N N is the order of the filter ad the sequece {θ i } N i=1 is icreasig i.e., θ i(z) θ i+1 (z), for all z ξ, for all 1 i N 1. A operator ψ O is called a morphological filter if it is icreasig ad idempotet. This termiology is differet from the word filter, which is commoly used by the sigal ad image processig commuity to deote a operator. Although the class of icreasig trasformatios is closed uder compositio, the class of idempotet trasformatios is ot. The followig propositio gives a sufficiet coditio o the sequece of structurig elemet mappigs {θ i } for the spatially-variat alteratig sequetial filter to be a morphological filter. Propositio 2: (a) For every structurig elemet mappig θ, the spatially-variat alteratig filter SVAF θ is a morphological filter. (b) If θ i is θ i 1 -ope (i.e., Γ θi 1 (θ i (z)) = θ i (z), z ξ), for 3 Ofte, the sequece of germs {x i,, = 1, 2, } is distributed accordig to a Poisso poit process. I this case, the germ-grai model is kow as the Boolea model [51], [9], [50]. 2 i N, the the spatially-variat alteratig sequetial filter of order N, SVASF N is a morphological filter. I the traslatio-ivariat case, the sequece of structurig elemet mappigs is usually chose to be θ i (z) = (B i ) z = B i + z, where B i = B B B (i times) ad B P(ξ) [8]. The, we have ([(i + 1)B] z ib) ib = [((i + 1)B ib) ib] z = [(i + 1)B] z ; that is θ i+1 is θ i - ope. Hece the coditio of Propositio 2 is satisfied i the traslatio-ivariat case. Sice for a special choice of the structurig elemet mappig θ, the SVASF reduces to the traslatio-ivariat ASF, the class of SVASF s is still the subset of smoothig morphological filters which best preserve the crucial structure of iput images i the least mea differece sese [8]. 2) Simulatios: As i the traslatio-ivariat case, SV mathematical morphology theory is ot costructive, i the sese that it does ot build a systematic algorithm to fid the optimal structurig elemet at each poit of the image. The choice of the structurig elemet mappig obviously depeds o the cosidered applicatio. We propose a geeral selectio rule for image restoratio. We assume that the oise model degradatio is characterized by the germ-grai model give by (24) ad (25). I traslatioivariat morphology, a priori kowledge of the oise model leads to the selectio of a structurig elemet of size larger tha the largest oise-grai [8]. This approach esures that the oise is elimiated from the image. However, the geometric ad topological structure of the restored image is degraded durig the restoratio process. Deoisig should be performed so that the oise is reduced sufficietly ad the geometric ad topological characteristics of the image are preserved. This ca be achieved by spatially-varyig the structurig elemet depedig o the local properties at each pixel i the image. The idea of the proposed algorithm is to use, at each pixel, a structurig elemet of size slightly bigger tha the size of the oise-grai at that poit. The mappigs θ i of the SVASF N are selected as follows: θ i (z) = C(z) S, if z is detected as the ceter of a oise-grai C(z) at iteratio i;, otherwise, where z X, S is the 3 3 square structurig elemet ad i = 1,2,,N. Observe that the above defiitio of the θ i s does ot imply that these mappigs are equal, sice the oise is reduced as the iteratios icrease. For istace, assume that at the first iteratio, a poit z is detected as the ceter of a oise-grai C(z). So, θ 1 (z) = C(z) S. Assume further that the latter oise-grai is small eough so that it has bee removed by the filter Φ θ1 Γ θ1. Hece, at the secod iteratio, o oise-grai is detected at poit z ad thus θ 2 (z) =, i.e., the poit z is ot filtered at the secod iteratio. Moreover, observe that the costructed θ i s do ot satisfy Propositio 2 ad thus the SVASF N, for N 2, is ot idempotet. The detectio of the presece of a oise-grai C(z) cetered at the pixel z is determied by selectig the largest possible grai C i the germ-grai model give by (24) ad (25) which is preset or abset i the degraded image (i.e., C + {z} Y or C + {z} Y c ) [8].

6 IEEE TRANSACTIONS ON IMAGE PROCESSING 6 The performace of the algorithm is measured by the Sigal-to-Noise ratio (SNR). Let X o deote the origial image of size L C ad X r the restored (deoised) image. The Sigal to Noise Ratio is defied by L C i=1 j=1 SNR = X o(i,j) 2 L C i=1 j=1 (X o X r )(i,j). 2 Cosider the biary image X depicted i Fig. 1(a). The degraded biary image Y, obtaied by usig (24) ad (25), with C i,,i = 1,2, formed by the overlappig of square structurig elemets distributed accordig to a Berouilli process, is depicted i Fig. 1(b). Figure 1(c) (resp. 1(d)) shows the output image of the AF usig the rhombus structurig elemet i [43] (resp. 3 3 square structurig elemet) dilated 8 times. A slight improvemet is obtaied by the use of a ASF of order 8 usig the rhombus structurig elemet (resp. 3 3 square structurig elemet) i Fig. 1(e) (resp. 1(f)). Although most of the oise is removed by the ASF, the origial image is highly smoothed ad its origial topology is lost. We immediately see the drastic improvemet of the spatially-variat SVAF ad SVASF over their traslatio-ivariat couterparts i Figs. 1(g) ad 1(h), respectively. The SVASF removes the oise while preservig the edges ad the geometric structure of the image. The SNR of the differet experimets are provided below their correspodig images. The SVASF achieves a SNR 80 db higher tha its ivariat homologue. The simulatio results obtaied illustrate that, give a image degraded by oise characterized by the germ-grai model, eve if oe were to select the optimal parametrizatio [8] ad the optimal structurig elemet [38] for the traslatioivariat AF ad ASF morphological filters, the results would be iferior to those obtaied by usig spatially-variat morphological filters (see Fig. 3 i [8]). B. Adaptive Media Filter 1) Theoretical Aspects: Cosider ξ = Z 2. Let θ be a mappig from ξ ito P(ξ) such that y θ(y) ad θ(y) = (i,j) Z2[θ(y)](i,j) = is odd, for every y ξ. The media med (X,θ) of X with respect to the adaptive widow θ is give by med (X,θ) = {y ξ : X θ(y) + 1 }. (28) 2 It is easy to show that the media filter is a self-dual C- operator, i.e., it is a C-operator such that it is its ow dual. Therefore, it ca be show from the defiitio of the kerel ad from Theorem 1 that med (X,θ) = E λ (X) = D λ (X), (29) λ A λ A where λ : ξ P(ξ) ad λ A if ad oly if λ(y) is ay subset of θ(y) of cardiality ( + 1)/2. Equatio (29) establishes the relatio betwee the adaptive media filter ad the basic SV morphological filters, i.e., SV erosio ad SV dilatio. The implicatio of Eq. (29) are profoud because they eable us to express the adaptive media filter via a closed formula ivolvig oly uios ad itersectios of sets, without requirig ay sortig. For small adaptive widow sizes, it was show that the implemetatio of the media filter via its kerel represetatio is more attractive tha sortig schemes [48]. Although the theory of SV mathematical morphology has bee preseted for the biary case, its extesio to grayscale is straightforward ad follows the steps used to exted traslatio-ivariat biary morphology to traslatioivariat gray-scale morphology [37], [42]. Therefore, we will apply adaptive media filterig to gray-scale images. 2) Simulatios: The key idea of the implemetatio of the adaptive media filter is idetical to the SVASF. Specifically, the size of the local widow at a give poit is selected to be slightly larger tha the size of the germ-grai at this poit. I our simulatios we cosider the origial image depicted i Fig. 2(a). Its corrupted versio by a germ-grai oise model appears i Fig. 2(b). I the first experimet, We applied the media filter iteratively to the degraded image usig a fixed square widow of size 3 3. The output image is show i Fig. 2(c). Notice that sice some of the germ-grais have size larger tha 3, the media filter usig the 3 3 widow fails to remove the larger oise structures. We repeat the same experimet usig a 5 5 square widow. The resultig image is depicted i Fig. 2(d). While the media filter usig the 5 5 widow removes most of the oise i iteratio 8, the output image is more smoothed. I a secod experimet, we applied a Media filter usig a fixed square widow of size (see Fig. 2(e)). Although more oise has bee removed tha the iterative media filters i the first experimet, the restored image is overly smoothed. The same experimet is repeated usig a square widow of size (Fig. 2(f)). The filtered image is cleaer but equally smoothed. I a third experimet, we applied a Alteratig Sequetial Media Filter (ASMF) of order 8, which is composed of 8 media filters of icreasig widow sizes. The widow size is icremeted by 2 at each iteratio. Figure 2(g) shows the result of ASMF usig a iitial square widow of size 3 3. Although the oise-grais are totally removed, the restored image is over smoothed ad its features (e.g., widows, edges) are completely lost. We reach the same coclusio if we apply a ASMF usig a iitial square widow of size 5 5 (Fig. 2(h)). Observe that the largest widow of the ASMF with a iitial widow of size 3 3 (resp. 5 5) has size (resp ). I the last experimet, we applied the spatially-variat media filter (SVMF). Figures 2(i) ad 2(j) are obtaied by SV media filterig usig, at each poit, a local widow size equal to the size of the oise-grai, at the same poit, icremeted by 1 ad 2, respectively. The restored images preserve the edges ad geometric structure of the oise-free image. Notice that usig a local widow size equal to the size of the oise-grai icremeted by 2 performs better i terms of oise removal capability, tha usig a local widow of size equal to the size of the oise-grai icremeted by 1. The reaso is that some of the oise-grais overlap ad merge to form bigger oise-grais. Therefore, a larger local widow size is eeded to esure that these oise-grais are

7 IEEE TRANSACTIONS ON IMAGE PROCESSING 7 Fig. 1. Deoisig of a biary image usig morphological filters ad SNR compariso: (a) Origial biary image; (b) Degraded image by a germ-grai oise model (c) AF usig the rhombus SE dilated 8 times; (d) AF usig a 3 3 square SE dilated 8 times; (e) ASF 8 usig the rhombus SE; (f) ASF 8 usig a 3 3 square SE; (g) SVAF; (h) SVASF 3. suppressed. However, if the local widow size is too large, the media value computed i that widow will ot provide a good estimate of the oise-free pixel because oly pixels i a small eighborhood are strogly correlated. Therefore, there is a trade-off betwee the oise removal capability ad the accuracy of the estimatio. Figures 2(k) ad 2(l) show two iteratios of the SVMF usig a local widow size equal to the size of the oise-grai icremeted by 1 ad 2, respectively. All of the oise has bee removed i the secod iteratio of the SVMF without alterig the topological characteristics of the oise-free image. The SNR of the above experimets are provided below their correspodig images i Fig 2. Notice that the SVAMF achieves a SNR which is 20 db higher tha its traslatio-ivariat couterpart. IV. SPATIALLY-VARIANT MORPHOLOGICAL SKELETON REPRESENTATION Let A B,A B,A B deote the traslatio-ivariat erosio, dilatio ad opeig, respectively, of the set A by the structurig elemet B [9]. Let B = B B B ( times). A. Theoretical Aspects Cosider a sequece of mappigs {λ : 0} from ξ ito P(ξ) such that z λ (z), for every z ξ, for all ad λ (z) {z}, for all. Cosider the sequece of mappigs θ from ξ ito P(ξ) give by θ +1 (z) = t λ θ (z) (t) = D θ (λ (z)) for > 0,z ξ ad θ 0 (z) = {z}, for every z ξ. We defie the iteger N X by N X = max{ : E θ (X) } for a give X P(ξ). Let {ψ : = 0,1,,N X } deote a collectio of operators i O such that E θ+1 (X) ψ (E θ+1 (X)) E θ (X), (30) for every [0,N X ], every X P(ξ) ad ψ ( ) =, for every [0,N X ]. Defiitio 2: Cosider X P(ξ). The spatially-variat (SV) morphological skeleto represetatio R(X) of X is give by R(X) = {R 0 (X),R 1 (X),,R NX (X)}, (31) where R (X) is the spatially-variat morphological skeleto represetatio subset of order give by R (X) = E θ (X) ψ (E θ+1 (X)). (32) Defiitio 3: The SV morphological skeleto represetatio of X P(ξ) is ivertible if there exists a sequece {G : [0,N X ]} of operators i O such that N X X = G (R (X)). (33) =0 The followig theorem establishes a restrictio o the choices of the sequeces {ψ : [0,N X ]} as a direct cosequece of costrait (30) ad establishes the ivertibility of R(X) uder this restrictio. Theorem 2: If the sequece {ψ : [0,N X ]} of operators i O satisfies costrait (30), the E θ+1 (X) ψ (E θ+1 (X)) E θ (Γ θ+1 (X)), (34) for [0,N X ] ad for every X P(ξ). Moreover, R(X) is ivertible ad N X X = R 1 (R(X)) = D θ (R (X)). (35) =0 From Theorem 2, we observe that the SV morphological represetatio of X, R(X), obtaied by the sequece of trasformatios {ψ : [0,N X ]} which satisfy restrictio (30), decomposes ito a sequece of N X + 1 subsets {R (X) : [0,N X ]} which uiquely characterizes X, thereby allowig for a SV morphological represetatio which permits the exact recostructio of X. I the remaider of this sectio, we shall ivestigate some properties of R(X). The followig propositio shows that the resultig morphological image represetatio subsets R N (X), for = 0,1,,N X, are disjoit ad ati-extesive. Propositio 3: We have R 1 (X) R 2 (X) =, (36)

8 IEEE TRANSACTIONS ON IMAGE PROCESSING 8 Fig. 2. Deoisig usig media filters ad SNR compariso: (a) Origial gray scale image; (b) Image degraded by a germ-grai model; (c) 8 iteratios of media filterig by a fixed 3 3 widow; (d) 8 iteratios of media filterig by a fixed 5 5 widow; (e) Media filterig by a fixed widow; (f) Media filterig by a fixed widow; (g) Alteratig Sequetial Media Filter ASMF 8 of size 8 usig iitial widow of size 3 3 icremeted by 2 at each iteratio; (h) Alteratig Sequetial Media Filter ASMF 8 usig iitial widow of size 5 5 icremeted by 2 at each iteratio; (i) SV media filterig with adaptive widow size correspodig to the germ grai size icremeted by 1; (j) SV media filterig with adaptive widow size correspodig to the germ-grai size icremeted by 2; (k) secod iteratio of SV media filterig with adaptive widow size correspodig to the germ-grai size icremeted by 1; (l) secod iteratio of SV media filterig with adaptive widow size correspodig to the germ-grai size icremeted by 2. for 1 2 ad R (X) X, (37) for [0,N X ]. I the followig propositio we show that, uder a certai coditio o the mappigs {λ : N}, a repeated applicatio of the trasformatio R( ) does ot ifluece the image represetatio. Propositio 4: If λ (z) λ 0 (z), for every z ξ ad for [0,N X ], (38) the R(R (X)) = {R (X)}, (39) for [0,N X ]. Whe coditio (38) is ot satisfied, the repeated applicatio of R( ) may result i a further reductio of the total cardiality of the represetatio. This is a desirable result i may applicatios of iterest (e.g., image codig [52], [53]). 1) Example (Geeralized Morphological Skeleto [3]): The followig example is a importat special case of the geeral SV morphological image represetatio R(X). Cosider ψ (X) = D λ (X), = 0,1,,N X, X P(E). (40) The followig propositio shows that the above sequece ψ satisfies costrait (34). Propositio 5: E θ+1 (X) D λ (E θ +1 (X)) E θ (Γ θ+1 (X)), (41) for N ad X P(ξ). Therefore, the represetatio R(X), give by Eqs. (31) ad (32), is ivertible ad the recostructio formula is give by Eq. (35). B. Algorithmic Aalysis I this sectio, we develop a algorithm for the implemetatio of the SV morphological skeleto represetatio studied above. We compare the SV skeleto represetatio with the traslatio-ivariat represetatio. The performace of the morphological skeleto represetatios is assessed by the umber of poits, i the image represetatio, required for exact recostructio of the origial image. From our perspective, the purpose of morphological skeleto represetatios is codig, compressio ad storage. I a commuicatio framework, our goal is to miimize the average code legth of the compressed biary image. It has bee show that efficiet ecodig of the skeleto represetatio usig ru-legth type codes ca be used to provide a efficiet compressio routie for biary images [43]. This approach relies o the sparse represetatio of skeletos to efficietly ecode log ru-legths correspodig to pixels that do ot lie i the skeleto. Therefore, it is ot surprisig that ivestigators have determied that lower cardiality skeleto represetatios yield superior compressio ratios [43]. Our goal is thus to miimize the cardiality of the source image uder the costrait of lossless compressio. For the purpose of this presetatio, we assume the chael to be oiseless. Therefore, the receiver will be able to recostruct the origial image perfectly without error. The optimal SE, i the sese of miimizig the cardiality of the morphological skeleto represetatio, would be the image itself. The traslatio-ivariat ad spatially-variat morphological skeleto represetatios would be idetical ad cosist of 1 poit. However, this is a trivial solutio sice it is impractical ad assumes that the image to be trasmitted by the seder is already kow by the receiver ad is stored i its library. We will assume a fixed library of structurig elemets at the ecoder ad decoder ad costruct the optimal spatially-variat structurig elemet mappig to miimize the

9 IEEE TRANSACTIONS ON IMAGE PROCESSING 9 TABLE I A UNIVERSAL ALGORITHM TO CONSTRUCT THE OPTIMAL STRUCTURING ELEMENT MAPPING FOR THE SPATIALLY-VARIANT MORPHOLOGICAL SKELETON REPRESENTATION. 1. Choose N 0 = max{ : X B }. 2. Let X e = X N 0 B. 3. Choose z 0 X e such that {z 0 } N 0 B is maximal. 4. Let X = X ({z 0 } N 0 B). 5. Store the value of z 0 ad N Let M N0 = 0; k = 0; 7. While (X ) do the followig: a. M = 0; N = N 0 ; k = k + 1; b. While( NB > M & N 0) N = N 1 Let X e = X NB Choose z N X e such that ({z N } NB) X is maximal Let M N = ({z N } NB) X M = max =N0 N M Temporarily store z N c. Store z k ad N k : ({z k } N k B) X = M d. Empty the temporarily stored z N s e. Let X = X {z k } N k B 8. The SV morphological skeleto represetatio is the give by R(X) = k i=0 {z i}. 9. The recostructed image is X = k i=0 {z i} N i B. a sythetic image, the resultig SV morphological skeleto represetatio usig the optimal spatially-variat structurig elemets outlied i the algorithm is idetical to the SV erosio usig the same structurig elemet mappig. Figures 3(d) - 3(g) illustrate the process of selectig the structurig elemets for the house image usig a 3 3 square structurig elemet. The SV ad traslatio-ivariat morphological skeleto represetatios are show i Figs. 3(b) ad 3(c), respectively. The SV morphological skeleto represetatio has a compressio ratio which is more tha 3 times higher tha its traslatio-ivariat couterpart. We shall oce agai determie the umber of parameters eeded for represetatio of the skeleto ad igore the effects of the use of ecodig schemes usig ru-legths type techiques i computig the storage capacity requiremets. If the morphological skeleto represetatio is used for storage or commuicatio, the we eed = 648 parameters to trasmit the SV morphological skeleto represetatio. O the other had, the total umber of parameters required for trasmissio of the traslatio-ivariat morphological skeleto represetatio is equal to = Therefore, the SV morphological skeleto represetatio has a storage capacity gai that is 2.32 times higher tha the traslatio-ivariat morphological skeleto represetatio. cardiality of the morphological skeleto represetatio. The idea of the proposed algorithm is similar to the matchig pursuit algorithm [54]. The matchig pursuit algorithm adaptively decomposes a sigal ito waveforms that are the dilatios, traslatios ad modulatios of a sigle fuctio; thus providig a iterpretatio of the sigal structure. I the proposed algorithm, let X deote the origial image ad B a fixed structurig elemet. Table I describes a uiversal algorithm to costruct the optimal structurig elemet mappig for the spatially-variat morphological skeleto represetatio. The algorithm is a iterative process. At each iteratio, the algorithm selects the ceter of the dilated structurig elemet B that maximally itersects the image, for some iteger. The uio of these ceter poits costitutes the SV morphological skeleto represetatio. The exact recostructio of the origial image is guarateed give the set of ceter poits ad their correspodig iteger. It is easy to show that the resultig spatially-variat morphological skeleto represetatio usig the proposed algorithm is compact, i the sese that the set {(z i,n i ),i = 0,,k} is ot redudat; i.e., the recostructio based o ay partial subset of the resultig SV morphological skeleto represetatio would form a strict subset of the origial image. It is also iterestig to observe that the sets {{z i } N i B,i = 0,,k} are ot ecessarily disjoit. Thus, the optimal morphological skeleto represetatio is ot derived by a decompositio of the origial image ito o-overlappig shapes. Istead, overlappig shapes are exploited i order to reduce the umber of shapes required to cover the image. This approach allows for a substatial reductio i the cardiality of the morphological skeleto represetatio. Moreover, as we have see earlier i the example of the SV skeleto represetatio of V. CONCLUSIONS I this paper, we preseted a geeral theory of spatiallyvariat mathematical morphology (SVMM) ad showed its eormous potetial through two importat image processig applicatios. First, we itroduced SV alteratig sequetial filters ad SV media filters for SV morphological deoisig of degraded images. Simulatio results demostrated that, ot oly is the oise removal capability of the SV morphological filters dramatically higher tha their traslatio-ivariat couterparts, but also the topology ad geometrical structure of the origial image are preserved. Secod, we exteded the traslatio-ivariat morphological skeleto represetatio to the spatially-variat case. We have also developed a uiversal algorithm for optimal selectio of the spatially-variat structurig elemet mappig for skeletoizatio by miimizig the cardiality of the SV morphological skeleto represetatio. This approach has bee show to yield a substatial reductio i the cardiality of the spatially-variat morphological skeleto represetatio i compariso to its traslatio-ivariat couterpart. As a result of this ivestigatio, we have complemeted the elegat theory of spatially-variat mathematical morphology with powerful practical algorithms for image processig applicatios. The SV morphological framework preseted ca be applied to may classical image processig problems related to o-liear filterig. I the future, we pla to further explore the power of the SVMM framework by developig more sophisticated ad faster algorithms for o liear filterig i various image processig applicatios. We also pla to ivestigate the optimal spatially-variat structurig elemet mappig for morphological image restoratio applicatios by extedig the work of Schofeld [38] for traslatioivariat morphological filters. We further pla to explore

10 IEEE TRANSACTIONS ON IMAGE PROCESSING 10 Fig. 3. Morphological skeleto represetatio: (a) Origial image; (b) SV morphological skeleto represetatio (162 poits); (c) Traslatio-ivariat morphological skeleto represetatio (502 poits). the robustess of the spatially-variat morphological skeleto represetatio to oise degradatio by extedig the work of Schofeld ad Goutsias [45] for the traslatio-ivariat morphological skeleto represetatio. A formal aalysis of the optimal structurig elemet mappig ad ivestigatio of the robustess of the morphological structurig elemet require the use of radom set theory [6], [9], [51], [50]. APPENDIX A: PROOF OF PROPOSITIONS Proof: [Proof of Propositio 2] From subsectio II-A.4, we kow that Γ θ ad Φ θ are icreasig operators. Sice the class of icreasig operators is closed uder compositio, we coclude that the SVAF θ ad the SVASF N are icreasig. (a) Let us prove the idempotece of the SVAF. By the atiextesivity property of Γ θ, we have Γ θ [Φ θ (Γ θ (X))] Φ θ (Γ θ (X)), for all X P(ξ). Applyig Φ θ to the above iequality ad, sice Φ θ is icreasig, we obtai Φ θ {Γ θ [Φ θ (Γ θ (X))]} Φ θ [Φ θ (Γ θ (X))] = Φ θ (Γ θ (X)), where the last equality follows from the idempotece of Φ θ. Therefore, we have SVAF θ (SVAF θ ) SVAF θ. (42) By the extesivity property of Φ θ, we have, Φ θ (Γ θ (X)) Γ θ (X), X P(ξ). Applyig Γ θ to the above iequality ad sice Γ θ is icreasig, we obtai Γ θ [Φ θ (Γ θ (X))] Γ θ (Γ θ (X)) = Γ θ (X), (43) where the last equality follows from the idempotece of Γ θ. Applyig Φ θ to Eq. (43) ad sice Φ θ is icreasig, we obtai Φ θ [Γ θ (Φ θ (Γ θ (X)))] Φ θ (Γ θ (X)), Therefore, we have X P(ξ). SVAF θ (SVAF θ ) SVAF θ. (44) Usig Eqs. (42) ad (44), we establish the idempotece of the SVAF θ. (b) The idempotece of the SVASF N follows from the more geeral result established by Schofeld ad Goutsias i [8, Propositio 1]. All the ecessary coditios to apply Propositio [8, Propositio 1] are satisfied (see Sectio II- A.4). Proof: [Proof of Propositio 3] From Eq. (32) ad costrait (30), we have R (X) E θ (X) E θ+1 (X). (45) Assume that 1, 2 [0,N X ] are such that 1 < 2. From the defiitio of θ, we have E θ2 +1 (X) E θ 2 (X) E θ1 (X) E θ1 +1 (X). Therefore, (E θ2 (X) E θ2 +1 (X)) (E θ 1 (X) E θ1 +1 (X)) =. From Eq. (45), we obtai R 2 R 1 =. Eq. (37) is a direct cosequece of Eq. (32) ad the fact that E θ (X) X. This completes the proof. Proof: [Proof of Propositio 4] Let X P(ξ) such that E λ0 (X) =. From the defiitio of θ ad λ, we have λ 0 (z) θ 1 (z), for every z ξ. Therefore, E θ1 (X) E λ0 (X) =. From Eq. (32) ad the fact that ψ 0 ( ) =, we have R 0 (X) = E θ0 (X) ψ 0 (E θ1 (X)) = E θ0 (X) = X. From the costrait (30) ad sice E θ1 (X) =, we have E θ E θ1 =. Therefore, from Eq. (32), we have R (X) = for 1. Fially, we see that R(X) = {X}. (46) Now, we will show that R (X) satisfies E λ0 (R (X)) =. Let us take y R (X). From Eq. (32), we see that y E θ (X) ad y / ψ (E θ+1 (X)). From costrait (30), we see that y / E θ+1 (X) θ +1 (y) X. From the defiitio of θ +1, there exists z λ (y) such that θ (z) X z / E θ (X) = z / R (X). Sice z λ (y) ad by hypothesis λ (y) λ 0 (y) for [0,N X ], we have z λ 0 (y). Thus, λ 0 (y) R (X) for every y R (X). Cosider ow, y / R (X) ad cosider the set λ 0 (y). By defiitio of the mappigs λ, we have that y λ 0 (y). Sice y / R (X), we coclude that λ 0 (y) R (X) for every y / R (X). Thus, λ 0 (y) R (X) for every y ξ or E λ0 (R (X)) =. Fially, by usig Eq. (46) with X R (X), we prove Eq. (39). Proof: [Proof of Propositio 5] By the extesivity property of the SV dilatio, we have that E θ+1 (X) D λ (E θ +1 (X)) = ψ (E θ+1 (X)). By the extesivity property

11 IEEE TRANSACTIONS ON IMAGE PROCESSING 11 of SV closig, we have ψ (E θ+1 (X)) = D λ θ +1 (X)) Φ θ λ (E θ +1 (X))) = E θ (D θ λ (E θ +1 (X)))). (47) Usig Eq. (10), we have that D θ (D λ (X)) = D D λ (θ )(X). From the costructio of θ +1, we have that θ +1 (z) = t λ(z)θ (t) = D θ (λ (z)), for > 0 ad z ξ. Therefore θ +1(z) = {y ξ : z θ +1 (y)} = {y ξ : z D θ (λ (y))} = {y ξ : θ (z) λ (y) } = D λ (θ (z)). Therefore, D θ (D λ (X)) = D D λ (θ )(X) = D θ (X),X +1 P(ξ). Fially, Eq. (47) becomes ψ (E θ+1 (X)) E θ (D θ (E θ+1 (X))) = E θ (Γ θ+1 (X)). +1 Therefore, the sequece {ψ = D λ : [0,N X]} satisfies costrait (34) for every X P(ξ). Hece, by Theorem 2, R(X) is ivertible ad X = N X =0 D θ (R (X)) = NX =0 D θ (E θ (X) D λ (E θ +1 (X))). APPENDIX B: PROOF OF THEOREMS Proof: [Proof of Theorem 2] Sice costrait (30) must be satisfied for every X P(ξ), we ca choose X Γ θ+1 (X). Therefore, we obtai E θ+1 (Γ θ+1 (X)) ψ (E θ+1 (Γ θ+1 (X))) E θ (Γ θ+1 (X)), (48) for [0,N X ]. From Eq. (12), we observe that E θ+1 (Γ θ+1 (X)) = Φ θ (E θ+1 (X)). From the fact that +1 E θ+1 (X) is θ +1-closed, we have, usig Propositio 1, E θ+1 (Γ θ+1 (X)) = E θ+1 (X). (49) Substitutig the above equatio ito Eq. (48), we obtai Eq. (34). From Eq. (32), we have E θ (X) = R (X) ψ (E θ+1 (X)), (50) where ψ satisfies restrictio (30). Let Υ = Γ θ (X). Applyig D θ to Eq. (50) ad usig Eq. (34) ad the ati-extesivity of Γ θ, we obtai Υ = D θ (X)) D θ (E θ+1 (X))) D θ (X)) Γ θ (Γ θ+1 (X)) D θ (X)) Γ θ+1 (X) = D θ (X)) Υ +1. (51) Observe that Υ NX+1 = ad Υ NX = D θ (X)). By iteratig Eq. (51) for = k,k + 1,,N X, we obtai N X Υ k =k D θ (R (X))). (52) From Eq. (32) we have that R (X) E θ (X); thus, sice the SV dilatio is icreasig, D θ R (X) Γ θ (X), i.e., D θ (R (X)) Υ, (53) for = 0,1,,N X. We observe that θ +1 is θ -ope. Therefore, from Eq. (19), we have Γ θ+1 (X) Γ θ (X), which results i Υ 2 Υ 1, (54) for 1 2. From Eqs. (53) ad (54), we have N X =k Equatios (52) ad (55) prove that D θ (R (X)) Υ k. (55) N X Υ k = =k D θ (R (X)). (56) Observe that Υ 0 = Γ θ0 (X) = X. Therefore, we obtai Eq. (35). REFERENCES [1] E. R. Dougherty ad C. R. Giardia, Morphological Methods i Image Processig. Eglewood Cliffs: Pretice-Hall, Ic., [2] R. M. Haralick, S. R. Sterberg, ad X. Zhuag, Image aalysis usig mathematical morphology, IEEE Trasactios o Patter Aalysis ad Machie Itelligece, vol. 9, pp , [3] P. A. Maragos, A uified theory of traslatio-ivariat systems with applicatios to morphological aalysis ad codig of images, Ph.D. dissertatio, Georgia Istitute of Techology, July [4] P. A. Maragos ad R. W. Schafer, Morphological filters - part i: Their set-theoric aalysis ad relatios to liear shift-ivariat filters, IEEE Trasactios o Acoustics, Speech ad Sigal Processig, vol. 35, pp , [5], Morphological filters - part ii: Their relatio to media, orderstatistics ad stack filters, IEEE Trasactios o Acoustics, Speech ad Sigal Processig, vol. 35, pp , [6] G. Mathero, Radom Sets ad Itegral Geometry. New York: J.Wiley & Sos, [7] D. Schofeld, Optimal morphological represetatio ad restoratio of biary images: Theory ad applicatios, Ph.D. dissertatio, Joh Hopkis Uiversity, Baltimore, Maryl., [8] D. Schofeld ad J. Goutsias, Optimal morphological patter restoratio from oisy biary images, IEEE Trasactios o Patter Aalysis ad Machie Itelligece, vol. 13, pp , [9] J. Serra, Image Aalysis ad Mathematical Morphology. Sa Diego, Calif.: Academic Press, [10], Itroductio to mathematical morphology, Computer Visio, Graphics, ad Image Processig, vol. 35, pp , [11], Image Aalysis ad Mathematical Morphology. New York: Theoretical Advaces. Academic Press, 1988, vol. 2. [12] P. Soille ad M. Pesaresi, Advaces i mathematical morphology applied to geosciece ad remote sesig, IEEE Trasactios o Geosciece ad Remote Sesig, vol. 40, pp , Sept [13] A. D. Kishore ad S. Sriivasa, A distributed memory architecture for morphological image processig, i Iteratioal Coferece o Iformatio Techology: Codig ad Computig [Computers ad Commuicatios], April 2003, pp [14] M. H. Sedaaghi, Direct implemetatio of ope-closig i morphological filterig, Electroics Letters, vol. 33, o. 30, pp , Jauary [15] A. C. P. Loui, A. N. Veetsaopoulos, ad K. C. Smith, Flexible architectures for morphological image processig ad aalysis, IEEE Trasactios o Circuits ad Systems for Video Techology, vol. 2, o. 1, pp , March [16] D. Wag ad D. C. He, A fast implemetatio of 1-d grayscale morphological filters, IEEE Trasactios o Sigal Processig, vol. 42, o. 12, pp , December [17] H. J. A. M. Heijmas, Gray level morphology, Ceter for Mathematics ad Computer Sciece, Tech. Rep. AM-R9003, Jauary [18], From biary to gray level morphology, Ceter for Mathematics ad Computer Sciece, Tech. Rep. AM-R9009, May 1990.

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED 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 information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones 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 information

3D Model Retrieval Method Based on Sample Prediction

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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 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 information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture 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 information

Fast Fourier Transform (FFT) Algorithms

Fast 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 information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern 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 information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement 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 information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: 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 information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

New HSL Distance Based Colour Clustering Algorithm

New 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 information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving 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 information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Compactness of Fuzzy Sets

Compactness of Fuzzy Sets Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i

More information

Accuracy Improvement in Camera Calibration

Accuracy 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 information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting 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 information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris 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 information

Image Segmentation EEE 508

Image 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

INTERSECTION CORDIAL LABELING OF GRAPHS

INTERSECTION CORDIAL LABELING OF GRAPHS INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH 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 information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 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 information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A 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 information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring 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 information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Improving Template Based Spike Detection

Improving 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 information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic 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 information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

The isoperimetric problem on the hypercube

The 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 information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 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 information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic 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 information

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

More information

Evaluation scheme for Tracking in AMI

Evaluation 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 information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Automatic Road Extraction from Satellite Image

Automatic Road Extraction from Satellite Image Automatic Road Extractio from Satellite Image B.Sowmya Dept. of Electroics & Cotrol Egg., Sathyabama Istitute of Sciece & Techology, Deemed Uiversity, Cheai bsowya@yahoo.com Abstract This paper explais

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

Elementary Educational Computer

Elementary 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 information

The Magma Database file formats

The 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 information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

EE123 Digital Signal Processing

EE123 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 information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 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 information

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: 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 information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis 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 information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating 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 information

Appendix D. Controller Implementation

Appendix 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 information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis 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 information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

More information

A New Bit Wise Technique for 3-Partitioning Algorithm

A New Bit Wise Technique for 3-Partitioning Algorithm Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New 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 information

Stone Images Retrieval Based on Color Histogram

Stone 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 information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro 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 information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An 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 information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization 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

. Written in factored form it is easy to see that the roots are 2, 2, i,

. 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 information

A Note on Chromatic Transversal Weak Domination in Graphs

A Note on Chromatic Transversal Weak Domination in Graphs Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,

More information

Probability of collisions in Soft Input Decryption

Probability of collisions in Soft Input Decryption Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile 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 information

Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators

Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators Relatioal Iterpretatios of Neighborhood Operators ad Rough Set Approximatio Operators Y.Y. Yao Departmet of Computer Sciece, Lakehead Uiversity, Thuder Bay, Otario, Caada P7B 5E1, E-mail: yyao@flash.lakeheadu.ca

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

c-dominating Sets for Families of Graphs

c-dominating Sets for Families of Graphs c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the

More information

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

Lecture 28: Data Link Layer

Lecture 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 information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information