Chin Contour Extraction Based on an Auto-Initialized Shape-Enhanced Snake

Size: px
Start display at page:

Download "Chin Contour Extraction Based on an Auto-Initialized Shape-Enhanced Snake"

Transcription

1 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October Chin Contour Extraction Based on an Auto-Initialized Shape-Enhanced Snake Kuo-Yu Chiu, Shih-Che Chien, and Sheng-Fuu Lin Department o Electrical Engineering, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu, Taiwan 300, ROC Summary In this paper, an improved method to extract the chin contour under dierent ace poses is proposed. Several previous approaches have used active contour models(acm) or snakes in ront-view acial images. However, successul chin contour extraction or a wide range o ace poses has seldom been mentioned. An algorithm based on an improved snake or chin contour extraction is presented here and it is able to be operated successully with wide range o dierent ace poses. Since lots o algorithms have been proposed or extracting ace region and important acial eatures like eyes and lips, the algorithm in this paper assumes that the ace region and locations o these two eatures are known as prior knowledge. At the irst stage, the ace is normalized and ace pose is roughly estimated according to the geometric relationship between eyes and lips. Then, the snake or chin contour is initialized with two parabolas according to dierent ace poses. The shape-enhanced snake model is employed to it the chin contour at last. Experimental results show that the proposed algorithm can extract the chin contour under dierent ace poses with good accuracy. Key words: Active contour model, chin contour extraction, acial eature, ace pose 1. Introduction Chin contour extraction, or itting the chin, is a major requirement or ace modeling, ace pose estimation, ace replacement, and ace recognition. In act, chin contour is an important eature to distinguish the ace region rom the neck region. Besides, the shape o a chin also oers some inormation or ace recognition and ace pose estimation. While the shape o a chin is an important eature or a human, the chin contour is rarely used as a eature. One reason is that an estimated chin contour may deviate rom the true chin contour due to the weak boundary between ace region and neck region. With noise or complicated background, the estimated chin contour would easily be led into alse result. Another reason is that the chin contour varies greatly while the ace pose is dierent. When the ace is proile, turn 90 degrees let or right, the chin contour is totally dierent rom the rontal pose. Hence, chin contour extraction is one o the most diicult tasks o acial eature extraction. The shadows, variations o the skin color, clothing, hair, beards, and noisy background may easily reduce the accuracy o chin contour extraction. In order to overcome these problems, the prior inormation such like skin color region and acial eatures, such as eyes and lips, are important and necessary. Using these inormation, the typical shape o chin contour can be modeled and the possible locations o chin contour can be estimated. Since acial eatures extraction is an important and primary step or systems such as interaction systems and identiication systems, lots o algorithms and methods [1]-[5] have been proposed or extracting the acial eatures, which include skin color region, eyes, and lips region. Hence, we do not ocus on how to extract and localize these acial eatures in this paper. There are also some chin contour estimation or itting the chin algorithms. For example, the authors in [6] use color-based segmentation along with morphological operation to approximate the chin contour. The resulting set o discontinued segments and ragmented curves are processed, thinned, classiied, and inally the chin contour is reconstructed. In [7], the chin contour is estimated by a deormable template consisting o our parabolas. Costunctions are established and minimized to ind the best it o the template to the chin and cheek. A more accurate algorithm based on three models is proposed in [8]. Three perect models, circular, triangular, and trapezoidal models, are used here along with piecewise linear model or curve itting. The experiments show high accuracy or extraction and classiication on a large data set. Another algorithm based on two curves with polynomials o ive degrees are employed in [9][10]. By using modiied Canny edge detector, some alse edges with unit gradient directions are excluded and the results o itting are improved. There are other approaches based on active contour model [11]-[16]. As the snake model is an energy-minimizing spline inluenced by image eatures and external orces which pull the spline toward real edges, the results using a snake model or itting would be much Manuscript received October 5, 010 Manuscript revised October 0, 010

2 4 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October 010 closer to the real chin contour. However, when the chin contour appears loosely marked due to complicated background or proile ace pose, the reliability o snake model is greatly reduced. Furthermore, the perormance is aected seriously by the initialization and external orce o snake model. The algorithm proposed in [17] shows good accuracy when dealing with dierent ace poses. By training 10 lexible ace models based on dierent ace poses, the initialization problem is hence solved. In this paper, an algorithm based on snake or chin contour extraction which separates the chin region rom the neck region is presented. This algorithm is applicable to both rontal and proile ace images based on the inormation that the skin color region and the locations o eyes and lips are known. There are three main stages to accomplish the chin contour extraction. In the irst stage, the ace is irst normalized so that the roll angle is rotated to be zero. The line across two tips o the lips with proile ace pose or the line across two eyes with rontal ace pose is rotated to be parallel to the x-axis. The purpose o normalizing ace image is to acilitate locating the possible chin contour region. Then, the normalized ace image is roughly classiied into 7 classes, according to the ace turning angle and ace looking up, down, or straight as the second stage. The geometric relationship between eyes and lips is used as the input eatures or classiication. The snake model is dierently initialized according to these two classes in this stage. Finally, the shape-enhanced snake model is employed in the last stage to it the chin curve. The remainder o this paper is organized as ollows. In Section, the steps o ace image pre-processing including ace image normalization and ace pose classiication are given. Then, the proposed auto-initialized shape-enhanced snake algorithm or itting the chin contour is introduced in Section 3. Some experimental results and discussions are shown in Section 4. Finally, the conclusions are given in Section 5. skin color region and locations o eyes and lips, represented by their mass centers, are supposed to be known as prior inormation to utilize the estimation. The chin curve, as it can be seen, transorms greatly with dierent ace poses. When turning let or right, or looking up or down, these changes will lead to dierent chin curves as shown in Fig.1. A ixed model used as initialization o snake is not appropriate to describe the variety o chin contours. Since the snake is so sensitive to the initialized curve, dierent initial snakes should be built by considering dierent ace poses, instead o using one chin contour model. In this paper, ace poses are roughly divided into two classes, namely rontal pose and proile pose. These two classes are distinguished by the number o eyes. When two eyes are ound in a ace image, the ace pose is deined as rontal, while one eye represents proile ace pose. Since there may be two eyes or one eye in a ace image and the ace pose may be rontal or proile, these conditions are discussed and processed under dierent criteria. In this section, the ace image is irst normalized by setting the roll angle to be zero. Later, the ace pose can be roughly estimated and classiied according to the geometrical and statistical inormation between prior acial eatures. Then the estimated chin curve can be initialized close enough to the real one.. Face Image Pre-processing In this section, the ace image pre-processing steps including ace image normalization and ace pose classiication will be introduced. Active contour model or snake is an energy minimizing curve that deorms to it image eatures. However, there are some limitations, such like the model usually incorporate edge inormation, ignoring other image characteristics such as texture and color. Besides, the snake must be initialized close enough to the eature o interest to avoid being distracted by noise and clutter. By using the geometrical and statistical inormation between acial eatures, the chin curve can be roughly initialized with two parabolas. In this paper, the Fig.1 Chin contour varies greatly with the change o ace poses. When turning let or right, or looking up or down, these changes will lead to dierent chin contours..1 Face image normalization The purpose o ace image normalization is to rotate the ace image so that the ace is centrally located with zero roll angle. Most o the lines crossing important ace eatures, such like eyes, lips, or nose, are parallel to the x-axis or y-axis ater normalization, as shown in Fig.. The roll angle in this paper is determined in two ways

3 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October according to the number o eyes. With the prior inormation that the locations o eyes and lips are known, the roll angle θ is deined as the included angle between x-axis and the extended line across two eyes when two eyes are ound, y 1 r eye y l eye θ = tan ( ), (1) xr eye yl eye where y r-eye and x r-eye are the y-coordinate and x-coordinate o the right eye respectively, while y l-eye and x l-eye are the y-coordinate and x-coordinate o the let eye respectively. When there is only one eye in the ace image, which means the proile ace pose, the roll angel is deined as the included angle between x-axis and the extended line across the right and let tips o the lips, y 1 r lip y l lip θ = tan ( ), () xr lip yl lip where y r-lip and x r-lip are the y-coordinate and x-coordinate o the right tip o lips, while y l-lip and x l-lip are the y-coordinate and x-coordinate o the let tip o lips. Ater the roll angle is retrieved, the ace can be normalized to be horizontal by executing rigid transormation. The rigid transormation matrix M rig is deined by cosθ sinθ 0 M rig = sinθ cosθ 0. (3) Bilinear interpolation using the our nearest neighbors o a point is adopted here to modiy the rotated image. Let the point (x', y') denote the coordinate o interpolated pixel and v(x', y') denote the RGB value assigned to it. For bilinear interpolation, the assigned RGB value is given by vx ( ', y ') = ax ' + bv ' + cx ' y ' + d, (4) where our coeicients are determined rom the our equations in our unknowns that can be written using the our nearest neighbors o point (x', y')[19]. Fig. Original image. Rotated image with zero roll angle ater normalization.. Face pose estimation Ater the ace image is normalized, the ace pose owing to turning let or right and looking up or down is estimated. The ace pose can be divided into two major classes, namely rontal pose or proile pose, according to the number o eyes ound in a ace image. In an input ace image, ace pose is deined to be rontal i two eyes are ound, while proile ace pose means that only one eye is ound, as shown in Fig.3. Since the chin contour varies greatly when the ace pose is dierent, ace poses are urther discussed and classiied in this section. With the prior inormation o skin color region and locations o eyes and lips, 15 sub-classes in rontal pose and 1 sub-classes in proile pose are classiied by using a 3-layer neural network. Three parameters which derive rom the geometrical relationship o acial eatures are used as the input o the neural network. These parameters will be introduced as ollows. Fig.3 Face pose is deined to be rontal i two eyes are ound. Face pose is deined to be proile i only one eye is ound. Since the resolution and size may be dierent rom each other, by comparing with the ace image in data base, a scale actor, S, is deined here to represent the relative size o ace image or ace region. When the ace pose is rontal, or two eyes are ound, the scale actor S is deined by S = ( De e + Dl ee = EL ER + TP L c, (5) where D e-e is the distance between two eyes, E L and E R, and D l-ee is the vertical distance rom the centroid o the lips, L c, to the point, T p, which is the intersection o the line segment o two eyes and the vertical line crossing the centroid o the lips. These eature points are illustrated in Fig.4. From the statistical experiment results, the value o these two parameters, D e-e and D l-ee, are approximately proportional to the ace size and nearly equal to each other when the ace is rontal without turning let or right and looking up or down, while D e-e varies with the turning angle and D l-ee varies when looking up or down. Hence, the scale actor S is deined by using these two parameters. Though the skin color region is known as prior inormation, the size o skin color region is not used here

4 44 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October 010 to represent the size o ace image since skin color region extracted by skin color may contain neck region. Hence, the size o skin color region is not a valid parameter or ace size. When the ace pose is proile, or one eye is ound, S is deined with lesser acial inormation as S = Dl e = Eo L c, (6) where D l-e is the distance between the only eye, E o, and the centroid o lips, L c. Ater S is determined, we use some parameters as input eatures or ace pose classiication. From our experiments, three more robust and simpler parameters are used to describe the ace pose. With rontal ace pose, these eatures are deined as De e p1 = ( ), Dl ee (7) DTE r DTE l TP ER TP EL p = ( ) =, S S Fc FFc p3 = ( ), S where D TE-r is the distance between T p to right eye E R and D TE-l is the distance between T p to let eye E L. When the ace is turning let (rom the viewpoint o an observer), D TE-r would be larger than D TE-l and the result o p will be positive. The dierence value between D TE-r and D TE-l is divided by the actor S to represent a relative turning degree. In last equation, the mass centers o ace region and acial eatures are utilized. We use F c to represent the x-coordinate o skin color region centroid. The x-coordinate acial eature centroid determined by the mass center o E L, E R, and L c is deined as acial eature centroid FF c. These two eatures are illustrated in Fig.4 and Fig.4 respectively. Since only x-coordinate is concerned in this equation, the skin color region containing neck region or not does not matter. The skin color region with neck region changes the centroid o skin color region center in y-axis much more than that in x-axis. With the ace turning let, the acial eature centroid moves leter than the skin color region centroid does. A positive p 3 represents that the ace is turning let and the magnitude show the turning degree. Fig.4 Facial eatures and the centroid o acial eatures o rontal ace pose. Face centroid is deined as the centroid o skin color region. When dealing with proile ace poses, we irst determine whether the head is turning let or right by comparing the x -coordinates o skin color region centroid and acial eature centroid, which is derived rom the centroid o lips only. Then, the chin tip, C T, is extracted by C = max xy, (8) T ( xy, ) F where is the set o points o skin color region. By setting the y-coordinate o the highest skin-color point and the x -coordinate o the most right skin-color point when turning let or the most let skin-color point when turning right as origin, the variable x and y are the relative x-coordinate and y-coordinate o points o skin color region. Connecting chin tip and lips tip as L 1 and connecting chin tip and the eye as L, we deine another three eatures or classiication. These eatures are deined by DE o L1 p1 = ( ), S (9) p = θl, 1 p3 = θl, where D Eo-L1 is the distance rom the eye to L 1. When the ace pose is more proile, the distance rom the eye to L 1 will be shorter. The parameter θ L1 is the included angle between L 1 and x-axis, whileθ L is the included angle between L and x-axis. These two eatures vary with the ace looking up or down and turning right or let. All the eatures are shown in Fig. 5. Fig.5 Facial eatures and some eature points or lines o proile ace pose. Now, or each ace image, we have three eatures derived rom the geometrical relationship and treat them as the input o neural network. The outputs o neural network are the types o ace pose. When the ace pose is rontal, there are 15 classes composed o 5 types o ace turning with looking up, down, and straight. The 5 types are -50 ~ -30, -30 ~ -10, -10 ~ 10, 10 ~ 30, and 30 ~50 respectively. The positive degree represents that the ace is turning right rom the view o an observer, while negative degree means turning let. The ace pose is deined as looking straight i the tilt angle owing to looking up or down is between -0 and 0. Hence, the tilt angle

5 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October greater than 0 means looking up and less than -0 represents looking down. When the ace pose is proile, there are 4 types o ace turning with looking up, down, and straight, totally 1 classes. The 4 types o ace turning are -90 ~ -70, -70 ~ -50, 50 ~ 70, and 70 ~ 90. The deinition o looking up, down and straight is the same as beore. Figure Fig.6 shows an example o all the 7 dierent ace poses. Each ace in Fig.6 belongs to one o these classes. Ater training the neural network with test data rom both real ace images and virtual ace images by using the eatures deined beore, the ace pose o an input ace image can be roughly classiied. Fig.6 The representative ace images o 7 dierent ace pose classes. 3. Chin Contour Extraction In this section, chin contour extraction based on auto-initialized shape-enhanced snake is introduced. The snake model is an energy-minimizing active contour composed o image eatures, internal constraints and external orces. Snakes lock on to local minima in the potential energy generated by processing an image. However, there are limitations such like that the models must be initialized close to the eature o interest to avoid being distracted by noise and clutter. In chin contour extraction problem, chin contour is weak and indistinct, and it varies greatly when the ace pose is dierent. Besides, there is some noise nearby such like beards or collars. With the inormation o ace pose obtained beore, the snake can be initialized appropriately to the real chin contour to solve these problems. A chin contour database o various ace pose is irst built. We use two parabolas to describe the chin contour based on the chin tip. Let chin and right chin are estimated by a parabola respectively. These parabolas are estimated by using least square error (LSE) method with the chin contour points extracted by man. Then, the initial control points can be set with this inormation. At last, an iterative shape-enhanced snake is adopted here to it the chin contour, which ocuses on the initial shape and the distance between initial position and inal position. These will be introduced in the ollowing sub-sections. 3.1 Snake auto-initialization Generally, the initial snake can be set arbitrarily in any shape, such as circle or square. However, i the shape o snake is similar to the target and the position is near to the target, a better and aster result will be obtained. The purpose o snake auto-initialization is to it the chin contour as similar and near as possible with the ace pose inormation. Beore initializing the snake, a chin contour database based on ace pose and statistical results is built. The initial snake control points are the linear transormation o the chin contour stored in database. We determine one typical chin contour as the average ace pose or each class o ace pose, and there are thereore 7 typical chin contours in the database. For example, the chin contour with 60 turning right looking straight ace pose will represent all the class o 50 ~ 70 turning right looking straight ace pose, while 0 looking up and -0 looking down will represent the class o looking up and looking down. Each typical chin contour is extracted by man. We deine the matching center, M c, as the center o lips when the ace pose is rontal or as the interior tip o lips when the ace pose is proile. Two parabolas, L and R, separated by the x-coordinate o M c with rontal ace pose and C T with proile ace pose are constructed to it the typical chin contour, as shown in Fig. 7. Using least square error (LSE) method, the parabola on the let, L, can be derived rom the ollowing equation x 1 T T T y = L( x) = XLX L XLY L x, (10) 1 where x1 x1 1 y1 1 y x x, XL = YL =, (11) M M M M xc xc 1 yc and (x k, y k ), k = 1,...,c, is the coordinate o typical chin contour on the let extracted by man. The right parabola can also be derived in a similar way. These two parabolas o each typical chin contour are built in the database or snake initialization.

6 46 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October 010 Fig.7 The matching center and the reconstructed chin contour with two parabolas in rontal ace pose, and proile ace pose. However, since the scale and the position o input ace image may not be the same as those in database, scaling and shiting is needed. When the input image ace is in high resolution, more control points are needed as shown in Fig.8, while ew control points are enough to represent the chin contour in ace images with poor resolution. To maintain accuracy o chin estimation and simplicity o calculation, the number o control points N cp is adaptive to the scale o input ace image and is determined by ' S Ncp = 7+, (1) 40 with rontal ace pose, or is determined by ' S Ncp = 9+, (13) 30 with proile ace pose where S' is the scale actor o input ace image. These equations and parameters are derived rom statistical experiment results. Because the proile ace pose is more complicated with more curves and details, more control points are also needed to express the chin contour, as shown in Fig.8. Fig.8 The ace image with higher resolution need more control points to represent the chin contour. There are more details on the chin contour o proile ace pose, so more control points are also needed. The initial control points are linear transormation o some points o parabolas stored in database. Suppose '={s' 1, s',, s' Ncp,} is the set o the initialized snake control points containing N cp elements as shown in Fig. 9, each o the control point is auto-initialized by ' s ' ' sk = [ sk Mc] + M c, k = 1,,..., Ncp, (14) s where s' k, M', M' c, and S' are the coordinates o control points, matching center, and scale actor o input ace image, while s k, M, M c, and S are those o typical chin contour with the same class o ace pose. The control point s k o typical chin contour is deined by y 1 M y π c s k = ( xy, ) tan ( ) = ( k 1),( xy, ) x y, xm x N 1 (15) c cp k= 1,,..., N, cp where (y Mc, x Mc) is the coordinate o M c, as shown in Fig.9. Fig.9 The control points o typical chin contour. The auto -initialized control points derived rom the typical chin contour. 3. Shape-enhanced snake The basic snake model is an energy-minimizing spline. A snake is represented as a parametric curve v(k)=(x(k), y(k)), where the arc length, k=1,,, N cp, is an index. The energy unction o snake is deined as[18] Esnake = ( αeinternal ( v( k)) + βeimage ( v( k)) + γeexternal ( v ( k))) ds,(16) where E internal is the internal energy o the contour composed o tension and stiness, E image represents the energy o the image, E external is the energy o the external constraint, α, β, and γ are weighting parameters. The internal energy incorporates regularizing constraints that give the model tension and stiness, and is deined as Einternal = α1etension ( v( k)) + αestiness ( v( k)), (17) = α1v'( k) + αv''( k) where v'(k) and v''(k) controlled by weighting parameters α 1 and α are irst- and second-order terms that produce tension and stiness respectively. The image energy drives the model towards salient eatures, which is usually generated by processing the image to enhance edges, terminations, or eatures. The image energy is deined as E = I( x, y), (18) image

7 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October where I(x,y) is the gradient image. The external energy represents external constraints imposed by high-level sources such as human operators. Here, we consider two constraints as snake external energy. First, since the snake is appropriately initialized, the real chin contour would be close to the initialized snake. When the chin contour is not salient with proile ace pose or when there is lots o noise nearby, the auto-initialized snake should be used as important inormation. The distance o each control point between the inal snake and the initialized snake should be minimized. With this constraint, the chance that the snake alls into another contour such as the neck o clothes will be reduced. Second, when there are errors in eature extraction, transormations o control points including shit or size change are predictable. Under this condition, all the control points will trend to the same direction. With above two considerations, the modiied external energy o shape -enhanced snake in this paper is deined as Eexternal = γ1 () i k + γσ k, (19) where γ 1 and γ are the weighting parameters, i(s) is the searching index whose sign is the searching direction and magnitude is the distance between snake control point o initialization and current iteration, and σ k is the standard deviation o i(k). Since the chin contour is properly initialized, the result o estimation should be close to the initialized chin contour. The distance between control points o the initial snake and the inal result is minimized. Hence, the irst term strengthen the shape o initialized snake and a smaller i(k) indicates the snake ater iterations is close to the initial one. The second term ocuses on the consistency. A smaller σ i would be derived i most o the searching indexes including direction and magnitude are similar. When there are errors between acial extraction or eature matching, the initialized chin contour is a transormation o the inal results. A minimized σ k implies that the degree o shit and translation is similar. Since the real chin contour is near the initialized snake, the possible searching range can be conined with the inormation o errors and scale. The errors include the estimated error between the typical chin contour model and all the chin contours in the same class, and the matching error brought rom the unprecise location o matching centers. These errors will be larger with high ace image resolution. Hence, ater the snake is initialized, the possible searching range o one control point can be determined by v( k) = v( k) + i( k) n v ( k), Imax ( k) i( k) Imax ( k), (0) where v ( k) and n v ( k) are the corresponding initial control point and unit normal vector respectively. The unit normal vector means that the possible searching region ollows the direction o normal vector. The maximum searching index I max determined by the inormation o errors and scale is deined as ' S Imax ( k) = ε ( k) Δ, (1) m S where ε(k) is the maximum error or control point v ( k) between the typical chin contour model and all the chin contour in the same class, while Δ m is a constant error which includes the matching error and the localization error o acial eatures. Ater the searching region is determined, the auto-initialized shape-enhanced snake will lead to estimated chin contour by minimizing the energy iteratively. The result chin contour is obtained when the energy is minimized or several iterations are run, such as 100 iterations. We use cubic spline to express the inal results, as shown in Fig.10. A cubic spline is a spline constructed by piecewise third-order polynomials which pass through a set o control points. By deining the cubic spline as 3 1 v( k ) = a3sk + ask + as 1 k + a 0, () the parameters, a 0, a 1, a, and a 3 can be derived by dierentiating the cubic spline equation. These parameters are expressed as a3 = v( k) v( k+ 1) + v'( k) + v'( k+ 1), a = 3 v( k) + 3 v( k+ 1) v'( k) v'( k+ 1), (3) a1 = v'( k), a0 = v( k), k = 1,,..., Ncp 1, and the spline unction is obtained by a3 a 3 v( t) = ( k) ( k) ( k) 1 v v v a1 a0 1 1 v( k) ( k 1) (4) + k k k 1 v = s s s, v '( k) v'( k + 1) t k k+ 1, [ ] Fig.10 The cubic spline is a continuous unction constructed by piecewise third-order polynomials which pass through all the control points.

8 48 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October Experiment Results and Discussions Our experiment results are divided into two parts. One is the ace pose estimation, and the other one is chin contour estimation. For the results o ace pose estimation, we use a database containing 70 real ace images rom 10 people and 810 virtual ace images. Since there are total 7 classes o ace pose in this paper, 10 real ace images and 30 virtual ace images are used as training data or each class o ace pose. The real images oer the variety o ace shape, such as the atter ace, thinner ace, or ace with double chin. The virtual ace images, on the other hand, give various ace poses since the degree o turning and looking up or down can be easily set by adjusting the parameters. All the 1080 ace images are used as input training data or a 3-layer neural network, and the output are the 7 classes o ace pose. Each class o ace pose is described by a typical chin contour model which consists o two parabolas. Since the ace pose o real ace image is unable to be correctly classiied, we use another 540 virtual ace images o random ace poses or testing, which means 0 test images are used or each class. The results o ace pose estimation are shown in Fig.11. From the experimental results, we can see that the ace pose estimation algorithm proposed in this paper gives an acceptable average accuracy as about 91%. Besides, analyzing the wrong results, all the misclassiied ace poses are classiied into the adjacent class o the correct class. Since the estimated ace poses are used as snake initialization, the estimation results are acceptable and useul or the urther chin contour estimation. inormation, the searching range or chin contour could be set reasonably. Some cases are concerned in our experiments, which include aces with dierent resolution, sizes, and ace poses. In this paper, we deined the scaling actor S which oers the inormation o relative ace size and image resolution. As shown in Fig.1, the resolution o input ace image is much higher than the ace image in database. By using the inormation o relative scaling actor, the initialized snake can be resized to it the real chin contour. When the ace is wider or narrower and longer in shape, the chin contour can be extracted more precisely under the limited searching range as shown in Fig.13. While dealing with dierent ace poses, they are roughly classiied into 7 classes and each o them has a typical initialized chin contour composed o two parabolas. In this way, this method proposed in this paper greatly improves the snake initialization drawback when coping with chin contour extraction. Besides, chin contour varies severely under dierent ace pose and extraction or chin contour o proile ace poses is seldom mentioned in previous papers because o the weak boundary. The ace pose based auto-initialization shape-enhanced snake provides a way to approach the chin contour with proile ace poses as illustrated in Fig.14. Fig.11 The accuracy o ace pose classiication. The average accuracy o ace pose classiication is 94.07%. Ater the ace pose is classiied, the snake model can be initialized. The maximum errors between the initialized chin contour and the real chin contour are derived rom the testing 540 virtual ace images. We do not use the real ace image because the chin contour o real ace image can be extracted by man only. The task is time consuming and the chin contour extracted by man is a little dierent time by time. Contrarily, the chin contour o virtual image could be extracted easily by program and the points o chin contour can be determined previously. Hence, the maximum errors are derived rom the virtual ace image. With this Fig.1 The typical chin contour model stored in database. The initialized control points. (c) The control points ater several iterations. (d) The reconstructed chin contour.

9 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October Fig.13 The typical chin contour model stored in database is thinner than the input ace. The chin contour can be properly estimated under limited searching range. Fig.15 The input ace image is a atter ace with double chin, proile ace pose, looking down, and complex background. The reconstructed chin contour. Fig.14 The initialized control points o chin contour. The autoinitialized shape-enhanced snake oers an approach to the proile ace pose. Also, we consider some special cases. In Fig.15, a atter ace with double chin, proile ace pose, looking down, and complex background is tested. The wrinkle ormed because o ace pose or atty ace shape leads into a local minimum. The ace image is more complicated and with more details on it. From the experimental results, the proposed method in this paper oers an acceptable approach to the test input image. Another contrary example is given in Fig.16. The input image is a ace with long thin chin and the initial chin contour is hence ar away rom the real chin contour. Ater several iterations, the proposed snake successully converges to the real chin contour. When there are some objects or noise near the chin contour, the proposed method also has good perormance. For example, consider the ace image with a cell phone near the ace as shown in Fig.17, the integrity and the smoothness o the estimated chin contour is maintained. Except the internal constraint o stiness and tension, this is not only because that the auto-initialized shape-enhanced snake oers a prototype o chin contour but because that the normal vector is used to narrow the searching region to a line segment instead o an area, which reduces the opportunity o alling into alse minimum. Hence, a proper chin contour is derived by the proposed method, as shown in Fig.17. Fig.16 Face image with a long and thin chin. Dots in green are the initial control points, while dots in red are the estimated chin contour. An estimated chin contour is established when the chin is thinner and longer than the one in data base. Fig.17 Face image with a cell phone near the ace The chin contour is estimated with the inormation o initialized snake. 5. Conclusions In this paper, a chin contour estimation algorithm is proposed, which is based on an auto-initialized shape-enhanced snake. By roughly estimated the ace poses, the control points o snake can be appropriately initialized according to the 7 dierent ace poses. The drawback o snake initialization is thereore improved. When dealing with the proile ace poses, the autoinitialized snake along with the enhanced snake shape oers an approach to the proile ace poses, even the boundary o proile ace poses are very poor. The

10 50 IJCSNS International Journal o Computer Science and Network Security, VOL.10 No.10, October 010 experimental results show that the proposed method can estimate the chin contour with reliability and robustness under various ace poses and several situations. Reerences [1] U. Qayyum and M. Y. Javed, Real time notch based ace detection, tracking and acial eature localization, in Int. Con. on Emerging Technologies, 006. ICET'06, Nov. 006, pp [] R. Belaroussi and M. Milgram, Face tracking and acial eature detection with a webcam, in 3rd European Con. on Visual Media Production, 006. CVMP 006, Nov. 006, pp [3] R. Hepers, G. Verghese, K. Derpanis, R. McCready, J. Maclean, A. Levin, D. Topalovic, L. Wood, A. Jepson, and J. Tsotsos, Detection and tracking o aces in real environments, in Proc. Int. Workshop on Recognition, Analysis, and Tracking o Faces and Gestures in Real-Time Systems, Sep. 1999, pp [4] M. H. Yang and N. Ahuja, Detecting human aces in color images, in Proc. Int. Con. on Image Processing, vol. 1, Oct. 1998, pp [5] L. V. Praseeda, S. Kumar, and D. S. Vidyadharan, Face detection and localization o acial eatures in still and video images, in First Int. Con. on Emerging Trends in Engineering and Technology, ICETET '08, Jul. 008, pp [6] S. Boursas and H. Yan, Chin extraction in colour rontal-view ace images,' in Digital Image Computing Techniques and Applications, Melbourne, Australia, Jan. 00, pp [7] M. Kampmann, Estimation o the chin and cheek contours or precise ace model adaptation, in Proc. ICIP 97}, Oct. 1997, pp [8] J. Y. Wang, G. D. Su, and X. G. Lin, The research o chin contour in ronto-parallel images, in Proc. Second Int. Con. on Machine Learning and Cybernetics}, vol. 5, Mar. 003, pp [9] Q. R. Chen, W. K. Cham, and K. K. Lee, Chin contour estimation or ace recognition, in IEEE Int. Con. on Acoustics, Speech, and Signal Processing (ICASSP03)}, vol. 6, Apr. 003, pp [10] Q. R. Chen, W. K. Cham, and K. K. Lee, Extracting eyebrow contour and chin contour or ace recognition, Pattern Recognition, vol. 40, pp , Aug [11] K. M. Lam and H. Yan, An analytic-to-holistic approach or ace recognition based on a single rontal view, in Proc. IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 0, Jul. 1998, pp [1] R. L. Rudianto and K. N. Ngan, Automatic 3d wirerame model itting to rontal acial image in model-based video coding, Picture Coding Symposium (PCS 96), pp , Mar [13] C. L. Huang and C. W. Chen, Human acial eature extraction or ace interpretation and recognition, Pattern Recognition, vol. 5, pp , Dec [14] M. Hu, S. Worrall, A. Sadka, and A. Kondoz, A ast and eicient chin detection method or -d scalable ace model design, in IEE Int. Con. on Visual Inormation Engineering, UK, Jul. 003, pp [15] P. Kuo and J. M. Hannah, Improved chin itting algorithm based on an adaptive snake, in IEEE Int. Con. on Image Processing, Atlanta, US, Oct. 006, pp [16] J. Y. Wang, G. D. Su, and X. G. Lin, Improved chin itting algorithm based on an adaptive snake, in Proc. Int. Con. on Intelligent Computing, ICIC 005, Heei, China, Aug. 005, pp [17] X. L. Ge, J. Yang, Z. L. Zheng, and F. Li, Multi-view based ace chin contour xtraction, Engineering Applications o Artiicial Intelligence, vol. 19, 006, pp [18] M. Kass, A. Witkin, and D. Terzopoulos, Snake: active contour models, Int. J. Comouter Vision, vol. 1(4), 1987, pp [19] R. C. Gonzalez and R. E. Wood, Digital Image Processing, nd ed. Prentice Hall, 001. Kuo-Yu Chiu was born in Hsinchu, R.O.C., in He received the B.E. degree in electrical and control engineering rom National Chiao Tung University, Hsinchu, Taiwan, R.O.C, in 003. He is currently pursuing the Ph. D. degree in the Department o Electrical and Control Engineering, the National Chiao Tung University, Hsinchu, Taiwan. His current research interests include image processing, ace recognition, ace pose estimation, ace replacement, intelligent transportation system, and machine learning. Shih-Che Chien was born in Chiayi, R.O.C., in He received the B.E. degree in electronic engineering rom the Nation Chung Cheng University, in 00. He is currently pursuing the M.E. and Ph.D. degree in the Department o Electrical and Control Engineering, the National Chiao Tung University, Hsinchu, Taiwan. His current research interests include image processing, image recognition, uzzy theory, 3D image processing, intelligent transportation system, and animation. Sheng-Fuu Lin (S 84 M 88) was born in Tainan, R.O.C., in He received the B.S. and M.S. degrees in mathematics rom National Taiwan Normal University in 1976 and 1979, respectively, the M.S. degree in computer science rom the University o Maryland, College Park, in 1985, and the Ph.D. degree in electrical engineering rom the University o Illinois, Champaign, in Since 1988, he has been on the aculty o the Department o Electrical and Control Engineering at National Chiao Tung University, Hsinchu, Taiwan, where he is currently a Proessor. His research interests include image processing, image recognition, uzzy theory, automatic target recognition, and scheduling.

ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION

ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION Phuong-Trinh Pham-Ngoc, Quang-Linh Huynh Department o Biomedical Engineering, Faculty o Applied Science, Hochiminh University o Technology,

More information

CS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012

CS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012 CS8/68 Computer Vision Spring 0 Dr. George Bebis Programming Assignment Due Date: /7/0 In this assignment, you will implement an algorithm or normalizing ace image using SVD. Face normalization is a required

More information

Face Detection for Automatic Avatar Creation by using Deformable Template and GA

Face Detection for Automatic Avatar Creation by using Deformable Template and GA Face Detection or Automatic Avatar Creation by using Deormable Template and GA Tae-Young Park*, Ja-Yong Lee **, and Hoon Kang *** * School o lectrical and lectronics ngineering, Chung-Ang University, Seoul,

More information

Binary Morphological Model in Refining Local Fitting Active Contour in Segmenting Weak/Missing Edges

Binary Morphological Model in Refining Local Fitting Active Contour in Segmenting Weak/Missing Edges 0 International Conerence on Advanced Computer Science Applications and Technologies Binary Morphological Model in Reining Local Fitting Active Contour in Segmenting Weak/Missing Edges Norshaliza Kamaruddin,

More information

Facial Expression Recognition based on Affine Moment Invariants

Facial Expression Recognition based on Affine Moment Invariants IJCSI International Journal o Computer Science Issues, Vol. 9, Issue 6, No, November 0 ISSN (Online): 694-084 www.ijcsi.org 388 Facial Expression Recognition based on Aine Moment Invariants Renuka Londhe

More information

MAPI Computer Vision. Multiple View Geometry

MAPI Computer Vision. Multiple View Geometry MAPI Computer Vision Multiple View Geometry Geometry o Multiple Views 2- and 3- view geometry p p Kpˆ [ K R t]p Geometry o Multiple Views 2- and 3- view geometry Epipolar Geometry The epipolar geometry

More information

Road Sign Analysis Using Multisensory Data

Road Sign Analysis Using Multisensory Data Road Sign Analysis Using Multisensory Data R.J. López-Sastre, S. Lauente-Arroyo, P. Gil-Jiménez, P. Siegmann, and S. Maldonado-Bascón University o Alcalá, Department o Signal Theory and Communications

More information

Reflection and Refraction

Reflection and Refraction Relection and Reraction Object To determine ocal lengths o lenses and mirrors and to determine the index o reraction o glass. Apparatus Lenses, optical bench, mirrors, light source, screen, plastic or

More information

SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN

SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN Tsz Chun Ho and Bing Zeng Department o Electronic and Computer Engineering The Hong Kong University o Science

More information

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm Int J Contemp Math Sciences, Vol 6, 0, no 0, 45 465 A Proposed Approach or Solving Rough Bi-Level Programming Problems by Genetic Algorithm M S Osman Department o Basic Science, Higher Technological Institute

More information

Defects Detection of Billet Surface Using Optimized Gabor Filters

Defects Detection of Billet Surface Using Optimized Gabor Filters Proceedings o the 7th World Congress The International Federation o Automatic Control Deects Detection o Billet Surace Using Optimized Gabor Filters Jong Pil Yun* SungHoo Choi* Boyeul Seo* Chang Hyun Park*

More information

Chapter 3 Image Enhancement in the Spatial Domain

Chapter 3 Image Enhancement in the Spatial Domain Chapter 3 Image Enhancement in the Spatial Domain Yinghua He School o Computer Science and Technology Tianjin University Image enhancement approaches Spatial domain image plane itsel Spatial domain methods

More information

2 DETERMINING THE VANISHING POINT LOCA- TIONS

2 DETERMINING THE VANISHING POINT LOCA- TIONS IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL.??, NO.??, DATE 1 Equidistant Fish-Eye Calibration and Rectiication by Vanishing Point Extraction Abstract In this paper we describe

More information

521466S Machine Vision Exercise #1 Camera models

521466S Machine Vision Exercise #1 Camera models 52466S Machine Vision Exercise # Camera models. Pinhole camera. The perspective projection equations or a pinhole camera are x n = x c, = y c, where x n = [x n, ] are the normalized image coordinates,

More information

3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY

3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY 3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY Bin-Yih Juang ( 莊斌鎰 ) 1, and Chiou-Shann Fuh ( 傅楸善 ) 3 1 Ph. D candidate o Dept. o Mechanical Engineering National Taiwan University, Taipei, Taiwan Instructor

More information

A Method of Sign Language Gesture Recognition Based on Contour Feature

A Method of Sign Language Gesture Recognition Based on Contour Feature Proceedings o the World Congress on Engineering and Computer Science 014 Vol I WCECS 014, -4 October, 014, San Francisco, USA A Method o Sign Language Gesture Recognition Based on Contour Feature Jingzhong

More information

ES 240: Scientific and Engineering Computation. a function f(x) that can be written as a finite series of power functions like

ES 240: Scientific and Engineering Computation. a function f(x) that can be written as a finite series of power functions like Polynomial Deinition a unction () that can be written as a inite series o power unctions like n is a polynomial o order n n ( ) = A polynomial is represented by coeicient vector rom highest power. p=[3-5

More information

A Review of Evaluation of Optimal Binarization Technique for Character Segmentation in Historical Manuscripts

A Review of Evaluation of Optimal Binarization Technique for Character Segmentation in Historical Manuscripts 010 Third International Conerence on Knowledge Discovery and Data Mining A Review o Evaluation o Optimal Binarization Technique or Character Segmentation in Historical Manuscripts Chun Che Fung and Rapeeporn

More information

Classification Method for Colored Natural Textures Using Gabor Filtering

Classification Method for Colored Natural Textures Using Gabor Filtering Classiication Method or Colored Natural Textures Using Gabor Filtering Leena Lepistö 1, Iivari Kunttu 1, Jorma Autio 2, and Ari Visa 1, 1 Tampere University o Technology Institute o Signal Processing P.

More information

Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation

Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.11, November 2013 1 Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial

More information

A new approach for ranking trapezoidal vague numbers by using SAW method

A new approach for ranking trapezoidal vague numbers by using SAW method Science Road Publishing Corporation Trends in Advanced Science and Engineering ISSN: 225-6557 TASE 2() 57-64, 20 Journal homepage: http://www.sciroad.com/ntase.html A new approach or ranking trapezoidal

More information

Adaptive osculatory rational interpolation for image processing

Adaptive osculatory rational interpolation for image processing Journal of Computational and Applied Mathematics 195 (2006) 46 53 www.elsevier.com/locate/cam Adaptive osculatory rational interpolation for image processing Min Hu a, Jieqing Tan b, a College of Computer

More information

Edge and local feature detection - 2. Importance of edge detection in computer vision

Edge and local feature detection - 2. Importance of edge detection in computer vision Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature

More information

1.2 Related Work. Panoramic Camera PTZ Dome Camera

1.2 Related Work. Panoramic Camera PTZ Dome Camera 3rd International Conerence on Multimedia Technology ICMT 2013) A SPATIAL CALIBRATION METHOD BASED ON MASTER-SLAVE CAMERA Hao Shi1, Yu Liu, Shiming Lai, Maojun Zhang, Wei Wang Abstract. Recently the Master-Slave

More information

Mobile Robot Static Path Planning Based on Genetic Simulated Annealing Algorithm

Mobile Robot Static Path Planning Based on Genetic Simulated Annealing Algorithm Mobile Robot Static Path Planning Based on Genetic Simulated Annealing Algorithm Wang Yan-ping 1, Wubing 2 1. School o Electric and Electronic Engineering, Shandong University o Technology, Zibo 255049,

More information

Neighbourhood Operations

Neighbourhood Operations Neighbourhood Operations Neighbourhood operations simply operate on a larger neighbourhood o piels than point operations Origin Neighbourhoods are mostly a rectangle around a central piel Any size rectangle

More information

Using a Projected Subgradient Method to Solve a Constrained Optimization Problem for Separating an Arbitrary Set of Points into Uniform Segments

Using a Projected Subgradient Method to Solve a Constrained Optimization Problem for Separating an Arbitrary Set of Points into Uniform Segments Using a Projected Subgradient Method to Solve a Constrained Optimization Problem or Separating an Arbitrary Set o Points into Uniorm Segments Michael Johnson May 31, 2011 1 Background Inormation The Airborne

More information

Face Recognition using Hough Peaks extracted from the significant blocks of the Gradient Image

Face Recognition using Hough Peaks extracted from the significant blocks of the Gradient Image Face Recognition using Hough Peaks extracted rom the signiicant blocks o the Gradient Image Arindam Kar 1, Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nasipuri, Mahantapas Kundu 1 Indian Statistical

More information

Distortion Correction for Conical Multiplex Holography Using Direct Object-Image Relationship

Distortion Correction for Conical Multiplex Holography Using Direct Object-Image Relationship Proc. Natl. Sci. Counc. ROC(A) Vol. 25, No. 5, 2001. pp. 300-308 Distortion Correction for Conical Multiplex Holography Using Direct Object-Image Relationship YIH-SHYANG CHENG, RAY-CHENG CHANG, AND SHIH-YU

More information

9.8 Graphing Rational Functions

9.8 Graphing Rational Functions 9. Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm P where P and Q are polynomials. Q An eample o a simple rational unction

More information

Piecewise polynomial interpolation

Piecewise polynomial interpolation Chapter 2 Piecewise polynomial interpolation In ection.6., and in Lab, we learned that it is not a good idea to interpolate unctions by a highorder polynomials at equally spaced points. However, it transpires

More information

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions

Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Tomokazu Wakasugi, Masahide Nishiura and Kazuhiro Fukui Corporate Research and Development Center, Toshiba Corporation

More information

Geometric Registration for Deformable Shapes 2.2 Deformable Registration

Geometric Registration for Deformable Shapes 2.2 Deformable Registration Geometric Registration or Deormable Shapes 2.2 Deormable Registration Variational Model Deormable ICP Variational Model What is deormable shape matching? Example? What are the Correspondences? Eurographics

More information

A Cylindrical Surface Model to Rectify the Bound Document Image

A Cylindrical Surface Model to Rectify the Bound Document Image A Cylindrical Surace Model to Rectiy the Bound Document Image Huaigu Cao, Xiaoqing Ding, Changsong Liu Department o Electronic Engineering, Tsinghua University State Key Laboratory o Intelligent Technology

More information

Optimizing the Deblocking Algorithm for. H.264 Decoder Implementation

Optimizing the Deblocking Algorithm for. H.264 Decoder Implementation Optimizing the Deblocking Algorithm for H.264 Decoder Implementation Ken Kin-Hung Lam Abstract In the emerging H.264 video coding standard, a deblocking/loop filter is required for improving the visual

More information

Snakes operating on Gradient Vector Flow

Snakes operating on Gradient Vector Flow Snakes operating on Gradient Vector Flow Seminar: Image Segmentation SS 2007 Hui Sheng 1 Outline Introduction Snakes Gradient Vector Flow Implementation Conclusion 2 Introduction Snakes enable us to find

More information

Fig. 3.1: Interpolation schemes for forward mapping (left) and inverse mapping (right, Jähne, 1997).

Fig. 3.1: Interpolation schemes for forward mapping (left) and inverse mapping (right, Jähne, 1997). Eicken, GEOS 69 - Geoscience Image Processing Applications, Lecture Notes - 17-3. Spatial transorms 3.1. Geometric operations (Reading: Castleman, 1996, pp. 115-138) - a geometric operation is deined as

More information

Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model

Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model 608 IEEE TRANSACTIONS ON MAGNETICS, VOL. 39, NO. 1, JANUARY 2003 Expectation and Maximization Algorithm for Estimating Parameters of a Simple Partial Erasure Model Tsai-Sheng Kao and Mu-Huo Cheng Abstract

More information

A SAR IMAGE REGISTRATION METHOD BASED ON SIFT ALGORITHM

A SAR IMAGE REGISTRATION METHOD BASED ON SIFT ALGORITHM A SAR IMAGE REGISTRATION METHOD BASED ON SIFT ALGORITHM W. Lu a,b, X. Yue b,c, Y. Zhao b,c, C. Han b,c, * a College o Resources and Environment, University o Chinese Academy o Sciences, Beijing, 100149,

More information

UNIT #2 TRANSFORMATIONS OF FUNCTIONS

UNIT #2 TRANSFORMATIONS OF FUNCTIONS Name: Date: UNIT # TRANSFORMATIONS OF FUNCTIONS Part I Questions. The quadratic unction ollowing does,, () has a turning point at have a turning point? 7, 3, 5 5, 8. I g 7 3, then at which o the The structure

More information

PATH PLANNING OF UNMANNED AERIAL VEHICLE USING DUBINS GEOMETRY WITH AN OBSTACLE

PATH PLANNING OF UNMANNED AERIAL VEHICLE USING DUBINS GEOMETRY WITH AN OBSTACLE Proceeding o International Conerence On Research, Implementation And Education O Mathematics And Sciences 2015, Yogyakarta State University, 17-19 May 2015 PATH PLANNING OF UNMANNED AERIAL VEHICLE USING

More information

Automated Segmentation Using a Fast Implementation of the Chan-Vese Models

Automated Segmentation Using a Fast Implementation of the Chan-Vese Models Automated Segmentation Using a Fast Implementation of the Chan-Vese Models Huan Xu, and Xiao-Feng Wang,,3 Intelligent Computation Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Science,

More information

3D HAND LOCALIZATION BY LOW COST WEBCAMS

3D HAND LOCALIZATION BY LOW COST WEBCAMS 3D HAND LOCALIZATION BY LOW COST WEBCAMS Cheng-Yuan Ko, Chung-Te Li, Chen-Han Chung, and Liang-Gee Chen DSP/IC Design Lab, Graduated Institute of Electronics Engineering National Taiwan University, Taiwan,

More information

Automatic Video Segmentation for Czech TV Broadcast Transcription

Automatic Video Segmentation for Czech TV Broadcast Transcription Automatic Video Segmentation or Czech TV Broadcast Transcription Jose Chaloupka Laboratory o Computer Speech Processing, Institute o Inormation Technology and Electronics Technical University o Liberec

More information

Lip Tracking for MPEG-4 Facial Animation

Lip Tracking for MPEG-4 Facial Animation Lip Tracking for MPEG-4 Facial Animation Zhilin Wu, Petar S. Aleksic, and Aggelos. atsaggelos Department of Electrical and Computer Engineering Northwestern University 45 North Sheridan Road, Evanston,

More information

Estimating normal vectors and curvatures by centroid weights

Estimating normal vectors and curvatures by centroid weights Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National

More information

Research on Image Splicing Based on Weighted POISSON Fusion

Research on Image Splicing Based on Weighted POISSON Fusion Research on Image Splicing Based on Weighted POISSO Fusion Dan Li, Ling Yuan*, Song Hu, Zeqi Wang School o Computer Science & Technology HuaZhong University o Science & Technology Wuhan, 430074, China

More information

Lab 9 - GEOMETRICAL OPTICS

Lab 9 - GEOMETRICAL OPTICS 161 Name Date Partners Lab 9 - GEOMETRICAL OPTICS OBJECTIVES Optics, developed in us through study, teaches us to see - Paul Cezanne Image rom www.weidemyr.com To examine Snell s Law To observe total internal

More information

Classifier Evasion: Models and Open Problems

Classifier Evasion: Models and Open Problems Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin I. P. Rubinstein 2, Ling Huang 3, Anthony D. Joseph 1,3, and J. D. Tygar 1 1 UC Berkeley 2 Microsot Research 3 Intel Labs Berkeley

More information

Gesture Recognition using a Probabilistic Framework for Pose Matching

Gesture Recognition using a Probabilistic Framework for Pose Matching Gesture Recognition using a Probabilistic Framework or Pose Matching Ahmed Elgammal Vinay Shet Yaser Yacoob Larry S. Davis Computer Vision Laboratory University o Maryland College Park MD 20742 USA elgammalvinayyaserlsd

More information

Triangular Mesh Segmentation Based On Surface Normal

Triangular Mesh Segmentation Based On Surface Normal ACCV2002: The 5th Asian Conference on Computer Vision, 23--25 January 2002, Melbourne, Australia. Triangular Mesh Segmentation Based On Surface Normal Dong Hwan Kim School of Electrical Eng. Seoul Nat

More information

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant

More information

Accurate Trajectory Control for Five-Axis Tool-Path Planning

Accurate Trajectory Control for Five-Axis Tool-Path Planning Accurate Trajectory Control for Five-Axis Tool-Path Planning Rong-Shine Lin* and Cheng-Bing Ye Abstract Computer-Aided Manufacturing technology has been widely used for three-axis CNC machining in industry

More information

Announcements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10

Announcements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10 Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal

More information

Lecture 7: Most Common Edge Detectors

Lecture 7: Most Common Edge Detectors #1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the

More information

MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM

MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM UDC 681.3.06 MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM V.K. Pogrebnoy TPU Institute «Cybernetic centre» E-mail: vk@ad.cctpu.edu.ru Matrix algorithm o solving graph cutting problem has been suggested.

More information

HOUGH TRANSFORM CS 6350 C V

HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges

More information

Computers and Mathematics with Applications. An embedded system for real-time facial expression recognition based on the extension theory

Computers and Mathematics with Applications. An embedded system for real-time facial expression recognition based on the extension theory Computers and Mathematics with Applications 61 (2011) 2101 2106 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: www.elsevier.com/locate/camwa An

More information

GEOMETRICAL OPTICS OBJECTIVES

GEOMETRICAL OPTICS OBJECTIVES Geometrical Optics 207 Name Date Partners OBJECTIVES OVERVIEW GEOMETRICAL OPTICS To examine Snell s Law and observe total internal relection. To understand and use the lens equations. To ind the ocal length

More information

Digital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4)

Digital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4) Digital Image Processing Image Enhancement in the Spatial Domain (Chapter 4) Objective The principal objective o enhancement is to process an images so that the result is more suitable than the original

More information

Robust face recognition under the polar coordinate system

Robust face recognition under the polar coordinate system Robust face recognition under the polar coordinate system Jae Hyun Oh and Nojun Kwak Department of Electrical & Computer Engineering, Ajou University, Suwon, Korea Abstract In this paper, we propose a

More information

Classifier Evasion: Models and Open Problems

Classifier Evasion: Models and Open Problems . In Privacy and Security Issues in Data Mining and Machine Learning, eds. C. Dimitrakakis, et al. Springer, July 2011, pp. 92-98. Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin

More information

Abalone Age Prediction using Artificial Neural Network

Abalone Age Prediction using Artificial Neural Network IOSR Journal o Computer Engineering (IOSR-JCE) e-issn: 2278-066,p-ISSN: 2278-8727, Volume 8, Issue 5, Ver. II (Sept - Oct. 206), PP 34-38 www.iosrjournals.org Abalone Age Prediction using Artiicial Neural

More information

Accurate 3D Face and Body Modeling from a Single Fixed Kinect

Accurate 3D Face and Body Modeling from a Single Fixed Kinect Accurate 3D Face and Body Modeling from a Single Fixed Kinect Ruizhe Wang*, Matthias Hernandez*, Jongmoo Choi, Gérard Medioni Computer Vision Lab, IRIS University of Southern California Abstract In this

More information

Subpixel Corner Detection Using Spatial Moment 1)

Subpixel Corner Detection Using Spatial Moment 1) Vol.31, No.5 ACTA AUTOMATICA SINICA September, 25 Subpixel Corner Detection Using Spatial Moment 1) WANG She-Yang SONG Shen-Min QIANG Wen-Yi CHEN Xing-Lin (Department of Control Engineering, Harbin Institute

More information

Face Recognition Using Vector Quantization Histogram and Support Vector Machine Classifier Rong-sheng LI, Fei-fei LEE *, Yan YAN and Qiu CHEN

Face Recognition Using Vector Quantization Histogram and Support Vector Machine Classifier Rong-sheng LI, Fei-fei LEE *, Yan YAN and Qiu CHEN 2016 International Conference on Artificial Intelligence: Techniques and Applications (AITA 2016) ISBN: 978-1-60595-389-2 Face Recognition Using Vector Quantization Histogram and Support Vector Machine

More information

THIN LENSES: BASICS. There are at least three commonly used symbols for object and image distances:

THIN LENSES: BASICS. There are at least three commonly used symbols for object and image distances: THN LENSES: BASCS BJECTVE: To study and veriy some o the laws o optics applicable to thin lenses by determining the ocal lengths o three such lenses ( two convex, one concave) by several methods. THERY:

More information

Head Frontal-View Identification Using Extended LLE

Head Frontal-View Identification Using Extended LLE Head Frontal-View Identification Using Extended LLE Chao Wang Center for Spoken Language Understanding, Oregon Health and Science University Abstract Automatic head frontal-view identification is challenging

More information

3D Hand and Fingers Reconstruction from Monocular View

3D Hand and Fingers Reconstruction from Monocular View 3D Hand and Fingers Reconstruction rom Monocular View 1. Research Team Project Leader: Graduate Students: Pro. Isaac Cohen, Computer Science Sung Uk Lee 2. Statement o Project Goals The needs or an accurate

More information

CONTENT ADAPTIVE SCREEN IMAGE SCALING

CONTENT ADAPTIVE SCREEN IMAGE SCALING CONTENT ADAPTIVE SCREEN IMAGE SCALING Yao Zhai (*), Qifei Wang, Yan Lu, Shipeng Li University of Science and Technology of China, Hefei, Anhui, 37, China Microsoft Research, Beijing, 8, China ABSTRACT

More information

AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK

AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK AN APPROACH OF SEMIAUTOMATED ROAD EXTRACTION FROM AERIAL IMAGE BASED ON TEMPLATE MATCHING AND NEURAL NETWORK Xiangyun HU, Zuxun ZHANG, Jianqing ZHANG Wuhan Technique University of Surveying and Mapping,

More information

Towards Knowledge-Based Extraction of Roads from 1m-resolution Satellite Images

Towards Knowledge-Based Extraction of Roads from 1m-resolution Satellite Images Towards Knowledge-Based Extraction of Roads from 1m-resolution Satellite Images Hae Yeoun Lee* Wonkyu Park** Heung-Kyu Lee* Tak-gon Kim*** * Dept. of Computer Science, Korea Advanced Institute of Science

More information

Towards the completion of assignment 1

Towards the completion of assignment 1 Towards the completion of assignment 1 What to do for calibration What to do for point matching What to do for tracking What to do for GUI COMPSCI 773 Feature Point Detection Why study feature point detection?

More information

Detection of Edges Using Mathematical Morphological Operators

Detection of Edges Using Mathematical Morphological Operators OPEN TRANSACTIONS ON INFORMATION PROCESSING Volume 1, Number 1, MAY 2014 OPEN TRANSACTIONS ON INFORMATION PROCESSING Detection of Edges Using Mathematical Morphological Operators Suman Rani*, Deepti Bansal,

More information

Concavity. Notice the location of the tangents to each type of curve.

Concavity. Notice the location of the tangents to each type of curve. Concavity We ve seen how knowing where a unction is increasing and decreasing gives a us a good sense o the shape o its graph We can reine that sense o shape by determining which way the unction bends

More information

Adaptive Recovery of Image Blocks Using Spline Approach

Adaptive Recovery of Image Blocks Using Spline Approach IJCSNS International Journal of Computer Science and Netwk Security, VOL.11 No., February 011 1 Adaptive Recovery of Image Blocks Using Spline Approach Jong-Keuk Lee Ji-Hong Kim Jin-Seok Seo Dongeui University,

More information

An Efficient Image Sharpening Filter for Enhancing Edge Detection Techniques for 2D, High Definition and Linearly Blurred Images

An Efficient Image Sharpening Filter for Enhancing Edge Detection Techniques for 2D, High Definition and Linearly Blurred Images International Journal of Scientific Research in Computer Science and Engineering Research Paper Vol-2, Issue-1 ISSN: 2320-7639 An Efficient Image Sharpening Filter for Enhancing Edge Detection Techniques

More information

Optimization of HMM by the Tabu Search Algorithm

Optimization of HMM by the Tabu Search Algorithm JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 20, 949-957 (2004) Optimization of HMM by the Tabu Search Algorithm TSONG-YI CHEN, XIAO-DAN MEI *, JENG-SHYANG PAN AND SHENG-HE SUN * Department of Electronic

More information

Larger K-maps. So far we have only discussed 2 and 3-variable K-maps. We can now create a 4-variable map in the

Larger K-maps. So far we have only discussed 2 and 3-variable K-maps. We can now create a 4-variable map in the EET 3 Chapter 3 7/3/2 PAGE - 23 Larger K-maps The -variable K-map So ar we have only discussed 2 and 3-variable K-maps. We can now create a -variable map in the same way that we created the 3-variable

More information

A fast and area-efficient FPGA-based architecture for high accuracy logarithm approximation

A fast and area-efficient FPGA-based architecture for high accuracy logarithm approximation A ast and area-eicient FPGA-based architecture or high accuracy logarithm approximation Dimitris Bariamis, Dimitris Maroulis, Dimitris K. Iakovidis Department o Inormatics and Telecommunications University

More information

Asymmetric 2 1 pass stereo matching algorithm for real images

Asymmetric 2 1 pass stereo matching algorithm for real images 455, 057004 May 2006 Asymmetric 21 pass stereo matching algorithm for real images Chi Chu National Chiao Tung University Department of Computer Science Hsinchu, Taiwan 300 Chin-Chen Chang National United

More information

EE 584 MACHINE VISION

EE 584 MACHINE VISION EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency

More information

Pattern Recognition Methods for Object Boundary Detection

Pattern Recognition Methods for Object Boundary Detection Pattern Recognition Methods for Object Boundary Detection Arnaldo J. Abrantesy and Jorge S. Marquesz yelectronic and Communication Engineering Instituto Superior Eng. de Lisboa R. Conselheiro Emídio Navarror

More information

Texture classification using fuzzy uncertainty texture spectrum

Texture classification using fuzzy uncertainty texture spectrum Neurocomputing 20 (1998) 115 122 Texture classification using fuzzy uncertainty texture spectrum Yih-Gong Lee*, Jia-Hong Lee, Yuang-Cheh Hsueh Department of Computer and Information Science, National Chiao

More information

Facial Animation System Design based on Image Processing DU Xueyan1, a

Facial Animation System Design based on Image Processing DU Xueyan1, a 4th International Conference on Machinery, Materials and Computing Technology (ICMMCT 206) Facial Animation System Design based on Image Processing DU Xueyan, a Foreign Language School, Wuhan Polytechnic,

More information

Snakes reparameterization for noisy images segmentation and targets tracking

Snakes reparameterization for noisy images segmentation and targets tracking Snakes reparameterization for noisy images segmentation and targets tracking Idrissi Sidi Yassine, Samir Belfkih. Lycée Tawfik Elhakim Zawiya de Noaceur, route de Marrakech, Casablanca, maroc. Laboratoire

More information

Topic 6 Representation and Description

Topic 6 Representation and Description Topic 6 Representation and Description Background Segmentation divides the image into regions Each region should be represented and described in a form suitable for further processing/decision-making Representation

More information

A face recognition system based on local feature analysis

A face recognition system based on local feature analysis A face recognition system based on local feature analysis Stefano Arca, Paola Campadelli, Raffaella Lanzarotti Dipartimento di Scienze dell Informazione Università degli Studi di Milano Via Comelico, 39/41

More information

Parallel-computing approach for FFT implementation on digital signal processor (DSP)

Parallel-computing approach for FFT implementation on digital signal processor (DSP) Parallel-computing approach for FFT implementation on digital signal processor (DSP) Yi-Pin Hsu and Shin-Yu Lin Abstract An efficient parallel form in digital signal processor can improve the algorithm

More information

A Two-stage Scheme for Dynamic Hand Gesture Recognition

A Two-stage Scheme for Dynamic Hand Gesture Recognition A Two-stage Scheme for Dynamic Hand Gesture Recognition James P. Mammen, Subhasis Chaudhuri and Tushar Agrawal (james,sc,tush)@ee.iitb.ac.in Department of Electrical Engg. Indian Institute of Technology,

More information

The Graph of an Equation Graph the following by using a table of values and plotting points.

The Graph of an Equation Graph the following by using a table of values and plotting points. Calculus Preparation - Section 1 Graphs and Models Success in math as well as Calculus is to use a multiple perspective -- graphical, analytical, and numerical. Thanks to Rene Descartes we can represent

More information

A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOGY

A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOGY In: Stilla U et al (Eds) PIA7. International Archives o Photogrammetry, Remote Sensing and Spatial Inormation Sciences, 36 (3/W49B) A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOG

More information

Automated Modelization of Dynamic Systems

Automated Modelization of Dynamic Systems Automated Modelization o Dynamic Systems Ivan Perl, Aleksandr Penskoi ITMO University Saint-Petersburg, Russia ivan.perl, aleksandr.penskoi@corp.imo.ru Abstract Nowadays, dierent kinds o modelling settled

More information

EDGE BASED REGION GROWING

EDGE BASED REGION GROWING EDGE BASED REGION GROWING Rupinder Singh, Jarnail Singh Preetkamal Sharma, Sudhir Sharma Abstract Image segmentation is a decomposition of scene into its components. It is a key step in image analysis.

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 10 130221 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Canny Edge Detector Hough Transform Feature-Based

More information

Globally Stabilized 3L Curve Fitting

Globally Stabilized 3L Curve Fitting Globally Stabilized 3L Curve Fitting Turker Sahin and Mustafa Unel Department of Computer Engineering, Gebze Institute of Technology Cayirova Campus 44 Gebze/Kocaeli Turkey {htsahin,munel}@bilmuh.gyte.edu.tr

More information

New Edge Detector Using 2D Gamma Distribution

New Edge Detector Using 2D Gamma Distribution Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 New Edge Detector Using 2D Gamma Distribution Hessah Alsaaran 1, Ali El-Zaart

More information

Study and Analysis of Edge Detection and Implementation of Fuzzy Set. Theory Based Edge Detection Technique in Digital Images

Study and Analysis of Edge Detection and Implementation of Fuzzy Set. Theory Based Edge Detection Technique in Digital Images Study and Analysis o Edge Detection and Implementation o Fuzzy Set Theory Based Edge Detection Technique in Digital Images Anju K S Assistant Proessor, Department o Computer Science Baselios Mathews II

More information

A NOVEL LANE FEATURE EXTRACTION ALGORITHM BASED ON DIGITAL INTERPOLATION

A NOVEL LANE FEATURE EXTRACTION ALGORITHM BASED ON DIGITAL INTERPOLATION 17th European Signal Processing Conference (EUSIPCO 2009) Glasgow, Scotland, August 24-28, 2009 A NOVEL LANE FEATURE EXTRACTION ALGORITHM BASED ON DIGITAL INTERPOLATION Yifei Wang, Naim Dahnoun, and Alin

More information

A threshold decision of the object image by using the smart tag

A threshold decision of the object image by using the smart tag A threshold decision of the object image by using the smart tag Chang-Jun Im, Jin-Young Kim, Kwan Young Joung, Ho-Gil Lee Sensing & Perception Research Group Korea Institute of Industrial Technology (

More information