Accurate Depth of Field Simulation in Real Time

We present a new post processing method of simulating depth of field based on accurate calculations of circles of confusion. Compared to previous work, our method derives actual scene depth information directly from the existing depth buffer, requires no specialized rendering passes, and allows easy integration into existing rendering applications. Our implementation uses an adaptive, two‐pass filter, producing a high quality depth of field effect that can be executed entirely on the GPU, taking advantage of the parallelism of modern graphics cards and permitting real time performance when applied to large numbers of pixels.     

Stochastic analysis of file-swarming systems

File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

一种彩色C型显示及数据处理终端

本文介绍了一种利用数字信号处理器ＴＭＳ３２０Ｃ２５用作雷达数据实时处理，利用图形处理器ＴＭＳ３４０１０用作雷达视频图象处理，完成雷达视频图象彩色显示的雷达终端。     

A fast digital Radon transform—An efficient means for evaluating the Hough transform

A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N² log N additions for an N × N image. This transform can be used to evaluate the Hough transform to detect straight lines in a digital image. Whilst a parallel implementation of the Hough transform algorithm is difficult because of global memory access requirements, the fast digital Radon transform is vectorizable and therefore well suited for parallel computation. The structure of the fast algorithm is shown to be quite similar to the FFT algorithm for decimation in frequency. It is demonstrated that even for sequential computation the fast Radon transform is an attractive alternative to the classical Hough transform algorithm.     

Concealed weapon detection and visualization in a synthesized image

Images acquired by heterogeneous image sensors may provide complementary information about the scene, for instance, the visual image can provide personal identification information like the facial pattern while the infrared (IR) or millimeter wave image can detect the suspicious regions of concealed weapons. Usually, a technique, namely multiresolution pixel-level image fusion is applied to integrate the information from multi-sensor images. However, when the images are significantly different, the performance of the multiresolution fusion algorithms is not always satisfactory. In this study, a new strategy consisting of two steps is proposed. The first step is to use an unsupervised fuzzy k-means clustering to detect the concealed weapon from the IR image. The detected region is embedded in the visual image in the second step and this process is implemented with a multiresolution mosaic technique. Therefore, the synthesized image retains the quality comparable to the visual image while the region of the concealed weapon is highlighted and enhanced. The experimental results indicate the efficiency of the proposed approach.This material is based on part of the work carried out at the SPCR laboratory of Lehigh University and the work is partially supported by the U. S. Army Research Office under grant number DAAD19-00-1-0431. The content of the information does not necessarily reflect the position or the policy of the federal government, and no official endorsement should be inferred.     

Two years of operational use of Subpixel Automatic Navigation of AVHRR scheme: accuracy assessment and validation

Automated techniques for satellite imagery navigation and co-location are especially required for environmental monitoring activities intensively using satellite data. In this work are presented the results obtained after 2 years of operational use of the Subpixel Automatic Navigation of AVHRR (SANA) scheme. An automatic method for accuracy assessment of satellite navigation techniques, which permits a preliminary evaluation of their performances, dealing with a large collection of test images is also proposed. The navigation accuracy assessment, performed by using a selection of small islands as reference points, is discussed.Results achieved over more than 400 Advanced Very-High-Resolution Radiometer (AVHRR) scenes confirm that the SANA scheme is a very accurate one (computed mean navigation error is generally about one AVHRR pixel). Furthermore, because of its high processing speed, it can be considered a suitable tool for intensive satellite data processing in multitemporal analyses, especially required for environmental studies as well as for operational monitoring purposes.     

An empirical investigation of socio-cultural factors of information sharing in China

Understanding information sharing is an important challenge to modern organizations, and is likely to be increasingly considered when IT investment decisions are made world-wide. Our research study investigated the influence of cultural factors on information sharing in China. It was postulated that social network structures such as guanxi, Confucian dynamism, and collectivism could explain the degree to which information sharing took place between people in China. It was found that guanxi, Confucian dynamism, and collectivism all had a significant influence on information sharing.