Search results for " Representation."
showing 10 items of 791 documents
Visual servo control using orthinormal polynomial
2003
This paper describes an application of the visual servoing approach to vision-based control in robotics. The basic idea addresses the use of a vision sensor in the feedback loop within the controlled vision framework. It consists in tracking of arbitrary 3-D objects travelling at unknown velocities in a 2-D space (depth is given as known). Once the necessary modeling stage is performed, the framework becomes one of automatic control, and naturally stability, performance and robustness questions arise. Here, we consider to track line segments corresponding to the edges extracted from the image being analyzed. Two representations for a line segment are presented and discussed, and an appropri…
Posets That Locally Resemble Distributive Lattices
2000
Abstract Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanley. Similar theorems are proven for semimodular, modular, and complemented modular lattices. As a corollary, a theorem of Stanley for Boolean lattices is obtained, as well as a theorem of Grabiner (conjectured by Stanley) for products of chains. Applications to incidence geometry and connections with the theory of buildings are discussed.
Character correspondences in blocks with normal defect groups
2014
Abstract In this paper we give an extension of the Glauberman correspondence to certain characters of blocks with normal defect groups.
Compactness of Fourier integral operators on weighted modulation spaces
2019
Using the matrix representation of Fourier integral operators with respect to a Gabor frame, we study their compactness on weighted modulation spaces. As a consequence, we recover and improve some compactness results for pseudodifferential operators.
Are There Essentially Incomplete Knowledge Representation Systems?
2001
A mathematical model of a knowledge representation system (KR-system) is proposed. Its prototype is the concept of an information system in the sense of Z. Pawlak; however, the model is, in fact, a substantial extension of the latter. In our model, attributes may form an arbitrary category, where morphisms represent built-in functional dependencies, and uncertainty of knowledge is treated in terms of category theory via monads. Several notions of simulation are also considered for such KR-systems. In this general setting, the semiphilosophical problem mentioned in the title, still open, is given a precise meaning.
Animated Representations. Multimedia Techniques for Storytelling
2023
The paper presents the results of two case studies that use multimedia language for the knowledge, appreciation and communication of works of art of different epochs, nature and location and that, through the tools of Representation, make use of digital methods of animation and visualisation. The final results concern the creation of multimedia products designed to narrate a conceptual path, through a reasoned animation of raster and vectorial products. Together with the necessary technical and IT skills, it is essential to reaffirm the role of representation, which is central to image processing, recognition of graphic analogies, study of proportions, knowledge of the laws of visual percep…
Looking Across Instead of Back and Forth: How the Simultaneous Presentation of Multiple Animation Episodes Facilitates Learning
2017
Many learning tasks require students to induce higher-order relationships from the learning material. Compare and contrast processes play a pivotal role in solving such inductive tasks. Different presentations of animation episodes offer affordances to students that can either impede or facilitate compare and contrast processes. While conventional behaviorally realistic animations typically present multiple episodes one after the other, i.e. sequentially, simultaneous presentation offers a feasible alternative. We investigated how the sequential and simultaneous presentation of multiple animation episodes affects students’ perceptual interrogation of the animation as well as their learning …
Processing and learning from multiple sources: A comparative case study of students with dyslexia working in a multiple source multimedia context
2019
This study investigated how four 10th-grade students with dyslexia processed and integrated information across web pages and representations when learning in a multiple source multimedia context. Eye movement data showed that participants’ processing of the materials varied with respect to their initial exploration of the web pages, their overall processing time, and the linearity of their processing patterns, with post-learning interviews indicating the deliberate, strategic considerations underlying each participant’s processing pattern. Eye movement data in terms of fixation duration and percentage of regressions also corroborated the findings of formal, diagnostic assessments. Finally, …
Knowledge Acquisition from Multiple Experts Based on Semantics of Concepts
1999
This paper presents one approach to acquire knowledge from multiple experts. The experts are grouped into a multilevel hierarchical structure, according to the type of knowledge acquired. The first level consists of experts who have knowledge about the basic objects and their relationships. The second level of experts includes those who have knowledge about the relationships of the experts at the first level and each higher level accordingly. We show how to derive the most supported opinion among the experts at each level. This is used to order the experts into categories of their competence defined as the support they get from their colleagues.
The Kolmogorov Spline Network for Image Processing
2011
In 1900, Hilbert stated that high order equations cannot be solved by sums and compositions of bivariate functions. In 1957, Kolmogorov proved this hypothesis wrong and presented his superposition theorem (KST) that allowed for writing every multivariate functions as sums and compositions of univariate functions. Sprecher has proposed in (Sprecher, 1996) and (Sprecher, 1997) an algorithm for exact univariate function reconstruction. Sprecher explicitly describes construction methods for univariate functions and introduces fundamental notions for the theorem comprehension (such as tilage). Köppen has presented applications of this algorithm to image processing in (Köppen, 2002) and (Köppen &…