Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 52 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. An Effective Estimation of Distributed Algorithm for Solving Identical Parallel Machine Scheduling Problem with Precedence Constraints | |||
WU Chuge,WANG Ling,ZHENG Xiaolong | |||
Computer Science and Technology 26 February 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, an effective estimation of distributed algorithm (eEDA) is proposed to solve the identical parallel machine scheduling problem with precedence constraints (prec-IPMSP). First, the permutation-based encoding scheme is adopted and the earliest finish time (EFT) method is proposed to decode the solution. Second, a new probability model is designed, which describes the relative positions of the jobs. Based on the model, an incremental learning based updating method is developed and a sampling mechanism is proposed to generate feasible solutions with good diversity. In addition, the Taguchi method of design-of-experiment method is used to investigate the effect of key parameters on the performance of the eEDA. Finally, the comparative results of the numerical testing show that the eEDA outperforms the existing algorithm. | |||
TO cite this article:WU Chuge,WANG Ling,ZHENG Xiaolong. An Effective Estimation of Distributed Algorithm for Solving Identical Parallel Machine Scheduling Problem with Precedence Constraints[OL].[26 February 2016] http://en.paper.edu.cn/en_releasepaper/content/4678754 |
2. Fast Video Stream Super Resolution Reconstruction based on CUDA | |||
LI Ying,HU Jie,LI Hailiang,SHEN Qiang | |||
Computer Science and Technology 04 December 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents a parallel GPU-based solution for video stream super resolution reconstruction. We propose an approach, using the computer unified device architecture (CUDA) platform developed by NVIDIA, to partition the steps of the non-local iterative back projection (NLIBP) algorithm (which is designed for single image super resolution reconstruction). The approach also exploits the redundant information of the video stream in the time-space domain in an effort to further reduce the unnecessary searching work in the motion estimation process. The use of CUDA enhances the programmability and flexibility for general-purpose computation of GPU. Experimental results show that, with the assistance of CUDA, the processing time is approximately 8 times faster than that of using CPU only in C++ language, while preserving good visual quality of the reconstructed video stream. | |||
TO cite this article:LI Ying,HU Jie,LI Hailiang, et al. Fast Video Stream Super Resolution Reconstruction based on CUDA[OL].[ 4 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4663992 |
3. Sparse Sampling and Completion for Light Transport in VPL-based Rendering | |||
Yuchi Huo, Rui Wang, Xinguo Liu, Hujun Bao | |||
Computer Science and Technology 26 November 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The many-light formulation provides a general framework for rendering various illumination effects using hundreds of thousands of virtual point lights (VPLs). To efficiently gather the contributions of the VPLs, lightcuts and its extensions cluster the VPLs, which implicitly approximates the lighting matrix with some representative blocks similar to vector quantization. In this paper, we propose a new approximation method based on the previous lightcut method and a low-rank matrix factorization model. As many researchers pointed out, the lighting matrix is low rank, which implies that it can be completed from a small set of known entries.We first generate a conservative global light cut with bounded error and partition the lighting matrix into slices by the coordinate and normal of the surface points using the method of lightslice. Then we perform two passes of randomly sampling on each matrix slice. In the first pass, uniformly distributed random entries are sampled to coarsen the global light cut, further clustering the similar light for the spatially localized surface points of the slices. In the second pass, more entries are sampled according to the possibility distribution function estimated from the first sampling result. Then each matrix slice is factorized into a product of two smaller low-rank matrices constrained by the sampled entries, which delivers a completion of the lighting matrix. The factorized form provides an additional speedup for adding up the matrix columns which is more GPU friendly. Compared with the previous lightcut based methods, we approximate the lighting matrix with some signal specialized bases via factorization. The experimental results shows that we can achieve significant acceleration than the state of the art many-light methods. | |||
TO cite this article:Yuchi Huo, Rui Wang, Xinguo Liu, et al. Sparse Sampling and Completion for Light Transport in VPL-based Rendering[OL].[26 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4663747 |
4. A new image segmentation algorithm based on Mean-Shift for outdoor image | |||
QIN Zheng,YANG Xiao | |||
Computer Science and Technology 13 August 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, an improved outdoor color image segmentation algorithm based on Mean-Shift was proposed in this article, the real-time requirement of the image processing for visual navigation could be satisfied by the algorithm. It presented the theory of Mean-Shift firstly, and then processed fast color image segmentation algorithm by using a scale transformation method. The experiment results indicates that the efficiency of the segmentation is greatly optimized. | |||
TO cite this article:QIN Zheng,YANG Xiao. A new image segmentation algorithm based on Mean-Shift for outdoor image[OL].[13 August 2015] http://en.paper.edu.cn/en_releasepaper/content/4652205 |
5. Design of Proportional Integral Kalman Filter for Discrete-time Systems | |||
XU Hui,CAO Yimeng | |||
Computer Science and Technology 17 April 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The Kalman filter operates recursively on streams of noisy input data to produce a statistically optimal estimate of the underlying system state. In this paper, we mainly derived a Proportional Integral Kalman filter(PI-Kalman filter), which is used to solve the inaccuracy of the regular Kalman filter caused by constant process disturbance in discrete-time systems. Besides, the PI-Kalman filter can be used to estimate the unknown constant process disturbance. In addition, this PI-Kalman filter was used in the simulation of a single tracking problem. The result shows that it perform better than the regular Kalman filter. | |||
TO cite this article:XU Hui,CAO Yimeng. Design of Proportional Integral Kalman Filter for Discrete-time Systems[OL].[17 April 2015] http://en.paper.edu.cn/en_releasepaper/content/4638268 |
6. Key Technology Research of IoT Resource Access Framework | |||
LI Cheng,LIU Chuanchang | |||
Computer Science and Technology 10 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Now many kinds of sensors appear in all aspects of our real life. The data that these sensors got is collected by Internet of Things (IoT) system. However, the current IoT systems work for some specially appointed IoT resources and has no ability to extend itself. In this paper, a resource access framework based on OSGI is designed to make IoT system to support more resources by installing new protocols. And this framework has strong dynamic extendibility. | |||
TO cite this article:LI Cheng,LIU Chuanchang. Key Technology Research of IoT Resource Access Framework[OL].[10 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4620808 |
7. A forwarding scheme of publish/subscribe system based on OpenFlow | |||
Zhang Yang,Chen Tianyu | |||
Computer Science and Technology 28 November 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Nowadays, Internet protocol only provides "best effort" data forwarding services. So, the existing publish/subscribe systems' data forwarding scheme which is based on traditional network has some inevitable problems, such as excessive delay, unreliable data forwarding service. Because of the reasons above, we use OpenFlow to redesign a publish/subscribe system's data forwarding scheme. We design a new forwarding scheme according to OpenFlow's match methods of flow tables. In addition, we propose a new network traffic management algorithm to make the system work more stably and efficiently. At last, we built the system on Open vSwtich platform and did some tests on system's packets' processing speed and traffic management algorithm's working conditions. The results showed that system works well. | |||
TO cite this article:Zhang Yang,Chen Tianyu. A forwarding scheme of publish/subscribe system based on OpenFlow[OL].[28 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4619545 |
8. A 3D Fingertips Detecting and Tracking Algorithm based on the Sliding Window | |||
WU Jun,QIAO Wenjing,KUANG Cailiang,LIU Zhenbao,BU Shuhui,HAN Junwei | |||
Computer Science and Technology 15 August 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we propose a 3D finger detecting and tracking algorithm (3dFDT) based on a sliding window for RGB-D sequences. Microsoft Kinect is utilized as a 3D depth camera, which provides RGB images and depth data simultaneously. However the depth data have large noises when the background is white. We are focusing on tracking the up or down movements of the fingertips in order to apply in some applications such as playing the piano on the table or "in the air". First, the skin statistical ellipse model is applied to detect the hand skin region, and the pseudo-contours are removed to get the interested hand region. Then, the region center is considered as the center of the palm. Next, the fingertips are located precisely using the convex defect detection based on the refined hand contours. Furthermore, the depth information is aligned to the fingertips in the RGB channels. Finally, the sliding window strategy is employed to stabilize the depth information due to large noises from the depth space especially when dealing with the white surface as backgrounds. The experimental results show that our proposed method is effective, and it can be applied in the real-time applications for non-contact interactions. | |||
TO cite this article:WU Jun,QIAO Wenjing,KUANG Cailiang, et al. A 3D Fingertips Detecting and Tracking Algorithm based on the Sliding Window[OL].[15 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4606484 |
9. Enriched Kernel for Protein Function Prediction | |||
Qianli Ma,Jiajun Jiang,Guoxian Yu | |||
Computer Science and Technology 21 June 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Protein function prediction is one of the hottest research areas in biotech. According to different similarities characteristics of proteins, scientists construct more than one relationship between proteins, which can be called kernels. Different kernels have different domain-related information of proteins' relationship. Generally speaking, due to the complementarity of these information, multiple kernel learning (MKL) can overcome the heterogeneity between the kernels data to some extent and improve the protein function prediction precision. However, the existing domain-related kernels may contain some isolated proteins. Furthermore, the similarities between proteins may be considerably affected by noises. In this paper, we propose a fully connected kernel to enrich the available kernels. Based on the label propagation algorithm, the enriched kernels can not only propagate information to the isolated protein, but also can reduce the noises influences and improve the protein function prediction accuracy. We tested the method on the benchmark protein datasets, and the MKL algorithms with enriched kernel have a better performance. | |||
TO cite this article:Qianli Ma,Jiajun Jiang,Guoxian Yu. Enriched Kernel for Protein Function Prediction[OL].[21 June 2014] http://en.paper.edu.cn/en_releasepaper/content/4600760 |
10. A Novel Edge Detection Operator Based On Fractional Gaussian Differential | |||
HAN Qirui,LIU Ke | |||
Computer Science and Technology 08 May 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents an improved algorithm for edge detection. The algorithm combines the Gaussian average operator with 1-2 order fractional differential.Gaussian average operatorhas outstanding performance in image denoising and 1-2 order fractional differential retain more detailed imageinformation during sharping. It has been proved by theoretical analysis and experimental verificationsthat this method could extract image edge information effectively and reserve partial near edgedetails, and shows better noise immunity in edge detection. | |||
TO cite this article:HAN Qirui,LIU Ke. A Novel Edge Detection Operator Based On Fractional Gaussian Differential[OL].[ 8 May 2014] http://en.paper.edu.cn/en_releasepaper/content/4595118 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated