Search

The paper presents a new open-source visualization system, named ReVisE, aimed to provide interactive visualization of large datasets, which are results of complex numerical simulations. These datasets are hosted on a remote server or a supercomputer. The design of the system is briefly described. Dataset representation, proposed for interactive visualization and implemented in the system, is discussed. The effectiveness of our approach is confirmed by results of performance measurements on test and real-life large datasets. A comparison with other visualization systems is presented. Future plans of system development are outlined.

As an important cause of global warming, CO2 concentrations and their changes have aroused worldwide concern. Establishing explicit understanding of the spatial and temporal distributions of CO2 concentrations at regional scale is a crucial technical problem for climate change research. High accuracy surface modeling (HASM) is employed in this paper using the output of the CO2 concentrations from weather research and forecasting-chemistry (WRF-CHEM) as the driving fields, and the greenhouse gases observing satellite (GOSAT) retrieval XCO2 data as the accuracy control conditions to obtain high accuracy XCO2 fields. WRF-CHEM is an atmospheric chemical transport model designed for regional studies of CO2 concentrations. Verified by ground- and space-based observations, WRF-CHEM has a limited ability to simulate the conditions of CO2 concentrations. After conducting HASM, we obtain a higher accuracy distribution of the CO2 in North China than those calculated using the classical Kriging and inverse distance weighted (IDW) interpolation methods, which were often used in past studies. The cross-validation also shows that the averaging mean absolute error (MAE) of the results from HASM is 1.12 ppmv, and the averaging root mean square error (RMSE) is 1.41 ppmv, both of which are lower than those of the Kriging and IDW methods. This study also analyses the space-time distributions and variations of the XCO2 from the HASM results. This analysis shows that in February and March, there was the high value zone in the southern region of study area relating to heating in the winter and the dense population. The XCO2 concentration decreased by the end of the heating period and during the growing period of April and May, and only some relatively high value zones continued to exist.

A new Interpolation based Reversible Data Hiding (IRDH) scheme is reported in this paper. For different applications of an IRDH scheme to the digital image, video, multimedia, big-data and biological data, the embedding capacity requirement usually varies. Disregarding this important consideration, existing IRDH schemes do not offer a better embedding rate-distortion performance for varying size payloads. To attain this varying capacity requirement with our proposed adaptive embedding, we formulate a capacity control parameter and propose to utilize it to determine a minimum set of embeddable bits in a pixel. Additionally, we use a logical (or bit-wise) correlation between the embeddable pixel and estimated versions of an embedded pixel. Thereby, while a higher range between an upper and lower limit of the embedding capacity is maintained, a given capacity requirement within that limit is also attained with a better-embedded image quality. Computational modeling of all new processes of the scheme is presented, and performance of the scheme is evaluated with a set of popular test-images. Experimental results of our proposed scheme compared to the prominent IRDH schemes have recorded a significantly better-embedding rate-distortion performance.

Background Different equations have been used to describe and understand the growth kinetics of undisturbed malignant solid tumors. The aim of this paper is to propose a new formulation of the Gompertz equation in terms of different parameters of a malignant tumor: the intrinsic growth rate, the deceleration factor, the apoptosis rate, the number of cells corresponding to the tumor latency time, and the fractal dimensions of the tumor and its contour. Methods Furthermore, different formulations of the Gompertz equation are used to fit experimental data of the Ehrlich and fibrosarcoma Sa-37 tumors that grow in male BALB/c/Cenp mice. The parameters of each equation are obtained from these fittings. Results The new formulation of the Gompertz equation reveals that the initial number of cancerous cells in the conventional Gompertz equation is not a constant but a variable that depends nonlinearly on time and the tumor deceleration factor. In turn, this deceleration factor depends on the apoptosis rate of tumor cells and the fractal dimensions of the tumor and its irregular contour. Conclusions It is concluded that this new formulation has two parameters that are directly estimated from the experiment, describes well the growth kinetics of unperturbed Ehrlich and fibrosarcoma Sa-37 tumors, and confirms the fractal origin of the Gompertz formulation and the fractal property of tumors.

The spatial resolution of diffusion-weighted imaging (DWI) is limited by several physical and clinical considerations, such as practical scanning times. Interpolation methods, which are widely used to enhance resolution, often result in blurred edges. Advanced superresolution scanning acquires images with specific protocols and long acquisition times. In this paper, we propose a novel single image superresolution (SR) method which introduces high-order SVD (HOSVD) to regularize the patch-based SR framework on DWI datasets. The proposed method was implemented on an adaptive basis which ensured a more accurate reconstruction of high-resolution DWI datasets. Meanwhile, the intrinsic dimensional decreasing property of HOSVD is also beneficial for reducing the computational burden. Experimental results from both synthetic and real DWI datasets demonstrate that the proposed method enhances the details in reconstructed high-resolution DWI datasets and outperforms conventional techniques such as interpolation methods and nonlocal upsampling.

The nonrigid registration algorithm based on B-spline Free-Form Deformation (FFD) plays a key role and is widely applied in medical image processing due to the good flexibility and robustness. However, it requires a tremendous amount of computing time to obtain more accurate registration results especially for a large amount of medical image data. To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper. First, the Logarithm Squared Difference (LSD) is considered as the similarity metric in the B-spline registration algorithm to improve registration precision. After that, we create a parallel computing strategy and lookup tables (LUTs) to reduce the complexity of the B-spline registration algorithm. As a result, the computing time of three time-consuming steps including B-splines interpolation, LSD computation, and the analytic gradient computation of LSD, is efficiently reduced, for the B-spline registration algorithm employs the Nonlinear Conjugate Gradient (NCG) optimization method. Experimental results of registration quality and execution efficiency on the large amount of medical images show that our algorithm achieves a better registration accuracy in terms of the differences between the best deformation fields and ground truth and a speedup of 17 times over the single-threaded CPU implementation due to the powerful parallel computing ability of Graphics Processing Unit (GPU).

Dynamic solar shading has the potential to dramatically reduce the energy consumption in buildings while at the same time improving the thermal and visual comfort of its occupants. Many new typologies of shading systems that have appeared recently, but it is difficult to compare those new systems to existing typologies due to control algorithm being rule-based as opposed to performance driven. Since solar shading is a design problem, there is no single right answer. What is the metric to determine if a system has reached its optimal kinematic design? Shading solutions should come from a thorough iterative and comparative process. This paper provides an original and flexible framework for the design and performance optimization of dynamic shading systems based on interpolation of simulations and global minimization. The methodology departs from existing rule-based strategies and applies to existing and to complex shading systems with multiple degree-of-freedom mobility. The strategy for control is centered on meeting comfort targets for work plane illuminance while minimizing the energy needed to operate space. The energy demand for thermal comfort and work plane daylight quantity (illuminance) are evaluated with Radiance and EnergyPlus based on local weather data. Applied to a case study of three typologies of dynamic shading, the results of the methodology inform the usefulness and quality of each degree-of-freedom of the kinematic systems. The case study exemplifies the iterative benefits of the methodology by providing detailed analytics on the behavior of the shades. Designers of shading systems can use this framework to evaluate their design and compare them to existing shading systems. This allows creativity to be guided so that eventually building occupants benefit from the innovation in the field.

Analytical CT reconstruction is popular in practice because of its computational efficiency, but it suffers from low reconstruction quality when an insufficient number of projections are used. To address this issue, this paper presents a new analytical method of backprojection Wiener deconvolution (BPWD). BPWD executes backprojection first, and then applies a Wiener deconvolution to the whole backprojected image. The Wiener filter is derived from a ramp filter, enabling the proposed approach to perform reconstruction and denoising simultaneously. The use of a filter after backprojection does not differentiate between real sampled projections and interpolated ones, introducing reconstruction errors. Therefore a weighted ramp filter was applied to increase the contribution of real sampled projections in the reconstruction, thus improving reconstruction quality. Experiments on synthetic data and real phase-contrast x-ray images showed that the proposed approach yields better reconstruction quality compared to the classical filtered backprojection (FBP) method, with comparable reconstruction speed Refereed/Peer-reviewed

The availability of digital X-ray detectors, together with advances in reconstruction algorithms, creates an opportunity for bringing 3D capabilities to conventional radiology systems. The downside is that reconstruction algorithms for non-standard acquisition protocols are generally based on iterative approaches that involve a high computational burden. The development of new flexible X-ray systems could benefit from computer simulations, which may enable performance to be checked before expensive real systems are implemented. The development of simulation/reconstruction algorithms in this context poses three main difficulties. First, the algorithms deal with large data volumes and are computationally expensive, thus leading to the need for hardware and software optimizations. Second, these optimizations are limited by the high flexibility required to explore new scanning geometries, including fully configurable positioning of source and detector elements. And third, the evolution of the various hardware setups increases the effort required for maintaining and adapting the implementations to current and future programming models. Previous works lack support for completely flexible geometries and/or compatibility with multiple programming models and platforms. In this paper, we present FUX-Sim, a novel X-ray simulation/reconstruction framework that was designed to be flexible and fast. Optimized implementation for different families of GPUs (CUDA and OpenCL) and multi-core CPUs was achieved thanks to a modularized approach based on a layered architecture and parallel implementation of the algorithms for both architectures. A detailed performance evaluation demonstrates that for different system configurations and hardware platforms, FUX-Sim maximizes performance with the CUDA programming model (5 times faster than other state-of-the-art implementations). Furthermore, the CPU and OpenCL programming models allow FUX-Sim to be executed over a wide range of hardware platforms.

The scientific demand for more accurate modeling of the climate system calls for more computing power to support higher resolutions, inclusion of more component models, more complicated physics schemes, and larger ensembles. As the recent improvements in computing power mostly come from the increasing number of nodes in a system and the integration of heterogeneous accelerators, how to scale the computing problems onto more nodes and various kinds of accelerators has become a challenge for the model development. This paper describes our efforts on developing a highly scalable framework for performing global atmospheric modeling on heterogeneous supercomputers equipped with various accelerators, such as GPU (Graphic Processing Unit), MIC (Many Integrated Core), and FPGA (Field Programmable Gate Arrays) cards. We propose a generalized partition scheme of the problem domain, so as to keep a balanced utilization of both CPU resources and accelerator resources. With optimizations on both computing and memory access patterns, we manage to achieve around 8 to 20 times speedup when comparing one hybrid GPU or MIC node with one CPU node with 12 cores. Using a customized FPGA-based data-flow engines, we see the potential to gain another 5 to 8 times improvement on performance. On heterogeneous supercomputers, such as Tianhe-1A and Tianhe-2, our framework is capable of achieving ideally linear scaling efficiency, and sustained double-precision performances of 581 Tflops on Tianhe-1A (using 3750 nodes) and 3.74 Pflops on Tianhe-2 (using 8644 nodes). Our study also provides an evaluation on the programming paradigm of various accelerator architectures (GPU, MIC, FPGA) for performing global atmospheric simulation, to form a picture about both the potential performance benefits and the programming efforts involved.

Saliency detection is widely used in many visual applications like image segmentation, object recognition and classification. In this paper, we will introduce a new method to detect salient objects in natural images. The approach is based on a regional principal color contrast modal, which incorporates low-level and medium-level visual cues. The method allows a simple computation of color features and two categories of spatial relationships to a saliency map, achieving higher F-measure rates. At the same time, we present an interpolation approach to evaluate resulting curves, and analyze parameters selection. Our method enables the effective computation of arbitrary resolution images. Experimental results on a saliency database show that our approach produces high quality saliency maps and performs favorably against ten saliency detection algorithms.