Todays, the number of vehicles is rapidly increasing. In parallel, the number of ways and traffic signs have increased. As a result of increased traffic signs, the drivers are expected to learn all the traffic signs a...
详细信息
Nonlocal self-similarity of images has attracted considerable interest in the field of imageprocessing and has led to several state-of-the-art image denoising algorithms, such as block matching and 3-D, principal com...
详细信息
Nonlocal self-similarity of images has attracted considerable interest in the field of imageprocessing and has led to several state-of-the-art image denoising algorithms, such as block matching and 3-D, principal component analysis with local pixel grouping, patch-based locally optimal wiener, and spatially adaptive iterative singular-value thresholding. In this paper, we propose a computationally simple denoising algorithm using the nonlocal self-similarity and the low-rank approximation (LRA). The proposed method consists of three basic steps. First, our method classifies similar image patches by the block-matching technique to form the similar patch groups, which results in the similar patch groups to be low rank. Next, each group of similar patches is factorized by singular value decomposition (SVD) and estimated by taking only a few largest singular values and corresponding singular vectors. Finally, an initial denoised image is generated by aggregating all processed patches. For low-rank matrices, SVD can provide the optimal energy compaction in the least square sense. The proposed method exploits the optimal energy compaction property of SVD to lead an LRA of similar patch groups. Unlike other SVD-based methods, the LRA in SVD domain avoids learning the local basis for representing image patches, which usually is computationally expensive. The experimental results demonstrate that the proposed method can effectively reduce noise and be competitive with the current state-of-the-art denoising algorithms in terms of both quantitative metrics and subjective visual quality.
For optical remote sensing images, an effective method to reduce or eliminate the impact of clouds is important. With big data input and real-time processing demands, efficient parallelization strategies are essential...
详细信息
ISBN:
(纸本)9781509028962
For optical remote sensing images, an effective method to reduce or eliminate the impact of clouds is important. With big data input and real-time processing demands, efficient parallelization strategies are essential for high performance computing on multi-core systems. This paper proposes an efficient high performance parallel computing framework for cloud filtering and smoothing. A comparison and benchmarking of two parallel algorithms for cloud filtering that incorporates spatial smoothing solved by two-dimensional dynamic programming is implemented. The experiments were carried out on an NVIDIA GPU accelerator with evaluations of approximation, parallelism and performance. The test results show significant performance improvements with high accuracy compared with sequential CPU implementation, and can be applied to other multi-core systems.
Interaction experience in multimedia systems can be improved by adding personalization. Current applications for building and animating characters to represent real users are typically based on pose and motion detecti...
详细信息
ISBN:
(纸本)9781509037971
Interaction experience in multimedia systems can be improved by adding personalization. Current applications for building and animating characters to represent real users are typically based on pose and motion detection. For so doing, computer vision algorithms do not exploit the anatomical characteristics of the human body for improving their classification accuracy. This work presents an strategy that considers age-group, body shape and height estimation by using anatomical low level descriptors. The proposed strategy allows to differentiate children from adults, and under-weighted and normal body shaped from over-weighted individuals, based on a set of features extracted from full body images and a classification process based on Support Vector Machine (SVM). These classification models were evaluated using a 10-fold cross validation, obtaining an area under the ROC curve of 89 % and 92 % respectively for age-group and body shape. On the other hand, the height of a person was computed by using a reference image in a leave-one-out evaluation and, in comparison with the real one, an square error (MSE) of 17 cm was obtained.
This article describes a new 3D RGBD image feature, referred to as iGRaND, for use in real-time systems that use these sensors for tracking, motion capture, or robotic vision applications. iGRaND features use a novel ...
详细信息
ISBN:
(纸本)9781510601086
This article describes a new 3D RGBD image feature, referred to as iGRaND, for use in real-time systems that use these sensors for tracking, motion capture, or robotic vision applications. iGRaND features use a novel local reference frame derived from the image gradient and depth normal (hence iGRaND) that is invariant to scale and viewpoint for Lambertian surfaces. Using this reference frame, Euclidean invariant feature components are computed at keypoints which fuse local geometric shape information with surface appearance information. The performance of the feature for real-time odometry is analyzed and its computational complexity and accuracy is compared with leading alternative 3D features.
This article presents a superpixel-guided multiscale kernel collaborative representation method for robust classification of hyperspectral images. This novel method first exploits the spatial multiscale information of...
详细信息
This article presents a superpixel-guided multiscale kernel collaborative representation method for robust classification of hyperspectral images. This novel method first exploits the spatial multiscale information of hyperspectral images by extending a superpixel segmentation algorithm, and then proposes a spatial-spectral information fusion technique to encode the spatial multiscale similarities and the spectral similarities between the pixels in the framework of kernel collaborative representation classification. The advantages of it mainly consist in (1) avoiding choosing empirical parameters in the spatial feature extraction process of superpixels and (2) enhanced classification accuracy as compared to traditional spatial-spectral kernel techniques. Experimental results with two widely used hyperspectral images demonstrate the effectiveness of the proposed method.
Missile-borne synthetic aperture radar (SAR) imaging system is built up according to actual working principle, it uses the input data and embedded algorithms to simulate echo, then generate SAR image. Relevant algorit...
详细信息
ISBN:
(纸本)9781509007684
Missile-borne synthetic aperture radar (SAR) imaging system is built up according to actual working principle, it uses the input data and embedded algorithms to simulate echo, then generate SAR image. Relevant algorithms is analyzed, a SAR echo simulation method based on graphic processing unit (GPU) acceleration is presented to satisfy the request of real-time. Simulation platform realized by MATLAB GUI turns out to be reliable and interactive, it can meet the demand for missile-borne SAR system test and development, and has some practical value.
作者:
Tian, XiaolinJiao, LichengGuo, KaiwuXidian Univ
Int Res Ctr Intelligent Percept & Computat Minist Educ Key Lab Intelligent Percept & Image Understanding Xian Peoples R China Xidian Univ
Inst Intelligent Informat Proc Xian 710071 Peoples R China
An algorithm in which affinity is merged into nonsubsampled contourlet transform (NSCT) to denoise synthetic aperture radar (SAR) image is proposed. The important information (boundaries or details) or non-important i...
详细信息
An algorithm in which affinity is merged into nonsubsampled contourlet transform (NSCT) to denoise synthetic aperture radar (SAR) image is proposed. The important information (boundaries or details) or non-important information (homogeneous area) in a SAR image is estimated based on affinity matrix, by which the affinity-based denoising assigns a high affinity element to the coefficients of NSCT that belong to same region. The foreground and background in NSCT domain are automatically initialized which avoids the need for user initialization. Foreground probability obtained by optimizing objective function can be used to achieve the posterior ratio. Combining the posterior ratio and prior ratio, we can obtain the shrunk coefficients. The proposed algorithm was applied to real SAR images denoising and compared through the SAR image vision effect, the equivalent number of looks (ENL) and the edge sustain index (ESI). Experimental results show that the proposed algorithm outperforms the compared algorithms and achieves the better denoising result and edge preservation.
A parallel 4D fMRI filtering algorithmis proposed to overcome the bottlenecks of large 4D volumetric fMRI data and its overlapping segments by input decimation, multidimensional intensive computation by parallel proce...
详细信息
A parallel 4D fMRI filtering algorithmis proposed to overcome the bottlenecks of large 4D volumetric fMRI data and its overlapping segments by input decimation, multidimensional intensive computation by parallel processing and the boundary conditions by output interpolation. Three spatial convolution architectures implement this parallel multidimensional filtering algorithm in Virtex-6 FPGA board, as automated 4D fMRI filtering systems. These three automated filtering systems are devised as "plug and develop" processors to filter any 4D volumetric data. Then, two sets of generic Edge and noise smoothing filtering operators are prototypically plugged and developed to be improved for filtering a dementia case study of color 256 x 256 x 4 x 3 volumetric fMRI. Accordingly, performance indices of the three architectures are evaluated as a complete package of area, speed, dynamic power, and throughput. Significant improvements have been achieved in keeping a stable speed, decreasing power consumption and increasing throughput in color fMRI filtering applications. All three architectures have an operating (225 MHz) maximum frequency. The power consumption improved more than two-fold using architecture 2 compared to 3. The highest throughput is achieved by architectures 2 and 3 almost (2.5) times than that of architecture 1. Evidently, all three architectures are performance-aware processors, and architecture 2 is optimal.
暂无评论