In images and videos of a 3D scene, blur due to camera shake can be a source of depth information. Our objective is to find the shape of the scene from its motion-blurred observations without having to restore the ori...
详细信息
Image deconvolution is an important subject in image processing. It is an ill-posed inverse problem, so regularization techniques are used to solve this problem by adding constraints to the objective function. Various...
详细信息
We want to implement a new optimal approach for image restoration problem, which is useful for neutron radiography images enhancement to assist the physician interpreter on his evaluation. Our approach is based on usi...
详细信息
An algorithm for automated extraction of interest points (IP) in hyperspectral images is presented. IP are features of the image that capture information from its neighbors and are distinctive and stable under transla...
详细信息
The aim of this study is to assess the functional connectivity from resting state functional magnetic resonance imaging (fMRI) data. Spectral clustering algorithm was applied to the realistic and real fMRI data acquir...
详细信息
ISBN:
(纸本)9781424466238
The aim of this study is to assess the functional connectivity from resting state functional magnetic resonance imaging (fMRI) data. Spectral clustering algorithm was applied to the realistic and real fMRI data acquired from a resting healthy subject to find functionally connected brain regions. In order to make computation of the spectral decompositions of the entire brain volume feasible, the similarity matrix has been sparsified with the t-nearestneighbor approach. Realistic data were created to investigate the performance of the proposed algorithm and comparing it to the recently proposed spectral clustering algorithm with the Nystrom approximation and also with some well-known algorithms such as the Cross Correlation Analysis (CCA) and the spatial Independent Component Analysis (sICA). To enhance the performance of the methods, a variety of data pre and post processing steps, including data normalization, outlier removal, dimensionality reduction by using wavelet coefficients, estimation of number of clusters and optimal number of independent components (ICs). Results demonstrate the applicability of the proposed algorithm for functional connectivity analysis.
Multi-core architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance. Well scheduling of running threads on these processors will result i...
Multi-core architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance. Well scheduling of running threads on these processors will result in achieving higher performance. Modern multi-core systems are designed to allow clusters of cores to share various hardware structures, such as last-level caches, memory controllers, and interconnections, as well as prefetching hardware. Without considering these shared resources, scheduling the threads will cause serious degradation in overall performance of the system. In this paper we propose a novel algorithm to schedule the threads that considers these potential contentions to keep away from. The simulation results showed that the proposed scheduler would avoid from lots of contentions between threads on various resources especially on shared caches.
Content searching and downloading are the two dominant actions of the Internet users today, despite the fact that the Internet was not originally architected to serve such actions. Content Centric Networking is the ne...
详细信息
In this paper, a novel method is proposed able to automatically generate accurate 3D models of both outdoor buildings and indoor scenes with perspective cues from line segments that are automatically extracted from a ...
详细信息
ISBN:
(纸本)9781450301756
In this paper, a novel method is proposed able to automatically generate accurate 3D models of both outdoor buildings and indoor scenes with perspective cues from line segments that are automatically extracted from a single image with an uncalibrated camera. The proposed method uses geometric constraints and knowledge of photography and achieves an accurate, real-time and fully automated 3D reconstruction of the scene without any intervention from the user.
This paper deals with the local spectrum sensing problem in non-Gaussian noise. It is of great importance to reliably detect the presence of licensed users in cognitive radio. This task highly depends on the noise dis...
详细信息
This paper deals with the local spectrum sensing problem in non-Gaussian noise. It is of great importance to reliably detect the presence of licensed users in cognitive radio. This task highly depends on the noise distribution, thus it is important to characterize the noise behavior as best as possible. Although Gaussian assumption for noise is of interest due to many reasons, it sometimes fails to model the behavior of noise in practice. In this paper we present a local spectrum sensing scheme in a broad family of non-Gaussian noise. We reasonably assume that the Primary User (PU) signal is Phase Shift Keying (PSK) modulated, where the number of constellation points, M, and the symbol code sequence are unknown to the Secondary Users (SU), as in practice. We also assume that the SUs are unaware of the PU signal complex amplitude and the non-Gaussian noise variance. Within this framework, we obtain the Generalized Likelihood Ratio Test (GLRT) as our spectrum sensing scheme and propose an approximate implementation of the resulting GLRT. Simulation results show that our proposed scheme has an acceptable performance.
To efficiently perform large matrix LU decomposition on FPGAs with limited local memory, the original algorithm needs to be blocked. In this paper, we propose a block LU decomposition algorithm for FPGAs, which is app...
详细信息
To efficiently perform large matrix LU decomposition on FPGAs with limited local memory, the original algorithm needs to be blocked. In this paper, we propose a block LU decomposition algorithm for FPGAs, which is applicable for matrices of arbitrary size. We introduce a high performance hardware design, which mainly consists of a linear array of processing elements (PEs), to implement our block LU decomposition algorithm. A total of 36 PEs can be integrated into a Xilinx Virtex-5 xc5vlx330 FPGA on our self-designed PCI-Express card, reaching a sustained performance of 8.50 GFLOPS at 133 MHz, which outperforms previous work.
暂无评论