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

Learning to Rank for Blind Image Quality Assessment

IEEE Transactions on Neural Networks and Learning systems 2015年第10期26卷 2275-2290页

作者： Gao, Fei Tao, Dacheng Gao, Xinbo Li, Xuelong Video and Image Processing System Laboratory School of Electronic Engineering Xidian University Xi'an710071 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology 235 Jones Street Sydney UltimoNSW2007 Australia State Key Laboratory of Integrated Services Networks School of Electronic Engineering Xidian University Xi'an710071 China State Key Laboratory of Transient Optics and Photonics Xi'An Institute of Optics and Precision Mechanics Chinese Academy of Sciences Xi'an Shaanxi710119 China

Blind image quality assessment (BIQA) aims to predict perceptual image quality scores without access to reference images. State-of-the-art BIQA methods typically require subjects to score a large number of images to train a robust model. However, subjective quality scores are imprecise, biased, and inconsistent, and it is challenging to obtain a large-scale database, or to extend existing databases, because of the inconvenience of collecting images, training the subjects, conducting subjective experiments, and realigning human quality evaluations. To combat these limitations, this paper explores and exploits preference image pairs (PIPs) such as the quality of image Iais better than that of image Ibfor training a robust BIQA model. The preference label, representing the relative quality of two images, is generally precise and consistent, and is not sensitive to image content, distortion type, or subject identity;such PIPs can be generated at a very low cost. The proposed BIQA method is one of learning to rank. We first formulate the problem of learning the mapping from the image features to the preference label as one of classification. In particular, we investigate the utilization of a multiple kernel learning algorithm based on group lasso to provide a solution. A simple but effective strategy to estimate perceptual image quality scores is then presented. Experiments show that the proposed BIQA method is highly effective and achieves a performance comparable with that of state-of-the-art BIQA algorithms. Moreover, the proposed method can be easily extended to new distortion categories. © 2012 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Flocking of partially-informed multi-agent systems avoiding obstacles with arbitrary shape

引用

Autonomous Agents and Multi-Agent systems 2014年第5期29卷 943-972页

作者： Li, Jiaojie Zhang, Wei Su, Housheng Yang, Yupu Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Measurement and Control Technology Shanghai Dian Ji University Shanghai China School of Automation Key Laboratory of Image Information Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education National Key Laboratory of Science and Technology on Multispectral Information Processing Huazhong University of Science and Technology Wuhan China

In this paper, we study the flocking problem of multi-agent systems with obstacle avoidance, in the situation when only a fraction of the agents have information on the obstacles. Obstacles of arbitrary shape are allowed, no matter if their boundary is smooth or non-smooth, and no matter it they are convex or non-convex. A novel geometry representation rule is proposed to transfer obstacles to a dense obstacle-agents lattice structure. Non-convex regions of the obstacles are detected and supplemented using a geometric rule. The uninformed agents can detect a section of the obstacles boundary using only a range position sensor. We prove that with the proposed protocol, uninformed agents which maintain a joint path with any informed agent can avoid obstacles that move uniformly and assemble around a point along with the informed agents. Eventually all the assembled agents reach consensus on their velocity. In the entire flocking process, no distinct pair of agents collide with each other, nor collide with obstacles. The assembled agents are guaranteed not to be lost in any non-convex region of the obstacles within a distance constraint. Numerical simulations demonstrate the flocking algorithm with obstacle avoidance both in 2D and 3D space. The situation when every agent is informed is considered as a special case.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A secure distributed consensus scheme for wireless sensor networks against data falsification

A secure distributed consensus scheme for wireless sensor ne...

引用

World Congress on intelligent control and Automation (WCICA)

作者： Shichao Mi Hui Han Shanying Zhu Cailian Chen Bo Yang Xinping Guan Department of Automation Key Laboratory of System Control and Information Processing Shanghai P. R. China The State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System(CEMEE) Luoyang P. R. China

This paper focuses on the problem of secure distributed consensus to defend covert misbehavior in wireless sensor networks (WSNs). Distributed consensus is a promising method to improve the efficiency and precision of consensus results in WSNs, but it introduces new security issues that malicious nodes may manipulate false sensing data to degrade the sensing result of the whole network. A data falsification attack, i.e., the attacker injects random values into its neighboring nodes at each time-step of consensus process, is considered. This kind of attack cannot be defended against by most of existing detection mechanisms. We present a distributed detection mechanism with adaptive local threshold to isolate the abnormal nodes. A Weighted Averaging-based Consensus Scheme (WACS) is proposed to decrease the negative impact of the attack and make the network converge to a consensus value. It is proved that convergence property can be guaranteed by the relationship between weighted average of the noise and stochastic approximation. Simulation results are presented to show the effectiveness of the proposed secure scheme.

关键词： Sensors Wireless sensor networks Detection algorithms Distributed databases Convergence Vectors Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Coordinated obstacle avoidance with reduced interaction

引用

Neurocomputing 2014年 139卷 233-245页

作者： Jiaojie Li Wei Zhang Housheng Su Yupu Yang Hongtao Zhou Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China Department of Measurement and Control Technology Shanghai Dian Ji University Shanghai 200240 China School of Automation Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China

In this paper, we study the coordinated obstacle avoidance algorithm of multi-agent systems when only a subset of agents has obstacle dynamic information, or every agent has local interaction. Each agent can get partial measuring states information from its neighboring agent and obstacle. Coordinated obstacle avoidance here represents not only the agents moving without collision with an obstacle, but also the agents bypassing and assembling at the opposite side of the obstacle collectively, where the opposite side is defined according to the initial relative position of the agents to the obstacle. We focus on the collective obstacle avoidance algorithms for both agents with first-order kinematics and agents with second-order dynamics. In the situation where only a fixed fraction of agents can sense obstacle information for agents with first-order kinematics, we propose a collective obstacle avoidance algorithm without velocity measurements. And then we extend the algorithm to the case in switched topology. We show that all agents can bypass an obstacle and converge together, and then assemble at the opposite side of the obstacle in finite time, if the agents׳ topology graph is connected and at least one agent can sense the obstacle. In the case where obstacle information is available to only a fixed fraction of agents with second-order kinematics, we propose two collective obstacle avoidance algorithms without measuring acceleration when the obstacle has varying velocity and constant velocity. The switched topology is considered and extended next. We show that agents can bypass the obstacle with their positions and velocities approaching consensus in finite time if the connectivity of switched topology is continuously maintained. Several simulation examples demonstrate the proposed algorithms.

关键词： Obstacle avoidance Consensus Reduced interaction Circular motion Multi-agents

来源：评论

学校读者我要写书评

暂无评论

Using artificial plant optimization algorithm with dynamic population and cluster methods to optimize the performance of DV-Hop

引用

Sensor Letters 2014年第8期12卷 1313-1317页

作者： Wu, Xuexue Cui, Zhihua Dai, Chaohua Chen, Weirong Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Shanxi China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Electric Engineering Southwest Jiaotong University Sichuan China

Artificial plant optimization algorithm is a novel stochastic population-based evolutionary algorithm by simulating the plant growing process. In this paper, a new variant, which is called APOA-DC is proposed by incorporating with dynamic population size and cluster methods, furthermore, to investigate the performance, APOA-DC is applied to optimize the DV-Hop localization algorithm, simulation results show it achieves better performance than the DV-Hop algorithm.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved low energy adaptive clustering hierarchy protocol based on local centroid bat algorithm

引用

Sensor Letters 2014年第9期12卷 1372-1377页

作者： Cao, Yang Cui, Zhihua Li, Feixiang Dai, Chaohua Chen, Weirong Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Shanxi China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Electric Engineering Southwest Jiaotong University Sichuan China

Bat algorithm (BA) is a novel intelligent optimization algorithm. In order to improve the poor local search capability of the algorithm, we present a new variant of bat optimization algorithm based on local centroid strategy (LCBA). Meanwhile, LEACH is a low energy adaptive clustering hierarchy algorithm for wireless sensor networks (WSN). And it has many disadvantages such as random selection of cluster head, taking no account of the remaining energy and position of nodes. To solve these problems, this paper proposes an improved LEACH protocol based on local centroid bat algorithm. The improved protocol divides the cluster head selection process into optimization of temporary cluster head and formal cluster head selection. First, we generate temporary cluster heads by traditional LEACH protocol, then optimize these cluster heads based on LCBA and select formal cluster heads according to the remaining energy of nodes. The result of experiment shows that, comparing with LEACH, LEACH-LCBA can balance the network load efficiently, improve the energy utilization, prolong the network lifetime.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Swarm aggregations of heterogeneous multi-agent systems

引用

International Journal of control 2014年第12期87卷 2594页

作者： Liang, Haili Su, Housheng Wang, Xiaofan Chen, Michael Z.Q. [a] Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China[b] School of Automation Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China[c] Department of Mechanical Engineering The University of Hong Kong Hong Kong

This paper investigates the problem of swarm aggregations of heterogeneous multi-agent systems. Comparing with the existing studies on swarm aggregations of homogeneous multi-agent systems, this paper is much more resembling the practical situations, where the agents have different dynamics. We show that the heterogeneous agents will gather with a certain error under some assumptions and conditions. The stability properties have been proven by theoretical analysis and verified via numerical simulation. The stability of the heterogeneous multi-agent systems has been achieved based on matrix theory and the Lyapunov stability theorem. Numerical simulation is given to demonstrate the effectiveness of the theoretical result. [PUBLICATION ABSTRACT]

关键词： swarm multi-agent systems heterogeneous systems stability

来源：评论

学校读者我要写书评

暂无评论

Distributed differential evolution algorithm with adaptive parameters

引用

Kongzhi yu Juece/control and Decision 2014年第4期29卷 701-706页

作者： Zhang, Chun-Mei Chen, Jie Xin, Bin School of Automation Ministry of Education Beijing Institute of Technology Beijing 100081 China Key Laboratory of Complex System Intelligent Control and Decision Ministry of Education Beijing Institute of Technology Beijing 100081 China School of Electronic Information Engineering Taiyuan University of Science and Technology Taiyuan 030024 China

An adaptive distributed differential evolution algorithm is proposed based on the change of the individual's fitness value. Firstly, the initial population is divided into several subpopulations. When the migration condition is satisfied, the best individual in each subpopulation will replace the worst individual of its neighbor subpopulations according to the Von Neumann topology. The migration mechanism among subpopulations enables the information to be communicated in the whole population. Meanwhile, the adaptive mechanism of F and CR is presented for assigning different F and CR to each individual according to the individual's fitness. Numerical results show that, the proposed algorithm is beneficial to explore the solution space, which can avoid the premature convergence and search the excellent solutions.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

The trading between virtual mobile operator and wireless service provider in the two-tier Femtocell network

The trading between virtual mobile operator and wireless ser...

引用

8th International Conference on Wireless Algorithms, systems, and Applications, WASA 2013

作者： Yang, Fan Yang, Bo Guan, Xinping Department of Automation Shanghai Jiao Tong University China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University China Key Laboratory of Education Ministry for Image Processing and Intelligent Control Shanghai Jiao Tong University China

ISBN: (纸本)9783642397004

This paper considers the problem that the virtual mobile operator (VMO) buys services from the wireless service provider (WSP) to serve its users. When faced with poor indoor coverage or at the edge of marcocell, the WSP would ask nearby femto base stations (FBSs) to help serve the VMO. We focus on the interesting questions when the WSP prefers to ask help from FBSs and how WSP, VMO and FBSs adjust their strategies to maximize their profits. A two-stage Stackelberg game is built for the situation when the WSP serve the VMO by itself and a four-stage Stackelberg game is considered when the WSP rents FBSs by offering spectrum bands to FBSs. We firstly define the utility functions of VMO, WSP and FBSs to reflect their satisfaction and cost in participating into the game and then give the analysis based on the backward induction method. Meanwhile, the competition among FBSs when the WSP allocates spectrum bands for FBSs' help is formulated as a non-cooperative spectrum competition game (NSCG) and the existence and uniqueness of the Nash equilibrium in NSCG is proved. Simulation results of the two service modes show the WSP can obtain more profits through renting FBSs in poor coverage areas. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：