检索结果-内蒙古大学图书馆

Shot Transition Detection Based on Locally Linear Embedding

Shot Transition Detection Based on Locally Linear Embedding

2010 International Conference on Measuring Technology and Mechatronics Automation(ICMTMA 2010)(2010年检测技术与机电自动化国际会议)

作者： MaoSheng Fu DaMing Zhang Min Kong Bin Luo Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei230039. P. R. China Department of Computer Science and Technology in West Anhui University Anhui Lu'an 237012. P. R. China

ISBN: (纸本)9781424450015

Detection of shot transitions servers as the preliminary step to video indexing and retrieval. Locally linear embedding (LLE) algorithm fails when it is applied to video with multi-shot. In this paper, we present a novel framework of shot transitions detection. The method involves two processes: First we extract the manifold feature of shot transition using LLE through addition of virtual frames on an enriched set, and then they are classified by *** show that the recognition rate of shot transition is reached over 90％.

关键词： shot transition detection locally linear embedding feature extraction

来源：评论

学校读者我要写书评

暂无评论

Subspace selection using semi-supervised harmonic mean of Kullback-Leibler divergences

Subspace selection using semi-supervised harmonic mean of Ku...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Si-Bao Chen Hai-Xian Wang Bin Luo Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui China Key Lab of Child Development and Learning Science of Ministry of Education Research Center of Learning Sciences South-East University Nanjing Jiangsu China

In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. However, LDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), can significantly reduce the class separation problem. Furthermore, maximizing the harmonic mean of Kullback-Leibler (KL) divergences of class pairs (MHMD) emphasizes smaller divergences more than MGMD, and deals with the class separation problem more effectively. However, in many applications, labeled data are very limited while unlabeled data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate labeled data. To take advantage of unlabeled data for subspace selection, semi-supervised MHMD (SSMHMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMHMD.

关键词： Harmonic analysis Training Laplace equations Manifolds Covariance matrix Machine learning Symmetric matrices

来源：评论

学校读者我要写书评

暂无评论

On Dynamic Weighting of Data in Clustering with K-Alpha Means

On Dynamic Weighting of Data in Clustering with K-Alpha Mean...

引用

International Conference on Pattern Recognition

作者： Si-Bao Chen Hai-Xian Wang Bin Luo Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui China Key Laboratory of Child Development and Learning Science of Ministry of Education Research Center of Learning Science South-East University Nanjing Jiangsu China

ISBN: (纸本)9781424475421

Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-Alpha Means (KAM), which is insensitive to the initial centers. With K-Harmonic Means as a special case, KAM dynamically weights data points during iteratively updating centers, which deemphasizes data points that are close to centers while emphasizes data points that are not close to any centers. Through replacing minimum operator in K-Means by alpha-mean operator, KAM significantly improves the clustering performances.

关键词： Clustering algorithms Heuristic algorithms Indexes Partitioning algorithms signal processing algorithms Euclidean distance Iris

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of the Zigbee-based body sensor network system

Design and implementation of the Zigbee-based body sensor ne...

引用

5th International Conference on Wireless Communications, Networking and Mobile computing, WiCOM 2009

作者： Chengcheng, Ding Xiaopei, Wu Zhao, Lv Key Laboratory of Intelligent Computing and Signal Processing China Anhui University Hefei Anhui Province

ISBN: (纸本)9781424436934

Tranditionally the medical monitoring used in hospital brought a lot inconvenience because of the complex wires between patients and equipments. In order to solve these problems, a human health wireless monitoring system based on Zigbee wireless communications is proposed. The system proposes multiple wireless physiological sensors to form a expandable wireless sensor network system architecture. Then the structure of the system used in wireless sensor nodes is introduced and the purpose is to collect the patients' physiological information, such as pulse, temperature, basically realize remote medical monitoring for patients. This system can not only realize accurate measurement of indicators, but also save the patients' travel between home and the hospital. ©2009 IEEE.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of an improved BCI System based on alpha rhythm

Design and implementation of an improved BCI System based on...

引用

3rd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2009

作者： Bing, Wei Xiaopei, Wu Daoxin, Zhang Key Laboratory of Intelligent Computing and Signal Processing China of Anhui University Hefei Anhui Province China

ISBN: (纸本)9781424429028

This paper introduces an improved BCI system based on alpha rhythm, the main composition units of the system are electrodes, acquisition circuit, online detecting algorithm and outer devices. For improving the performance of BCT systems, a new algorithms for alpha wave detection is proposed, which can reduce EEG baseline wandering and energy fluctuation efficiently and make the BCI system work more stable. Based on the BCI system, experiments of media player control are carried out among different subjects, which show that the system has an excellent performance in alpha wave detection and real-time controlling. ©2009 IEEE.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

A 5-Parameter bundld adjustment method for image mosaic

A 5-Parameter bundld adjustment method for image mosaic

引用

8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009

作者： Fang, Xianyong Luo, Bin Zhao, Haifeng Zhang, Yiwen Key Lab. of Intelligent Computing and Signal Processing of MOE School of Computer Science and Technology Anhui University China

ISBN: (纸本)9780769536415

A 5-parameter bundle adjustment method is proposed in this paper for global mosaic of an image sequence. By decomposing the rotation matrix into a 3-parameter rotation axis and a rotation angle, to each image, there are 5 parameters that need estimate for rotation axis, rotation angle and focal length. The proposed method minimizes the distance between feature matches in 3D space so that these 5 parameters are refined gradually for final stitching of all images together. Experimental results suggest that this method is an useful extension to existing research with the advantages of real 3D camera motion, accurate 5-parameter rotation decomposition and reliable 3D feature definition. © 2009 IEEE.

关键词： Rotation

来源：评论

学校读者我要写书评

暂无评论

A Spectrum Based Algorithm for Image Classification

引用

电子学报(英文版) 2009年第3期18卷 427-430页

作者： WANG Nian ZHANG Jiang TANG Jun FAN Yizheng LIANG Dong Key Laboratory of Intelligent Computing and Signal Processing Anhui University Education Ministry Hefei 230039 China Hefei Teachers College Hefei 230601 China Department of Mathematics Anhui University Hefei 230039 China

In this paper, a novel algorithm for image classification is presented which uses the projective value of adjacency spectrum as classified samples. Firstly, the eigenvalues of adjacency matrices constructed on the feature point-sets of images are obtained by singular value decomposition. Secondly, the eigenvalues are projected onto the eigenspace by means of the covariance matrix. Finally, image classification is performed by adopting RBF and PNN neural networks as classifiers respectively. Meanwhile, some theoretical analyses are given to support the proposed method.

关键词：图像分类分类算法神经网络分类器矩阵特征值奇异值分解协方差矩阵射影分类特征空间

来源：评论

学校读者我要写书评

暂无评论

Segmentation of brain MR images based on t-mixture model

Segmentation of brain MR images based on t-mixture model

引用

3rd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2009

作者： Haifeng, Zhao Xingming, Xu Sibao, Chen Bin, Luo Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424429028

As Magnetic Resonance Imaging (MRI) is an important technology of radiological evaluation and computeraided diagnosis, the accuracy of the MR image segmentation directly influences the validity of following processing. The paper concerns medical image segmentation based on t-mixture model because of merits of the model. By analyzing the features of MR images, the main procedure of white matter segmentation of brain MR Images based on t-mixture model is outlined follows. The parameters of t-mixture model for the image are firstly estimated. Then the posterior probabilities of the pixels of the image are computed. At last, the image is segmented according to the Bayes decision rule for minimum error. Experimental results show that t-mixture model fits for medical image segmentation. ©2009 IEEE.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Nonlinear dynamics in Internet congestion control model with TCP Westwood under RED

引用

The Journal of China Universities of Posts and Telecommunications 2009年第4期16卷 53-58页

作者： DING Da-wei ZHU Jie LUO Xiao-shu HUANG Lin-sheng HU Yan-jun Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China Department of Electronic Engineering Shanghai Jiaotong University Shanghai 200240 China School of Electronic Engineering Guangxi Normal University Guilin 541004 China

This article develops a discrete time dynamic feedback model of a congestion control system for a simple network with TCP Westwood （TCPW） connections and a single bottleneck link with random early detection （RED） gateway. By using this model, the nonlinear dynamics of the TCPW/RED network are analyzed and its parameter sensitivities are studied. It is shown that periodic doubling bifurcation occurs when the RED control parameters or other parameters are varied. By theoretical analysis, the fixed point, the critical value of parameters and the nature of the bifurcation are determined. Moreover, by using bifurcation diagrams and Lyapunov exponent, the result of theoretical analysis is validated and the bifurcation and chaotic phenomena are numerically studied of the congestion control system with TCPW connections and RED gateway.

关键词： nonlinear system bifurcation chaos congestion control TCP Westwood RED

来源：评论

学校读者我要写书评

暂无评论

A fast thinning algorithm for fingerprint image

A fast thinning algorithm for fingerprint image

引用

1st International Conference on Information Science and Engineering, ICISE2009

作者： Xiang, Ming Wu, Xiaopei Hua, Quanping Key Lab. of Intelligent Computing and Signal Processing Anhui University Hefei230039 China Department of Information Engineering Zhejiang Textile and Fashion College Ningbo315211 China

ISBN: (纸本)9780769538877

Thinning algorithms can be classified into two general types: serial and parallel algorithms. Several algorithms have been proposed, but they have limitations. A new thinning algorithm based on the centroid of the block is presented. The new algorithm checks the 9*9 local neighborhoods around the pixel to find out the centroid pixel of the block, and other pixels are removed. The process is performed iteratively until less than ten pixels are deleted in one loop. To ensure the ridge is one pixel wide, a post-processing loop is designed and the pixels are deleted from the image if they satisfy some conditions. Experimental results are used to compare this new algorithm to other algorithms and their relative performances are assessed. The new algorithm is fast than other algorithms and the ridges are one pixel wide after thinned. ©2009 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：