Real walking in large virtual indoor environments within a limited real world workspace requires effective spatial compression methods. These methods should be unnoticed by the user. Scene manipulation that creates overlapping spaces has been suggested in recent work. However, there is little research focusing on users’ perception of overlapping spaces depending on the layout of the environment...

We present in this paper an algorithm for determining 3D motion and structure from correspondences of line segments between two perspective images. To our knowledge, this paper is the rst investigation of use of line segments in motion and structure from motion. Classical methods use their geometric abstraction, namely straight lines, but then three images are necessary for the motion and struc...

Key management is the base of wireless sensor network security, key pre-distribution way is a high feasibility method in key management. The network connectivity rate, resilience against node capture and the storage consumption are important performance indicators in key pre-distribution way. However, most of the existing key pre-distribution schemes of wireless sensor network have the problems...

Prior efforts have shown that data fusion techniques can be used to improve retrieval effectiveness under certain situations. Although the precise conditions necessary for fusion to improve retrieval have not been identified, it is widely believed that as long as component result sets used in fusion have higher relevant overlap than non-relevant overlap, improvements due to fusion can be observ...

For a pharmaceutical like insulin, the product should be clearly linked to its source. Therefore, it is important to track each batch throughout the production process. Tracking each batch in a simulated moving bed (SMB) process is more challenging than in conventional batch chromatography. Solutes coming from a certain feed batch in SMB can be mixed with solutes coming from adjacent feed batch...

In this paper, we make eecient use of pipelining on LU decomposition with pivoting and a column-scattered data decomposition to derive precise variations of the computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines.

A novel method for automatic registration based on Iterative Closest Point (ICP) approach is proposed. This method uses geometric bounding containers to evaluate the optimum overlap rate of the data and model point sets.

In this paper we present the two-pass speaker diarization system that we developed for the NIST RT09s evaluation. In the first pass of our system a model for speech overlap detection is gen­ erated automatically. This model is used in two ways to reduce the diarization errors due to overlapping speech. First, it is used in a second diarization pass to remove overlapping speech from the data whi...

Random Forests (RF) are a successful ensemble prediction technique that uses majority voting or averaging as a combination function. However, it is clear that each tree in a random forest may have a different contribution in processing a certain instance. In this paper, we demonstrate that the prediction performance of RF may still be improved in some domains by replacing the combination functi...

A procedure to approximate non-causal adaptive IIR filtering is described. Such structures could be useful, for instance, in the equalization of non-minimum phase communication channels. The procedure is based on backward calculations within blocks of samples and we show that for adaptive filtering the overlap-save method is more suitable than the overlap-add method. Moreover, a temporary freez...