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

Copyright Protection Using A computational Watermarking Scheme

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Qi Jiang Dongfeng Han Yi Li Wenhui Li Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time human vision system is considered to get perceptual results. We design an elaborate function for blind watermarking scheme. This function can dynamically determine the embedding position. The theory and experimental results show that our method successfully survives image processing operation, noise adding, the JPEG lossy compression and image cropping. Especially, the scheme is robust towards image sharpening and image enhancement.

关键词： copyright protection watermark wavelet tree

来源：评论

学校读者我要写书评

暂无评论

Mutual conversion of regression and classification based on least squares support vector machines

Mutual conversion of regression and classification based on ...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Jiang, Jing-Qing Song, Chu-Yi Wu, Chun-Guo Liang, Yang-Chun Yang, Xiao-Wei Hao, Zhi-Feng Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tongliao 028043 China Key Laboratory of Information Science and Engineering Beijing Jiaotong University Railway Ministry Beijing 100044 China School of Mathematical Science South China University of Technology Guangzhou 510640 China

ISBN: (纸本)354034439X

Classification and regression are most interesting problems in the fields of pattern recognition. The regression problem can be changed into binary classification problem and least squares support vector machine can be used to solve the classification problem. The optimal hyperplane is the regression function. In this paper, a one-step method is presented to deal with the multi-category problem. The proposed method converts the problem of classification into the function regression problem and is applied to solve the converted problem by least squares support vector machines. The novel method classifies the samples in all categories simultaneously only by solving a set of linear equations. Demonstrations of numerical experiments are performed and good performances are obtained. Simulation results show that the regression and classification can be converted each other based on least squares support vector machines. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Communities Detection with Applications to Real-World Networks Analysis

Communities Detection with Applications to Real-World Networ...

引用

International Conference on computational Intelligence and Security

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

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.

关键词： Communities Probability distribution Dolphins Social network services Probabilistic logic Prediction algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A kind of improving HMM model and using in the visual speech recognition

A kind of improving HMM model and using in the visual speech...

引用

International Conference on Computer Science and Service System (CSSS)

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

Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between characters from the frozen pictures and templates being stored. It neglects the character is changing with time. This method is very simply, but it only can classify the simple elements not the words, so it couldn't render great serves to speech recognition. Afterwards the adoption of behavioral characteristics is becoming more widespread. Because of the superior of Hidden Markov model (HMM), it can be applied in speech recognition widely. In recent years, it is also used in the research of lip-reading recognition. The classical HMM model makes two hypotheses: hidden expropriation hypothesis: the state at t+1 is only conditioned by the state at t, not the state before; the expropriation hypothesis from hidden state to visible state: the visible state at t only conditioned by the hidden state at t, not the state before. Such kind of hypothesis is not very reasonable in some practical application (such as lip-reading). In some kind condition, the state at t is not only conditioned by t-1, but also t-2. Therefore this thesis revises the assumed condition classical HMM to derive a new HMM model and algorithm, and applying it into lip-reading recognition to increase the discrimination.

关键词： Hidden Markov models Viterbi algorithm Speech recognition knowledge engineering Laboratories Electronic mail Medical services

来源：评论

学校读者我要写书评

暂无评论

An Approach for Calculating Semantic Similarity between Words Using WordNet

An Approach for Calculating Semantic Similarity between Word...

引用

International Conference on Digital Manufacturing and Automation (ICDMA)

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

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.

关键词： Semantics Humans computational modeling Correlation Educational institutions Benchmark testing Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

Independent and Collaborative Demosaicking Neural Networks 5

Independent and Collaborative Demosaicking Neural Networks

引用

5th ACM International Conference on Multimedia in Asia, MMAsia 2023

作者： Niu, Yan Zhang, Lixue Li, Chenlai State Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun China College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Shenzhen Polytechnic University Shenzhen China

ISBN: (纸本)9798400702051

Existing demosaicking neural models generally reconstruct the red, green and blue channels by one unified network. This has the advantage of allowing the RGB channels to share latent features. However, it is unnoticed that the training samples are severely unbalanced among the three channels. As a consequence, a unified model trained to fit the red or blue sample distributions is prone to under-fit the green samples. In this paper, we demonstrate the existence of such conflicts, and analyze the reason behind this phenomenon. To solve this disadvantage, we decouple the traditional three-in-one demosaicking to three independent but collaborative sub-tasks, respecting the distribution of samples in each spectrum. We show that, by our decoupling strategy, a very simple architecture can achieve high accuracy with high efficiency. For substantiation, we construct a model that has merely 1.3M parameters in total, and compares its accuracy to state of the art methods of similar or larger model size, across a wide variety of benchmark datasets. The proposed independent and collaborative architecture gains performance improvement over comparable models in both accuracy and inference time. © 2023 Copyright held by the owner/author(s).

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Friend Recommendation System Based on Geolocation and Contents of Users

Friend Recommendation System Based on Geolocation and Conten...

引用

2018 International Conference on Computer Modeling, Simulation and Algorithm（CMSA2018）

作者： Mingyue Duan Jing Huang Jiaxuan Zhang Yunjie Tian Dongwei Li Bin Wang College of Computer Science and Technology Jilin university Key Laboratory of Symbol Computation and Knowledge Engineering (Jilin university) Ministry of Education

ISBN: (纸本)9781510864696

In recent years, with the rapid development of wireless mobile network and smart phone operating systems, various social software based on wireless Internet has emerged one after another. Current popular social software such as QQ and We Chat have become important tools for people to meet new friends. At present, existing social software can recommend other users in the vicinity according to the geographical location of the user. However, this method does not consider the user's interests, hobbies, etc. So that the effectiveness of such a friend recommmendation system is often unsatisfactory. In order to solve the above problems, a personalized friend recommendation system based on geolocation information and user content is designed and developed. In this system, not only the geolocation information of the user is considered, but also the features of the user's published statuses are extracted, aiming to recommend more similar other users to the user. After testing, the effectiveness of the proposed method is verified.

关键词： instant message friend recommendation geolocation information context information

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Computer Science and Service System (CSSS)

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

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 t-1, but also t-2. 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.

关键词： Hidden Markov models Mouth Speech recognition Cost accounting Training Viterbi algorithm Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows

An Ant Colony Optimization Method for Prize-collecting Trave...

引用

International Conference on Natural computation (ICNC)

作者： Xiaohu Shi Liupu Wang You Zhou Yanchun Liang Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

Focused on a variation of the Euclidean traveling salesman problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving method. The time window constraints are considered in the computation for the probability of selection of the next city. The parameters of the algorithm are analyzed by experiments. Numerical results also show that the proposed method is effective for the PCTSPTW problem.

关键词： Ant colony optimization Traveling salesman problems Cities and towns Algorithm design and analysis Time factors Performance analysis Educational institutions Computer science Educational technology Laboratories

来源：评论

学校读者我要写书评

暂无评论

Learning hybrid Bayesian network based on divide and conquer strategy

引用

Journal of computational Information Systems 2007年第2期3卷 583-588页

作者： Wang, Limin Xu, Peijuan Li, Xiongfei Li, Xiaolin Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China Department of Computer Science and Technology Nanjing University Nanjing 210093 China

We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence among feature subset;a model we refer to as the Augmented Naive Bayes (ANB) classifier. ANB relaxes the independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains show that ANB has clear advantages with respect to the generalization ability.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：