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

Optical flow computation based on spline functionals

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition) 2013年第SUPPL.1期43卷 165-168页

作者： Guo, Xiao-Xin Yang, Guang Xu, Zhi-Wen College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

A mathematical model using the spline functional as smooth constraints was presented. The second-and fourth-order partial differential equations constraints were two special cases in the model. The necessary condition for optical flow minimization problem solution was also presented. This model provided a basis for formal representation and numerical computation of optical flow from a methodological point of view. The significance of this mathematical model lay in the simplification of the equations for optical flow computation into linear algebraic equations. The simplification can contribute to discrete representation of the optical flow equation, and also verify that the use of smoothness constraints can ensure the existence and uniqueness of the solution from the view of the algebraic equations.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Intensity preserving technology in image restoration

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition) 2013年第SUPPL.1期43卷 106-109页

作者： Guo, Xiao-Xin Xu, Zhi-Wen Che, Xiang-Jiu College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

A new approach of image restoration for the sequence of fluorescein angiography was proposed. First, the intensity constraint was incorporated into Miller regularization equation to obtain the ability to preserve the high intensity of pixels. Thus, the restored image would be influenced not only by the smoothness constraints, but also by the intensity constraints. Secondly, in the process of the restoration, we use an intensity template obtained from the pre-filtering procedure was used to achieve the intensity constraints. The template represented an image composed by the desired intensity value. The experiments show that the proposed scheme gains a better result in both high intensity preservation and image restoration.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Algorithmic challenges in structure-based drug design and NMR structural biology

引用

Frontiers of Electrical and Electronic Engineering in China 2012年第1期7卷 69-84页

作者： Lincong WANG Shuxue ZOU Yao WANG College of Computer Science and Technology The Joint Center for Systems Biology of Jilin University and the University of Georgia Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineer-ing of Ministry of Education Jilin University Changchun 130012China

The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly by two techniques： X-ray crystallog- raphy and nuclear magnetic resonance （NMR） spec- troscopy. Because neither X-ray crystallography nor NMR spectroscopy could directly measure the positions of atoms in a biomolecule, algorithms must be designed to compute atom coordinates from the data. One salient feature of most NMR structure computation algorithms is their reliance on stochastic search to find the lowest energy conformations that satisfy the experimentally- derived geometric restraints. However, neither the cor- rectness of the stochastic search has been established nor the errors in the output structures could be quantified. Though there exist exact algorithms to compute struc- tures from angular restraints, similar algorithms that use distance restraints remain to be developed. An important application of structures is rational drug design where protein-ligand docking plays a crit- ical role. In fact, various docking programs that place a compound into the binding site of a target protein have been used routinely by medicinal chemists for both lead identification and optimization. Unfortunately, de- spite ongoing methodological advances and some success stories, the performance of current docking algorithms is still data-dependent. These algorithms formulate the docking problem as a match of two sets of feature points. Both the selection of feature points and the search for the best poses with the minimum scores are accomplished through some stochastic search methods. Both the un- certainty in the scoring function and the limited sam- pling space attained by the stochastic search contribute to their failures. Recently, we have developed two novel docking algorithms： a data-driven docking algorithm and a general docking algorithm that does not re

关键词： structure-based drug design （SBDD） vir- tual screening （VC） protein-ligand docking scoring function molecular dynamics （MD） Monte Carlo （MC） simulated annealing （SA） Markov chain Monte Carlo （MCMC） nuclear magnetic resonance （NMR） nuclear Overhauser effect （NOE） residual dipolar couplings （RDCs） chemical shift （CS） inference structure deter- mination （ISD） Bayesian Gibbs sampling probabil- ity distribution functions （PDFs） degrees of freedom （DOF） van der Waals （VDW） root mean square devi- ation （RMSD） manifold Poisson-Boltzmann equation （PBE）

来源：评论

学校读者我要写书评

暂无评论

Speech separation in the vehicle environment based on fastICA algorithm

引用

Journal of Multimedia 2012年第1期7卷 33-40页

作者： Zhang, Jindong Qin, Guihe Liu, Ye College of computer science and technology Jilin University Changchun China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun China

The speech interaction in-vehicle was mainly realized by the speech recognition. The human-machine interaction around was usually disturbed by the noise, and the speech received by the receiver was not the original pure speech, so compared to the pure environment, the accuracy of the speech recognition declined so sharply that it could not meet the demand of the practical application of human- machine interaction. So the speech recognition was required to have the strong adaptability and processing capacity to the speech with noise. In this paper, the FastICA algorithm in signal process and statistics was studied and used to separate the driver's speech in the vehicle environment, and realizes the pretreatment in recognizing driver's speech. The effectiveness of the method had been validated in actual vehicle experimental configuration. © 2012 Academy Publisher.

关键词： Speech processing

来源：评论

学校读者我要写书评

暂无评论

Improving the Recommendation of Collaborative Filtering by Fusing Trust Network

Improving the Recommendation of Collaborative Filtering by F...

引用

International Conference on computational Intelligence and Security

作者： Bo Yang Pengfei Zhao Shuqiu Ping Jing Huang School of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun P.R.China

To accurately and actively provide users with their potentially interested information or services is the main task of a recommender system. Collaborative filtering is one of the most widely adopted recommender methods, whereas it is suffering the issue of sparse rating data that will severely degenerate the quality of recommendations. To address this issue, the article proposes a novel method, named the FTRA (Fusing Trust and Ratings), trying to improve the performance of collaborative filtering recommendation by means of elaborately integrating twofold sparse information, i.e., the conventional rating data given by users and the social trust network among the same users. The performance of FTRA is rigorously validated by comparing it with six representative methods on a real-world dataset. The experimental results show that the FTRA outperforms all other competitors in terms of both precision and recall. More importantly, our work suggests that the strategy of augmenting sparse rating data by fusing trust networks does significantly improve the quality of conventional collaborative filtering recommendation, and its quality could be further improved by means of designing more effective integrating schemes.

关键词： Collaboration Recommender systems Measurement Social network services Web sites Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A hybrid optimization algorithm for the multi-chromosomal reversal median problem

A hybrid optimization algorithm for the multi-chromosomal re...

引用

1st International Conference on Engineering and Technology Innovation, ICETI 2011

作者： Zhang, Yi Zhang, Meng Department of Computer Science Jilin Business and Technology College Changchun 130062 China Military Simulation Technology Institute Air Force Aviation University Changchun130022 China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9783037853245

In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome into TSP maps at first. Then we use a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the problem. In our improved algorithm, we increase the search speed by implement multi-branch parallel search of ACO. Our extensive experiments on simulated datasets show that this median solver is efficient.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Improved cross-media relevance model for automatic image annotation

引用

ICIC Express Letters, Part B: Applications 2012年第5期3卷 1231-1237页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Bao, Cuizhu Liu, Yongkui Xu, Lu Institute of Computer Graphics and Image Processing Dalian Nationalities University No. 18 Liaohe Road Economic and Technological Development Zone-Dalian 116600 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University No. 2699 Qianjin Avenue Changchun 130012 China

Automatic image annotation has been an active research topic in the last decade due to its potentially large impact on image retrieval, object recognition and image understanding. Many approaches have been proposed for image annotation in recent years. The most influential annotation model is relevance model, whose representative algorithm is Cross-Media Relevance Model (CMRM). In this paper, to overcome the shortcomings of the original CMRM, we propose improved CMRM. In the improved CMRM, the annotation word distribution is estimated using binary probability, the significance of blob is discriminately depicted using TF-IDF (term frequency-inverse document frequency) schemes, and the similarity measurement of blob is based on blob and continuousvalued feature vector. The experimental results on the standard Corel5K dataset show that our proposed approach outperforms the original CMRM by about 111% and 73% in terms of F1 and N+ measures respectively. The improved CMRM can get better performance in specific domains such as cultural heritage and special necessities digitization for ethnic minorities. © 2012 ICIC International.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

An approach for calculating semantic similarity between words using WordNet

An approach for calculating semantic similarity between word...

引用

2011 2nd International Conference on Digital Manufacturing and Automation, ICDMA 2011

作者： Hao, Dou Zuo, Wanli Peng, Tao He, Fengling College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (纸本)9780769544557

This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A study on improved hidden Markov models and applications to speech recognition

A study on improved hidden Markov models and applications to...

引用

2011 International Conference on Computer Science and Service System, CSSS 2011

作者： Zhang, Zeliang Li, Xiongfei Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Beihua University Jilin China

ISBN: (纸本)9781424497638

Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the frozen image is stored. It ignores the very nature and time changes. This method is very simple, but it's just simple elements can be classified, then it may not show significant speech recognition services. Behavior was characterized by more and more common. Because of the hidden Markov model is superior (HMM), which can be widely used in speech recognition. In recent years, is also used to lip reading identification. Classical HMM model, so that the two assumptions: hidden assumptions collected: in t+1 the state can only be in this country is not in the state before t;from the hidden visible state hypothesis: only by regulating the t hide the visible state, rather than the previous state. This hypothesis is not very useful in some applications (such as lip reading) is reasonable. Under certain conditions, in the t state not only limits the t1, but also t2. Therefore, this study modified the assumptions of the classical HMM to derive a new HMM model and algorithms, and applied to the lip-reading recognition is increasing discrimination. © 2011 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Communities detection with applications to real-world networks analysis

Communities detection with applications to real-world networ...

引用

2011 7th International Conference on computational Intelligence and Security, CIS 2011

作者： Yang, Bo School of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9780769545844

Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions of networks. Previously, we have proposed a probabilistic algorithm called the NCMA to efficiently as well as effectively mine communities from real-world networks. Here, we show that the NCMA can be readily extended and applied to address a wide range of network oriented applications beyond community detection including ranking, characterizing and searching real-world networks. © 2011 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：