3 resultados para coding complexity

em Digital Peer Publishing


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a new compression algorithm for dynamic 3d meshes. In such a sequence of meshes, neighboring vertices have a strong tendency to behave similarly and the degree of dependencies between their locations in two successive frames is very large which can be efficiently exploited using a combination of Predictive and DCT coders (PDCT). Our strategy gathers mesh vertices of similar motions into clusters, establish a local coordinate frame (LCF) for each cluster and encodes frame by frame and each cluster separately. The vertices of each cluster have small variation over a time relative to the LCF. Therefore, the location of each new vertex is well predicted from its location in the previous frame relative to the LCF of its cluster. The difference between the original and the predicted local coordinates are then transformed into frequency domain using DCT. The resulting DCT coefficients are quantized and compressed with entropy coding. The original sequence of meshes can be reconstructed from only a few non-zero DCT coefficients without significant loss in visual quality. Experimental results show that our strategy outperforms or comes close to other coders.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The use of virtual reality as tool in the area of spatial cognition raises the question of the quality of learning transfer from a virtual to a real environment. It is first necessary to determine with healthy subjects, the cognitive aids that improve the quality of transfer and the conditions required, especially since virtual reality can be used as effective tool in cognitive rehabilitation. The purpose of this study was to investigate the influence of the exploration mode of virtual environment (Passive vs. Active) according to Route complexity (Simple vs. Complex) on the quality of spatial knowledge transfer in three spatial tasks. Ninety subjects (45 men and 45 women) participated. Spatial learning was evaluated by Wayfinding, sketch-mapping and picture classification tasks in the context of the Bordeaux district. In the Wayfinding task, results indicated that active learning in a Virtual Environment (VE) increased the performances compared to the passive learning condition, irrespective of the route complexity factor. In the Sketch-mapping task, active learning in a VE helped the subjects to transfer their spatial knowledge from the VE to reality, but only when the route was complex. In the Picture classification task, active learning in a VE when the route was complex did not help the subjects to transfer their spatial knowledge. These results are explained in terms of knowledge levels and frame/strategy of reference [SW75, PL81, TH82].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The development of path-dependent processes basically refers to positive feedback in terms of increasing returns as the main driving forces of such processes. Furthermore, path dependence can be affected by context factors, such as different degrees of complexity. Up to now, it has been unclear whether and how different settings of complexity impact path-dependent processes and the probability of lock-in. In this paper we investigate the relationship between environmental complexity and path dependence by means of an experimental study. By focusing on the mode of information load and decision quality in chronological sequences, the study explores the impact of complexity on decision-making processes. The results contribute to both the development of path-dependence theory and a better understanding of decision-making behavior under conditions of positive feedback. Since previous path research has mostly applied qualitative case-study research and (to a minor part) simulations, this paper makes a further contribution by establishing an experimental approach for research on path dependence.