Vector Image Segmentation by Piecewise Continuous Approximation

In this article we present an approach to the segmentation problem by a piecewise approximation of the given image with continuous functions. Unlike the common approach of Mumford and Shah in our formulation of the problem the number of segments is a parameter, which can be estimated. The problem can be stated as: Compute the optimal segmentation with a fixed number of segments, then reduce the number of segments until the segmentation result fulfills a given suitability. This merging algorithm results in a multi-objective optimization, which is not only resolved by a linear combination of the contradicting error functions. To constrain the problem we use a finite dimensional vector space of functions in our approximation and we restrict the shape of the segments. Our approach results in a multi-objective optimization: On the one hand the number of segments is to be minimized, on the other hand the approximation error should also be kept minimal. The approach is sound theoretically and practically: We show that for L ²-images a Pareto-optimal solution exists and can be computed for the discretization of the image efficiently.     

Elimination of artifacts due to occlusion and discretization problems in image space blurring techniques

Traditional computer graphics methods render images that appear sharp at all depths. Adding blur can add realism to a scene, provide a sense of scale, and draw a viewer’s attention to a particular region of a scene. Our image-based blur algorithm needs to distinguish whether a portion of an image is either from a single object or is part of more than one object. This motivates two approaches to identify objects after an image has been rendered. We illustrate how these techniques can be used in conjunction with our image space method to add blur to a scene.     

Treatment of insomnia. Getting to the root of sleeping problems

Insomnia may be periodic and transient, as caused by situational stress, or persistent, as caused by a chronic sleep disorder. Physicians can gain much information concerning the type, probable cause, onset, and duration of insomnia through history taking. A sleep diary may reveal helpful information, and input from the patient's sleeping partner can also be valuable. Complicating disorders, such as heart failure, prostatism, or depression, should be sought and specific treatment prescribed. Chemical dependency, too, requires appropriate treatment. These measures, institution of good sleep-hygiene practices, and behavior modification may resolve sleeplessness. The primary indication for use of hypnotic agents is transient sleep disruption caused by acute stress. When an agent is chosen, onset of action, metabolism, and side effects should be considered, especially in elderly patients. Addictive agents should not be given to patients with substance abuse problems. If insomnia persists, evaluation at a sleep-disorder center is recommended to facilitate design of an appropriate therapeutic regimen.     

Morphological image sequence processing

We present a morphological multi-scale method for image sequence processing, which results in a truly coupled spatio-temporal anisotropic diffusion. The aim of the method is not to smooth the level-sets of single frames but to denoise the whole sequence while retaining geometric features such as spatial edges and highly accelerated motions. This is obtained by an anisotropic spatio-temporal level-set evolution, where the additional artificial time variable serves as the multi-scale parameter. The diffusion tensor of the evolution depends on the morphology of the sequence, given by spatial curvatures of the level-sets and the curvature of trajectories (=acceleration) in sequence-time. We discuss different regularization techniques and describe an operator splitting technique for solving the problem. Finally we compare the new method with existing multi-scale image sequence processing methodologies.     

Associative symmetry versus independent associations in the memory for object-location associations.

The formation of associations between objects and locations is a vital aspect of episodic memory. More specifically, remembering the location where one experienced an object and, vice versa, the object one encountered at a specific location are both important elements for the memory of an event. Whether episodic associations are holistic representations of individual components or whether there are unidirectional, separately modifiable connections between them has been investigated nearly exclusively using verbal stimuli. A preliminary conclusion concerning this controversy is that verbal associations are, at least, highly correlated (M. J. Kahana, 2002). This theoretical debate, which in the past has undergone a major empirical effort, is still of relevance for the concurrent global matching models of associative memory (S. E. Clark & S. D. Gronlund, 1996). The authors used variations of a novel object-location learning paradigm to complement the accumulated evidence regarding the nature of episodic associations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Parallel Dynamic Binary Translator for Efficient Multi-Core Simulation

In recent years multi-core processors have seen broad adoption in application domains ranging from embedded systems through general-purpose computing to large-scale data centres. Simulation technology for multi-core systems, however, lags behind and does not provide the simulation speed required to effectively support design space exploration and parallel software development. While state-of-the-art instruction set simulators (Iss) for single-core machines reach or exceed the performance levels of speed-optimised silicon implementations of embedded processors, the same does not hold for multi-core simulators where large performance penalties are to be paid. In this paper we develop a fast and scalable simulation methodology for multi-core platforms based on parallel and just-in-time (Jit) dynamic binary translation (Dbt). Our approach can model large-scale multi-core configurations, does not rely on prior profiling, instrumentation, or compilation, and works for all binaries targeting a state-of-the-art embedded multi-core platform implementing the ARCompact instruction set architecture (Isa). We have evaluated our parallel simulation methodology against the industry standard Splash-2 and Eembc MultiBench benchmarks and demonstrate simulation speeds up to 25,307 Mips on a 32-core x86 host machine for as many as 2,048 target processors whilst exhibiting minimal and near constant overhead, including memory considerations.     

Close-range hyperspectral imaging for geological field studies: workflow and methods

Close-range hyperspectral imaging is a new method for geological research, in which imaging spectrometry is applied from the ground, allowing the mineralogy and lithology in near-vertical cliff sections to be studied in detail. Contemporary outcrop studies often make use of photorealistic three-dimensional (3D) models, derived from terrestrial laser scanning (lidar), that facilitate geological interpretation of geometric features. Hyperspectral imaging provides complementary geochemical information that can be combined with lidar models, enhancing quantitative and qualitative analyses. This article describes a complete workflow for applying close-range hyperspectral imaging, from planning the optimal scan conditions and data acquisition, through pre-processing the hyperspectral imagery and spectral mapping, integration with lidar photorealistic 3D models, and analysis of the geological results. Pre-processing of the hyperspectral images involves the reduction of scanner artefacts and image discontinuities, as well as relative reflectance calibration using empirical line correction, based on two calibrated reflection targets. Signal-to-noise ratios better than 70:1 are achieved for materials with 50% reflectance. The lidar-based models are textured with products such as hyperspectral classification maps. Examples from carbonate and siliciclastic geological environments are presented, with results showing that spectrally similar material, such as different dolomite types or sandstone and siltstone, can be distinguished and spectrally mapped. This workflow offers a novel and flexible technique for applications, in which a close-range instrument setup is required and the spatial distribution of minerals or chemical variations is valuable.     

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.