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

International Conference on Green Energy, Computing and Sustainable Technology (GECOST)

作者： Chan, Aifian Adi Sufian Abdullah, M. F. L. Mustam, Saizalmursidi Md Poad, Farhana Ahman Joret, Ariffuddin Univ Tun Hussein Onn Malaysia Fac Elect & Elect Engn Parit Raya Johor Malaysia

ISBN: (纸本)9781665486637

Face detection plays an important role in today's technological advancement as it is used in various applications in multiple fields. Many techniques and frameworks have been proposed throughout the decades, utilising different methods that range from algorithms to machine learning and even deep learning. In this paper, a face detection framework that utilises a two-step method was proposed to overcome over-detection in still images containing face images and misdetection in non-face images. The two-step method consists of feature detection using SSD MobileNet V2 and a geometrical algorithm for detecting the face region in the given image. The proposed method was compared with the state-of-the-art face detection algorithms such as MTCNN, Dlib face detector, and OpenCV optimised Haar Classifier. The proposed method performed well in the testing dataset, with 91.5% prediction accuracy. However, it fell short in terms of prediction accuracy performance against the MTCNN and Dlib but performed better in reducing the number of overdetection and misdetection. Hence, achieving the target of the proposed framework.

关键词： SSD MobileNet V2 geometrical algorithm face detection

来源：评论

学校读者我要写书评

暂无评论

Hash-Based Method for Generating Building Information Models From 2D CAD Drawings

引用

IEEE ACCESS 2024年 12卷 147065-147072页

作者： Kang, Kyungjin Ra, Ilkyeun Park, Sangoh Chung Ang Univ Sch Comp Sci & Engn Seoul 06974 South Korea Univ Colorado Denver Dept Comp Sci & Engn Denver CO 80204 USA

A building information model (BIM) encompasses the essential information required for a building's entire lifecycle, based on a 3D model. However, because building design begins with spatial planning, the initial design is based on a 2D plane. Furthermore, introducing BIM to general buildings is not effective in terms of modeling because of the design cost and the inherent 2D structure of older buildings. Consequently, research conducted over the past few years aimed to automatically generate 3D models from 2D drawings;however, the performance is limited in terms of data structure and methodology. Therefore, this study proposes a method that generates 3D information necessary for generating BIM models from 2D drawings using 2D hash-based data structures and planar graph analysis to resolve the above problem. Time and spatial complexities for planar graph generation from drawings consisting of n line segments among the proposed methods are O(kn) and O(n), respectively, where n is the number of the lines in drawing, k satisfies E(p) <= k <= n, and E(p) denotes the average number of intersections in each hash cell. By applying it to 2D drawing data used in actual architectures, a 3D model could be developed with approximately 2.9% effort compared to the entire 2D drawing being modeled by a worker. This enables designers unfamiliar with BIM environments to conveniently obtain IFC files containing BIM models and then utilize BIM software to harness 3D information.

关键词： Building information model CAD drawing analysis geometrical algorithm geometrical algorithm polygon detection polygon detection geometrical algorithm polygon detection

来源：评论

学校读者我要写书评

暂无评论

Velocity obstacle-based conflict resolution and recovery method

引用

AERONAUTICAL JOURNAL 2022年第1296期126卷 345-364页

作者： Sun, F. Chen, Y. Xu, X. Mu, Y. Wang, Z. Nanjing Univ Aeronaut & Astronaut Jiangning Rd Campus Nanjing Jiangsu Peoples R China 1 Jiazi Changle East Rd Xian Shanxi Peoples R China

Considering the shortcomings of current methods for real-time resolution of two-aircraft flight conflicts, a geometric optimal conflict resolution and recovery method based on the velocity obstacle method for two aircraft and a cooperative conflict resolution method for multiple aircraft are proposed. The conflict type was determined according to the relative position and velocity of the aircraft, and a corresponding conflict mitigation strategy was selected. A resolution manoeuvre and a recovery manoeuvre were performed. On the basis of a two-aircraft conflict resolution model, a multi-aircraft cooperative conflict resolution game was constructed to identify an optimal solution for maximising group welfare. The solution and recovery method is simple and effective, and no new flight conflicts are introduced during track recovery. For multi-aircraft conflict resolution, an equilibrium point that maximises the welfare function of the group was identified, and thus, an optimal strategy for multi-aircraft conflict resolution was obtained.

关键词： collision detection and resolution cooperative game geometrical algorithm optimal solution of alliance welfare particle swarm optimisation algorithm recovery track velocity obstacle method

来源：评论

学校读者我要写书评

暂无评论

Multi-obstacle Path Planning of UAV Based on Improved Ant Colony System algorithm 5

Multi-obstacle Path Planning of UAV Based on Improved Ant Co...

引用

IEEE 5th Information Technology and Mechatronics Engineering Conference (ITOEC)

作者： Ling, Fuyuan Chen, Jinchao Du, Chenglie Northwestern Polytech Univ Dept Comp Sci Xian 710072 Peoples R China

ISBN: (纸本)9781728143231;9781728143224

Recently unmanned aerial vehicles (UAVs) have been widely adopted by military and civilian applications due to their strong autonomies and adaptabilities. Especially in some tasks, a complex path planning problem is that a UAV traverses and searches multiple targets in an environment with obstacles, which is a traveling salesman problem with NP-hard computational complexity. The traditional algorithms which do not consider environment with obstacles are not feasible in the actual flying environment. In this paper, we study the path planning problem of a UAV searching for multiple targets in the environment with irregular obstacles. First, we use an improved geometric algorithm to find an accessible path between any two targets. Then, we design an ant colony system(ACS)-based optimization strategy to adjust the accessible order of a UAV such that the task completion time obtained by our approach would be reduced as much as possible. Finally, experiments with randomly generated target points in an environment with obstacles are conducted to show the effectiveness of the algorithm.

关键词： unmanned aerial vehicle path planning Multi-obstacle ant colony system geometrical algorithm

来源：评论

学校读者我要写书评

暂无评论

Constant speed optimal reciprocal collision avoidance

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2018年第Nov.期96卷 366-379页

作者： Durand, Nicolas ENAC Toulouse France

In this article, the Optimal Reciprocal Collision Avoidance (ORCA) algorithm is modified to make it work for speed constrained aircraft. The adaptation of ORCA to aircraft conflict resolution shows that when the speed norm is constrained, aircraft flying within the same speed range with small angle converging trajectories tend to remain on parallel tracks, preventing a resolution of the conflict. The ORCA algorithm is slightly modified to avoid this behavior. In the new algorithm called CSORCA (Constant Speed Optimal Reciprocal Collision Avoidance), the directions of the semi-plane used to calculate the conflict free maneuvers are modified when the relative speed vector is in the semi-circular part of the conflicting area. After explaining the reasons that make the original algorithm fail in the constant speed environment, the modification made on the algorithm is detailed and its impact on a simple example is shown. The new strategy is also compared to an Add-Up strategy close to the Airborne Separation Assurance System (ASAS) strategy found in the literature. Hundreds of fast time simulations are then performed to compare the two versions of the algorithm for different traffic densities in the horizontal plane. In these simulations the speed norm is first constrained. The aircraft can only change direction with a limited turning rate. Simulations with released speed constraints are then performed to compare the behavior of both algorithms in a more general environment. In all the scenarios tested, CSORCA is more efficient than ORCA to solve conflicts.

关键词： ORCA CSORCA Self-separation geometrical algorithm Air traffic control UAS

来源：评论

学校读者我要写书评

暂无评论

Integration of UAS in Terminal Control Area 35

Integration of UAS in Terminal Control Area

引用

35th IEEE/AIAA Digital Avionics Systems Conference (DASC)

作者： Allignol, Cyril Barnier, Nicolas Durand, Nicolas Manfredi, Guido Blond, Eric ENAC 7 Av Edouard Belin F-31055 Toulouse France DSNA DTI 1 Av du Maurice Grynfogel F-31035 Toulouse France

ISBN: (纸本)9781509025237

In this article, we test a horizontal detect and avoid algorithm for UASs flying in Terminal Control Areas. We have used recorded commercial traffic trajectories and randomly built thousands of conflict scenarios with UASs to check the ability of such an algorithm to ensure the separation with commercial aviation. We consider two different types of UASs, flying at 80 kn or 160 kn, with six different missions: flying straight or turning and leveled, climbing or descending. We only focus on horizontal maneuvers at constant speed in order to not interfere with the TCASs of aircraft, nor rely on most UASs poor ability to change speed. The article investigates the influence of the various parameters on the separation achieved and the amount of maneuvers required, especially the strategy used to select the best maneuver among the allowed headings. The analysis of our results shows that, amid two basic and "extreme" strategies that favor either minimal heading changes or the robustness of the maneuvers, the combination of both, switching from the first one to the second whenever the distance between the UAS and aircraft falls under a given threshold, gives the best results with very few remaining airproxes, while keeping low the amount and amplitude of maneuvers.

关键词： UAS self-separation conflict resolution geometrical algorithm

来源：评论

学校读者我要写书评

暂无评论

A new heuristic algorithm for the planar minimum covering circle problem

引用

PRODUCTION AND MANUFACTURING RESEARCH-AN OPEN ACCESS JOURNAL 2014年第1期2卷 142-155页

作者： Nasab, Hasan Hosseini Tavana, Mahdi Yousefi, Mohsen Yazd Univ Fac Engn Ind Engn Dept Yazd Iran

The minimum covering circle problem is widely utilized in the studies of single or multiple facility location problems. It may be employed to locate the essential locations of factories, schools, fire departments, hospital establishments, and other facilities, which could be considered as a point in a plane theoretically. In this paper, a new geometrical algorithm is presented which determines the minimum covering circle of all points on a plane in four steps. The model validity was considered by studying the coordinates of points with random numbers and different distributions. In order to show the accuracy of the proposed algorithm, numerical experiments were carried out and compared with other studies in the field. The results show that the proposed algorithm extremely outperforms other examined algorithms.

关键词： minimum covering circle facility location geometrical algorithm

来源：评论

学校读者我要写书评

暂无评论

3D terrain reconstruction based on contours

3D terrain reconstruction based on contours

引用

9th International Conference on Computer Aided Design and Computer Graphics

作者： Zhang, ZY Konno, K Tokuyama, Y Iwate Univ Fac Engn Morioka Iwate 0208551 Japan

ISBN: (纸本)0769524737

In 3D terrain reconstruction, the differences of shape and topology among contours in adjacent sections cause a difficulty as the tiling problem of branching terrain. In this paper, we present a brief and pure geometrical algorithm to reconstruct 3D terrain based on contours. The merit of our method is that the tiling rules guarantee arbitrary branching terrain can be divided into correct topology.

关键词： computational geometry image reconstruction surface topography terrain mapping topology 3D terrain reconstruction branching terrain contours geometrical algorithm tiling problem terrain mapping topology Computational geometry image reconstruction surface topography terrains landscapes Sea Surface Topography

来源：评论

学校读者我要写书评

暂无评论

Decision Support for Location Problems in Town Planning

引用

International Transactions in Operational Research 2002年第3期9卷 261-278页

作者： Patz, Renate Spitzner, Jan Tammer, Christiane University of Applied Science Department of Technology Transfer Merseburg D-06217 Germany Department of Mathematics Martin-Luther University Germany

Urban development and town planning need an adequate decision-making process. European cities, in particular, are compact. Urban elements and functions are in a constant state of change. Moreover, the large number of historic buildings and areas means a sensitive and responsible approach must be taken. The aim of this paper is to consider special location problems in town planning. We formulate multi-criteria location problems, derive optimality conditions and present a geometric algorithm and an interactive procedure including a proximal point algorithm for solving multi-criteria location problems. In this paper, we use location theory as a possible method to help determine the location of a children’s playground in a newly-built district of Halle, Germany. International Federation of Operational Research Societies 2002.

关键词： Duality assertions geometrical algorithm Location problem Multi-criteria decision-making Proximal point algorithm Town planning

来源：评论

学校读者我要写书评

暂无评论

A geometrical algorithm to search the conformational space (GASCOS) of flexible molecules

引用

JOURNAL OF MOLECULAR STRUCTURE-THEOCHEM 1999年第1期465卷 33-67页

作者： Santagata, LN Suvire, FD Enriz, RD Torday, LL Csizmadia, IG Univ Nacl San Luis Fac Quim Bioquim & Farm Dept Quim RA-5700 San Luis Argentina Albert Szent Gyorgyi Med Univ Dept Pharmacol & Pharmacotherapy H-6701 Szeged Hungary Univ Toronto Lash Miller Chem Labs Toronto ON M5S 3H6 Canada

We report a geometrical algorithm to search the conformational space (GASCOS), with the goal to evaluate, in a computationally effective way, all possible conformations of a flexible molecule. The present report itself consists of two parts. The first part is primarily devoted to the mathematical principles on which our approach is based. The basic principles are illustrated in terms of the conformational aspect of small normal hydrocarbons: CnH2n+2. In the second half of the paper we apply the geometrical approach to a set of specific chemical problems namely, partially fluorinated propanes are used in order to determine the steric requirement and, therefore, the spatial proximity of the terminal atoms during multiple internal rotations. In one type of application the torsion about the bond was regarded as a continuous variable by choosing the increment in torsional angle (Delta theta) to be small, such as 5 degrees. In this approach we were able to assess the spatial requirement and therefore any possible collision of rotating moieties. In an other type of application Delta theta was assumed to be as large as 120 degrees, thus the internal rotational angle was regarded as a variable that can assume only discrete values (g(+), a, g(-)). In this fashion, the program could generate an input file for empirical force field, semi-empirical MO or ab initio molecular computations within the framework of multidimensional conformational analysis (MDCA). In other words GASCOS could become the driver program for any energy calculating software. Finally, when an unusually short distance was obtained by the GASCOS method, it was then possible to consider such an occurrence as an indicator of a probable conformational catastrophe. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： conformational space geometrical algorithm flexible molecules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：