Clustering interval data through kernel-induced feature space

Recently, kernel-based clustering in feature space has shown to perform better than conventional clustering methods in unsupervised classification. In this paper, a partitioning clustering method in kernel-induce feature space for symbolic interval-valued data is introduced. The distance between an item and its prototype in feature space is expanded using a two-component mixture kernel to handle intervals. Moreover, tools for the partition and cluster interpretation of interval-valued data in feature space are also presented. To show the effectiveness of the proposed method, experiments with real and synthetic interval data sets were performed and a study comparing the proposed method with different clustering algorithms of the literature is also presented. The clustering quality furnished by the methods is measured by an external cluster validity index (corrected Rand index). These experiments showed the usefulness of the kernel K-means method for interval-valued data and the merit of the partition and cluster interpretation tools.     

Handwritten Data Clustering Using Agents Competition in Networks

In this paper, we study a new type of competitive learning scheme realized on large-scale networks. The model consists of several agents walking within the network and competing with each other to occupy as many nodes as possible, while attempting to reject intruder agents. In the end of the process, each agent dominates a community (a strongly connected subnetwork). Here, the model is described by a stochastic dynamical system. In this paper, a mathematical analysis for uncovering the system’s properties is presented. In addition, the model is applied to solve handwritten digits and letters clustering problems. An interesting feature is that the model is able to group the same digits or letters even with considerable distortions into the same cluster. Computer simulations reveal that the proposed technique presents high precision of cluster detections, as well as low computational complexity.     

Student progress assessment with the help of an intelligent pupil analysis system

Students and lecturers would like to know how well students have learned the study materials being taught. A formal test or exam would cause needless stress for students. To resolve this problem, the authors of this article have developed an Intelligent Pupil Analysis (IPA) System. A sufficient amount of studies worldwide prove an interrelation between pupil size and a person's cognitive load. The obtained research results are comparable with the results from other similar studies. The original contribution of this article, compared to the research results published earlier, is as follows: the IPA System developed by the authors is superior to the traditional pupil analysis research due to the integration of pupil analysis with subsystems of decision support, recommender and intelligent tutoring systems and innovative Models of the Model-base, which permit a more detailed analysis of the knowledge attained by a student. This article ends with a case study to demonstrate the practical operation of the IPA System.     

Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform

Networks-on-Chip (NoC) is an interesting option in design of communication infrastructures for embedded systems. It provides a scalable structure and balanced communication between the cores. Parallel applications that take advantage of the NoC architectures, are usually are communication-intensive. Thus, a big deal of data packets is transmitted simultaneously through the network. In order to avoid congestion delays that deteriorate the execution time of the implemented applications, an efficient routing strategy must be thought of carefully. In this paper, the ant colony optimization paradigm is explored to find and optimize routes in a mesh-based NoC. The proposed routing algorithms are simple yet efficient. The routing optimization is driven by the minimization of total latency during packets transmission between the tasks that compose the application. The presented performance evaluation is threefold: first, the impact of well-known synthetic traffic patterns is assessed; second, randomly generated applications are mapped into the NoC infrastructure and some synthetic communication traffics, that follow known patterns, are used to simulate real situations; third, sixteen real-world applications of the E3S and one specific application for digital image processing are mapped and their execution time evaluated. In both cases, the obtained results are compared to those obtained with known general purpose algorithms for deadlock free routing. The comparison avers the effectiveness and superiority of the ant colony inspired routing.     

Temporal scale and spatial resolution effects on Amazon forest fragmentation assessment in Rondônia

The Amazon has been under an intense deforestation process for the last 30 years, causing landscape fragmentation in many different regions and at distinct stages. The fragmentation process is commonly assessed by land‐use maps derived from satellite sensor data and analysed at a landscape context. The analysis of fragmentation depends on an adequate choice of spatial resolution of land‐use maps, and temporal scale in landscape dynamics studies. In this study, spatial–temporal resolution variation effects on fragmentation assessment were analysed in the Quatro Cachoeiras watershed, located at central Rondônia, Brazilian Amazon. Land‐use maps derived from 1984 to 2002 satellite sensor data at 2‐year intervals were used for landscape structure analysis on 12 samples randomly distributed along the watershed. In the spatial resolution variation analysis, landscape metrics obtained at 30 m resolution were compared with those obtained at coarser spatial resolutions. Effects of temporal scale variation were tested by comparison of landscape metrics calculated at 2‐, 4‐ and 6‐year intervals in the studied period. Results show that fragmentation stage influences sensitivity of landscape metrics for spatial resolution and at initial stages of fragmentation finer spatial resolution is required. Also, coarser resolutions up to 100 m could be used to assess landscape fragmentation at regions and the adequate time interval for landscape dynamics studies should be between 3 and 4 years.     

Adaptive Ray‐bundle Tracing with Memory Usage Prediction: Efficient Global Illumination in Large Scenes

This paper proposes an adaptive rendering technique for ray‐bundle tracing. Ray‐bundle tracing can be done by per‐pixel linked‐list construction on a GPU rasterization pipeline. This rasterization based approach offers significant benefits for the efficient generation of light maps (e.g., hardware acceleration, tessellation, and recycling of shaders used in real‐time graphics). However, it is inapplicable to large and complex scenes due to the limited capacity of the GPU memory because it requires a high‐resolution frame buffer and high‐capacity node buffer for the linked‐lists. In addition, memory overflow can potentially occur on the per‐pixel linked‐list since the memory usage of the lists is usually unknown before the rendering process. We introduce an adaptive tiling technique with memory usage prediction. Our method uses an appropriately tiled frame buffer, thus eliminating almost all of the overflow risks thanks to our adaptive tile subdivision scheme. Using this technique, we are able to render high‐quality light maps of large and complex scenes which cannot be computed using previous ray‐bundle based methods.     

Quad‐Mesh Generation and Processing: A Survey

Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi‐regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this survey we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrisation and remeshing.     

Optimizing Disparity for Motion in Depth

Beyond the careful design of stereo acquisition equipment and rendering algorithms, disparity post‐processing has recently received much attention, where one of the key tasks is to compress the originally large disparity range to avoid viewing discomfort. The perception of dynamic stereo content however, relies on reproducing the full disparity‐time volume that a scene point undergoes in motion. This volume can be strongly distorted in manipulation, which is only concerned with changing disparity at one instant in time, even if the temporal coherence of that change is maintained. We propose an optimization to preserve stereo motion of content that was subject to an arbitrary disparity manipulation, based on a perceptual model of temporal disparity changes. Furthermore, we introduce a novel 3D warping technique to create stereo image pairs that conform to this optimized disparity map. The paper concludes with perceptual studies of motion reproduction quality and task performance in a simple game, showing how our optimization can achieve both viewing comfort and faithful stereo motion.