We present an error tolerant path planning algorithm for Micro Aerial Vehicles (MAV) swarms. We assume a MAV navigation system without relying on GPS-like techniques. The MAV find their navigation path by using their sensors and cameras, in order to identify and follow a series of visual landmarks. The visual landmarks lead the MAV towards the target destination. MAVs are assumed to be unaware of the terrain and locations of the landmarks. Landmarks are also assumed to hold a-priori information, whose interpretation (by the MAVs) is prone to errors. We distinguish two types of errors, namely, recognition and advice. Recognition errors are due to misinterpretation of sensed data and a-priori information or confusion of objects (e.g., due to faulty sensors). Advice errors are due to outdated or wrong information associated to the landmarks (e.g., due to weather conditions). Our path planning algorithm proposes swarm cooperation. MAVs communicate and exchange information wirelessly, to minimize the recognition and advice error ratios. By doing this, the navigation system experiences a quality amplification in terms of error reduction. As a result, our solution successfully provides an adaptive error tolerant navigation system. Quality amplification is parametetrized with regard to the number of MAVs. We validate our approach with theoretical proofs and numeric simulations.
The resulting classifiers had been tested via experimental work. * mavs with high-definition cameras, recording images at a resolution of @math x @math pixels, at the speed of @math fps (frames per second) are loaded a given classifier, to evaluate a visual classification ratio. Each experiment consists of building a classifier and getting the averaged ratio. Results by in @cite_14 @cite_3 show an average empirical visual error ratio of about @math the landmarks, on average). The results are compared to some other well-established pattern recognition methods for the visual identification of objects, such as minimum distance and @math -nearest neighbor classification algorithms.
@cite_14 @cite_3
2134557905 2171943915 2538008885 2025862220
We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter. A large dataset comprising stereo image pairs of 50 uniform-colored toys under 36 azimuths, 9 elevations, and 6 lighting conditions was collected (for a total of 194,400 individual images). The objects were 10 instances of 5 generic categories: four-legged animals, human figures, airplanes, trucks, and cars. Five instances of each category were used for training, and the other five for testing. Low-resolution grayscale images of the objects with various amounts of variability and surrounding clutter were used for training and testing. Nearest neighbor methods, support vector machines, and convolutional networks, operating on raw pixels or on PCA-derived features were tested. Test error rates for unseen object instances placed on uniform backgrounds were around 13 for SVM and 7 for convolutional nets. On a segmentation recognition task with highly cluttered images, SVM proved impractical, while convolutional nets yielded 16 7 error. A real-time version of the system was implemented that can detect and classify objects in natural scenes at around 10 frames per second. Visual object analysis researchers are increasingly experimenting with video, because it is expected that motion cues should help with detection, recognition, and other analysis tasks. This paper presents the Cambridge-driving Labeled Video Database (CamVid) as the first collection of videos with object class semantic labels, complete with metadata. The database provides ground truth labels that associate each pixel with one of 32 semantic classes. The database addresses the need for experimental data to quantitatively evaluate emerging algorithms. While most videos are filmed with fixed-position CCTV-style cameras, our data was captured from the perspective of a driving automobile. The driving scenario increases the number and heterogeneity of the observed object classes. Over 10min of high quality 30Hz footage is being provided, with corresponding semantically labeled images at 1Hz and in part, 15Hz. The CamVid Database offers four contributions that are relevant to object analysis researchers. First, the per-pixel semantic segmentation of over 700 images was specified manually, and was then inspected and confirmed by a second person for accuracy. Second, the high-quality and large resolution color video images in the database represent valuable extended duration digitized footage to those interested in driving scenarios or ego-motion. Third, we filmed calibration sequences for the camera color response and intrinsics, and computed a 3D camera pose for each frame in the sequences. Finally, in support of expanding this or other databases, we present custom-made labeling software for assisting users who wish to paint precise class-labels for other images and videos. We evaluate the relevance of the database by measuring the performance of an algorithm from each of three distinct domains: multi-class object recognition, pedestrian detection, and label propagation. Our objective is to obtain a state-of-the art object category detector by employing a state-of-the-art image classifier to search for the object in all possible image sub-windows. We use multiple kernel learning of Varma and Ray (ICCV 2007) to learn an optimal combination of exponential χ2 kernels, each of which captures a different feature channel. Our features include the distribution of edges, dense and sparse visual words, and feature descriptors at different levels of spatial organization. In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 scene categories and ImageNet [6] has 15,589 synsets. Designing a multiclass classifier that is both accurate and fast at test time is an extremely important problem in both machine learning and computer vision communities. To achieve a good trade-off between accuracy and speed, we adopt the relaxed hierarchy structure from [15], where a set of binary classifiers are organized in a tree or DAG (directed acyclic graph) structure. At each node, classes are colored into positive and negative groups which are separated by a binary classifier while a subset of confusing classes is ignored. We color the classes and learn the induced binary classifier simultaneously using a unified and principled max-margin optimization. We provide an analysis on generalization error to justify our design. Our method has been tested on both Caltech-256 (object recognition) [9] and the SUN dataset (scene classification) [24], and shows significant improvement over existing methods.