期刊：
Computer Vision and Image Understanding,2015年150:109-125 ISSN：1077-3142
通讯作者：
Peng, Xiaojiang(xiaojiang.peng@inria.fr)
作者机构：
[Peng, Xiaojiang] College of Computer Science and Technology, Hengyang Normal University, Hengyang, China;[Peng, Xiaojiang] LEAR Team, INRIA, Grenoble, France;[Wang, Limin; Wang, Xingxing; Qiao, Yu] Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China;Computer Vision Lab, ETH Zurich, Zurich, Switzerland
通讯机构：
[Peng, Xiaojiang] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.;[Peng, Xiaojiang] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen, Peoples R China.;[Peng, Xiaojiang] INRIA, LEAR Team, Grenoble, France.
关键词：
Action recognition;Bag of visual words;Fusion methods;Feature encoding
摘要：
Video based action recognition is one of the important and challenging problems in computer vision research. Bag of visual words model (BoVW) with local features has been very popular for a long time and obtained the state-of-the-art performance on several realistic datasets, such as the HMDB51, UCF50, and UCF101. BoVW is a general pipeline to construct a global representation from local features, which is mainly composed of five steps; (i) feature extraction, (ii) feature pre-processing, (iii) codebook generation, (iv) feature encoding, and (v) pooling and normalization. Although many efforts have been made in each step independently in different scenarios, their effects on action recognition are still unknown. Meanwhile, video data exhibits different views of visual patterns , such as static appearance and motion dynamics. Multiple descriptors are usually extracted to represent these different views. Fusing these descriptors is crucial for boosting the final performance of an action recognition system. This paper aims to provide a comprehensive study of all steps in BoVW and different fusion methods, and uncover some good practices to produce a state-of-the-art action recognition system. Specifically, we explore two kinds of local features, ten kinds of encoding methods, eight kinds of pooling and normalization strategies, and three kinds of fusion methods. We conclude that every step is crucial for contributing to the final recognition rate and improper choice in one of the steps may counteract the performance improvement of other steps. Furthermore, based on our comprehensive study, we propose a simple yet effective representation, called hybrid supervector, by exploring the complementarity of different BoVW frameworks with improved dense trajectories. Using this representation, we obtain impressive results on the three challenging datasets; HMDB51 (61.9%), UCF50 (92.3%), and UCF101 (87.9%).
作者：
Tao Jiang;Yu-cai Feng;Bin Zhang;Zhong-sheng Cao;Ge Fu;Jie Shi
期刊：
Journal of Zhejiang University: Science A,2009年10(7):937-951 ISSN：1673-565X
通讯作者：
Jiang, T.(jiangtao_albert@yahoo.cn)
作者机构：
[Tao Jiang; Yu-cai Feng; Ge Fu; Zhong-sheng Cao; Jie Shi] College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;[Bin Zhang] Department of Computer Science, Hengyang Normal University, Hengyang 421008, China
关键词：
Computational costs - Correlation - Data streams - Distance metric - Financial data - Grid structures - High precision - Local pattern - Local patterns - Model monitoring - On-line fashion - Orders of magnitude - Pattern similarity - Quick response time - Scan techniques - Time cost
摘要：
Developing tools for monitoring the correlations among thousands of financial data streams in an online fashion can be interesting and useful work. We aimed to find highly correlative financial data streams in local patterns. A novel distance metric function slope duration distance (SDD) is proposed, which is compatible with the characteristics of actual financial data streams. Moreover, a model monitoring correlations among local patterns (MCALP) is presented, which dramatically decreases the computational cost using an algorithm quickly online segmenting and pruning (QONSP) with O(1) time cost at each time tick t, and our proposed new grid structure. Experimental results showed that MCALP provides an improvement of several orders of magnitude in performance relative to traditional naive linear scan techniques and maintains high precision. Furthermore, the model is incremental, parallelizable, and has a quick response time.
期刊：
Image and Vision Computing,2014年32(9):616-628 ISSN：0262-8856
通讯作者：
Qiao, Y
作者机构：
[Peng, Xiaojiang; Peng, Qiang] Southwest Jiaotong University, Chengdu, China;[Peng, Xiaojiang; Qiao, Yu] Shenzhen Key Lab of CVPR, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China;[Qiao, Yu] Chinese University of Hong Kong, Hong Kong, Hong Kong;[Peng, Xiaojiang] Department of Computer Science, Hengyang Normal University, Hengyang, China
通讯机构：
[Qiao, Yu] 1068 Xueyuan Ave, Shenzhen, Peoples R China.
关键词：
Dense trajectory;Action recognition;3D co-occurrence descriptors;Motion boundary;Bag of Features
摘要：
Recent studies witness the success of Bag-of-Features (BoF) frameworks for video based human action recognition. The detection and description of local interest regions are two fundamental problems in BoF framework. In this paper, we propose a motion boundary based sampling strategy and spatial-temporal (3D) co-occurrence descriptors for action video representation and recognition. Our sampling strategy is partly inspired by the recent success of dense trajectory (DT) based features [Wang et al., 20131 for action recognition. Compared with DT, we densely sample spatial-temporal cuboids along a motion boundary which can greatly reduce the number of valid trajectories and preserve the discriminative power. Moreover, we develop a set of 3D co-occurrence descriptors which take account of the spatial-temporal context within local cuboids and deliver rich information for recognition. Furthermore, we decompose each 3D co-occurrence descriptor at pixel level and bin level and integrate the decomposed components with a multi-channel framework, which can improve the performance significantly. To evaluate the proposed methods, we conduct extensive experiments on three benchmarks including KTH, YouTube and HMDB51. The results show that our sampling strategy significantly reduces the computational cost of point tracking without degrading performance. Meanwhile, we achieve superior performance than the state-of-the-art methods. We report 95.6% on KTH, 87.6% on YouTube and 51.8% on HMDB51. (C) 2014 Elsevier B.V. All rights reserved.
摘要：
We propose a new ultra-lightweight block cipher, QTL. The 64 bits block cipher QTL supports 64 and 128 bits keys. To solve the slow diffusion of the traditional Feistel-type structures we have used a new variant of generalized Feistel network structure in design of the QTL. Traditional Feistel-type structures change only half of block messages in an iterative round, but our structure overcomes this disadvantage and changes all block messages. Thus, our structure has the fast diffusion of the Substitution Permutation Networks (SPNs) structures, which improves the security of lightweight block cipher in Feistel-type structures. Moreover, QTL algorithm has the same encryption and decryption processes, so it will occupy less area in resource-constrained applications. Furthermore, to reduce the cost of energy consumption in hardware implementation of the cipher while maintaining security, we decide not to use a key schedule. We show that QTL offers an adequate security level against classic analyses. Our hardware implementation for the 64 and the 128 bits keys modes only require 1025.52 and 1206.52 gate equivalents, respectively. QTL achieves high security and compact implementation in hardware. QTL is one of the most competitive ultra-lightweight block ciphers, which is suitable for extremely constrained devices. (C) 2016 Elsevier B.V. All rights reserved.
期刊：
International Journal of Systems Science,2013年44(9):1762-1773 ISSN：0020-7721
通讯作者：
Liang, T.(ltn_99@126.com)
作者机构：
[Jianjun Chen; Taonian Liang] School of Mechanical and Electronic Engineering, Xidian University, Xi'an 710071, China;[Huihuang Zhao] Department of Computer Science, Hengyang Normal University, Hunan, HengYang 421008, China;[Taonian Liang] Northwest Institute of Mechanical and Electrical Engineering, Xianyang 712099, China
通讯机构：
[Liang, Taonian] Xidian Univ, Sch Mech & Elect Engn, Xian 710071, Peoples R China.;School of Mechanical and Electronic Engineering , Xidian University , Xi'an 710071 , China;Northwest Institute of Mechanical and Electrical Engineering , Xianyang 712099 , China
关键词：
PIλ controller;value set approach;zero exclusion principle;robust stability region;fractional order interval plant
摘要：
In this article, by using the fractional order PIλ controller, we propose a simple and effective method to compute the robust stability region for the fractional order linear time-invariant plant with interval type uncertainties in both fractional orders and relevant coefficients. The presented method is based on decomposing the fractional order interval plant into several vertex plants using the lower and upper bounds of the fractional orders and relevant coefficients and then constructing the characteristic quasi-polynomial of each vertex plant, in which the value set of vertex characteristic quasi-polynomial in the complex plane is a polygon. The D-decomposition method is used to characterise the stability boundaries of each vertex characteristic quasi-polynomial in the space of controller parameters, which can obtain the stability region by varying λ orders in the range (0, 2). These regions of each vertex plant are computed by using three stability boundaries: real root boundary (RRB), complex root boundary (CRB) and infinite root boundary (IRB). The method gives the explicit formulae corresponding to these boundaries in terms of fractional order PIλ controller parameters. Thus, the robust stability region for fractional order interval plant can be obtained by intersecting stability region of each vertex plant. The robustness of stability region is tested by the value set approach and zero exclusion principle. Our presented technique does not require sweeping over the parameters and also does not need linear programming to solve a set of inequalities. It also offers several advantages over existing results obtained in this direction. The method in this article is useful for analysing and designing the fractional order PIλ controller for the fractional order interval plant. An example is given to illustrate this method.
作者机构：
[Zhou, Huaan; Wen, Guilin; Chen, Zhong] State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, Changsha, 410082, China;[Zhou, Huaan; Wen, Guilin; Chen, Zhong] Key Laboratory of Advanced Design and Simulation Techniques for Special Equipment, Ministry of Education, Hunan University, Changsha, 410082, China;[Chen, Junyao] College of information technology, Ajou University, Suwon, 16499, Korea, Republic of;[Chen, Junyao] Department of Physics and Electronic Information Science, Hengyang Normal University, Hengyang, 421008, China;[Chen, Zhong] Department of Computer Science, Hengyang Normal University, Hengyang, 421008, China
通讯机构：
[Wen, Guilin] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China.;[Wen, Guilin] Hunan Univ, Key Lab Adv Design & Simulat Tech Special Equipme, Minist Educ, Changsha 410082, Hunan, Peoples R China.
摘要：
A chaotic model for generating multi-directional multi-scroll attractors via hyperbolic tangent function series is proposed in this paper. The dynamical mechanisms of this chaotic model are further investigated, including M-scroll, MxN-grid scroll, MxNxL-grid scroll chaotic attractors. Moreover, the dynamical behaviors of this system are theoretically analyzed and numerically simulated, such as equilibria and their stability,.Lyapunov exponents and bifurcation diagrams. This system can be widely used in data encryption and secure communication. (C) 2016 Elsevier GmbH. All rights reserved.
期刊：
The Visual Computer,2016年32(9):1121-1132 ISSN：0178-2789
通讯作者：
Cao, JJ
作者机构：
[Tao, Pingping; Cao, Junjie; Liu, Xiuping; Chen, He] School of Mathematical Sciences, Dalian University of Technology, Dalian, 116024, China;[Zou, Changqing] School of Computing Science, Simon Fraser University, Burnaby, V5A 1S6, Canada;[Zou, Changqing] College of Computer Science and Technology, Hengyang Normal University, Hengyang, 421000, China
通讯机构：
[Cao, Junjie] Dalian Univ Technol, Sch Math Sci, Dalian 116024, Peoples R China.
摘要：
We propose a mesh saliency detection approach using absorbing Markov chain. Unlike most of the existing methods based on some center-surround operator, our method employs feature variance to obtain insignificant regions and considers both background and foreground cues. Firstly, we partition an input mesh into a set of segments using Ncuts algorithm and then each segment is over segmented into patches based on Zernike coefficients. Afterwards, some background patches are selected by computing feature variance within the segments. Secondly, the absorbed time of each node is calculated via absorbing Markov chain with the background patches as absorbing nodes, which gives a preliminary saliency measure. Thirdly, a refined saliency result is generated in a similar way but with foreground nodes extracted from the preliminary saliency map as absorbing nodes, which inhibits the background and efficiently enhances salient foreground regions. Finally, a Laplacian-based smoothing procedure is utilized to spread the patch saliency to each vertex. Experimental results demonstrate that our scheme performs competitively against the state-of-the-art approaches.
摘要：
This paper presents a multi-modal feature fusion based framework to improve the geographic image annotation. To achieve effective representations of geographic images, the method leverages a low-to-high learning flow for both the deep and shallow modality features. It first extracts low-level features for each input image pixel, such as shallow modality features (SIFT, Color, and LBP) and deep modality features (CNNs). It then constructs mid-level features for each superpixel from low-level features. Finally it harvests high-level features from mid-level features by using deep belief networks (DBN). It uses a restricted Boltzmann machine (RBM) to mine deep correlations between high-level features from both shallow and deep modalities to achieve a final representation for geographic images. Comprehensive experiments show that this feature fusion based method achieves much better performances compared to traditional methods. (C) 2017 Published by Elsevier Ltd.
期刊：
International Journal of Distributed Sensor Networks,2015年2015 ISSN：1550-1329
通讯作者：
Liu, Fangju(liufj127@163.com)
作者机构：
[Liang, Junbin] School of Computer and Electronic Information, Guangxi University, Nanning, Guangxi, China;[Ma, Xingpo] School of Computer and Information Technology, Xinyang Normal University, Xinyang, Henan, China;[Lin, Mugang] Department of Computer Science, Hengyang Normal University, Hengyang, Hunan, China;[Liu, Fangju] School of Computer Science and Technology, University of South China, Hengyang, Hunan, China
通讯机构：
[Liu, Fangju] Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
关键词：
Analysis and simulation - Mobile sensor networks - Mobile sensor node - Static sensor networks - Static sensor nodes - Static state - Symmetric keys - Top-k query processing
期刊：
IET Communications,2015年9(7):940-946 ISSN：1751-8628
通讯作者：
Zhao, Huihuang
作者机构：
[Peng, Xiaojiang; Zhao, Huihuang] Department of Computer Science, Hengyang Normal University, HuNan, China;[Zhao, Huihuang; Wang, Yaonan] College of Electrical and Information Engineering, Hunan University, Hunan, China;[Qiao, Zhijun] Department of Mathematics, University of Texas-Pan American, Edinburg, TX, United States
通讯机构：
[Zhao, Huihuang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Hunan, Peoples R China.
关键词：
special patterns;detecting;predicting;financial data streams
摘要：
Online detecting special patterns over financial data streams is an interesting and significant work. Existing many algorithms take it as a subsequence similarity matching problem. However, pattern detection on streaming time series is naturally expensive by this means. An efficient segmenting algorithm ONSP (ONline Segmenting and Pruning) is proposed, which is used to find the end points of special patterns. Moreover, a novel metric distance function is introduced which more agrees with human perceptions of pattern similarity. During the process, our system presents a pattern matching algorithm to efficiently match possible emerging patterns among data streams, and a probability prediction approach to predict the possible patterns which have not emerged in the system. Experimental results show that these approaches are effective and efficient for online pattern detecting and predicting over thousands of financial data streams.
作者：
Zhao, Huihuang;Wang, Yaonan;Qiao, Zhijun;Fu, Bin
期刊：
Soldering and Surface Mount Technology,2014年26(3):129-138 ISSN：0954-0911
通讯作者：
Zhao, HH
作者机构：
[Qiao, Zhijun; Fu, Bin] Department of Mathematics, University of Texas-Pan American, Texas, United States;[Zhao, Huihuang] Department of Computer Science, HengYang Normal University, HengYang, China;[Zhao, Huihuang; Wang, Yaonan] College of Electrical and Information Engineering, Hunan University, ChangSha, China
期刊：
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE,2015年12(7):1300-1310 ISSN：1546-1955
通讯作者：
Xu, Yuming
作者机构：
[Ouyang, Aijia] College of Computer, Hunan Science and Technology Economy Trade Vocation College, Hengyang, Hunan, China;[Ouyang, Aijia] School of Information Science and Engineering, Hunan City University, Yiyang, Hunan, China;[Zheng, Guangyong; Xu, Yuming] Department of Computer Science, Hengyang Normal University, Hengyang, Hunan, China;[Pan, Guo] College of Information Science and Engineering, Hunan University, Changsha,Hunan, China
通讯机构：
[Xu, Yuming] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
关键词：
Artificial chemical reaction optimization algorithms - Chemical reaction process - Chemical-reaction optimizations - Grid computing environment - Job scheduling - Job scheduling problem - Makespan - Meta-heuristic optimizations
关键词：
Time Series;Similarity/Dissimilarity Analysis;Principal Component Analysis;Fast Fourier Transformation;Protein Sequence
摘要：
In this paper, a novel method to analyze the similarity/dissimilarity of protein sequences based on Principal Component Analysis-Fast Fourier Transformation (PCA-FFT) is proposed, in which, the PCA is utilized to transform protein sequences into time series and the FFT is utilized to analyze the time series while considering them as signals. To test the effectiveness of our newly proposed method, it is applied to analyze the similarity/dissimilarity of 16 different ND5 protein sequences and 29 different spike protein sequences, respectively. Furthermore, the correlation analysis is presented for comparing with others methods, and the simulation results show that it has better performances in the aspects of computation complexity and recognition degree than some existing methods.
作者机构：
[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.;[Su, Zhuo; Gao, Chengying] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.;[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.;[Tan, Ping; Zou, Changqing] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.;[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.
通讯机构：
[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.;[Zou, Changqing] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.
会议名称：
25th Pacific Conference on Computer Graphics and Applications (Pacific Graphics)
会议时间：
OCT 16-19, 2017
会议地点：
Taipei, TAIWAN
会议主办单位：
[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.^[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.^[Zou, Changqing;Tan, Ping] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.^[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.^[Gao, Chengying;Su, Zhuo] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.
摘要：
This paper presents a new two-step color transfer method which includes color mapping and detail preservation. To map source colors to target colors, which are from an image or palette, the proposed similarity-preserving color mapping algorithm uses the similarities between pixel color and dominant colors as existing algorithms and emphasizes the similarities between source image pixel colors. Detail preservation is performed by an L0 gradient-preserving algorithm. It relaxes the large gradients of the sparse pixels along color region boundaries and preserves the small gradients of pixels within color regions. The proposed method preserves source image color similarity and image details well. Extensive experiments demonstrate that the proposed approach has achieved a state-of-art visual performance.
作者机构：
[朱虹; 蒋涛; 李国徽] College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;[蒋涛; 张彬] Department of Computer Science, Hengyang Normal University, Hengyang 421008, China
作者机构：
[Jiang, Tao; Yue, Guangxue] College of Mathematics and Information Engineering, Jiaxing University, Jiaxing 314000, Zhejiang, China;[Jiang, Tao; Li, Guohui] College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;[Zhang, Bin] Department of Computer Science, Hengyang Normal University, Hengyang 421008, Hunan, China
