This paper presents a graph cut-based fast texture synthesis algorithm which utilizes CUDA to greatly accelerate the synthesis speed. The whole sample serves as a patch and is laid into the synthesized image repeatedl...
详细信息
ISBN:
(纸本)9781424471645;9781424471638
This paper presents a graph cut-based fast texture synthesis algorithm which utilizes CUDA to greatly accelerate the synthesis speed. The whole sample serves as a patch and is laid into the synthesized image repeatedly to build the final texture, and graph cut is used to determine the optimal patch boundaries. To speed up the synthesis speed, the patch locations are only selected based on a small set, which consists of some optimal relative offsets between two patches and is constructed in the preprocessing step. The matching errors during patch selection are also estimated without much computation from the information provided by this step. The graph cut algorithm is implemented every time a patch is laid, resulting in its becoming the bottleneck of the synthesis process. This problem is solved by virtue of the CUDA implementation of the maxflow/mincut algorithm. Graph construction and the preprocessing step are also accelerated with CUDA. The speed of the synthesis is several to dozens of times faster than the traditional algorithm without GPU acceleration.
Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distance estimation is handling anisotropic problems in...
详细信息
ISBN:
(纸本)9781424458363
Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distance estimation is handling anisotropic problems in sensor networks. Compared with isotropic networks, anisotropic networks are more intractable in that their properties vary according to the directions of measurement. Anisotropic properties result from various factors, such as geographic shapes, irregular radio patterns, node densities, and impacts from obstacles. In this paper, we study the problem of measuring irregularity of sensor networks and evaluating its impact on distance estimation. In particular, we establish a new metric to measure irregularity along a path in sensor networks, and identify turning nodes where a considered path is inflected. Furthermore, we develop an approach to construct a virtual ruler for distance estimation between any pair of sensor nodes. The construction of a virtual ruler is carried out according to distance measurements among beacon nodes. However, it does not require beacon nodes to be deployed uniformly throughout sensor networks. Compared with existing methods, our approach neither assumes global knowledge of boundary recognition nor relies on uniform distribution of beacon nodes. Therefore, this approach is robust and applicable in practical environments. Simulation results show that our approach outperforms some previous methods, such as DV-Distance and PDM.
Distributions over permutations arise in applications ranging from multi-object tracking to ranking of instances. The difficulty of dealing with these distributions is caused by the size of their domain, which is fact...
详细信息
Distributions over permutations arise in applications ranging from multi-object tracking to ranking of instances. The difficulty of dealing with these distributions is caused by the size of their domain, which is factorial in the number of considered entities (n!). It makes the direct definition of a multinomial distribution over permutation space impractical for all but a very small n. In this work we propose an embedding of all n! permutations for a given n in a surface of a hyper sphere defined in ℝ (n-1) . As a result of the embedding, we acquire ability to define continuous distributions over a hyper sphere with all the benefits of directional statistics. We provide polynomial time projections between the continuous hyper sphere representation and the n!-element permutation space. The framework provides a way to use continuous directional probability densities and the methods developed thereof for establishing densities over permutations. As a demonstration of the benefits of the framework we derive an inference procedure for a state-space model over permutations. We demonstrate the approach with simulations on a large number of objects hardly manageable by the state of the art inference methods, and an application to a real flight traffic control dataset.
The target detection algorithm based on Independent Component Analysis (ICA) was proposed. The orthogonal subspace projection operator was used to extract the target endmembers and the initialization mixing matrix of ...
详细信息
The target detection algorithm based on Independent Component Analysis (ICA) was proposed. The orthogonal subspace projection operator was used to extract the target endmembers and the initialization mixing matrix of the FastõICA was made up of such endmember vectors. This method could solve the ordering randomicity of independent vectors. In this paper, the Noise-Adjusted Principal Component Analysis (NAPCA) was used to reduce the dimensionality of the original data to reduce the calculation. The ICA transformation of the reserved principal components was developed to detect the targets. The experimental results based on AVIRIS hyperspectral imagery have shown that it is more effective than the CEM method.
In this paper, we quantify the performance analysis of PingPong-128 keystream generator for wireless sensor networks. Although, PingPong-128 is not a standard stream cipher but still PingPong-128 keystream generator i...
详细信息
In this paper, we quantify the performance analysis of PingPong-128 keystream generator for wireless sensor networks. Although, PingPong-128 is not a standard stream cipher but still PingPong-128 keystream generator is an idea for resource constrained WSNs and can be widely used in the applications of secure communication, where the communication nodes have limited computation processing and storage capabilities while requiring sufficient levels of security. We present a performance comparison of PingPong-128 with other stream ciphers selected in European Project Ecrypt called eSTREAM project, namely Dragon, HC-128, and Rabbit. Apart from that, we are also considering RC-4 stream ciphers for comparison with pingpong-128 for wireless sensor networks.
In this paper, we propose the two quasi-sliding mode control for bilinear systems. By proper choice of the parameters in the control law, the system states will move within the quasi-sliding mode control band. Finally...
详细信息
In this paper, we propose the two quasi-sliding mode control for bilinear systems. By proper choice of the parameters in the control law, the system states will move within the quasi-sliding mode control band. Finally, the simulations are given to illustrate the effectiveness of the proposed controller.
Wireless sensor networks (WSN) are desirable to offer continuous services even in the case of sensor failures. Deploying redundant sensors or mobile sensors to guarantee service continuity may not be cost-effective. I...
Wireless sensor networks (WSN) are desirable to offer continuous services even in the case of sensor failures. Deploying redundant sensors or mobile sensors to guarantee service continuity may not be cost-effective. In contrast, this paper resorts to mobile robots that replace failed sensors in an on-demand manner. A rendezvous overlay is proposed on the top of wireless sensor networks in order to efficiently collect and disseminate sensor failure reports. Also optimal overlay size for sensor networks is presented. Simulation results show that our overlay-based approach outperforms two existing algorithms (i.e. dynamic distributed algorithm and centralized algorithm) with regard to the message overhead.
Bit Torrent is arguably the most prevalent file sharing protocol on the Internet. In Bit Torrent swarms, seeds usually offer file chunks for free and thus induce free-riding behavior. Some anti-Bit Torrent companies e...
Bit Torrent is arguably the most prevalent file sharing protocol on the Internet. In Bit Torrent swarms, seeds usually offer file chunks for free and thus induce free-riding behavior. Some anti-Bit Torrent companies even launch targeted attacks against the seeds. This paper proposes a batch mechanism for proper functioning of the seeds. It applies symmetric-key encryption and chunk mixing to plain chunks of the file, and enforces chunk recipients to do exchanges before they are able to obtain plain chunks. As a result, free-riding behavior and malicious attacks are discouraged. Also, the robustness of the batch mechanism is analyzed in detail under both fully and partial colluding scenarios.
Emerging multimedia applications have increased the need for video quality measurement. Motion is critical to this task, but is complicated owing to a variety of object movements and movement of the camera. Here, we c...
详细信息
Emerging multimedia applications have increased the need for video quality measurement. Motion is critical to this task, but is complicated owing to a variety of object movements and movement of the camera. Here, we categorize the various motion situations and deploy appropriate perceptual models to each category. We use these models to create a new approach to objective video quality assessment. Performance evaluation on the Laboratory for Image and Video engineering (LIVE) Video Quality Database shows competitive performance compared to the leading contemporary VQA algorithms.
In this paper, an effective simple method for reducing bandwidth usage over an access link in the IPTV multicast delivery services is proposed. The IPTV services are required to meet rapid channel switching as well as...
详细信息
In this paper, an effective simple method for reducing bandwidth usage over an access link in the IPTV multicast delivery services is proposed. The IPTV services are required to meet rapid channel switching as well as conventional analog TV services, but these services encounter issues to achieve rapid channel switching. One of significant problems is overloaded bandwidth consumption due to repeated channel switching behavior by users' channel request. This problem is caused by multicast leave processing, i.e., edge routers (ER) cannot stop transmission immediately due to the leave processing, so that ERs are required to stop unnecessary distributions. The feature of our proposed method is a reduction of bandwidth usage for transmitting IP multicast packets on the access link between ER and home access gateways (HG). We show effectiveness of the proposed method and efficiency of simple algorithm from the perspective of practical level through simulation evaluations.
暂无评论