Hybrid Body Representation for Integrated Pose Recognition, Localization and Segmentation
|
|
- Charlene Campbell
- 6 years ago
- Views:
Transcription
1 Hybrd Body Representaton for Integrated Pose Recognton, Localzaton and Segmentaton Cheng Chen and Guolang Fan School of Electrcal and Computer Engneerng Oklahoma State Unversty, Stllwater, OK {c.chen, Abstract We propose a hybrd body representaton that represents each typcal pose by both template-lke vew nformaton and part-based structural nformaton. Specfcally, each body part as well as the whole body are represented by an off-lne learned shape model where both regon-based and edge-based prors are combned n a coupled shape representaton. Part-based spatal prors are represented by a star graphcal model. Ths hybrd body representaton can synergstcally ntegrate pose recognton, localzaton and segmentaton nto one computatonal flow. Moreover, as an mportant step for feature extracton and model nference, segmentaton s nvolved n the low-level, md-level and hgh-level vson stages, where top-down pror knowledge and bottom-up data processng s well ntegrated va the proposed hybrd body representaton. 1. Introducton We consder pose recognton, localzaton and segmentaton of the whole body as well as body parts n a sngle mage. Ths research s a fundamental step toward vdeo-based human moton analyss that have been ntensvely studed recently. Pose recognton, localzaton and segmentaton n a stll mage are challengng problems due to the varablty of human body shapes and poses as well as the nherent ambguty n the observed mage. Our goal s to develop a hybrd human representaton and the correspondng processng to assemble three tasks nto one ntegrated framework. We propose a hybrd body representaton, as shown n Fg. 1, where the four mages show the nput mage represented by watershed cells, the part-based body representaton, the onlne learned whole shape pror, and the part/whole segmentaton results respectvely. Partcularly, the segmentaton process that has been found useful for object recognton and localzaton s nvolved for learnng and nference n ths work. Fgure 1. The nput mage represented by watershed cells, the partbased body representaton, the onlne learned whole shape pror, and the part-whole segmentaton results (from left to rght). The proposed research s deeply nspred and motvated by shape representaton theores n cogntve psychology where there are two prevalng theores,.e., the structural descrpton-based and the vew-based representatons [10]. The former one suggests that a complex object s represented by a collecton of smpler elements wth specfc nter-relatonshps. The latter one postulates a very smple template-lke representaton n whch an objects s holstcally represented by a smple vector or matrx feature wthout an ntermedate representatonal step. Current cogntve studes ndcate that none of these two representaton schemes alone can provde a complete characterzaton of the human vson system for object recognton [7]. Smlarly, exstng shape representatons n computer vson can be roughly grouped nto two categores. One s template-lke or slhouette-based methods, whch are sutable for shape pror-based segmentaton. The other s the part-based methods, whch can capture the ntra-class varablty. The man dea of our research s to ntegrate both vew-based and structural descrpton-based models nto a hybrd body representaton to support ntegrated pose recognton, localzaton, and segmentaton. Partcularly, t can facltate shape pror guded segmentaton, by whch bottom-up features can be extracted to drve the top-down nference n a cascade fashon. Addtonally, both offlne and onlne learnng are nvolved to learn general and subject-specfc knowledge respectvely, ncludng the colors, shapes and spatal structure /08/$ IEEE
2 2. Related work Exstng pose recognton, localzaton, and segmentaton methods can be broadly grouped nto three major categores accordng to the way how the body s represented: the representaton-free methods, the vew-based methods, and the structural descrptons-based methods. The frst category manly contans some bottom-up approaches, n whch there s no explct shape pror representaton, [15] and [19]. All the nformaton used s a seres of regon groupng rules establshed accordng to physcal constrants such as the body part proxmty. In general, these approaches focus on explotng bottom-up cues. The second category ncludes all slhouette-based pose analyss methods. In [1], a specfc vew-based approach was proposed where pose nformaton s mplctly emboded nto a classfer learned from SIFT-lke features. In general, no ntermedate feature or color s used n these approaches. All vew-based approaches normally am at detectng partcular body pose wthout extractng body parts. Thus t cannot recover anthropometrc nformaton. The pctoral structure model proposed [5] s a typcal approach belongng to the thrd category, n whch the human body s descrbed by several parts wth ther appearances and spatal relatonshps. Ths knd of approach usually requres a robust part detector. The edge hstogram [3] and other SIFT-lke features are wdely used to represent parts. Very recently, a regon-based deformable model s used to represent parts [17] where segmentaton was used to verfy the object hypothess. The method n [17] s smlar n sprt to the part-level nference proposed here. However, n our approach, where an mage s represented by small buldng blocks (watershed cells), the coupled shape model s nvolved n a hypothess-and-test paradgm where the regon pror forms a segmentaton gven a poston hypothess and the edge pror evaluates the formed segmentaton. As the name suggests, the hybrd human body representaton proposed here absorbs recent multfaceted advances n the feld. The proposed representaton nvolves shape pror guded segmentaton and nference n a mult-stage fashon. Unlke prevous methods, we use segmentaton to extract bottom-up features to drve the top-down nference. Our contrbutons n ths work nclude: (1) a hybrd human body representaton that supports the onlne color model learnng and nvolves an onlne learned deformable shape model to segment the whole body and parts, (2) an effectve hypothess-and-test paradgm for the part-level nference that nvolves the coupled regon-edge shape prors, (3) a three-stage cascade computatonal flow to ntegrate pose recognton, localzaton and segmentaton nto a bologcally plausble framework, and (4) a new watershedbased Graphc-cut segmentaton where both regon and edge shape prors are used for optmal segmentaton. 3. Overvew of our approach The proposed hybrd body representaton synergstcally ntegrates pose recognton, localzaton and segmentaton of the whole body as well as body parts n an mage, as shown n Fg. 2. Several key ssues are addressed. Hgh-level vson Mddle-level vson Low-level vson Check assocatons of part and whole segmentatons Localzaton and pose recognton va Inference Map mages Low-level groupng Input Bottom-up flow Graph-cut based segmentaton Onlne learnng and deformaton Part locatons Segmentaton based hypothessand-test UC regons Feedback flow Fgure 2. Overvew of our approach. On-lne learned body shape Off-lne learned body shape Off-lne learned spatal prors Off-lne learned part shape prors Top-down flow Off-lne and onlne learnng: Off-lne and onlne learnng are used to obtan both general and subject-specfc nformaton, respectvely. The former one acqures the general shape and spatal prors for both body parts and the whole body, and the latter one captures the subject specfc nformaton, ncludng colors and shapes. Part-whole organzaton: Parts and the whole are two complementary components for object representaton. The part-level nference produces the map mages that are assembled to localze the whole body as well as body parts. Coupled regon-edge shape model: The coupled regon-edge shape representaton supports a hypothessand-test paradgm, where the regon-based pror s used to form a segmentaton and the edge-based pror s used to evaluate the formed segmentaton. After the onlne learnng of the whole body, both prors are used n a new Graph-cut segmentaton framework for an optmal segmentaton. Integraton of bottom-up and top-down: Both the data-drven bottom-up and knowledge-drven top-down flows are ntegrated at low-level vson (watershed segmentaton), md-level (part-level nference/segmentaton) and hgh-level (whole-level nference/segmentaton). Potentally, ths work can lead to a dynamc computatonal framework by ncorporatng two feedback flows (from hghlevel vson to md-level and low-level vson).
3 4. Hybrd human body representaton Consder a walkng cycle wth K typcal poses W = {W (k) k = 1,..., K}, We model each pose W (k) by both part-based and whole-based statstcal representatons W (k) = {V (k) 1:d, L(k),SW (k) (k) off }, where V 1:d are shape prors of d part, L (k) s a set of statstcal parameters that encode the spatal relatonshps between parts n a star graphcal model, and SW (k) off s the off-lne learned shape pror of the whole body. The shape pror of each part V (k) s represented by the regon-based shape pror SP (k), the edgebased shape pror M (k) (k), and the average orentaton θ,.e., V (k) = {SP (k), M (k) (k), θ }. Moreover, durng the nference processes, the part-based and whole-based color models as well as the subject specfc whole shape model wll be onlne learned as part of the hybrd body representaton. For clearness, we may omt the pose ndex (k), n some places below Part-based shape pror Inspred by the MetaMorphs model n [9], we develop an mplct shape model for each part where both regonbased and edge-based shape prors are holstcally represented. The learnng process s smlar to the one n [13]. belongng to the object and background respectvely. Gven a threshold ε, anaverage object boundary M can be extracted from the learned regon-based shape pror SP (p) by a level-set lke method, M = {p SP (p) =ε}. (1) Snce both the regon-based and edge-based prors are embedded n V, the two prors can be learned smultaneously n the tranng process. More mportantly, ths coupled representaton allows a hypothess-and-test paradgm for the nference at the part-level where the regon pror nduces a segmentaton gven a poston hypothess and the edge pror s used to valdate the segmentaton, resultng part-based possblty maps for whole-based nference Part-based spatal pror We use the spatal pror model proposed n [3] to characterze the varablty of spatal confguraton of body parts. For pose k, we defne the part-based spatal pror by a start graphcal model as shown n the second fgure of Fg. 1 that, Σ (k) =1,..., d, = = r} denote the Gaussan prors for the relatve locatons between the non-reference part and the reference part r. These statstcal parameters can be obtaned by a maxmum-lkelhood estmator (MLE) from labeled tranng data. Gven a partcular spatal confguraton of d parts, L =(l 1,..., l d ), the jont dstrbuton of d parts wth respect to pose k can be wrtten as the followng: s parameterzed by L (k) = {µ (k) r}. Specfcally, {µ (k), Σ (k) p L (k)(l) =p L (k)(l 1,..., l d )=p L (k)(l r ) =r p L (k)(l l r ). Fgure 3. The top row shows the tranng mages wthout algnment. The bottom row show the algned tranng mages, the learned shape pror, and the extracted edge-based shape pror. For each part, we have obtaned a set of tranng mages (pre-segmented bnary mages wth a fxed wndow sze and the measured orentaton). Let θ be the average orentaton of part V. All tranng mages have been algned to the average orentaton frst. Let {Ω (p) j =1,..., Q} denote the algned tranng mages, where p =(x, y) s the locaton of one pxel n the wndow where the shape pror s defned. The shape pror SP (p) can be obtaned by addng all algned tranng mages as shown n Fg. 3, SP (p) = 1 Q Q Ω (p). j=1 SP (p) and 1 SP (p) reflect the the probablty of pxel p (2) Thesameasn[3], we assume that p L (k)(l) s Gaussan. Therefore, the condtonal dstrbuton p L (k)(l l r ) s stll Gaussan. As defned above, µ (k) and Σ (k) are the mean and covarance for the spatal dstrbuton (relatve) of part n pose k. Then, for each non-reference part, the condtonal dstrbuton of ts poston wth respect to pose k s defned below, p L (k)(l l r )=N(l l r µ (k), Σ (k) ). (3) 4.3. Whole body shape pror For each pose, a whole body shape pror s needed for body segmentaton after pose recognton and localzaton. Both off-lne and onlne learnng are nvolved for generatng shape models that capture the general representaton as well as the subject specfc nformaton, as shown n Fg Off-lne learnng The off-lne learnng s smlar to that of parts, except that a part-based algnment s needed due to the spatal varablty
4 Average poston and orentaton of parts Off-lne learnng On lne Localzaton + 1 T T On-lne learnng Fgure 4. The learnng of the whole body shape pror. of each pose. For each pose, we can compute the average locaton and orentaton for all parts. For each tranng mage wth a segmented body and parts, we want to fnd a set of control ponts based on whch the tranng mage can be deformed n a way that all parts are transformed to the average locaton and orentaton. To preserve the shape nformaton of parts, we wll use the edge ponts of all parts to be control ponts whch can be transformed to a target mage va 2-D rgd transformatons obtaned from the averaged locatons and orentatons. After we get control ponts n both source and target mages, the multlevel B-splne method [11] s used to obtan non-lnear transformatons by whch all pxels n the source mage are mapped to the target mage. Small holes can be flled by smple morphologcal operatons. These algned blary mages are used construct a whole body shape pror,.e., SW off (p) Onlne learnng The onlne learnng s used to create a subject specfc shape model SW on (p) after all parts are localzed. The goal s to deform SW off (p) n a way that the locatons of all detected parts are reflected n the shape pror. The smlar technque descrbed above for off-lne learnng s used here to fnd the non-lnear transformaton functons for every pxel n SW off (p) by whch SW off (p) s converted to SW on (p) that carres a subject specfc shape model. It s worth notng that both SW off (p) and SW on (p) are not bnary mages. Approprate nterpolaton s needed to fll the possble holes n SW on (p) durng the deformaton process. 5. Low-level vson: watershed transform Groupng pxels nto small homogenous regons s becomng a popular pre-processng for many computer vson tasks. Ths s well supported by the cogntve theory proposed by [16] that consders unform connectedness (UC) regons as the buldng block for object representaton. In ths work, we chose the watershed transform [20] because of ts many bologcally plausble propertes, such as fast, local computaton. More mportantly, both boundary and regonal nformaton are avalable for each cell. To overcome the over-segmentaton problem, the geodesc reconstructon preprocessng [14] s used to control the watershed sze through some morphologcal parameters, whch can be dynamcally adjusted accordng to the feedback from the hgh-level vson (as shown n Fg. 2). A gven an mage I, s represented by Z watershed cells I = {C = 1, 2,..., Z}. Each cell conssts of a set of pxels C = {p (),..., p() η }, where η s the number of 1,p() 2 pxels. Moreover, we use a 3-D Gaussan model {µ (c),σ (c) } to represent the color dstrbuton n the L a b color space for cell C. The watershed cells are used as the buldng blocks n the followng processes. 6. Md-level vson: part-based nference The goal of the md-level vson s to generate mmedate part detecton results that wll be useful for the hgh-level vson. What we need here s a map mage that ndcates how lkely there s an object (.e., a body part) at each locaton. Recently, the dea of usng segmentaton to verfy object hypotheses has acheved remarkable success n object detecton [18, 12]. We hereby propose a new hypotheses-and-test paradgm, as shown n Fg. 5, where the regon-based shape pror s used to form a segmentaton for a gven poston hypothess and the edge-based shape pror s used to valdate the formed segmentaton. Good hypothess Bad hypothess Segmentaton usng regon-based shape pror Regon based Shape pror Evaluaton usng edgebased shape pror Edge based Hgh Score Low Score Fgure 5. The hypothess-and-test paradgm for part nference Hypothess step: regon-based segmentaton Gven the shape pror SP (p) p Ω for part where Ω s a rectangular wndow, we can use Ω as a sldng-wndow to scan through the whole mage to examne the exstence of part at each locaton. For a hypotheszed locaton, we use SP (p) to nduce a local fgure-ground segmentaton that s composed by some watershed cells covered by Ω. Ths segmentaton wll be used to valdate the exstence of part at that locaton. In order to take advantage of watershed cells
5 and ther color models, we propose a new sem-parametrc kernel-based model learnng technques to onlne learn the fgure/ground color models from the watershed results drectly, as shown n Fg. 6(a). We treat the Gaussan model learned from a watershed cell as a kernel center, and learn the fgure/ground color models as follows, ˆ f ob (x) = ˆ f bg (x) = Z =1,C Ω = Z =1,C Ω = α K (x), (4) β K (x), (5) where x s a color vector; C s one of Z watershed cells that has overlap wth wndow Ω; K (x) =N (x µ (c), Σ (c) ) s the color model assocated wth C ; α and β denote the contrbuton of cell C to the object and background respectvely that can be calculated from SP (p), (p Ω) as α = 1 T β = 1 T p (C Ω) p (C Ω) SP(p), (6) (1 SP(p)), (7) where T s the sze of shape pror wndow Ω. Based on the fgure/ground color models, we can use the maxmum a posteror (MAP) crteron to dentfy the watershed cells that belong to the object. Let τ be the class label for C : τ = { 1 (object), α ˆ 0 (background), α ˆ fob (µ (c) fob (µ (c) ) >β fbg ˆ (µ (c) ); ) <β fbg ˆ (µ (c) ). (8) Therefore, we can obtan the correspondng segmentaton for the poston hypothess l as, X = { C τ =1}. Dfferent from the one n [18] where the shape pror s used once for onlne color model learnng, here we use the shapebased pror twce. The frst tme s for the onlne color model learnng and the second tme s for MAP-based segmentaton. Consderng the false negatve s more detrmental than the false postve n md-level vson, we fully ncorporate the regon-base shape pror nto segmentaton. Ths may lead to more false postves due to more object-lke segmentatons. However, the sequent edge-based evaluaton wll mtgate ths problem Test step: edge-based evaluaton After segmentaton X s formed, we evaluate t accordng to the edge pror M. LetΓ(X) to be the boundary of X, we compare Γ(X) wth M n terms of shape smlarty and smoothness. The score of X wth respect to ts complance wth M,.e., ρ M (X) s gven by, ρ M (X) = exp( d c (Γ(X), M)) + ζ(1 S(Γ(X), M)), (9) Fgure 6. (a) Kernel-based color model learnng usng the regonbased prors and watershed cells.(b) Smoothness measurement. where the frst term s the chamfer dstance ndcatng the shape smlarty; the second term measures the boundary smoothness; and ζ balances the relatve mportance between the two terms. It s expected that a vald segmentaton should be smooth and match wth M well. The chamfer dstance s senstve to the transton, rotaton and scale. Ths s desred for rejectng false hypotheses. The second term ams to reject segmentatons wth ragged boundares. We defne an effectve smoothness measurement as follows. As shown n Fg. 6(b), assume that Γ(X) touches n cells {C 1,..., C n }, and we defne H = {h () 1,..., h() n } to be the set of n boundary pxels shared by cell C and Γ(X). Let φ M (p) :R 2 R to be the sgned Eucldan dstance transform that s + or - for p nsde or outsde M, respectvely. The maxmum and mnmum dstances from H to M are obtaned by d () max = max(φ M (h () 1 ),..., φ M(h () n )), and d () mn = mn(φ M(h () 1 ),..., φ M(h () m )), respectvely. The degree of parallelness between Γ(X) and H s measured by S M (H )= d() max d () mn. (10) n When H s parallel to M (e.g., H 2 n Fg. 6(b)), S M (H ) = 0, ndcatng good local smoothness. When H s perpendcular to M (e.g., H 3 n Fg. 6(b)), S M (H ) = 1, ndcatng poor local smoothness. In general, the smaller the value, the more parallel between H and Γ(X). Therefore, we defne the overall smoothness of Γ(X) as S(Γ(X), M) = 1 n n S M (H ). (11) =1 For each of d parts of pose k, the score functon (9) wll return a map mage that records the exstence possblty of a part n every locaton and wll be the nput for the hgh-level vson. It s worth notng that at each poston hypothess, the shape pror s hypotheszed wth dfferent orentatons around the mean angle, and we use the wnner-take-all strategy to generate the map mage. The optmal angle at each locaton s also recorded.
6 7. Hgh-level vson: recognton/localzaton We use g (k) (I,l ) to represent the map mage for part of pose k n mage I, and l denotes an arbtrary poston. Let I maps (k) = {g (k) (I,l ),..., g (k) d (I,l d)} denotes the set of d map mages, part localzaton and pose recognton are formulated as an nference process guded by the spatal prors of dfferent poses represented by {L (k) k =1,..., K}. Usng Bayes law, the posteror dstrbuton for pose k can be wrtten n terms of the map mages I (k) maps and the spatal pror defned n (2) as, p L (k)(l I (k) maps) p L (k)(i (k) maps L).p L (k)(l). (12) Let P L (k)(i maps L) (k) = =d the terms n (12), we have =1 g(k) (I,l ), by manpulatng p L (k)(l I maps) (k) p L (k)(l r )g r (k) (I,l r ) p Lk (l l r )g (k) (I,l ). =r (13) Then pose recognton and part localzaton can be jontly obtaned by the followng optmzaton: {k,l } = arg max p L k,l (k)(l I(k) maps). (14) However, the drect evaluaton of (14) s computatonally prohbtve. We use the effcent nference engne proposed n [3] to obtan the soluton here. For any non-reference part of pose k, the qualty of an optmal locaton can be, ɛ k,(l r ) = max p L (k)(l l r )g (k) (I,l ). (15) l Gven p L (k)(l l r ) s Gaussan, ɛ,k (l r) can be computed by the generalzed dstance transform. Then, the posteror probablty of an optmal confguraton for pose k can be expressed n terms of the reference locaton l r and ɛ. Then the posteror probablty n (13) wll become, p Lk (L I (k) maps) p Lk (l r )g (k) r (I,l r ) =r ɛ k,(l r ), (16) whch wll lead to a new map mage G k (I,l r ) that ndcates how lkely the reference part of pose k s n each locaton. Ths new map mage G k (I,l r ) s the poolng results of all the map mages n I maps (k) va the spatal pror model of pose k,.e., L (k). Therefore, pose recognton and reference part localzaton can be effcently mplemented by {k,l r} = arg max k,l r G k=1:k (I,l r ). (17) After the reference part s located, the poston of each nonreference part can be obtaned by l = arg max p(l lr)g (k (I,l ). (18) l Accordng to the maxmum value of obtaned G k (I,lr), we could desgn a feedback loop to adjust the sze of watershed cells n low-level vson, as shown n Fg. 2. ) 8. Whole body Segmentaton va Graph-cut Recently, the graph-cut approach has acheved consderable success n mage segmentaton. It has the capacty to fuse both boundary and regonal cues n an unfed optmzaton framework [2]. Several exstng methods, such as [6], only ncorporate a sngle shape pror (edge-based or regon-based) nto the segmentaton process. Our contrbuton here s to combne two shape prors nto segmentaton where the mage s represented by watershed cells. After pose recognton and localzaton, onlne learned whole body shape prors, SWon L (p), M L w and pose confguraton L can be obtaned. Gven mage I = {C = 1,..., Z}, τ = {τ =1,..., Z} denotes the set of bnary class labels for all watershed cells (τ =0: background and τ =1: object). Followng the segmentaton energy defnton from [2] E(τ) =λ. Z R(τ )+ =1 C Cj = E(H,j )δ(τ,τ j ), (19) where R(τ ) s the regonal term, whch relates to the posteror probablty of C belongng to class τ ; E(H,j ) s the boundary term, whch represents the consstence between the edge-based shape pror M L w and local boundary formed by two cells, H,j = C Cj ; δ(τ,τ j )=1when τ = τ j otherwse δ(τ,τ j )=0; λ specfes a relatve mportance between two terms. The calculaton of R(τ ) nvolves onlne learnng of fgure/ground color models where regon-based shape pror SWon L (p) s nvolved for kernel-based densty estmaton, (w) (w) as dscussed n Secton 6.1. Let ˆf ob (x) and ˆf bg (x) be the fgure/ground color models, and α (w) and β (w) are computed from SW on (p) that denote the pror probabltes of C belongng to the object and background respectvely. Therefore, R(τ ) s defned as R(τ =1) = ln α (w) R(τ =0) = ln β (w) ˆf (w) ob (µ(c) ), (20) ˆf (w) bg (µ(c) ), (21) where µ (c) s the mean color vector of C. Usng the same dea of edge-based shape evaluaton defned n (9), let X = H,j, and we can defne E(H,j )=ρ M (X), whch evaluates the consstence between H,j and edge-based shape pror M L w n terms of the degree of parallelness and the shape smlarty. In a smlar way, all body parts can also be segmented. Moreover, the segmentaton n the hgh-level vson stage wll help us extract more useful features to prune possble false postves. For example, false postves can be dentfed by checkng the color smlarty between the two arms or legs. The feedback loop from segmentaton to localzaton(asshownnnfg.2) makes our framework a dynamc system that has potental to be further optmzed.
7 9. Expermental results Here we valdate the effectveness of the proposed approach on the CMU Mobo database [8], whch contans mages of 25 ndvduals walkng on a treadmll. Each mage s down-sampled to the sze of pxels, and each body part s defned n a wndow of pxels. For each pose, there are totally sx parts (the head, torso, leftarm, rght-arm, left-leg, and rght-leg), and 200 manually segmented bnary mages are used for the off-lne learnng of part-based and whole body shape prors. The algorthm was programmed n C++, and the test platform s Pentum 4 3.2GHz and 1GB RAM. Totally, the expermental results are reported for three tasks, pose recognton, body/parts localzaton, and body segmentaton. The man competng algorthms are the 1- fan method n [3] for the frst two tasks and the graphccut algorthm defned n (19) for the last task. Although our approach s a dynamc process wth potental for further optmzaton, we have fxed the watershed transform n all experments (wthout the feedback from hgh-level vson to fne tune the watershed transform as shown n Fg. 2). Hgh-pont Passng Recol Fgure 7. Pose defntons [4]. Contact 9.2. Localzaton Based on the same test mages used for pose recognton, we have tested two methods on the localzaton of three poses,.e., Hgh-pont (H-pont), Contact and Passng. Table 1 compares the proposed method wth the 1-fan method n terms of localzaton error n pxel for sx body parts. It s shown that the results on localzng the head and torso are comparable for the two methods, and our approach shows sgnfcant advantages on localzng other body parts. Table 1. The comparson of localzaton errors (n pxel) between the two methods wth respect to three poses. Poses Methods Head Torso Larm Rarm Lleg Rleg H-pont 1-fan hybrd Contact 1-fan hybrd Passng 1-fan hybrd The reasons for above observatons s that the relatve poston between the head and torso has least varablty, and the part-based spatal pror that s shared by the two methods plays the major role for part localzaton, leadng to the smlar results. However, there s drastc (relatve) spatal varablty, both postonal and orentatonal, for the arms and legs, and the mprovements from the proposed method are much more sgnfcant due to the enhanced salency of the part-based map mages generated by the segmentatonbased hypothess-and-test paradgm. Some part localzaton results of three poses are shown n Fg. 8 (the frst three rows), where the proposed method successfully detects (and segments) all body parts despte the sgnfcant varablty Pose recognton In a walkng cycle, the human pose s a contnuous tmevaryng varable. Accordng to [4], a complete walkng cycle can be defned by eght poses that are further grouped nto four poses due to the symmetrc property. They are Contact, Recol, Passng and Hgh-pont, as shown n Fg. 7. In our experments, we combne poses Recol and Contact together due to ther strong smlarty. For each of the three poses, the torso s used as the reference part, and 230 labeled tranng data are collected for learnng the partbased spatal pror. It was found that the proposed approach acheves the recognton rate of 98% for the three poses over 144 test mages from 21 persons. The ms-classfcaton only occurs for pose passng that sometmes s very smlar to other two poses. One possble way to mprove the recognton for ths pose s to ncorporate the moton nformaton from vdeo sequences. The 1-fan method n [3] acheved the recognton rate of 93%. Fgure 8. Part localzaton of three poses and onlne learned whole body shape models that are used for the whole body segmentaton.
8 9.3. Segmentaton After localzaton, an onlne learned subject specfc shape pror (as shown n the last row of Fg. 8) susedn the new Graph-cut algorthm where both regon and edge prors are nvolved n the energy functon defned n (19). For comparson,the second term of the energy functon defned n (19) s replaced by a standard color smlarty-based boundary penalty term [2] wthout usng the edge-based shape pror. Currently, we only performed Graph-cut segmentaton on pose Contact due to ts least occluson. By settng λ =1/30 n (19) and usng 60 test mages, segmentaton results are evaluated by the rato between the falsely detected regon sze (ncludng both false postves and false negatves) and the ground truth regon sze. The error rate of the segmentaton usng both regon-based and edge-based prors s 17.2%, whle that of the one wthout usng the edge-based shape pror s 38.1%. Therefore, we have obtaned more than 50% mprovement. 10. Dscusson and Concluson In ths paper, we have proposed a hybrd body representaton that supports an ntegrated pose recognton, localzaton and segmentaton framework. Partcularly, segmentaton, as a brdge between bottom-up cues and top-down knowledge, plays an mportant role n all three levels of vson. In our experment, when the number of poses goes up, the performance of pose recognton wll deterorate due to the overlap between adjacent poses. However, the performance of body/part localzaton and segmentaton s qute stable and s less senstve to the error of pose recognton. We also found that the proposed approach s very robust to the occluson of one body part. More experments need to be done to test ts robustness for multple occluded parts. The proposed framework has potental to be a dynamc system wth the feedback loops that can be used for further optmzaton. In prncple, ths approach s applcable to any artculated object that has well defned spatal confguratons and can be decomposed nto dfferent parts that have lttle shape varablty. Our future research wll focus on extendng the proposed body representaton to be a dynamc human body representaton that supports vdeo-based pose recognton, localzaton, trackng and segmentaton. Acknowledgments The authors would lke to thank the revewers for ther valuable comments. Ths work s supported by the Natonal Scence Foundaton under Grant IIS (CAREER). References [1] A. Bssacco, M. H. Yang, and S. Soatto. Detectng humans va ther pose. In Neural Informaton Processng Systems (NIPS), [2] Y. Boykov and G. Funka-Lea. Graph cuts and effcent n- d mage segmentaton. Internatonal Journal of Computer Vson, 70: , , 8 [3] D. Crandall, P. Felzenszwalb, and D. Huttenlocher. Spatal prors for part-based recognton usng statstcal models. In Proc. of IEEE CVPR, , 3, 6, 7 [4] Dermot [5] P. Felzenszwalb and D. Huttenlocher. Pctoral structures for object recognton. Internatonal Journal of Computer Vson, 61(1):55 79, January [6] D. Freedman and T. Zhang. Interactve graph cut based segmentaton wth shape prors. In Proc. of IEEE CVPR, [7] R. L. Goldstone. Object, please reman composed. Behavoral and bran scences, 21: , [8] R. Gross and J. Sh. The cmu moton of body (mobo) database. Techncal Report CMU-RI-TR-01-18, Robotcs Insttute, Carnege Mellon Unversty, [9] X. Huang, D. Metaxas, and T. Chen. Metamorphs: Deformable shape and texture models. In Proc. of IEEE CVPR, [10] J. E. Hummel and B. J. Stankewcz. Two roles for attenton n shape percepton: A structural descrpton model of vsual scrutny. Vsual Congnton, 5:49 79, [11] S. Lee, G. Wolberg, and S. Y. Shn. Scattered data nterpolaton wth multlevel b-splnes. IEEE Trans. on Vsualzaton and Computer Graphcs, 3: , [12] B. Lebe, E. Seemann, and B. Schele. Pedestran detecton n crowded scenes. In Proc. IEEE Conference on Computer Vson and Pattern Recognton, [13] X. L and G. Hamarneh. Modelng pror shape and appearance knowledge n watershed segmentat. In The 2nd Canadan Conference on Computer and Robot Vson, pages 27 33, [14] Y.-C. Ln, Y.-P. Tsa, Y.-P. Hung, and Z.-C. Shh. Comparson between mmerson-based and toboggan-based watershed mage segmentaton. IEEE Trans. on Image Processng, 15: , [15] G. Mor, X. Ren, A. A. Efros, and J. Malk. Recoverng human body confguratons: combnng segmentaton and recognton. In Proc. of IEEE CVPR, volume 2, pages , [16] S. E. Palmer and I. Rock. Rethnkng perceptual organzaton: The role of unform connectedness. Psychonomc Bulletn and Revew, 1:29 55, [17] D. Ramanan. Learnng to parse mages of artculated bodes. In Proc. of Neural Info. Proc. Systems (NIPS),, [18] D. Ramanan. Usng segmentaton to verfy object hypotheses. In Proc. of IEEE CVPR, , 5 [19] P. Srnvasan and J. Sh. Bottom-up recognton and parsng of the human body. In Proc. of IEEE CVPR, [20] L. Vncent and P. Solle. Watersheds n dgtal spaces: an effcent algorthm based onmmerson smulatons. IEEE Trans. on Pattern Analyss and Machne Intellgence, 13: ,
Learning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationMultiple Frame Motion Inference Using Belief Propagation
Multple Frame Moton Inference Usng Belef Propagaton Jang Gao Janbo Sh The Robotcs Insttute Department of Computer and Informaton Scence Carnege Mellon Unversty Unversty of Pennsylvana Pttsburgh, PA 53
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationPose, Posture, Formation and Contortion in Kinematic Systems
Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationA B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images
A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty
More informationFusion Performance Model for Distributed Tracking and Classification
Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
More informationCombined Object Detection and Segmentation
Combned Object Detecton and Segmentaton Jarch Vansteenberge, Masayuk Mukunok, and Mchhko Mnoh Abstract We develop a method for combned object detecton and segmentaton n natural scene. In our approach segmentaton
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationTitle: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images
2009 IEEE. Personal use of ths materal s permtted. Permsson from IEEE must be obtaned for all other uses, n any current or future meda, ncludng reprntng/republshng ths materal for advertsng or promotonal
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationLong-Term Moving Object Segmentation and Tracking Using Spatio-Temporal Consistency
Long-Term Movng Obect Segmentaton Trackng Usng Spato-Temporal Consstency D Zhong Shh-Fu Chang {dzhong, sfchang}@ee.columba.edu Department of Electrcal Engneerng, Columba Unversty, NY, USA Abstract The
More informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More information2 ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE (a) Ambgutes from person re dentfcaton n solaton (b) Assocatng groups of people may reduce ambgutes n mat
ZHENG et al.: ASSOCIATING GROUPS OF PEOPLE 1 Assocatng Groups of People We-Sh Zheng jason@dcs.qmul.ac.uk Shaogang Gong sgg@dcs.qmul.ac.uk Tao Xang txang@dcs.qmul.ac.uk School of EECS, Queen Mary Unversty
More informationDetecting Irregularities in Images and in Video
Detectng Irregulartes n Images and n Vdeo Oren Boman Mchal Iran Dept. of Computer Scence and Appled Math The Wezmann Insttute of Scence 76100 Rehovot, Israel Abstract We address the problem of detectng
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationAdaptive Silhouette Extraction and Human Tracking in Dynamic. Environments 1
Adaptve Slhouette Extracton and Human Trackng n Dynamc Envronments 1 X Chen, Zhha He, Derek Anderson, James Keller, and Marjore Skubc Department of Electrcal and Computer Engneerng Unversty of Mssour,
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
More informationA New Knowledge-Based Face Image Indexing System through the Internet
Ne Knoledge-ased Face Image Indexng System through the Internet Shu-Sheng La a Geeng-Neng You b Fu-Song Syu c Hsu-Me Huang d a General Educaton Center, Chna Medcal Unversty, Taan bc Department of Multmeda
More informationA Graphical Model Framework for Coupling MRFs and Deformable Models
A Graphcal Model Framework for Couplng MRFs and Deformable Models Ru Huang, Vladmr Pavlovc, and Dmtrs N. Metaxas Dvson of Computer and Informaton Scences, Rutgers Unversty {ruhuang, vladmr, dnm}@cs.rutgers.edu
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationFace Detection with Deep Learning
Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
More informationA Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
More informationFeature Extractions for Iris Recognition
Feature Extractons for Irs Recognton Jnwook Go, Jan Jang, Yllbyung Lee, and Chulhee Lee Department of Electrcal and Electronc Engneerng, Yonse Unversty 134 Shnchon-Dong, Seodaemoon-Gu, Seoul, KOREA Emal:
More informationColor Image Segmentation Using Multispectral Random Field Texture Model & Color Content Features
Color Image Segmentaton Usng Multspectral Random Feld Texture Model & Color Content Features Orlando J. Hernandez E-mal: hernande@tcnj.edu Department Electrcal & Computer Engneerng, The College of New
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationComparison Study of Textural Descriptors for Training Neural Network Classifiers
Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More information