Interference impacts on 60 ghz real-time online video streaming in wireless smart tv platforms

In this paper we provide a method for computing and estimating the impact of interference on real-time online 1080p@30Hz and 1080p@60Hz high-definition video streaming in 60 GHz wireless smart TV platforms. The analysis involves two different interference scenarios: 1) downlink interference from deployed 60 GHz access points to the associated mobile ad-hoc devices, and 2) uplink interference from randomly deployed 60 GHz ad-hoc mobile devices to their associated access points. With these interference scenarios, the interference impact on the quality of main 1080p@30Hz and 1080p@60Hz wireless high-definition video streaming with various simulation settings are measured and estimated in terms of signal-to-interference-plus-noise ratio.     

A novel part-based approach to mean-shift algorithm for visual tracking

Visual tracking is one of the most important problems considered in computer vision. To improve the performance of the visual tracking, a part-based approach will be a good solution. In this paper, a novel method of visual tracking algorithm named part-based mean-shift (PBMS) algorithm is presented. In the proposed PBMS, unlike the standard mean-shift (MS), the target object is divided into multiple parts and the target is tracked by tracking each individual part and combining the results. For the part-based visual tracking, the objective function in the MS is modified such that the target object is represented as a combination of the parts and iterative optimization solution is presented. Further, the proposed PBMS provides a systematic and analytic way to determine the scale of the bounding box for the target from the perspective of the objective function optimization. Simulation is conducted with several benchmark problems and the result shows that the proposed PBMS outperforms the standard MS.

     

Note: Interpolation for evaluation of a two-dimensional spatial profile of plasma densities at low gas pressures

An interpolation algorithm for the evaluation of the spatial profile of plasma densities in a cylindrical reactor was developed for low gas pressures. The algorithm is based on a collisionless two-dimensional fluid model. Contrary to the collisional case, i.e., diffusion fluid model, the fitting algorithm depends on the aspect ratio of the cylindrical reactor. The spatial density profile of the collisionless fitting algorithm is presented in two-dimensional images and compared with the results of the diffusion fluid model.     

A high performance parallel DCT with OpenCL on heterogeneous computing environment

A noteworthy thing in desktop PCs is that they can provide a great opportunity to increase the performance of processing multimedia data by exploiting task- and data-parallelism with multi-core CPU and many-core GPU. This paper presents a high performance parallel implementation of 2D DCT on this heterogeneous computing environment. For this purpose, Intel TBB (threading building blocks) and OpenCL (Open Compute Language) are utilized for task- and data-parallelism, respectively. The simulation result shows that the parallel DCT implementations far the serial ones in processing speed. Especially, OpenCL implementation shows a linear speedup, a typical SIMD characteristic as the increase of 2D data sets.     

Polar-Cartesian Hybrid Transforms: A novel 2D range scan registration algorithm

Registration of range scans is commonly required in many localization and mapping algorithms. In this paper, we introduce a novel approach called Polar-Cartesian Hybrid Transforms for pair-wise registration of range scans. The proposed algorithm iteratively establishes correspondences by searching the points with closest polar angles in the polar coordinate frame. An angular look-up table is constructed based on the properties of the laser range finder to accelerate the searching procedure. In order to speed up the convergence, we compute the difference of polar range of every matched point pair to select the most contributing correspondences. After the correspondences are determined, the transformation is computed in Cartesian coordinate frame using a point-to-line metric. Combining the advantages of the polar and Cartesian coordinate frames, both robustness and efficiency are greatly improved compared with an up-to-date ICP algorithm.     

A finite memory filtering for end-to-end available bandwidth estimation

In this paper, a finite memory filter is proposed to estimate the available bandwidth through real-time tracking unknown parameters of the sloping straight line while removing undesired system and measurement noises. The finite memory filter is developed under a weighted least square criterion using only the most recent finite probe-packet measurements on the window. The proposed finite memory filtering based available bandwidth estimate is shown to have several inherent properties such as unbiasedness, deadbeat, and robustness. A guideline for choosing appropriate window length is described as it can significantly affect the estimation performance. Finally, computer simulations show that the proposed finite memory filtering based approach can be comparable with the Kalman filtering based approach with infinite memory structure for constantly or slowly changing available bandwidth and outperform that for dynamically changing available bandwidth.     

Image mosaicking for polyhedral scene and in particular singly visible surfaces

Image mosaic construction is about stitching together a number of images about the same scene to construct a single image with a larger field of view. The majority of the previous work was rooted at the use of a single image-to-image mapping termed planar homography for representing the imaged scene. However, the mapping is applicable only to cases where the imaged scene is either a single planar surface, or very distant from the cameras, or imaged under a pure rotation of the camera, and that greatly limits the range of applications of the mosaicking methods. This paper presents a novel mosaicking solution for scenes that are polyhedral (thus consisting of multiple surfaces) and that are pictured possibly in closed range of the camera. The solution has two major advantages. First, it requires only a few correspondences over the entire scene, not correspondences over every surface patch in it to work. Second, it conquers a seemingly impossible task—warping image data of surfaces that are visible in only one of the input images, which we refer to as the singly visible surfaces, to another viewpoint to constitute the mosaic there. We also provide a detail analysis of what determines whether a singly visible surface could be mosaicked or not. Experimental results on real image data are presented to illustrate the performance of the method.