Search results for "Set theory"
showing 10 items of 751 documents
An advanced system for the simulation and planning of orthodontic treatment
2000
This paper presents a new system for three-dimensional (3-D) orthodontic treatment planning and movement of teeth. We describe a computer vision technique for the acquisition and processing of 3-D images of the profile of hydrocolloid dental imprints. Profile measurement is based on the triangulation method which detects deformation of the projection of a laser line on the dental imprints. The system is computer-controlled and designed to achieve depth and lateral resolutions of 0.1 and 0.2 mm, respectively, within a depth range of 40 mm. The 3-D image of the imprint is segmented in order to identify different teeth. Two operators are presented: one for the detection of molars and premolars…
Projection Clustering Unfolding: A New Algorithm for Clustering Individuals or Items in a Preference Matrix
2020
In the framework of preference rankings, the interest can lie in clustering individuals or items in order to reduce the complexity of the preference space for an easier interpretation of collected data. The last years have seen a remarkable flowering of works about the use of decision tree for clustering preference vectors. As a matter of fact, decision trees are useful and intuitive, but they are very unstable: small perturbations bring big changes. This is the reason why it could be necessary to use more stable procedures in order to clustering ranking data. In this work, a Projection Clustering Unfolding (PCU) algorithm for preference data will be proposed in order to extract useful info…
Least-squares community extraction in feature-rich networks using similarity data
2021
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least-squares additive criterion allows us to search for communities one-by-one and to find each community by adding entities one by one. A focus of this paper is that the feature-space data part is converted into a similarity matrix format. The similarity/link values can be used in either of two modes: (a) as measured in the same scale so that one may …
GPU-accelerated integral imaging and full-parallax 3D display using stereo-plenoptic camera system
2019
Abstract In this paper, we propose a novel approach to produce integral images ready to be displayed onto an integral-imaging monitor. Our main contribution is the use of commercial plenoptic camera, which is arranged in a stereo configuration. Our proposed set-up is able to record the radiance, spatial and angular, information simultaneously in each different stereo position. We illustrate our contribution by composing the point cloud from a pair of captured plenoptic images, and generate an integral image from the properly registered 3D information. We have exploited the graphics processing unit (GPU) acceleration in order to enhance the integral-image computation speed and efficiency. We…
Decentralized Subspace Projection for Asymmetric Sensor Networks
2020
A large number of applications in Wireless Sensor Networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Most of the existi…
Full-parallax 3D display from stereo-hybrid 3D camera system
2018
Abstract In this paper, we propose an innovative approach for the production of the microimages ready to display onto an integral-imaging monitor. Our main contribution is using a stereo-hybrid 3D camera system, which is used for picking up a 3D data pair and composing a denser point cloud. However, there is an intrinsic difficulty in the fact that hybrid sensors have dissimilarities and therefore should be equalized. Handled data facilitate to generating an integral image after projecting computationally the information through a virtual pinhole array. We illustrate this procedure with some imaging experiments that provide microimages with enhanced quality. After projection of such microim…
Set similarity joins on mapreduce
2018
Set similarity joins, which compute pairs of similar sets, constitute an important operator primitive in a variety of applications, including applications that must process large amounts of data. To handle these data volumes, several distributed set similarity join algorithms have been proposed. Unfortunately, little is known about the relative performance, strengths and weaknesses of these techniques. Previous comparisons are limited to a small subset of relevant algorithms, and the large differences in the various test setups make it hard to draw overall conclusions. In this paper we survey ten recent, distributed set similarity join algorithms, all based on the MapReduce paradigm. We emp…
Seam-Based Edge Blending for Multi-Projection Systems
2016
Perceptual seamlessness of large-scale tiled displays is still a challenge. One way to avoid Bezel effects from contiguous displays is to blend superimposed parts of the image over the edges. This work proposes a new approach for edge blending. It is based on intensity edge blending adapted on the seam description of the image content. The main advantage of this method is to reduce visual artifacts thanks to context adaptation and smooth transitions. We evaluate the quality of the method with a perceptual experiment where it is compared with state-of-the-art methods. The new method shows most improvement in low frequency areas compared to the other techniques. This method can be inserted in…
Reduction of the number of spectral bands in Landsat images: a comparison of linear and nonlinear methods
2006
We describe some applications of linear and nonlinear pro- jection methods in order to reduce the number of spectral bands in Land- sat multispectral images. The nonlinear method is curvilinear component analysis CCA, and we propose an adapted optimization of it for image processing, based on the use of principal-component analysis PCA, a linear method. The principle of CCA consists in reproducing the topol- ogy of the original space projection points in a reduced subspace, keep- ing the maximum of information. Our conclusions are: CCA is an im- provement for dimension reduction of multispectral images; CCA is really a nonlinear extension of PCA; CCA optimization through PCA called CCAinitP…
A Large-Scale Empirical Evaluation of Cross-Validation and External Test Set Validation in (Q)SAR.
2013
(Q)SAR model validation is essential to ensure the quality of inferred models and to indicate future model predictivity on unseen compounds. Proper validation is also one of the requirements of regulatory authorities in order to accept the (Q)SAR model, and to approve its use in real world scenarios as alternative testing method. However, at the same time, the question of how to validate a (Q)SAR model, in particular whether to employ variants of cross-validation or external test set validation, is still under discussion. In this paper, we empirically compare a k-fold cross-validation with external test set validation. To this end we introduce a workflow allowing to realistically simulate t…