No abstract

No abstract

No abstract

The accuracy requirements for sensor network positioning have grown over the last few years due to the high precision demanded in activities related with vehicles and robots. Such systems involve a wide range of specifications which must be met through positioning devices based on time measurement. These systems have been traditionally designed with the synchronization of their sensors in order to compute the position estimation. However, this synchronization introduces an error in the time determination which can be avoided through the centralization of the measurements in a single clock in a coordinate sensor. This can be found in typical architectures such as Asynchronous Time Difference of Arrival (A-TDOA) and Difference-Time Difference of Arrival (D-TDOA) systems. In this paper, a study of the suitability of these new systems based on a Cramér-Rao Lower Bound (CRLB) evaluation was performed for the first time under different 3D real environments for multiple sensor locations. The analysis was carried out through a new heteroscedastic noise variance modelling with a distance-dependent Log-normal path loss propagation model. Results showed that A-TDOA provided less uncertainty in the root mean square error (RMSE) in the positioning, while D-TDOA reduced the standard deviation and increased stability all over the domain.

Time difference of arrival (TDOA) positioning methods have experienced growing importance over the last few years due to their multiple applications in local positioning systems (LPSs). While five sensors are needed to determine an unequivocal three-dimensional position, systems with four nodes present two different solutions that cannot be discarded according to mathematical standards. In this paper, a new methodology to solve the 3D TDOA problems in a sensor network with four beacons is proposed. A confidence interval, which is defined in this paper as a sphere, is defined to use positioning algorithms with four different nodes. It is proven that the separation between solutions in the four-beacon TDOA problem allows the transformation of the problem into an analogous one in which more receivers are implied due to the geometric properties of the intersection of hyperboloids. The achievement of the distance between solutions needs the application of genetic algorithms in order to find an optimized sensor distribution. Results show that positioning algorithms can be used 96.7% of the time with total security in cases where vehicles travel at less than 25 m/s.

Textile based image retrieval for indoor environments can be used to retrieve images that contain the same textile, which may indicate that scenes are related. This makes up a useful approach for law enforcement agencies who want to find evidence based on matching between textiles. In this paper, we propose a novel pipeline that allows searching and retrieving textiles that appear in pictures of real scenes. Our approach is based on first obtaining regions containing textiles by using MSER on high pass filtered images of the RGB, HSV and Hue channels of the original photo. To describe the textile regions, we demonstrated that the combination of HOG and HCLOSIB is the best option for our proposal when using the correlation distance to match the query textile patch with the candidate regions. Furthermore, we introduce a new dataset, TextilTube, which comprises a total of 1913 textile regions labelled within 67 classes. We yielded 84.94% of success in the 40 nearest coincidences and 37.44% of precision taking into account just the first coincidence, which outperforms the current deep learning methods evaluated. Experimental results show that this pipeline can be used to set up an effective textile based image retrieval system in indoor environments.

The combination of SIFT descriptors with other features usually improves image classification, like Edge-SIFT, which extracts keypoints from an edge image obtained after applying the compass operator to a colour image. We evaluate for the first time, how the use of different radii in the compass operator affects the classification performance. We demonstrate that the value proposed in the literature, radius = 4.00, is not the optimum from an image classification point of view. We also put in evidence that in ideal conditions, choosing an appropriate radius for each image yields accuracy values even higher than 95%. Finally, we propose a new method to estimate the best radius for the compass operator in each dataset. Using a training subset selected on the basis of a minimum dispersion criterion of edges density, we construct a richer dictionary for each dataset in our Bag of Words pipeline. From that dictionary it is selected a radius for the whole dataset that yields higher accuracy than using the value proposed in the literature. Using this method, we obtained improvements in the accuracy up to 24.4% in Soccer, 6.77% in COIL-RWTH-2, 4.46% in Birds, 3.82% in ImageNet_Dogs, 2.75% in ImageNet_Birds, 2.02% in Flowers and 1.75% in Caltech101 datasets.

No abstract