Resultados de la búsqueda176 resultados

IADAT Journal of Advanced Technology: Dynamic driving scenario design
Coma,Inmaculada; Fernández, Vera, Lucía; Olanda, Ricardo
(2005). ArticleSimulation and virtual environments are used increasingly for training and behaviour evaluation purposes. Driving simulators are a specific case of these systems. They have been proof as effective tools for drivers training, risky driving styles evaluation or the evaluation of the effects of external factors or new technologies in driving task. The interest in behaviour evaluation and training of drivers makes it necessary to design experiments that provide measurements of driver’s actions. These experiments are usually dynamic scenarios, which can be defined as a set of dynamic elements (cars, lights, pedestrians, etc.) carrying out some tasks in a synchronized way. The purpose of these...
Simulation and virtual environments are used increasingly for training and behaviour evaluation purposes. Driving simulators are a specific case of these systems. They have been proof as effective tools for drivers training, risky driving styles evaluation or the evaluation of the effects of external factors or new technologies in driving task. The interest in behaviour evaluation and training of drivers makes it necessary to design experiments that provide measurements of driver’s actions. These experiments are usually dynamic scenarios, which can be defined as a set of dynamic elements (cars, lights, pedestrians, etc.) carrying out some tasks in a synchronized way. The purpose of these scenarios is to force the driver to make a decision.
Leer másOcultar 
On the interaction of data representation and routing in sensor networks
Cristescu, R.; BeferullLozano, B.; Vetterli, M.; Ganesan, D.; Acimovic, J.
(2005). ArticleWe consider data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information, collected by the nodes, to the sink node. This problem requires a joint optimization of the data representation at the nodes and of the transmission structure. First, we study the case when the measured data are correlated random variables, both in the lossless scenario with SlepianWolf coding, and in the highresolution lossy scenario with optimal ratedistortion allocation. We show that the optimal transmission structure is the shortest path tree, and we find, in closedform, the rate and distortion...
We consider data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information, collected by the nodes, to the sink node. This problem requires a joint optimization of the data representation at the nodes and of the transmission structure. First, we study the case when the measured data are correlated random variables, both in the lossless scenario with SlepianWolf coding, and in the highresolution lossy scenario with optimal ratedistortion allocation. We show that the optimal transmission structure is the shortest path tree, and we find, in closedform, the rate and distortion allocation. Second, we study the case when the measured data are deterministic piecewise constant signals, and data is described with adaptive level waveletbased multiresolution representation. We show experimentally that, when computation is decentralized, there is an optimal network division into node groups of adaptive size. Finally, we also analyze the node positioning problem where, given a correlation structure and an available number of sensors, the goal is to place the nodes optimally in terms of minimizing the transmission cost; our results show that important gains can be obtained compared to a uniformly distributed sensor positioning.
Leer másOcultar 
Efficient Distributed Multiresolution processing for data gathering in sensor networks
Acimovic, J.; Cristescu, R.; beferullLozano, B.
(2005). ArticleWe consider large sensor networks where the cost of collecting data from the network nodes to the data gathering sink is critical. We propose several algorithms that use limited local communication and distributed signal processing to make communication more efficient in terms of transmission cost. We consider a model that uses distributed waveletbased signal processing. We first propose an algorithm that performs processing at nodes as data is forwarded to the sink. Then, we analyze algorithms that perform network division into groups of adaptive size and for which signal processing is applied separately to each group. We show by numerical simulations that such multiresolution approaches...
We consider large sensor networks where the cost of collecting data from the network nodes to the data gathering sink is critical. We propose several algorithms that use limited local communication and distributed signal processing to make communication more efficient in terms of transmission cost. We consider a model that uses distributed waveletbased signal processing. We first propose an algorithm that performs processing at nodes as data is forwarded to the sink. Then, we analyze algorithms that perform network division into groups of adaptive size and for which signal processing is applied separately to each group. We show by numerical simulations that such multiresolution approaches result in significant improvements for data gathering in terms of total communication costs.
Leer másOcultar 
RotationInvariant Texture Retrieval with gaussianized steerable pyramids
Tzagkarakis, G.; BeferullLozano, B.; Tsakalides, P.
(2005). ArticleThis paper presents a novel rotationinvariant image retrieval scheme based on a transformation of the texture information via a steerable pyramid. First, we fit the distribution of the subband coefficients using a joint alphastable subGaussian model to capture their nonGaussian behavior. Then, we apply a normalization process in order to Gaussianize the coefficients. As a result, the feature extraction step consists of estimating the covariances between the normalized pyramid coefficients. The similarity between two distinct texture images is measured by minimizing a rotationinvariant version of the KullbackLeibler Divergence between their corresponding multivariate Gaussian...
This paper presents a novel rotationinvariant image retrieval scheme based on a transformation of the texture information via a steerable pyramid. First, we fit the distribution of the subband coefficients using a joint alphastable subGaussian model to capture their nonGaussian behavior. Then, we apply a normalization process in order to Gaussianize the coefficients. As a result, the feature extraction step consists of estimating the covariances between the normalized pyramid coefficients. The similarity between two distinct texture images is measured by minimizing a rotationinvariant version of the KullbackLeibler Divergence between their corresponding multivariate Gaussian distributions, where the minimization is performed over a set of rotation angles.
Leer másOcultar 
Lossy network correlated data gathering with highresolution coding
Cristescu, R.; BeferullLozano,
(2005). ArticleWe consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy coded with highresolution, and the information measured by the nodes should be available at the sink within certain total and individual distortion bounds. First, we consider the problem of finding the optimal transmission structure and the ratedistortion allocations at the various spatially located nodes, such as to minimize the total power consumption cost of the network. We prove that the optimal transmission structure is the shortest path tree and that the problems of rate and distortion allocation separate in...
We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy coded with highresolution, and the information measured by the nodes should be available at the sink within certain total and individual distortion bounds. First, we consider the problem of finding the optimal transmission structure and the ratedistortion allocations at the various spatially located nodes, such as to minimize the total power consumption cost of the network. We prove that the optimal transmission structure is the shortest path tree and that the problems of rate and distortion allocation separate in the highresolution case, namely, we first find the distortion allocation as a function of the transmission structure, and then the rate allocation is computed. Then, we also study the case when the node positions can be chosen, by finding the optimal node placement when two different targets of interest are considered, namely total power minimization and network lifetime extension.
Leer másOcultar 
Efficient routing with small buffers in dense networks
Barrenetxea, G.; BeferullLozano, B.; Vetterli, M.
(2005). ArticleThe analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson's theorem that give more insight into the effect of routing algorithms on the queue size distributions. Using the proposed approximation models, we analyze and design routing algorithms that minimize overflow losses in grid networks with finite buffers and different communication patterns, namely uniform communication and data gathering. We show that the buffer size required to achieve the maximum possible rate decreases as the network size increases....
The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson's theorem that give more insight into the effect of routing algorithms on the queue size distributions. Using the proposed approximation models, we analyze and design routing algorithms that minimize overflow losses in grid networks with finite buffers and different communication patterns, namely uniform communication and data gathering. We show that the buffer size required to achieve the maximum possible rate decreases as the network size increases. Motivated by the insight gained in grid networks, we apply the same principles to the design of routing algorithms for random networks with finite buffers that minimize overflow losses. We show that this requires adequately combining shortest path tree routing and traveling salesman routing. Our results show that such specially designed routing algorithms increase the transmitted rate for a given loss probability up to almost three times, on average, with respect to the usual shortest path tree routing.
Leer másOcultar 
Adaptive distributed algorithms for powerefficient data gathering in sensor networks
Acimovic, J.; BeferullLozano, B.; Cristescu, R.
(2005). ArticleIn this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a sink node. We take into account both the power spent for purposes of communication as well as the power spent for local computation. Our distributed algorithms are also matched to the nature of the correlated field, namely, for piecewise smooth signals, we provide two distributed multiresolution waveletbased algorithms, while for correlated Gaussian fields, we use distributed prediction based processing. In both cases, we provide...
In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a sink node. We take into account both the power spent for purposes of communication as well as the power spent for local computation. Our distributed algorithms are also matched to the nature of the correlated field, namely, for piecewise smooth signals, we provide two distributed multiresolution waveletbased algorithms, while for correlated Gaussian fields, we use distributed prediction based processing. In both cases, we provide distributed algorithms that perform network division into groups of different sizes. The distribution of the group sizes within the network is the result of an optimal tradeoff between the local communication inside each group needed to perform decorrelation, the communication needed to bring the processed data (coefficients) to the sink and the local computation cost, which grows as the network becomes larger. Our experimental results show clearly that important gains in power consumption can be obtained with respect to the case of not performing any distributed decorrelating processing.
Leer másOcultar 
Approximation power of Directionlets
Velisavljevic, V.; BeferullLozano, B.; vetterli, M.; Dragotti, P. L.
(2005). ArticleIn spite of the success of the standard wavelet transform (WT) in image processing, the efficiency of its representation is limited by the spatial isotropy of its basis functions built in only horizontal and vertical directions. Onedimensional (1D) discontinuities in images (edges and contours), which are very important elements in visual perception, intersect too many wavelet basis functions and reduce the sparsity of the representation. To capture efficiently these anisotropic geometrical structures, a more complex multidirectional (MDIR) and anisotropic transform is required. We present a new latticebased perfect reconstruction and critically sampled anisotropic MDIR WT (with the...
In spite of the success of the standard wavelet transform (WT) in image processing, the efficiency of its representation is limited by the spatial isotropy of its basis functions built in only horizontal and vertical directions. Onedimensional (1D) discontinuities in images (edges and contours), which are very important elements in visual perception, intersect too many wavelet basis functions and reduce the sparsity of the representation. To capture efficiently these anisotropic geometrical structures, a more complex multidirectional (MDIR) and anisotropic transform is required. We present a new latticebased perfect reconstruction and critically sampled anisotropic MDIR WT (with the corresponding basis functions called directionlets) that retains the separable filtering and simple filter design from the standard twodimensional (2D) WT and imposes directional vanishing moments (DVM). Furthermore, we show that this novel transform has nonlinear approximation efficiency competitive to the other previously proposed oversampled transform constructions.
Leer másOcultar 
Networked SlepianWolf: Theory, Algorithms and Scaling Laws
Cristescu, R.; BeferullLozano, B.; Vetterli, M.
(2005). ArticleConsider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the datagathering scenario, which is relevant in sensor networks, and general traffic matrices, relevant for general networks. The minimization is achieved by jointly optimizing a) the transmission structure, which is shown to consist in general of a superposition of trees, and b) the rate allocation across the source nodes, which is done by SlepianWolf coding. The overall minimization can be achieved in two...
Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the datagathering scenario, which is relevant in sensor networks, and general traffic matrices, relevant for general networks. The minimization is achieved by jointly optimizing a) the transmission structure, which is shown to consist in general of a superposition of trees, and b) the rate allocation across the source nodes, which is done by SlepianWolf coding. The overall minimization can be achieved in two concatenated steps. First, the optimal transmission structure is found, which in general amounts to finding a Steiner tree, and second, the optimal rate allocation is obtained by solving an optimization problem with cost weights determined by the given optimal transmission structure, and with linear constraints given by the SlepianWolf rate region. For the case of data gathering, the optimal transmission structure is fully characterized and a closedform solution for the optimal rate allocation is provided. For the general case of an arbitrary traffic matrix, the problem of finding the optimal transmission structure is NPcomplete. For large networks, in some simplified scenarios, the total costs associated with SlepianWolf coding and explicit communication (conditional encoding based on explicitly communicated side information) are compared. Finally, the design of decentralized algorithms for the optimal rate allocation is analyzed.
Leer másOcultar 
Granular system models for real time simulation
Pla Castells, M.; García Fernández, I.; Martínez Durá, R. J.
(2004). ArticleProceedings of the Industrial Simulation Conference 2004, 8893 Granular systems appear in many industrial and agricultural disciplines, which has lead to a wide range of models for their simulation, both in engineering and applied physics. However, most of the current models are addressed to make a deep analysis of the properties of the system, and they are not suitable for their use in realtime simulations. Thus, despite of the efforts in computational ﬂuid dynamics and molecular dynamics, the application of granular systems in the ﬁeld of virtual reality and computer graphics lacks of a set of fast interactive models that allow their execution in realtime. In this paper we propose an...
Proceedings of the Industrial Simulation Conference 2004, 8893 Granular systems appear in many industrial and agricultural disciplines, which has lead to a wide range of models for their simulation, both in engineering and applied physics. However, most of the current models are addressed to make a deep analysis of the properties of the system, and they are not suitable for their use in realtime simulations. Thus, despite of the efforts in computational ﬂuid dynamics and molecular dynamics, the application of granular systems in the ﬁeld of virtual reality and computer graphics lacks of a set of fast interactive models that allow their execution in realtime. In this paper we propose an efﬁcient granular system model based on cellular automata, designed to be used in computer graphics applications. The model is provided with inertia which gives it more realistic physical properties. Also, several details for its implementation are given together with an analysis of its computational complexity.
Leer másOcultar