We address in this paper automatic face verification from 3D (3-dimensional) facial surface and grey level analysis. 3D acquisition is performed by a structured light system, adapted to face capture and allowing grey level acquisition in alignment. The 3D facial shapes are compared and the residual error after 3D matching is used as a first similarity measure. A second similarity measure is der...

The steady three-dimensional boundary layer flow and heat transfer of a dusty fluid towards a stretching sheet with convective boundary conditions is investigated by using similarity solution approach. The free stream along z-direction impinges on the stretching sheet to produce a flow with different velocity components. The governing equations are reduced into ordinary differential equations b...

High dimensional data is often analysed resorting to its distribution properties in subspaces. Subspace clustering is a powerfull method for elicication of high dimensional data features. The result of subspace clustering can be an essential base for building indexing structures and further data search. However, a high number of subspaces and data instances can conceal a high number of subspace...

Clustering is an established data mining technique for grouping objects based on their mutual similarity. Since in today’s applications, however, usually many characteristics for each object are recorded, one cannot expect to find similar objects by considering all attributes together. In contrast, valuable clusters are hidden in subspace projections of the data. As a general solution to this p...

Given a large collection of sparse vector data in a high dimensional space, we investigate the problem of finding all pairs of vectors whose similarity.ABSTRACT. Given a large collection of sparse vector data in a high dimensional space, we investigate the problem of finding all pairs of vectors whose similarity. Scaling up all pairs similarity search, Published by ACM. The problem of finding a...

Our velocity measurements on a quasi-two-dimensional turbulent flow in a rapidly rotating annulus yield an inverse cascade with E(k) ∼ k−2 rather than the expected E(k) ∼ k−5/3. The probability distribution functions for longitudinal velocity differences, δv(r) = v(x + r) − v(x), are self-similar (scale independent) but strongly non-Gaussian, which suggests that the coherent vortices play a sig...

To appear in Information Systems Journal, Elsevier, 2005 The efficient processing of multidimensional similarity joins is important for a large class of applications. The dimensionality of the data for these applications ranges from low to high. Most existing methods have focused on the execution of high-dimensional joins over large amounts of disk-based data. The increasing sizes of main memor...

This paper summarizes analytical and experimental results for the nearest neighbor similarity search problem in high-dimensional vector spaces using some kind of space-or data-partitioning scheme. Under the assumptions of uniformity and independence of data, we are able to formally show and to demonstrate that conventional approaches to the nearest neighbor problem degenerate if the dimensional...