Pub Date : 2014-12-15DOI: 10.1109/SPAC.2014.6982649
Xiaoyu Hu, Hongquan Yun, Delie Ming, Tian Tian
In this paper, we propose a compressive tracking method via appearance model based on structural local patchs and improved Haar-like feature. In contrast to previous compressive tracking only considering the holistic representation, an object can be represented by local image patches with spatial layout in an object. This representation takes advantage of both partial information and spatial information of the target. Each local patch has a fixed position in the target field, and all local patches can represent the whole target. In addition, our appearance model based on features extracted from image patches, which can guarantee the randomness of the rectangular boxes and the distribution of the rectangular boxes over the entire image area, avoiding the randomness of the rectangular boxes is too strong to weak the feature expression. We sample the positive and negative samples and divide them into patchs to train a binary classification via a naive Bayes classifier with online update, then the classifier is used to discriminate the candidate samples. The candidate sample which gets the highest classify score is the target. After that we draw positive and negative samples in the same way with the candidate samples to update the classifier to get ready for next frame. Our approach helps not only locate the target more accurately but also can handle partial occlusion effectively. The proposed tracker is compared with several state-of-the-art trackers on some challenging video sequences. Our proposed tracker is better and more stable in both quantitative and qualitative comparisons.
{"title":"Compressive tracking via appearance modeling based on structural local patch","authors":"Xiaoyu Hu, Hongquan Yun, Delie Ming, Tian Tian","doi":"10.1109/SPAC.2014.6982649","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982649","url":null,"abstract":"In this paper, we propose a compressive tracking method via appearance model based on structural local patchs and improved Haar-like feature. In contrast to previous compressive tracking only considering the holistic representation, an object can be represented by local image patches with spatial layout in an object. This representation takes advantage of both partial information and spatial information of the target. Each local patch has a fixed position in the target field, and all local patches can represent the whole target. In addition, our appearance model based on features extracted from image patches, which can guarantee the randomness of the rectangular boxes and the distribution of the rectangular boxes over the entire image area, avoiding the randomness of the rectangular boxes is too strong to weak the feature expression. We sample the positive and negative samples and divide them into patchs to train a binary classification via a naive Bayes classifier with online update, then the classifier is used to discriminate the candidate samples. The candidate sample which gets the highest classify score is the target. After that we draw positive and negative samples in the same way with the candidate samples to update the classifier to get ready for next frame. Our approach helps not only locate the target more accurately but also can handle partial occlusion effectively. The proposed tracker is compared with several state-of-the-art trackers on some challenging video sequences. Our proposed tracker is better and more stable in both quantitative and qualitative comparisons.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"27 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129498386","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-15DOI: 10.1109/SPAC.2014.6982673
Zhao Bing, Wu Jing, Liu Jingyu, Ben Xian-ye
Cognitive ultra wideband wireless communication system as a new type of intelligent communication system will be utilized with a variety of techniques, now research focuses on the generation and detection of short RF pulses. Prolate spheroidal wave function possess many desirable properties, such as high energy concentration and inherent Orthogonal properties, which is important because the regulatory rules for CUWB pluse have not been finalized. This paper describes an optimized pluse design for very high spectrum utilization, low Interference, divides the spectrum into several sub-bands which could be canceled in the interfering bands, combines sub-band pulse phase with spectrum overlap rate to improve spectrum utilization. So as to realize revising seamless transmitted waveform to adapt with the wireless environment efficiently.
{"title":"Multiband CUWB system pulse design methods and performance analysis","authors":"Zhao Bing, Wu Jing, Liu Jingyu, Ben Xian-ye","doi":"10.1109/SPAC.2014.6982673","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982673","url":null,"abstract":"Cognitive ultra wideband wireless communication system as a new type of intelligent communication system will be utilized with a variety of techniques, now research focuses on the generation and detection of short RF pulses. Prolate spheroidal wave function possess many desirable properties, such as high energy concentration and inherent Orthogonal properties, which is important because the regulatory rules for CUWB pluse have not been finalized. This paper describes an optimized pluse design for very high spectrum utilization, low Interference, divides the spectrum into several sub-bands which could be canceled in the interfering bands, combines sub-band pulse phase with spectrum overlap rate to improve spectrum utilization. So as to realize revising seamless transmitted waveform to adapt with the wireless environment efficiently.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126150847","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-15DOI: 10.1109/SPAC.2014.6982676
Yan Houyi, Ling Yunxiang, Fan Lin-jun
Human-computer interaction in intelligent space is more complex and requires higher design principles. Gesture is an important interactive modal because of its natural and nonconflicting feature. The gesture interaction patterns of various devices fall into four types, i.e. barehanded/auxiliary touch/touchless mode. Gesture interaction meeting the demand of intelligent space should satisfy several development requirements, including multi-device collaboration, user-centered interaction and task-oriented design, each of which will be elaborated on.
{"title":"Development principles of gesture interaction in smart space","authors":"Yan Houyi, Ling Yunxiang, Fan Lin-jun","doi":"10.1109/SPAC.2014.6982676","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982676","url":null,"abstract":"Human-computer interaction in intelligent space is more complex and requires higher design principles. Gesture is an important interactive modal because of its natural and nonconflicting feature. The gesture interaction patterns of various devices fall into four types, i.e. barehanded/auxiliary touch/touchless mode. Gesture interaction meeting the demand of intelligent space should satisfy several development requirements, including multi-device collaboration, user-centered interaction and task-oriented design, each of which will be elaborated on.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126058866","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-15DOI: 10.1109/SPAC.2014.6982663
Jing Yuan, Wei Wang, Wei Yang, Maojun Zhang
An approach for keyframe extraction using AdaBoost is proposed which is based on foreground detection. The aim of this approach is to extract keyframes from sequences of specific vehicle images of lane vehicle surveillance video. This method utilizes integral channel features and the area feature as the image feature descriptor, combined with training an AdaBoost classifier. The experimental results on real-road test video show that the algorithm presented in this paper effectively selects the most distinct and clearest image for a sequence of vehicle images which begins counting when a motional vehicle enters into the surveillance area and ends when it leaves. Compared with other methods, it has increased the effectiveness and precision for keyframe extraction of lane vehicle surveillance video and achieves more effective compression of video analytical data for lane vehicle surveillance.
{"title":"Keyframe extraction using AdaBoost","authors":"Jing Yuan, Wei Wang, Wei Yang, Maojun Zhang","doi":"10.1109/SPAC.2014.6982663","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982663","url":null,"abstract":"An approach for keyframe extraction using AdaBoost is proposed which is based on foreground detection. The aim of this approach is to extract keyframes from sequences of specific vehicle images of lane vehicle surveillance video. This method utilizes integral channel features and the area feature as the image feature descriptor, combined with training an AdaBoost classifier. The experimental results on real-road test video show that the algorithm presented in this paper effectively selects the most distinct and clearest image for a sequence of vehicle images which begins counting when a motional vehicle enters into the surveillance area and ends when it leaves. Compared with other methods, it has increased the effectiveness and precision for keyframe extraction of lane vehicle surveillance video and achieves more effective compression of video analytical data for lane vehicle surveillance.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124149990","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-15DOI: 10.1109/SPAC.2014.6982728
Teng Li, Y. Dou, Jingfei Jiang, Jing Gao
Morphological operation constitutes one of a powerful and versatile image and video applications applied to a wide range of domains, from object recognition, to feature extraction and to moving objects detection in computer vision where real-time and high-performance are required. However, the throughput of morphological operation is constrained by the convolutional characteristic. In this paper, we analysis the parallelism of morphological operation and parallel implementations on the graphics processing unit (GPU), and field programming gate array (FPGA) are presented. For GPU platform, we propose the optimized schemes based on global memory, texture memory and shared memory, achieving the throughput of 942.63 Mbps with 3×3 structuring element. For FPGA platform, we present an optimized method based on the traditional delay-line architecture. For 3×3 structuring element, it achieves a throughput of 462.64 Mbps.
{"title":"Efficient parallel implementation of morphological operation on GPU and FPGA","authors":"Teng Li, Y. Dou, Jingfei Jiang, Jing Gao","doi":"10.1109/SPAC.2014.6982728","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982728","url":null,"abstract":"Morphological operation constitutes one of a powerful and versatile image and video applications applied to a wide range of domains, from object recognition, to feature extraction and to moving objects detection in computer vision where real-time and high-performance are required. However, the throughput of morphological operation is constrained by the convolutional characteristic. In this paper, we analysis the parallelism of morphological operation and parallel implementations on the graphics processing unit (GPU), and field programming gate array (FPGA) are presented. For GPU platform, we propose the optimized schemes based on global memory, texture memory and shared memory, achieving the throughput of 942.63 Mbps with 3×3 structuring element. For FPGA platform, we present an optimized method based on the traditional delay-line architecture. For 3×3 structuring element, it achieves a throughput of 462.64 Mbps.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128379588","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-15DOI: 10.1109/SPAC.2014.6982677
Weizhen Chen, Long Zhou
As we all known that complicated system is too difficult to be identified. A system designed here may be expected to get good control effects. Firstly, grey state modeling and modal decomposition is proposed. Secondly, an approach to modal control, which is to control the complicated system's behavior is designed. The applicable field of modal control systems is rather far and wide especially for varieties of multivariable complicated systems.
{"title":"Approaches to grey state modeling and modal control of complicated systems","authors":"Weizhen Chen, Long Zhou","doi":"10.1109/SPAC.2014.6982677","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982677","url":null,"abstract":"As we all known that complicated system is too difficult to be identified. A system designed here may be expected to get good control effects. Firstly, grey state modeling and modal decomposition is proposed. Secondly, an approach to modal control, which is to control the complicated system's behavior is designed. The applicable field of modal control systems is rather far and wide especially for varieties of multivariable complicated systems.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128993535","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-15DOI: 10.1109/SPAC.2014.6982711
Yuhang Li, Ling Du
This paper proposes a semi-fragile digital watermarking scheme for image tamper localization and self-recovery. Firstly, the authentication watermark is generated for tampered area localization. After that, for content recovery, the recovery watermark is calculated from high frequency band with redundancy free. Then, for the two type of watermarks, the DWT-based watermark embedding method makes our proposed scheme tolerable against friendly manipulations. Even some parts of the watermarked image are tampered and the corresponding embedded information are missing, we can still recover the image from the untouched area based on the localization results and compressive sensing. Moreover, the encryption algorithm based on chaotic function guarantees the safety of our two type of watermarks. Extensive experiments demonstrate the effectiveness of the proposed scheme, which is sensitive against malicious tamper and robust to some incidental manipulations (e.g. JPEG compression, slight noise addition, brightness/contract adjustment and format conversion).
{"title":"Semi-fragile watermarking for image tamper localization and self-recovery","authors":"Yuhang Li, Ling Du","doi":"10.1109/SPAC.2014.6982711","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982711","url":null,"abstract":"This paper proposes a semi-fragile digital watermarking scheme for image tamper localization and self-recovery. Firstly, the authentication watermark is generated for tampered area localization. After that, for content recovery, the recovery watermark is calculated from high frequency band with redundancy free. Then, for the two type of watermarks, the DWT-based watermark embedding method makes our proposed scheme tolerable against friendly manipulations. Even some parts of the watermarked image are tampered and the corresponding embedded information are missing, we can still recover the image from the untouched area based on the localization results and compressive sensing. Moreover, the encryption algorithm based on chaotic function guarantees the safety of our two type of watermarks. Extensive experiments demonstrate the effectiveness of the proposed scheme, which is sensitive against malicious tamper and robust to some incidental manipulations (e.g. JPEG compression, slight noise addition, brightness/contract adjustment and format conversion).","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862074","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-15DOI: 10.1109/SPAC.2014.6982706
Jinxiang Zhang, Jian Zhang
This paper proposes a novel face warping approach to deforming a 3D face using a few 3D facial features. The objective function includes two parts, the first part is local geometric constraints which aim to maintain the general characteristics of human face, and the second part is a shape regularization term which can force the deformed face to have some personalized facial characteristics. The problem can be solved by a least square optimization method. Experimental results demonstrate the effect of the proposed approach. And compared with existing method, the approach can generate better face warping result.
{"title":"Face warping based on local geometric constraint","authors":"Jinxiang Zhang, Jian Zhang","doi":"10.1109/SPAC.2014.6982706","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982706","url":null,"abstract":"This paper proposes a novel face warping approach to deforming a 3D face using a few 3D facial features. The objective function includes two parts, the first part is local geometric constraints which aim to maintain the general characteristics of human face, and the second part is a shape regularization term which can force the deformed face to have some personalized facial characteristics. The problem can be solved by a least square optimization method. Experimental results demonstrate the effect of the proposed approach. And compared with existing method, the approach can generate better face warping result.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"500 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134549270","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-15DOI: 10.1109/SPAC.2014.6982705
Zhihua Yang, Yishu Liu
A novel approach which generates so-called ”potential genuine signatures” by timely nonlinear sampling from an original on-line signature is presented. Velocity vectors of these potential genuine signatures are exploited to construct an user-dependent overcomplete dictionary. Finally, sparse coefficients which served as features are used for verification. There are two main advantages: 1) The DTW becomes unnecessary, which makes the proposed method computationally inexpensive; 2) Multiply potential genuine signatures can be generated from a genuine one, so the difficulties causing by insufficient train samples in a real system are effectively alleviated. Experiments show encouraging results.
{"title":"An on-line signature verification based on timely nonlinear sampling and sparse representation","authors":"Zhihua Yang, Yishu Liu","doi":"10.1109/SPAC.2014.6982705","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982705","url":null,"abstract":"A novel approach which generates so-called ”potential genuine signatures” by timely nonlinear sampling from an original on-line signature is presented. Velocity vectors of these potential genuine signatures are exploited to construct an user-dependent overcomplete dictionary. Finally, sparse coefficients which served as features are used for verification. There are two main advantages: 1) The DTW becomes unnecessary, which makes the proposed method computationally inexpensive; 2) Multiply potential genuine signatures can be generated from a genuine one, so the difficulties causing by insufficient train samples in a real system are effectively alleviated. Experiments show encouraging results.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099480","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-15DOI: 10.1109/SPAC.2014.6982674
L. Kang, Z. Liu, Quan Guo
A force fields-based multi-scale docking method is proposed in this paper. Molecular docking problem has been divided into three sub problems: rigid-rigid phase, flexible-flexible phase and flexible-rigid phase. Residue groups of protein have been adopted to describe the conformation of protein. K-mean clustering algorithm and genetic algorithm have been developed to solve the optimization problem. A new docking program, which relies on calculated non-bonded interaction terms between protein and ligand atoms based on standard force fields, has been developed. In comparison with other docking methods, the docking method has significant improvement in docking accuracy.
{"title":"A force fields-based multi-scale docking method in drug molecular design","authors":"L. Kang, Z. Liu, Quan Guo","doi":"10.1109/SPAC.2014.6982674","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982674","url":null,"abstract":"A force fields-based multi-scale docking method is proposed in this paper. Molecular docking problem has been divided into three sub problems: rigid-rigid phase, flexible-flexible phase and flexible-rigid phase. Residue groups of protein have been adopted to describe the conformation of protein. K-mean clustering algorithm and genetic algorithm have been developed to solve the optimization problem. A new docking program, which relies on calculated non-bonded interaction terms between protein and ligand atoms based on standard force fields, has been developed. In comparison with other docking methods, the docking method has significant improvement in docking accuracy.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122921840","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
扫码关注我们
求助内容：
应助结果提醒方式：