The paper presents a method for patch classification and remoteimage segmentation based on correlated color information. During the trainingphase, a supervised learning algorithm is considered. In the testing phase, weused the classifier built a priori to predict which class an input image samplebelongs to. The tests showed that the most relevant features are contrast, energyand homogeneity extracted from the co-occurrence matrix between H and Scomponents. Compared to gray-level, the chromatic matrices improve the processof texture classification. For experimental results, the images were acquiredby the aid of an unmanned aerial vehicle and represent various types of terrain.Two case studies have shown that the proposed method is more effective thanconsidering separate color channels: flooded area and road segmentation. Also it is shown that the new algorithm provides a faster execution time than the similar one proposed.
Photogrammetry is a well-studied and much-used analysis tool. Typical use cases include area surveillance, flood monitoring and related tasks. Usually, an Unmanned Aerial System (UAS) is used as support for image acquisition from an a priori delimited region in a semi-automated manner (via a mix of ground control and autonomous trajectory tracking). This in turn has led to various algorithms which
handle path trajectory generation under realistic constraints but still many avenues remain open. In this paper, we consider typical costs and constraints (UAS dynamics, total-path length, line inter-distance, turn points, etc.) in order to obtain, via optimization procedures, an optimal trajectory. To this end we make use of polyhedral set operations, flat trajectory generation and other similar tools. Additional work includes the study of non-convex regions and estimation of the number of photographs taken via Ehrhart polynomial computations.
This paper considers the collision avoidance problem in a multi-agent multi-obstacle framework. The originality in solving this intensively studied problem resides in the proposed geometrical view combined with differential flatness for trajectory generation and B-splines for the flat output parametrization. Using some important properties of these theoretical tools we show that the constraints can be validated at all times. Exact and sub-optimal constructions of the collision avoidance optimization problem are provided. The results are validated through extensive simulations over standard autonomous aerial vehicle dynamics.
This paper discusses a practical implementation for photogrammetry missions in an UAV setting. Further advances, which exploit geometrical properties of the problem are considered. In particular, a bi-level optimization procedure which minimizes the total path-length is discussed. Various constraints and limitations are taken into account.
This paper addresses some alternatives to classical trajectory generation for an autonomous vehicle which needs to pass through a priori given way-points. Using differential flatness for trajectory generation and B-splines for the flat output parametrization, the current study concentrates on constraint relaxations and on obstacle avoidance conditions. The results are validated through simulations over standard UAV dynamics.
This paper addresses some alternatives to classical trajectory generation for an unmanned aerial vehicle (UAV) which needs to pass through (or near) a priori given way-points. Using differential flatness for trajectory generation and B-splines for the flat output parameterization, the current study concentrates on flat descriptions which respect to UAV dynamics and verify way-point constraints.
This paper addresses the coverage problem for a collection of agents and fixed obstacles (e.g., the “gallery” and the “patrolling” problems). A collection of sufficient conditions over the positions of the agents are provided such that whenever these are verified there is no “blind” region in the feasible space. These conditions are expressed by making use of hyperplane
arrangements which lead to a mixed-integer formulation. Practical applications regarding the coverage problem inside an augmented space with obstacles validate these concepts and
provide an efficient implementation (in terms of computing power).