Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073389
Yimei Yang, Yujun Yang
In the conventional coding techniques, all follow the Nyquist Law. The law states that the sampling rate is higher than twice the frequency of the original signal. For this method can not overcome the enormous amount of computation and a waste of resources, the compressed sensing theory recently proposed for image compression, can greatly reduce the sampling rate, the paper focuses on the image compression algorithm based on the compressed sensing theory, simulation results prove the feasibility of this algorithm and has good performances in invisibility and higher applied value.
{"title":"Study on imaging system based on compressed sensing theory","authors":"Yimei Yang, Yujun Yang","doi":"10.1109/ICCWAMTIP.2014.7073389","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073389","url":null,"abstract":"In the conventional coding techniques, all follow the Nyquist Law. The law states that the sampling rate is higher than twice the frequency of the original signal. For this method can not overcome the enormous amount of computation and a waste of resources, the compressed sensing theory recently proposed for image compression, can greatly reduce the sampling rate, the paper focuses on the image compression algorithm based on the compressed sensing theory, simulation results prove the feasibility of this algorithm and has good performances in invisibility and higher applied value.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117216112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073386
Weng Ji, Juanmin Cui
Based on the theory of ecological footprint this paper analyzed the ecological economic system in Shijiazhuang city in the view of demands of economic system to natural resource and supply of ecosystem for natural resources. Quantitative analysis of the ecosystem of Shijiazhuang city was attempted to estimate the status of sustainable development and give some insight into protection of the ecological environment of it and its province, Hebei province.
{"title":"The regional resource and environmental capacity analysis based on the ecological footprint","authors":"Weng Ji, Juanmin Cui","doi":"10.1109/ICCWAMTIP.2014.7073386","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073386","url":null,"abstract":"Based on the theory of ecological footprint this paper analyzed the ecological economic system in Shijiazhuang city in the view of demands of economic system to natural resource and supply of ecosystem for natural resources. Quantitative analysis of the ecosystem of Shijiazhuang city was attempted to estimate the status of sustainable development and give some insight into protection of the ecological environment of it and its province, Hebei province.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126644419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073395
Shizhe Tan, Wenlong Zhang, Yuandong Li
Multi-screen sharing system is the common applications of digital home. While users obtain poor experience because of the delay time of frames. In this paper, we propose an adaptive initial quantization parameter (QP) selection for the multi-screen sharing system based on H.264/SVC. First, the image complexity is estimated using a method based on the image gradient information. Second, the bits per pixel (bpp) is calculated in the base layer and the enhancement layer. The initial QP is estimated based on the bpp and the image complexity in every coding layer for H.264/SVC. Moreover, this paper designs and implements the multi-screen sharing system based on H.264/SVC. Experimental results show that the proposed algorithm decreases the delay time significantly and makes the video transmission smoother.
{"title":"An adaptive rate control scheme for multi-screen sharing system based on H.264/SVC","authors":"Shizhe Tan, Wenlong Zhang, Yuandong Li","doi":"10.1109/ICCWAMTIP.2014.7073395","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073395","url":null,"abstract":"Multi-screen sharing system is the common applications of digital home. While users obtain poor experience because of the delay time of frames. In this paper, we propose an adaptive initial quantization parameter (QP) selection for the multi-screen sharing system based on H.264/SVC. First, the image complexity is estimated using a method based on the image gradient information. Second, the bits per pixel (bpp) is calculated in the base layer and the enhancement layer. The initial QP is estimated based on the bpp and the image complexity in every coding layer for H.264/SVC. Moreover, this paper designs and implements the multi-screen sharing system based on H.264/SVC. Experimental results show that the proposed algorithm decreases the delay time significantly and makes the video transmission smoother.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128200157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073399
Zhihua Xie, Zhengzi Wang
Extracting robust and discriminatory features from images is a crucial task for infrared face recognition. For this reason, we have developed an infrared face recognition algorithm based on improved local features, which applies adaptive threshold quantization to encode the local directional energy. The conventional LBP-based feature as represented by the fix threshold encoding has limited distinguishing ability. The adaptive quantization measure of local directional responses can reduce the quantization loss and thus preserve more local structure information in infrared face images. The experimental results under variable ambient temperatures show the recognition rates of proposed infrared face recognition method outperform the state-of-the-art methods based on traditional local features.
{"title":"Infrared face recognition based on adaptively local directional pattern","authors":"Zhihua Xie, Zhengzi Wang","doi":"10.1109/ICCWAMTIP.2014.7073399","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073399","url":null,"abstract":"Extracting robust and discriminatory features from images is a crucial task for infrared face recognition. For this reason, we have developed an infrared face recognition algorithm based on improved local features, which applies adaptive threshold quantization to encode the local directional energy. The conventional LBP-based feature as represented by the fix threshold encoding has limited distinguishing ability. The adaptive quantization measure of local directional responses can reduce the quantization loss and thus preserve more local structure information in infrared face images. The experimental results under variable ambient temperatures show the recognition rates of proposed infrared face recognition method outperform the state-of-the-art methods based on traditional local features.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127230299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073400
Zhiwei Mo, Yuesheng Zhu, Zhen Liu
In this paper, a novel hash-based image content authentication scheme for tamper detection and localization is proposed. The original image is divided into sub-blocks whose size can be tuned with the accuracy of tamper localization, and the measurements which are obtained in the compressed sensing (CS) process contain all the information of the subblocks. Moreover, singular value decomposition (SVD) is applied to capture the most energy of measurements and compress them into a compact hash. Experimental results have shown that the proposed method is robust with a reliable security.
{"title":"A hash-based image content authentication scheme for tamper detection using compressive sensing","authors":"Zhiwei Mo, Yuesheng Zhu, Zhen Liu","doi":"10.1109/ICCWAMTIP.2014.7073400","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073400","url":null,"abstract":"In this paper, a novel hash-based image content authentication scheme for tamper detection and localization is proposed. The original image is divided into sub-blocks whose size can be tuned with the accuracy of tamper localization, and the measurements which are obtained in the compressed sensing (CS) process contain all the information of the subblocks. Moreover, singular value decomposition (SVD) is applied to capture the most energy of measurements and compress them into a compact hash. Experimental results have shown that the proposed method is robust with a reliable security.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115476314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073377
Hao Chen, Jinxiang Yang
This paper investigates asymptotic stability for delayed neural networks with two additive time-varying delays components. New Lyapunov functional are constructed to derive some new conditions for this system. The proposed result is less conservative because delay decomposition technique and reciprocally convex method are considered.
{"title":"Asymptotic stability analysis for neural networks with two additive time-varying delays components","authors":"Hao Chen, Jinxiang Yang","doi":"10.1109/ICCWAMTIP.2014.7073377","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073377","url":null,"abstract":"This paper investigates asymptotic stability for delayed neural networks with two additive time-varying delays components. New Lyapunov functional are constructed to derive some new conditions for this system. The proposed result is less conservative because delay decomposition technique and reciprocally convex method are considered.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115567058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073406
Muhammad Hammad Memon, R. Shaikh, Jian-ping Li, Asif Khan, I. Memon, S. Deep
In recent years, there are available extremely large collections of images located on distributed and heterogeneous platforms over the online web service. The proliferation of digital cameras and the growing photo sharing using current technology for browsing such collections, but at the same time it spurred the emergence of new image retrieval techniques based not only on photos' visual information, but on geo-location tags. Currently image retrieval systems; the retrieval process is performed using similarity strategies applied on certain features in the image. In this paper, we proposed a process of image refining retrieval result by exploiting and fusing unsupervised feature technique Principal component analysis (PCA) and spectral clustering. PCA algorithm is used for to remove the outliers from the initially retrieved image set, and then it uses Principal Component Analysis (PCA) to extract principal components of the feature values. Later on, feature values of each image are exhibited by a linear combination of these principal components. Spectral clustering analyzes retrieval process by clustering together visually similar images. PCA and spectral clustering require manual turning of their parameters, which usually requires a priori knowledge of the dataset. To overcome this problem we developed a tuning mechanism that automatically tunes the parameters of both algorithms. For the evaluation of the proposed approach we used thousands of images from Flickr downloaded using text queries for well-known cultural heritage monuments. The proposed method was performed and tested on a set of images from variant sceneries. Experimental results show the superior performance of this approach.
{"title":"Unsupervised feature approach for content based image retrieval using principal component analysis","authors":"Muhammad Hammad Memon, R. Shaikh, Jian-ping Li, Asif Khan, I. Memon, S. Deep","doi":"10.1109/ICCWAMTIP.2014.7073406","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073406","url":null,"abstract":"In recent years, there are available extremely large collections of images located on distributed and heterogeneous platforms over the online web service. The proliferation of digital cameras and the growing photo sharing using current technology for browsing such collections, but at the same time it spurred the emergence of new image retrieval techniques based not only on photos' visual information, but on geo-location tags. Currently image retrieval systems; the retrieval process is performed using similarity strategies applied on certain features in the image. In this paper, we proposed a process of image refining retrieval result by exploiting and fusing unsupervised feature technique Principal component analysis (PCA) and spectral clustering. PCA algorithm is used for to remove the outliers from the initially retrieved image set, and then it uses Principal Component Analysis (PCA) to extract principal components of the feature values. Later on, feature values of each image are exhibited by a linear combination of these principal components. Spectral clustering analyzes retrieval process by clustering together visually similar images. PCA and spectral clustering require manual turning of their parameters, which usually requires a priori knowledge of the dataset. To overcome this problem we developed a tuning mechanism that automatically tunes the parameters of both algorithms. For the evaluation of the proposed approach we used thousands of images from Flickr downloaded using text queries for well-known cultural heritage monuments. The proposed method was performed and tested on a set of images from variant sceneries. Experimental results show the superior performance of this approach.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073357
Lu Zheng, Debin Zhang, Fengyu Xiao, Wen Chen, Xinhua Chen
In the open hardware graphics accelerator (ORGFX), there are rectangle, line, triangle and curve rasterization modules. This paper is only focused on the improvement of line rasterization speed. Besides modifying the algorithm itself, hardware implementation and resource consumption are put into consideration here. Originally, ORGFX uses the classic Bresenham line algorithm with high precision and simple logic to rasterize lines, but this algorithm can only generate one pixel in each rasterization process, which results in efficiency relatively low. New algorithm in this paper combines Bresenham algorithm with the symmetry nature of lines, advantages of Bresenham algorithm are kept and rasterization speed is improved in this way. The results of experiments show that nearly 50 percent of time can be saved through software implementation and hardware implementation.
{"title":"Modified line algorithm based on ORGFX","authors":"Lu Zheng, Debin Zhang, Fengyu Xiao, Wen Chen, Xinhua Chen","doi":"10.1109/ICCWAMTIP.2014.7073357","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073357","url":null,"abstract":"In the open hardware graphics accelerator (ORGFX), there are rectangle, line, triangle and curve rasterization modules. This paper is only focused on the improvement of line rasterization speed. Besides modifying the algorithm itself, hardware implementation and resource consumption are put into consideration here. Originally, ORGFX uses the classic Bresenham line algorithm with high precision and simple logic to rasterize lines, but this algorithm can only generate one pixel in each rasterization process, which results in efficiency relatively low. New algorithm in this paper combines Bresenham algorithm with the symmetry nature of lines, advantages of Bresenham algorithm are kept and rasterization speed is improved in this way. The results of experiments show that nearly 50 percent of time can be saved through software implementation and hardware implementation.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073419
Yuan Liang, K. Guo, Jian-Pin Li
In order to solve the problem of trusted authentication between terminals, as well as terminals and the server, and to establish a safe and reliable network environment, a remote attestation scheme design based on the identity and attribute certificates is proposed. Through a third-party certification body, which authenticates the identity and attributes of the Trusted Platform, this design ensures transitive trust between the platform and the server. Analysis results show that the design on the basis of the property-based remote attestation makes an increase of platform-based identity authentication. With the method of double certified, the reliability and privacy of the user's platform, as well as the security and confidentiality of the data during the certification process are ensured. This can enhance the credibility and security of the system between user platforms and servers.
{"title":"The remote attestation design based on the identity and attribute certificates","authors":"Yuan Liang, K. Guo, Jian-Pin Li","doi":"10.1109/ICCWAMTIP.2014.7073419","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073419","url":null,"abstract":"In order to solve the problem of trusted authentication between terminals, as well as terminals and the server, and to establish a safe and reliable network environment, a remote attestation scheme design based on the identity and attribute certificates is proposed. Through a third-party certification body, which authenticates the identity and attributes of the Trusted Platform, this design ensures transitive trust between the platform and the server. Analysis results show that the design on the basis of the property-based remote attestation makes an increase of platform-based identity authentication. With the method of double certified, the reliability and privacy of the user's platform, as well as the security and confidentiality of the data during the certification process are ensured. This can enhance the credibility and security of the system between user platforms and servers.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121133124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/ICCWAMTIP.2014.7073384
Hao Zhang, Shunfang Wang, Haiyan Ding
In order to solve the small sample problems and the linear inseparable problems caused by some nonlinear factors, this paper proposed a method to generate multiple virtual samples similar to the original images by its class, then all virtual samples were combined as a new database for training. The method not only helps to increase more samples, but strengthens the reliance of virtual samples on the samples in original database. Since the face images are high dimensional, principal component analysis (PCA) is used for dimension reduction and feature extraction. The experiments based on the ORL face database show that the recognition rates have been greatly improved and the recognition results are relatively stable with the increased sample method.
{"title":"Research of increasing virtual face samples for small sample problems and its applications in face recognition","authors":"Hao Zhang, Shunfang Wang, Haiyan Ding","doi":"10.1109/ICCWAMTIP.2014.7073384","DOIUrl":"https://doi.org/10.1109/ICCWAMTIP.2014.7073384","url":null,"abstract":"In order to solve the small sample problems and the linear inseparable problems caused by some nonlinear factors, this paper proposed a method to generate multiple virtual samples similar to the original images by its class, then all virtual samples were combined as a new database for training. The method not only helps to increase more samples, but strengthens the reliance of virtual samples on the samples in original database. Since the face images are high dimensional, principal component analysis (PCA) is used for dimension reduction and feature extraction. The experiments based on the ORL face database show that the recognition rates have been greatly improved and the recognition results are relatively stable with the increased sample method.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126101652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：