{"title":"基于DCT的人脸特征提取","authors":"H.C. Akakin, B. Sankur","doi":"10.1109/SIU.2006.1659699","DOIUrl":null,"url":null,"abstract":"In this paper we introduced an automatic landmarking method for near-frontal face images based on DCT coefficients. The face information is provided as 480times640 gray-level images with 3D scene depth data. Range data is used to eliminate the background data from the face. The proposed facial landmarking algorithm uses a coarse-to-fine searching algorithm. In coarse level the images are downsampled to 80times60 pixels resolution. Both in coarse and fine levels SVM classifiers are trained using the DCT coefficients extracted from the manually landmarked training data. Coarse level candidate facial points are searched within the whole face image. Once the candidate locations are established, we revert back to the higher resolution image and refine the accuracy by using search windows around the coarse landmark locations","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DCT Based Facial Feature Extraction\",\"authors\":\"H.C. Akakin, B. Sankur\",\"doi\":\"10.1109/SIU.2006.1659699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduced an automatic landmarking method for near-frontal face images based on DCT coefficients. The face information is provided as 480times640 gray-level images with 3D scene depth data. Range data is used to eliminate the background data from the face. The proposed facial landmarking algorithm uses a coarse-to-fine searching algorithm. In coarse level the images are downsampled to 80times60 pixels resolution. Both in coarse and fine levels SVM classifiers are trained using the DCT coefficients extracted from the manually landmarked training data. Coarse level candidate facial points are searched within the whole face image. Once the candidate locations are established, we revert back to the higher resolution image and refine the accuracy by using search windows around the coarse landmark locations\",\"PeriodicalId\":415037,\"journal\":{\"name\":\"2006 IEEE 14th Signal Processing and Communications Applications\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE 14th Signal Processing and Communications Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2006.1659699\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE 14th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2006.1659699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we introduced an automatic landmarking method for near-frontal face images based on DCT coefficients. The face information is provided as 480times640 gray-level images with 3D scene depth data. Range data is used to eliminate the background data from the face. The proposed facial landmarking algorithm uses a coarse-to-fine searching algorithm. In coarse level the images are downsampled to 80times60 pixels resolution. Both in coarse and fine levels SVM classifiers are trained using the DCT coefficients extracted from the manually landmarked training data. Coarse level candidate facial points are searched within the whole face image. Once the candidate locations are established, we revert back to the higher resolution image and refine the accuracy by using search windows around the coarse landmark locations