Search results for "Data type"
showing 10 items of 1183 documents
Microscopic and macroscopic 3D imaging and display by integral imaging
2011
Integral imaging is a rising 3D imaging technique that can be considered the incoherent version of holography. In integral imaging the multiperspective information of 3D scenes is stored in a 2D picture. Such picture, composed by a set of elemental images, is obtained through a 2D array of microlenses. The elemental-images set can be used for many purposes. One is the display of 3D color scenes to audiences or much more than one person. Other is the 3D display, with full parallax, in personal monitors, like the screen of a smartphone, a tablet, or the monitor used by a surgeon in an endoscopic operation. Other important types of applications are connected with the topographic reconstruction…
Optimized integral imaging display by global pixel mapping
2006
Integral imaging systems are imaging devices that provide 3D images of 3D objects. When integral imaging systems work in their standard configuration the provided reconstructed images are pseudoscopic; that is, are reversed in depth. In this paper we present a technique for formation of real, undistorted, orthoscopic integral images by direct pickup. The technique is based on a global mapping of pixels of an elemental-images set. Simulated imaging experiments are presented.
Defining Interaction Design Patterns to Extract Knowledge from Big Data
2018
[EN] The Big Data domain offers valuable opportunities to gain valuable knowledge. The User Interface (UI), the place where the user interacts to extract knowledge from data, must be adapted to address the domain complexities. Designing UIs for Big Data becomes a challenge that involves identifying and designing the user-data interaction implicated in the knowledge extraction. To design such an interaction, one widely used approach is design patterns. Design Patterns describe solutions to common interaction design problems. This paper proposes a set of patterns to design UIs aimed at extracting knowledge from the Big Data systems data conceptual schemas. As a practical example, we apply the…
Wannier90 as a community code: new features and applications
2019
Wannier90 is an open-source computer program for calculating maximally-localised Wannier functions (MLWFs) from a set of Bloch states. It is interfaced to many widely used electronic-structure codes thanks to its independence from the basis sets representing these Bloch states. In the past few years the development of Wannier90 has transitioned to a community-driven model; this has resulted in a number of new developments that have been recently released in Wannier90 v3.0. In this article we describe these new functionalities, that include the implementation of new features for wannierisation and disentanglement (symmetry-adapted Wannier functions, selectively-localised Wannier functions, s…
Internal Test Sets Studies in a Group of Antimalarials
2006
Topological indices have been applied to build QSAR models for a set of 20 an- timalarial cyclic peroxy cetals. In order to evalua te the reliability of the proposed linear models leave-n-out and Internal Test Sets (ITS) approaches have b een considered. The pro- posed procedure resulted in a robust and consensued prediction equation and here it is shown why it is superior to the employed standard c ross-validation algorithms involving multilinear regression models.
Boolean-controlled systems via receding horizon and linear programing
2009
We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems.
A relevance feedback CBIR algorithm based on fuzzy sets
2008
CBIR (content-based image retrieval) systems attempt to allow users to perform searches in large picture repositories. In most existing CBIR systems, images are represented by vectors of low level features. Searches in these systems are usually based on distance measurements defined in terms of weighted combinations of the low level features. This paper presents a novel approach to combining features when using multi-image queries consisting of positive and negative selections. A fuzzy set is defined so that the degree of membership of each image in the repository to this fuzzy set is related to the user's interest in that image. Positive and negative selections are then used to determine t…
Gait Analysis Using Multiple Kinect Sensors
2014
A gait analysis technique to model user presences in an office scenario is presented in this chapter. In contrast with other approaches, we use unobtrusive sensors, i.e., an array of Kinect devices, to detect some features of interest. In particular, the position and the spatio-temporal evolution of some skeletal joints are used to define a set of gait features, which can be either static (e.g., person height) or dynamic (e.g., gait cycle duration). Data captured by multiple Kinects is merged to detect dynamic features in a longer walk sequence. The approach proposed here was been evaluated by using three classifiers (SVM, KNN, Naive Bayes) on different feature subsets.
On the Kneser property for reaction–diffusion systems on unbounded domains
2009
Abstract We prove the Kneser property (i.e. the connectedness and compactness of the attainability set at any time) for reaction–diffusion systems on unbounded domains in which we do not know whether the property of uniqueness of the Cauchy problem holds or not. Using this property we obtain that the global attractor of such systems is connected. Finally, these results are applied to the complex Ginzburg–Landau equation.
Automated vehicles' work planning in flexible manufacturing systems
2006
The problem of rules setting in coordination of automated vehicles access to shared system resources (sections of their transportation paths) which assure a deadlock free and starvation free flow of the executed processes belongs to NP-hard problems. Assuming that there are local (controlling access to shared resources) rules of priority dispatching, the problem deals with setting conditions sufficient for a pair (initial state, set of priority dispatching rules). The assumed knowledge base way of specifying a transportation subsystem leads to solving a logic-algebraic method decision problem. In this regard, the working knowledge representation synthesis method constitutes a significant co…