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

24th International Conference on Control Systems and computer science, CSCS 2023

作者： Furdu, Iulian Pruteanu, Eusebiu Nitu, Costica University Vasile Alecsandri of Bacau Department of Mathematics and Informatics Bacau Romania University Vasile Alecsandri of Bacau Department of Energy and Computer Science Bacau Romania Polytechnic University Department of Intelligent Robotics Bucharest Romania

ISBN: (纸本)9798350313390

Wireless Sensor Systems (WSN) is a broad, exciting area with new perspectives and growing growth over the past decades, where more research is being done. WSNs contain many (hundreds of thousands) of micro-sized, cheap chips, powered by low-cost wireless interconnected batteries. These chips are called nodes, which could be of several types, including acoustic, radar, low-frequency magnetic, thermal, and visual sampling frequencies. Many applications are based nowadays on WSN, such as environmental control, smart cities, wildlife monitoring, vehicles and infrastructure, natural disasters, home security, underwater investigations, military, airplane surveillance and drone body sensors. One of the aims of the paper is to develop a smart architecture based on intelligent microprocessor sensors, WSN802GCA/GPA and the software needed to operate with a TINI control unit. TINI allows this system to be connected to Ethernet via TCP/IP © 2023 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

MULTI-CAMERA POSITIONING FOR AUTOMATED TRACKING SYSTEMS IN DYNAMIC ENVIRONMENTS

引用

International Journal of Information Acquisition 2010年第3期7卷 225-242页

作者： YI YAO CHUNG-HAO CHEN BESMA ABIDI DAVID PAGE ANDREAS KOSCHAN MONGI ABIDI Visualization and Computer Vision Lab GE Global Research USA Department of Mathematics and Computer Science North Carolina Central University USA Imaging Robotics and Intelligent Systems Lab University of Tennessee Knoxville USA

Most existing camera placement algorithms focus on coverage and/or visibility analysis, which ensures that the object of interest is visible in the camera's field of view (FOV). According to recent literature, handoff safety margin is introduced to sensor planning so that sufficient overlapped FOVs among adjacent cameras are reserved for successful and smooth target transition. In this paper, we investigate the sensor planning problem when considering the dynamic interactions between moving targets and observing cameras. The probability of camera overload is explored to model the aforementioned interactions. The introduction of the probability of camera overload also considers the limitation that a given camera can simultaneously monitor or track a fixed number of targets and incorporates the target's dynamics into sensor planning. The resulting camera placement not only achieves the optimal balance between coverage and handoff success rate but also maintains the optimal balance in environments with various target densities. The proposed camera placement method is compared with a reference algorithm by Erdem and Sclaroff. Consistently improved handoff success rate is illustrated via experiments using typical office floor plans with various target densities.

关键词： Sensor planning visual surveillance multiple camera systems camera handoff

来源：评论

学校读者我要写书评

暂无评论

The Third International Conference on human-robot interaction

The Third International Conference on human-robot interactio...

引用

作者： Fong, Terry Dautenhahn, Kerstin Scheutz, Matthias Demiris, Yiannis Intelligent Robotics Group NASA Ames Research Center Department of Artificial Intelligence School of Computer Science University of Herfordshire Herfordshire United Kingdom Adaptive Systems Research Group University of Herfordshire Herfordshire United Kingdom Department of Cognitive Science Computer Science and Informatics Cognitive Science Program Indiana University Bloomington IN United States Intelligent Robotics Team Department of Electrical Engineering Imperial College London London United Kingdom

The third international conference on Human-Robot Interaction (HRI-2008) was held in Amsterdam, The Netherlands, March 12-15, 2008. The theme of HRI-2008, "living with robots," highlights the importance of the technical and social issues underlying human-robot interaction with companion and assistive robots for long-term use in everyday life and work activities. More than 250 researchers, practitioners, and exhibitors attended the conference, and many more contributed to the conference as authors or reviewers. HRI-2009 will be held in San Diego, California, from March 11-13, 2009. Copyright © 2008, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Recent Trends in Applied Artificial Intelligence 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Moonis Ali Tibor Bosse Jan Treur Koen V. Hindriks Catholijn M. Jonker Mark Hoogendoorn

ISBN: (数字)9783642385773

ISBN: (纸本)9783642385766

This volume constitutes the thoroughly refereed conference proceedings of the 26th International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2013, held in Amsterdam, The Netherlands, in June 2013. The total of 71 papers selected for the proceedings were carefully reviewed and selected from 185 submissions. The papers focus on the following topics: auctions and negotiation, cognitive modeling, crowd behavior modeling, distributed systems and networks, evolutionary algorithms, knowledge representation and reasoning, pattern recognition, planning, problem solving, robotics, text mining, advances in recommender systems, business process intelligence, decision support for safety-related systems, innovations in intelligent computation and applications, intelligent image and signal processing, and machine learning methods applied to manufacturing processes and production systems.

关键词： Artificial Intelligence Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery computer Imaging, vision, Pattern Recognition and Graphics computer science, general

来源：评论

学校读者我要写书评

暂无评论

Sentiment recognition in egocentric photostreams

arXiv

引用

arXiv 2017年

作者： Talavera, Estefania Strisciuglio, Nicola Petkov, Nicolai Radeva, Petia Intelligent Systems Group University of Groningen Netherlands Department of Mathematics and Computer Science University of Barcelona Spain Computer Vision Center Barcelona Spain

Lifelogging is a process of collecting rich source of information about daily life of people. In this paper, we introduce the problem of sentiment analysis in egocentric events focusing on the moments that compose the images recalling positive, neutral or negative feelings to the observer. We propose a method for the classification of the sentiments in egocentric pictures based on global and semantic image features extracted by Convolutional Neural Networks. We carried out experiments on an egocentric dataset, which we organized in 3 classes on the basis of the sentiment that is recalled to the user (positive, negative or neutral). Copyright © 2017, The Authors. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Latent space policy search for robotics

Latent space policy search for robotics

引用

2014 IEEE/RSJ International Conference on intelligent Robots and Systems, IROS 2014

作者： Luck, Kevin Sebastian Neumann, Gerhard Berger, Erik Peters, Jan Amor, Heni Ben Department of Computer Science Technische Universität Darmstadt Darmstadt64289 Germany Department of Mathematics and Computer Science Technische Universität Bergakademie Freiberg Freiberg09599 Germany Institute for Robotics and Intelligent Machines Georgia Institute of Technology GA30332 United States Max Planck Institute for Intelligent Systems Tübingen72076 Germany

ISBN: (纸本)9781479969340

Learning motor skills for robots is a hard task. In particular, a high number of degrees-of-freedom in the robot can pose serious challenges to existing reinforcement learning methods, since it leads to a high-dimensional search space. However, complex robots are often intrinsically redundant systems and, therefore, can be controlled using a latent manifold of much smaller dimensionality. In this paper, we present a novel policy search method that performs efficient reinforcement learning by uncovering the low-dimensional latent space of actuator redundancies. In contrast to previous attempts at combining reinforcement learning and dimensionality reduction, our approach does not perform dimensionality reduction as a preprocessing step but naturally combines it with policy search. Our evaluations show that the new approach outperforms existing algorithms for learning motor skills with high-dimensional robots. © 2014 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Feature detection using oriented local energy for 3D confocal microscope images 3rd

引用

3rd International computer science Conference, ICSC 1995

作者： Pudney, Chris Kovesi, Peter Robbins, Ben Biomedical Confocal Microscopy Research Centre Department of Pharmacology The University of Western Australia NedlandsWA6907 Australia Robotics and Vision Research Group Department of Computer Science The University of Western Australia NedlandsWA6907 Australia

ISBN: (纸本)9783540606970

The ability to detect features within confocal microscope images is important for the interpretation and analysis of such data. Most detectors are gradient-based, and so are sensitive to noise, and fail to accurately locate some feature types that are important in confocal microscopy. The local energy feature detector developed by Morrone and Owens marks locations where there is maximal congruence of phase in the Fourier components of an image. Points of maximal phase congruency occur at all common feature types: step and roof edges, line features and Mach bands. A 3D implementation of the local energy feature detector, suitable for confocal microscope data, is presented. The detector computes local energy by convolving an image with oriented pairs of 3D filters that are 3D versions of Morlet wavelets. To increase the speed of the convolution, the filters are designed in frequency-space and multiplied by the image's Fourier transform. Results are presented for real confocal images and a synthetic 3D image volume. These results are compared with those from a 3D implementation of the Sobel edge detecto. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Face recognition: The problem of compensating for changes in illumination direction 3rd

引用

3rd European Conference on computer vision, ECCV 1994

作者： Moses, Yael Adini, Yael Ullman, Shimon Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot76100 Israel Robotics Group Dept Engineering Science Oxford University Parks Rd OX1 3PJ United Kingdom

ISBN: (纸本)9783540579564

Recognizing faces is a difficult problem due to the generally similar shape of faces combined with the considerable variability in images of the same face under different viewing conditions. In this paper we consider image variation due mainly to illumination conditions. We study several image representations that are often considered insensitive to changes of illumination conditions, such as edge maps, derivatives of the grey-level image, and the image convolved with Gabor filters. For each of these representations, we compare the differences between images of the same face under different imaging conditions, with differences between images of distinct faces. The comparison is performed using a controlled database of faces, in which each of the imaging parameters (illumination, viewing position, and expression) is controlled separately. The main result of these studies is that the variations between the images of the same face due to illumination and viewing directions are almost always larger than image variations due to a change in face identity. For illumination changes, this reversal is ahnost complete except for representations that emphasized the horizontal features. However, even for these representations, systems based only on comparing such representations will fail to recognize up to 30% of the faces in our database. We conclude that these representations are insufficient by themselves to overcome the variation between images due to changes in illumination direction as well as changes due to viewing position and expression. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

The hamiltonian alternating path problem

引用

IAENG International Journal of Applied mathematics 2012年第4期42卷 204-213页

作者： Gorbenko, Anna Popov, Vladimir Ural Federal University Department of Intelligent Systems and Robotics of Mathematics Computer Science Institute 620083 Ekaterinburg Russia

In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a typical working day for indoor service robots problem. Also, we use these models for Bennett's model of cytogenetics, automatic generation of recognition modules, and algebraic data.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

The c-fragment longest arc-preserving common subsequence problem

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2012年第3期39卷 231-238页

作者： Gorbenko, Anna Popov, Vladimir Ural Federal University Department of Intelligent Systems Robotics of Mathematics and Computer Science Institute 620083 Ekaterinburg Russia

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. In particular, arc-annotated sequences are useful in describing the secondary and tertiary structures of RNA and protein sequences. Structure comparison for RNA and for protein sequences has become a central computational problem bearing many challenging computer science questions. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. It is a sound and meaningful mathematical formalization of comparing the secondary structures of molecular sequences. In this paper, we consider two special cases of the longest arc-preserving common subsequence problem, efragment LAPCS (unlimited, plain), c-fragment LAPCS (unlimited, unlimited). In particular, we consider a parameterized version of the 1-fragment LAPCS (unlimited, plain) problem, parameterized by the length l of the desired subsequence. We show W[1]-completeness of the problem. Also, we describe an approach to solve c-fragment LAPCS (unlimited, unlimited). This approach is based on constructing logical models for the problem.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：