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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Qi Chu Fa Zhang Kai Zhang Xiaohua Wan Mingwei Chen Zhiyong Liu Advanced Computer Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China National Key Laboratory of Biomacromolecules Chinese Academy of Sciences Beijing China

Accurate alignment of electron tomographic images without using embedded gold particles as fiducial markers is still a challenge. Here we propose a new markerless alignment method that employs Scale Invariant Feature Transform features (SIFT) as virtual markers. It differs from other types of feature in a way the sufficient and distinctive information it represents. This characteristic makes the following feature matching and tracking steps automatic and more reliable, which allows for estimating alignment parameters accurately. Furthermore, we use Sparse Bundle Adjustment (SPA) with M-estimation to estimate alignment parameters for each image. Experiments show that our method can achieve a reprojection residual less than 0.4 pixel and can approach the same accuracy of marker alignment. Besides, our method can apply to adjusting typical misalignments such as magnitude divergences or in-plane rotation and can detect bad images.

关键词： Feature extraction Image reconstruction Three dimensional displays Pixel Noise Robustness computers

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis for combinatorial optimization problems based on Ito process

引用

Journal of Computational Information Systems 2010年第10期6卷 3147-3154页

作者： Yu, Ruiguo Dong, Wenyong Lei, Ming School of Computer Science and Technology Tianjin University Tianjin 300072 China Computer School Wuhan University Wuhan 430079 China Institute of Automation Chinese Acad. of Sci. Beijing 100086 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin 300191 China

The paper provided some theoretical results about the convergence of ITO algorithm for combinatorial optimization problems. The transform probability of wave operator and move operator studied in detail. The almost sure convergence to the global optimum is obtained by transforming the search process of ITO algorithm to the discrete sub-martingale. Furthermore, the expected time of one particle in ITO algorithm is analyzed. © 2010 Binary Information Press October, 2010.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Selected Crosstalk Avoidance Code for Reliable Network-on-Chip

引用

Journal of computer Science & technology 2009年第6期24卷 1074-1085页

作者：张颖李华伟李晓维 Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Graduate School of the Chinese Academy of Sciences

With the shrink of the technology into nanometer scale, network-on-chip （NOC） has become a reasonable solution for connecting plenty of IP blocks on a single chip. But it suffers from both crosstalk effects and single event upset （SEU）, especially crosstalk-induced delay, which may constrain the overall performance of NOC. In this paper, we introduce a reliable NOC design using a code with the capability of both crosstalk avoidance and single error correction. Such a code, named selected crosstalk avoidance code （SCAC） in our previous work, joins crosstalk avoidance code （CAC） and error correction code （ECC） together through codeword selection from an original CAC codeword set. It can handle possible error caused by either crosstalk effects or SEU. When designing a reliable NOC, data are encoded to SCAC codewords and can be transmitted rapidly and reliably across NOC. Experimental results show that the NOC design with SCAC achieves higher performance and is reliable to tolerate single errors. Compared with previous crosstalk avoidance methods, SCAC reduces wire overhead, power dissipation and the total delay. When SCAC is used in NOC, it can save 20% area overhead and reduce 49% power dissipation.

关键词： crosstalk avoidance codeword selection reliable network-on-chip single event upset

来源：评论

学校读者我要写书评

暂无评论

Adaptive generic learning for face recognition from a single sample per person

Adaptive generic learning for face recognition from a single...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yu Su Shiguang Shan Xilin Chen Wen Gao School of Computer Science and Technology Harbin Institute of Technology China Digital Media Research Center Institute of Computing Technology CAS China Key Laboratory of Intelligent Information Processing Chinese Academy and Sciences China Institute for Digital Media Peking University China

Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the database. In this case, many of the popular face recognition methods fail to work well due to the inability to learn the discriminatory information specific to the persons to be identified. To address this problem, in this paper, we propose an Adaptive Generic Learning (AGL) method, which adapts a generic discriminant model to better distinguish the persons with single face sample. As a specific implementation of the AGL, a Coupled Linear Representation (CLR) algorithm is proposed to infer, based on the generic training set, the within-class scatter matrix and the class mean of each person given its single enrolled sample. Thus, the traditional Fisher's Linear Discriminant (FLD) can be applied to SSPP task. Experiments on the FERET and a challenging passport face database show that the proposed method can achieve better results compared with other common solutions to the SSPP problem.

关键词： Face recognition Principal component analysis Linear discriminant analysis computer science Content addressable storage Laboratories Deductive databases Information processing Scattering Image databases

来源：评论

学校读者我要写书评

暂无评论

Fast Facial Fitting Based on Mixture Appearance Model with 3D Constraint

Fast Facial Fitting Based on Mixture Appearance Model with 3...

引用

Chinese Conference on Pattern Recognition (CCPR)

作者： Xiangsheng Huang Lujin Gong Xiaoyan Wang Institute of Automation Chinese Academy and Sciences Beijing China State Key Laboratory of Scientific and Engineering Computing AMSS Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy and Sciences Beijing China College of Computer Science and Technology Zhejiang University of Technology Hangzhou China

Fast facial points fitting plays an important role in applications such as Human-computer Interaction, entertainment, surveillance, and is highly relevant to the techniques of facial expression analysis, face recognition, 3D face model generation, etc. Active Appearance Models (AAMs) are generative models commonly used to fit face. They are sensitive to illumination and expression changes because they use only raw intensity to build observation models. In this paper, a real time facial points fitting approach using mixture observation models is presented. Furthermore, the 3D modes are used to constrain the AAM so that it can only generate model instances that can also be generated with the 3D modes. Finally, we give a derivative process for fast energy minimization using the inverse compositional algorithm. A coarse-to-fine fitting strategy is used for realtime and robust facial points fitting. We apply this algorithm to facial expression cloning of 3D Avatar system. Experimental results demonstrate that fitting the AAM with mixture observation models and 3D constraint outperforms other classical algorithms.

关键词： Three dimensional displays Shape Active appearance model Solid modeling Face Pixel Robustness

来源：评论

学校读者我要写书评

暂无评论

A HSC-based sample selection method for support vector machine

A HSC-based sample selection method for support vector machi...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Qing He Ning Li Zhong-Zhi Shi The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China Key Laboratory of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding Hebei China Chinese Academy and Sciences China

Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high.

关键词： Support vector machines Training Classification algorithms Machine learning Accuracy Testing Machine learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Reduction Criteria for Probabilistic Models with Spatial Restrictions on States

Reduction Criteria for Probabilistic Models with Spatial Res...

引用

International Conference on Networks Security, Wireless Communications and Trusted computing, NSWCTC

作者： Niu Jun Guosun Zeng Embedded System and Service Computing Key Laboratory Ministry of Education Shanghai China College of Information Engineering Zhejiang Business and Technology Institute Ningbo China Department of Computer Science and Technology University of Tongji Shanghai China

ISBN: (纸本)9781424465972;9780769540115

Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on applying partial order reduction for verifying quantitative time properties and reward-based properties on actions. However, there are many situations that reward-based properties are expressed on states rather than on actions because actions are triggered in no time and the quantities can not be obtained easily. This paper presents reduction criteria for a probabilistic temporal logic that allows specification of restrictions on quantitative measures given by spatial resources function for the states of the considered system and provides the proof of the correctness.

关键词： Explosions computer networks Concurrent computing Embedded computing Educational technology Probabilistic logic Communication system security computer security Information security Wireless communication

来源：评论

学校读者我要写书评

暂无评论

A Generalized Model with Spatial Resources Labels

A Generalized Model with Spatial Resources Labels

引用

International Conference on Biomedical Engineering and computer Science (ICBECS)

This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and randomicity. The syntax and semantics of the new model are shown based on the existing temporal logics such as CSRL and pathCSRL. The model checking procedure is discussed and thus the practicability of the new model is intuitive. Based on the existing models, the proposed model includes spatial resources labels only by adding the spatial information to the existing labels of states, so the treatment of the state explosion problem is similar to that in the existing models.

关键词： Educational technology Paper technology Logic Labeling Educational institutions Embedded system Embedded computing computer science education Systems engineering education computer science

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a kind of EUPS for mobile service

引用

Journal of Information and Computational Science 2010年第11期7卷 2248-2257页

作者： Zhang, Xiaodan Zhang, Degan Qiao, Xiaodong Liang, Bing Peng, Hongtao Institute of Scientific and Technical Information of China Beijing 100038 China Tianjin Key Lab. of Intelligent Computing and Novel software Technology Tianjin University of Technology Tianjin 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin 300191 China Beijing Petroleum Managers Training Institute Beijing 100096 China

In order to support mobile service of long-distance monitoring and controlling UPS based on Web, a kind of design and implementation solution of embedded UPS (EUPS) system is brought forward in this paper. The design and implementation of system is based on ATmega161 and RTL8019AS with TCP/IP protocol suite for communication. In the EUPS system, an embedded file system is designed and implemented which can store the data and index information on a serial EEPROM chip in structured way and communicate with MCU through I2C bus. By embedding the file system into UPS system or other information appliances, users can browse and manipulate local data on the web client side. Based on our experimental tests, the performance of EUPS can meet the requirements of Web-based mobile services. © 2010 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Quantum State Reduction for Universal Measurement Based Computation

引用

Physical Review Letters 2010年第2期105卷 020502-020502页

作者： Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：