Pub Date : 2013-12-01DOI: 10.1109/CISP.2013.6745212
D. Chi, Ming Li, Ying Zhao, Wenhong Liu, Jingjing Hu
This paper presents an image-based artistic rendering algorithm for the automatic pointillism style. At first, stroke locations are randomly generated based on a target image; then stroke size and rendering order are pre-calculated by a standard deviation map of the image; at last, the rendering runs layer-by-layer from large stroke size to small stroke size so as to reserve the detailed parts of the image. Although only circle stroke is adopted, the result images look good because they not only have a pointillism style but also highlight the fine parts of the images.
{"title":"Multi-layer pointillism","authors":"D. Chi, Ming Li, Ying Zhao, Wenhong Liu, Jingjing Hu","doi":"10.1109/CISP.2013.6745212","DOIUrl":"https://doi.org/10.1109/CISP.2013.6745212","url":null,"abstract":"This paper presents an image-based artistic rendering algorithm for the automatic pointillism style. At first, stroke locations are randomly generated based on a target image; then stroke size and rendering order are pre-calculated by a standard deviation map of the image; at last, the rendering runs layer-by-layer from large stroke size to small stroke size so as to reserve the detailed parts of the image. Although only circle stroke is adopted, the result images look good because they not only have a pointillism style but also highlight the fine parts of the images.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276169","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 : 2013-12-01DOI: 10.1109/CISP.2013.6743977
Shuzhi Wei, Qi Zhu
This paper introduces an efficient and fair bandwidth allocation strategy called fair service for multiuser multimedia communication over Heterogeneous Networks. Its purpose is to fairly allocated bandwidth to all the users with different video service characteristics and ensures their efficiency at the same time. The proposed fair service bandwidth allocation strategy is formulated as a convex optimization problem that maximizes the user's utility and implements fair bandwidth allocation by using the weight factors in the utility function. The simulation results show that compared with the other scheme, the proposed fair service bandwidth allocation strategy in this paper has much better fairness under the premise of ensuring efficiency.
{"title":"Efficient and fair bandwidth allocation for multiuser multimedia communication over Heterogeneous Networks","authors":"Shuzhi Wei, Qi Zhu","doi":"10.1109/CISP.2013.6743977","DOIUrl":"https://doi.org/10.1109/CISP.2013.6743977","url":null,"abstract":"This paper introduces an efficient and fair bandwidth allocation strategy called fair service for multiuser multimedia communication over Heterogeneous Networks. Its purpose is to fairly allocated bandwidth to all the users with different video service characteristics and ensures their efficiency at the same time. The proposed fair service bandwidth allocation strategy is formulated as a convex optimization problem that maximizes the user's utility and implements fair bandwidth allocation by using the weight factors in the utility function. The simulation results show that compared with the other scheme, the proposed fair service bandwidth allocation strategy in this paper has much better fairness under the premise of ensuring efficiency.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116517772","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 : 2013-12-01DOI: 10.1109/CISP.2013.6743908
Chong Han, Xiaomin Zhang, Yu Chen
In this paper, a new design criterion for quasi-orthogonal space time block codes is proposed for four transmit anntenas and four receivers MIMO communication system when it experiences the Rayleigh fading channel. Based on the design criterion, an improved design of QOSTBC(Quasi Orthogonal Space Time Block Code) for coherent channal interference is proposed that avoids repeated transmission of symbols by mapping symbols into another symbol domain which can maximize the euclidean distance between the symbols. Based on the optimal design of symbol structure, the proposed codes have lower decode complexity which performs close to the linear decoder. In the algorithm performance and BER analysis that the results are validated by Monte Carlo simulations. It is shown that the improved algorithm compared with other tranditional methods has higher coding/diversity gain and lower complexity.
{"title":"A novel full density QSTBC scheme with low complexity","authors":"Chong Han, Xiaomin Zhang, Yu Chen","doi":"10.1109/CISP.2013.6743908","DOIUrl":"https://doi.org/10.1109/CISP.2013.6743908","url":null,"abstract":"In this paper, a new design criterion for quasi-orthogonal space time block codes is proposed for four transmit anntenas and four receivers MIMO communication system when it experiences the Rayleigh fading channel. Based on the design criterion, an improved design of QOSTBC(Quasi Orthogonal Space Time Block Code) for coherent channal interference is proposed that avoids repeated transmission of symbols by mapping symbols into another symbol domain which can maximize the euclidean distance between the symbols. Based on the optimal design of symbol structure, the proposed codes have lower decode complexity which performs close to the linear decoder. In the algorithm performance and BER analysis that the results are validated by Monte Carlo simulations. It is shown that the improved algorithm compared with other tranditional methods has higher coding/diversity gain and lower complexity.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132647090","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 : 2013-12-01DOI: 10.1109/CISP.2013.6745244
Z. Jianguang, Li Yongxia, An Zhihong
In this paper, we propose a multi-scale Bayesian networks model and its inference algorithm. We use the multi-scale Bayesian networks model to segment the Synthetic Aperture Radar (SAR) image. The multi-scale Bayesian networks is constructed accordance with the multi-scale sequence of SAR images, whose MAP value is performed using the Belief Propagation (BP) algorithm and the corresponding parameter estimation is finished by the Expectation-Maximization (EM) algorithm. Experimental results demonstrate that the proposed multi-scale Bayesian networks model outperform the single-scale Bayesian network model and Markov Random Field - Intersecting Cortical Model (MRF-ICM).
{"title":"Synthetic aperture radar image segmentation based on multi-scale Bayesian networks","authors":"Z. Jianguang, Li Yongxia, An Zhihong","doi":"10.1109/CISP.2013.6745244","DOIUrl":"https://doi.org/10.1109/CISP.2013.6745244","url":null,"abstract":"In this paper, we propose a multi-scale Bayesian networks model and its inference algorithm. We use the multi-scale Bayesian networks model to segment the Synthetic Aperture Radar (SAR) image. The multi-scale Bayesian networks is constructed accordance with the multi-scale sequence of SAR images, whose MAP value is performed using the Belief Propagation (BP) algorithm and the corresponding parameter estimation is finished by the Expectation-Maximization (EM) algorithm. Experimental results demonstrate that the proposed multi-scale Bayesian networks model outperform the single-scale Bayesian network model and Markov Random Field - Intersecting Cortical Model (MRF-ICM).","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133756021","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 : 2013-12-01DOI: 10.1109/CISP.2013.6743868
Lizhen Deng, Hu Zhu, Guanmin Lu
Deconvolution has become one of the most used methods for improving spectral resolution, and blind deconvolution as a typical method has been researched widely. However, the predefined point spread function (PSF) used in blind deconvolution method is not known exactly in practice. In general, the PSF is estimated simultaneously from the observed spectrum, but it becomes difficult when the spectroscopic data are polluted by strong noise. In this paper, we present a deconvolution method used to improve the resolution of THz spectrum. In the method, the energy function is constructed, which includes the likelihood term, Total variation of spectrum term and L2 norm of the PSF term. The PSF is modeled as a parametric function combination with the a priori knowledge about the characteristics of the instrumental response. The spectrum and the parameter of PSF are obtained by minimizing the energy functional using alternate minimization approach. Experimental results are shown to demonstrate the efficiency of the proposed method used for THz spectrum.
{"title":"THz spectrum deconvolution with Total variation regularization","authors":"Lizhen Deng, Hu Zhu, Guanmin Lu","doi":"10.1109/CISP.2013.6743868","DOIUrl":"https://doi.org/10.1109/CISP.2013.6743868","url":null,"abstract":"Deconvolution has become one of the most used methods for improving spectral resolution, and blind deconvolution as a typical method has been researched widely. However, the predefined point spread function (PSF) used in blind deconvolution method is not known exactly in practice. In general, the PSF is estimated simultaneously from the observed spectrum, but it becomes difficult when the spectroscopic data are polluted by strong noise. In this paper, we present a deconvolution method used to improve the resolution of THz spectrum. In the method, the energy function is constructed, which includes the likelihood term, Total variation of spectrum term and L2 norm of the PSF term. The PSF is modeled as a parametric function combination with the a priori knowledge about the characteristics of the instrumental response. The spectrum and the parameter of PSF are obtained by minimizing the energy functional using alternate minimization approach. Experimental results are shown to demonstrate the efficiency of the proposed method used for THz spectrum.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"22 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131805252","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 : 2013-12-01DOI: 10.1109/CISP.2013.6745265
Peng Peng, Yehu Shen
While face verification technology is proving its value on the security of smartphones, it finds a more suitable environment of implementation than on desktop computers. Targeting to the “close-range frontal” photos taken by the front camera of smartphones, an efficient face verification approach is proposed in this paper. A dedicated rule-based algorithm is first implemented to detect four facial feature points which are used to align the input face images and partition the face region into four components. Based on each group of facial components obtained from the training dataset, an eigen subspace is constructed through principal component analysis(PCA). Finally the weighted sum of correlations between each input face component and its back-projection onto the subspace is calculated to measure the similarity of the input person against that in the dataset. Experiments are conducted on a dataset with 464 face images taken from 9 persons with variable illumination, background and expression. The Experimental results prove a 98.2% of accuracy on feature detection, a 8.5% of EER on face verification and the computational time being less than 0.8 seconds on a personal computer.
{"title":"Efficient face verification in mobile environment using component-based PCA","authors":"Peng Peng, Yehu Shen","doi":"10.1109/CISP.2013.6745265","DOIUrl":"https://doi.org/10.1109/CISP.2013.6745265","url":null,"abstract":"While face verification technology is proving its value on the security of smartphones, it finds a more suitable environment of implementation than on desktop computers. Targeting to the “close-range frontal” photos taken by the front camera of smartphones, an efficient face verification approach is proposed in this paper. A dedicated rule-based algorithm is first implemented to detect four facial feature points which are used to align the input face images and partition the face region into four components. Based on each group of facial components obtained from the training dataset, an eigen subspace is constructed through principal component analysis(PCA). Finally the weighted sum of correlations between each input face component and its back-projection onto the subspace is calculated to measure the similarity of the input person against that in the dataset. Experiments are conducted on a dataset with 464 face images taken from 9 persons with variable illumination, background and expression. The Experimental results prove a 98.2% of accuracy on feature detection, a 8.5% of EER on face verification and the computational time being less than 0.8 seconds on a personal computer.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"4 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132273576","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 : 2013-12-01DOI: 10.1109/CISP.2013.6744061
P. Ahmadi
Segmentation of aerial images has been a challenging task in recent years. This paper introduces a simple and efficient method for segmentation and classification of aerial images based on a pixel-level classification. To this end, we use the Gabor texture features in HSV color space as our best experienced features for aerial images segmentation and classification. We test different classifiers including KNN, SVM and a classifier based on sparse representation. Comparison of our proposed method with a sample of segmentation pre-process based classification methods shows that our pixel-wise approach results in higher accuracy results with lower computation time.
{"title":"A simple and efficient method for segmentation and classification of aerial images","authors":"P. Ahmadi","doi":"10.1109/CISP.2013.6744061","DOIUrl":"https://doi.org/10.1109/CISP.2013.6744061","url":null,"abstract":"Segmentation of aerial images has been a challenging task in recent years. This paper introduces a simple and efficient method for segmentation and classification of aerial images based on a pixel-level classification. To this end, we use the Gabor texture features in HSV color space as our best experienced features for aerial images segmentation and classification. We test different classifiers including KNN, SVM and a classifier based on sparse representation. Comparison of our proposed method with a sample of segmentation pre-process based classification methods shows that our pixel-wise approach results in higher accuracy results with lower computation time.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134503546","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 : 2013-12-01DOI: 10.1109/CISP.2013.6745302
Qiao Ti-zhou, Dai Shu-ling
In order to analyze the head motion of pilots in real time and improve tracking performance, we propose a method based on the random regression forest framework to address head pose estimation from depth data captured by Kinect sensors. We present the novel Trinary Annulus Filter and implement Bilateral Filtering using CUDA to process depth data of Kinect, with the purpose of image quality improvement and minimized performance impact. We have evaluated our system on a public database, and it is proved to be more effective after depth data processing and capable of handling large and rapid head rotations, temporary and partial occlusions in performance evaluation. After head pose data are filtered by presented multiple pose estimation method, they are successfully used in flight simulation to drive the rotation of viewpoint.
{"title":"Depth data filtering for real-time head pose estimation with Kinect","authors":"Qiao Ti-zhou, Dai Shu-ling","doi":"10.1109/CISP.2013.6745302","DOIUrl":"https://doi.org/10.1109/CISP.2013.6745302","url":null,"abstract":"In order to analyze the head motion of pilots in real time and improve tracking performance, we propose a method based on the random regression forest framework to address head pose estimation from depth data captured by Kinect sensors. We present the novel Trinary Annulus Filter and implement Bilateral Filtering using CUDA to process depth data of Kinect, with the purpose of image quality improvement and minimized performance impact. We have evaluated our system on a public database, and it is proved to be more effective after depth data processing and capable of handling large and rapid head rotations, temporary and partial occlusions in performance evaluation. After head pose data are filtered by presented multiple pose estimation method, they are successfully used in flight simulation to drive the rotation of viewpoint.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134406102","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 : 2013-12-01DOI: 10.1109/CISP.2013.6743910
Yiteng Du, Zongtao Chi
It is widely accepted that active radio frequency identification (RFID) has been bringing forth great change in modern society, such as logistics, trace and orientation. Passive RFID is a significant research point owing to its advantages. In the meanwhile, anti-collision in active RFID system is inevitable especially in condition of massive tags. Through experiment and analysis, we found out that the ISO/IEC 18000-7 protocol cannot handle the problem well so we put forward a brand new algorithm which is called the slot-controlling method to improve its inventory rate. The conception described in this text is introduced to improve the use of vacant slot and additionally, master and slave reader mechanism can help improve the efficiency of recognition. Finally, we compared the result between the new algorithm and the old one and draw a conclusion that the new slot-controlling method can help improve the inventory rate dramatically under conditions of massive tags.
{"title":"A slot-controlling method for anti-collision in active RFID system","authors":"Yiteng Du, Zongtao Chi","doi":"10.1109/CISP.2013.6743910","DOIUrl":"https://doi.org/10.1109/CISP.2013.6743910","url":null,"abstract":"It is widely accepted that active radio frequency identification (RFID) has been bringing forth great change in modern society, such as logistics, trace and orientation. Passive RFID is a significant research point owing to its advantages. In the meanwhile, anti-collision in active RFID system is inevitable especially in condition of massive tags. Through experiment and analysis, we found out that the ISO/IEC 18000-7 protocol cannot handle the problem well so we put forward a brand new algorithm which is called the slot-controlling method to improve its inventory rate. The conception described in this text is introduced to improve the use of vacant slot and additionally, master and slave reader mechanism can help improve the efficiency of recognition. Finally, we compared the result between the new algorithm and the old one and draw a conclusion that the new slot-controlling method can help improve the inventory rate dramatically under conditions of massive tags.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124232396","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 : 2013-12-01DOI: 10.1109/CISP.2013.6743937
Zhenchao Zhu, Aiqun Hu, Anmin Fu
A quantum dialogue protocol based on single photons is proposed in this paper, two legitimate dialogue parties can send their secret messages to each other simultaneously. The protocol is secure against the denial of service attack, the delay-photon Trojan horse attack and invisible photon eavesdropping attack. Moreover, it can overcome the information leakage problem existed in most previous quantum dialogue protocols. Compared with the only secure quantum dialogue protocol based on single photons which also can overcome the information leakage problem as far as we know, our protocol has a higher efficiency for qubits. The protocol is experimentally feasible within current technologies.
{"title":"An efficient quantum secure dialogue scheme without information leakage by using single photons","authors":"Zhenchao Zhu, Aiqun Hu, Anmin Fu","doi":"10.1109/CISP.2013.6743937","DOIUrl":"https://doi.org/10.1109/CISP.2013.6743937","url":null,"abstract":"A quantum dialogue protocol based on single photons is proposed in this paper, two legitimate dialogue parties can send their secret messages to each other simultaneously. The protocol is secure against the denial of service attack, the delay-photon Trojan horse attack and invisible photon eavesdropping attack. Moreover, it can overcome the information leakage problem existed in most previous quantum dialogue protocols. Compared with the only secure quantum dialogue protocol based on single photons which also can overcome the information leakage problem as far as we know, our protocol has a higher efficiency for qubits. The protocol is experimentally feasible within current technologies.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908954","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
扫码关注我们
求助内容：
应助结果提醒方式：