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

Moving vehicle detection and tracking in traffic images based on horizontal edges

Telkomnika - Indonesian Journal of Electrical Engineering 2013年第11期11卷 6477-6483页

作者： Zhu, Hongjin Fan, Honghui Guo, Shuqiang School of Computer Engineering Jiangsu University of Technology Changzhou 213001 Jiangsu China Key Laboratory of Cloud Computing Intelligent Information Processing of Changzhou City China School of Information Engineering Northeast Dianli University Jilin 132012 Jilin China

This paper presents a moving vehicle detection and tracking system, which comprising of Horizontal Edges method and Local Auto Correlation. Horizontal Edges characteristic can be strengthened and the influence of weather condition is reduced by using Local Auto Correlation, so the detection rate of extracting and tracking moving vehicles with horizontal edge can be raised. Local Auto Correlation images are generated for vehicle detection and based on Horizontal Edges method. The distance of the gravity center of Horizontal Edges is used to track vehicles in traffic video. We verify the system using a variety of weather (in fog, car shadow existence, morning and evening) traffic video. Experimental results have shown that the high detection rate of moving vehicles be obtained by using the proposed method. © 2013 Universitas Ahmad Dahlan.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

A Fast Calculation of Metric Scores for Learning Bayesian Network

引用

International Journal of Automation and computing 2012年第1期9卷 37-44页

作者： Qiang Lv Xiao-Yan Xia Pei-De Qian School of Computer Science and Technology Soochow University Suzhou 215006 PRC Jiangsu Provincial Key Lab for Computer Information Processing Technology Suzhou 215006 PRC

Frequent counting is a very so often required operation in machine learning algorithms. A typical machine learning task, learning the structure of Bayesian network （BN） based on metric scoring, is introduced as an example that heavily relies on frequent counting. A fast calculation method for frequent counting enhanced with two cache layers is then presented for learning BN. The main contribution of our approach is to eliminate comparison operations for frequent counting by introducing a multi-radix number system calculation. Both mathematical analysis and empirical comparison between our method and state-of-the-art solution are conducted. The results show that our method is dominantly superior to state-of-the-art solution in solving the problem of learning BN.

关键词： Frequent counting radix-based calculation ADtree learning Bayesian network metric score

来源：评论

学校读者我要写书评

暂无评论

A NOVEL ENDMEMBER EXTRACTION METHOD USING MODIFIED MAXIMUM SPECTRAL SCREENING

A NOVEL ENDMEMBER EXTRACTION METHOD USING MODIFIED MAXIMUM S...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Hongjun Su Peijun Du Qian Du School of Earth Sciences and Engineering Hohai University China Jiangsu Provincial Key Laboratory of Geographic Information Science and Technology Nanjing University China Department of Electrical and Computer Engineering Mississippi State University USA

ISBN: (纸本)9781479911127

Endmember extraction is an important task for hyperspectral analysis;the accurate identification of endmembers enables efficient spectral unmixing and classification. In the paper, a new endmember extraction algorithm based on a modified MSS approach with LP error as initial spectrum selection algorithm, and OPD measure as similarity is proposed. The endmembers extracted by modified MSS are more similar than that of MSS algorithm;from the experiments results, it has proved that our proposed method outperforms the existed MSS and N-FINDR algorithms.

关键词： Hyperspectral imagery spectral screening endmember extraction OPD hyperspectral imagery Manuscripts Spiroplasma kunkelii Screening

来源：评论

学校读者我要写书评

暂无评论

Verifiable Fully Homomorphic Encryption scheme

Verifiable Fully Homomorphic Encryption scheme

引用

2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012

作者： Jin, Fangyuan Zhu, Yanqin Luo, Xizhao Department of Computer Science and Technology Soochow University Suzhou China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other p... 详细信息

ISBN: (纸本)9781457714153

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Structures on Multigranulation Spaces

引用

Journal of computer Science & technology 2012年第6期27卷 1169-1183页

作者：杨习贝钱宇华杨静宇 School of Computer Science and Engineering Jiangsu University of Science and Technology School of Computer Science and Technology Nanjing University of Science and Technology Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University

Though many hierarchical structures have been proposed to analyze the finer or coarser relationships between two granulation spaces, these structures can only be used to compare the single granulation spaces. However, it should be noticed that the concept of multigranulation plays a fundamental role in the development of granular computing. Therefore, the comparison between two multigranulation spaces has become a necessity. To solve such problem, two types of the multigranulation spaces are considered： one is the partition-based multigranulation space, the other is the covering-based multigranulation space. Three different hierarchical structures are then proposed on such two multigranulation spaces, respectively. Not only the properties about these hierarchical structures are discussed, but also the relationships between these hierarchical structures and the multigranulation rough sets are deeply investigated. It is shown that the first hierarchical structure is consistent with the monotonic varieties of optimistic multigranulation rough set, and the second hierarchical structure is consistent to the monotonic varieties of pessimistic multigranulation rough set, the third hierarchical structure is consistent to the monotonic varieties of both optimistic and pessimistic multigranulation rough sets.

关键词： hierarchical structure multicovering rough set multigranulation rough set multigranulation space

来源：评论

学校读者我要写书评

暂无评论

A processing method for inconsistent answer set programs based on minimal principle

A processing method for inconsistent answer set programs bas...

引用

International Conference on Automatic Control and Artificial Intelligence, ACAI 2012

作者： Zhu, Tao Zhang, Zhizheng Zhai, Yuqing Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou China

ISBN: (纸本)9781849195379

Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.

关键词： processing

来源：评论

学校读者我要写书评

暂无评论

Contourlet HMT model with directional feature

引用

Science China(information Sciences) 2012年第7期55卷 1563-1578页

作者： WANG XiangHai 1,2,3 ,CHEN MingYing 1 ,SONG ChuanMing 1,2 ,XU MengChun 1 & FANG LingLing 3 1 College of computer and information technology,Liaoning Normal University,Dalian 116029,China 2 State key laboratory for Novel Software technology,Nanjing University,Nanjing 210093,China 3 provincial key laboratory for computer information processing technology,Soochow University,Suzhou 215006,China 1. College of Computer and Information Technology Liaoning Normal University Dalian 116029 China2. State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China3. Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

According to Shanno's information theory,the directional feature of texture is defined as the value of directional variable when an image signal attains a singularity of random *** terms of this definition,we calculate the texture's directional features using Tamura's method and study the directional probability distribution of Contourlet *** we find that the directional features tend to be conveyed across parent and child *** on this conclusion,we establish a novel probability distribution model of hidden direction variables under the condition of hidden state variable's distribution,named Contourlet HMT model with directional *** structure and training method of the model are presented as ***,an unsupervised context-based image segmentation algorithm is proposed on the basis of the proposed *** effectiveness is verified via extensive experiments carried out on several synthesized images and remote sensing images.

关键词： directional feature Contourlet HMT Contourlet HMT with directional feature unsupervised texture segmentation

来源：评论

学校读者我要写书评

暂无评论

Answer set programming with uncertain facts

Answer set programming with uncertain facts

引用

2012 International Conference on computer Science and Service System, CSSS 2012

作者： Sha, Lei Zhang, Zhizheng Department of Transportation Management Nanjing Institute of Railway Technology Nanjing China School of Computer Science and Engineering Southeast University Nanjing China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University China

ISBN: (纸本)9780769547190

We introduce a new logic programming paradigm-answer set programming with uncertain facts (LPuF for short). A LPuF program is an extension of answer set programs (ASP for short). We first define the syntax of LPuF programs. Then, we propose preferred query semantics and preferred solution semantics of LPuF programs to address the issues of personal preference-dependent query generation and solution ranking in recommendation systems. Those semantics are based on the answer set semantics of logic programs. Correspondingly, we then present two algorithms which are used for computing preferred queries and preferred solutions respectively. Finally, we conclude the paper and present future works. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Communication network designing:Transmission capacity,cost and scalability

引用

Science China(information Sciences) 2012年第11期55卷 2454-2465页

作者： ZHANG GuoQiang1,2,3 & ZHANG GuoQing1 1Institute of Computing technology,Chinese Academy of Sciences,Beijing 100190,China 2School of computer Science and technology,Nanjing Normal University,Nanjing 210046,China 3provincial key laboratory for computer information processing technology,Soochow University,Suzhou 215000,China 1. Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China2. School of Computer Science and Technology Nanjing Normal University Nanjing 210046 China3. Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215000 China

Despite the growing number of works centering around the traffic dynamics on complex networks,these researches still have some common shortcomings,e.g.,too simple traffic flow model and lack of considerations for the designing cost and scalability *** paper builds on a more realistic traffic flow model,and offers a holistic view on the network designing *** addition to the extensively studied transmission capacity,this paper takes designing cost and scalability as two other designing objectives,and presents a quantitative study of how different designing choices independently and collectively influence these objectives by the introduction of a cartesian coordinate *** is shown that different kinds of network topologies display different shapes of achievable solution spaces and exhibit different abilities to achieve cost-effective and scalable *** particular,we find the philosophy underlying empirical network designing and engineering today fails to meet the cost-effective and scalable designing requirements,and propose a cost-effective and scalable designing scheme for BA-like networks,i.e.,the efficient routing combined with effective betweenness based link bandwidth *** addition,when designing a thoroughly new network from the beginning,we find that ER network is a good candidate to achieve cost-effective and scalable designing in most settings.

关键词： cost-effective communication network designing network transmission efficiency network topology traffic dynamics next generation network scalable network designing

来源：评论

学校读者我要写书评

暂无评论

A calculus of higher order safe ambients and its bisimulations

A calculus of higher order safe ambients and its bisimulatio...

引用

IEEE 6th International Symposium on Theoretical Aspects of Software Engineering, TASE 2012

作者： Cao, Zining Department of Computer Science and Technology Nanjing University of Aero. and Astro. Nanjing 210016 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

ISBN: (纸本)9780769547510

In this paper, we present a higher order ambient calculus HSAP, which is a higher order extension of SAP calculus. In HSAP, we extend higher order communication capability and administrator interaction capability. Higher order communication capability means that an ambients can be send to another ambients. Administrator interaction capability means that an ambients can interact with any ambients if the password is matched. Then, we give a LTS based operational semantics for HSAP and two labelled bisimulations, called early bisimulation and late bisimulation. Early bisimulation is proved to coincide with reduction barbed congruence. Furthermore, we present late bisimulation, quasi late bisimulation, concise quasi late bisimulation and quasi normal bisimulation for HSAP and study the relation between these bisimulations. Finally, we study the expressiveness of HSAP. © 2012 IEEE.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：