Search results for "image processing"
showing 10 items of 3285 documents
A directional spectral mixture analysis method: application to multiangular airborne measurements
2006
This study aims at developing an operational approach-namely, directional spectral mixture analysis (DISMA)-for retrieving vegetation parameters like fractional vegetation cover (FVC) and leaf area index (LAI) from multispectral and multiangular data. The approach attempts to highlight the consistency of one-dimensional models and linear mixture approaches. DISMA combines spectral signatures of soil and vegetation components with an analytical approximation of the radiative transfer equation, giving rise to a fast invertible bidirectional reflectance distribution function (BRDF) model of discontinuous canopies. Both the forward model and its inversion using a simple technique based on looku…
The Dynamical Kernel Scheduler - Part 1
2015
Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software using these hardware accelerators introduces additional challenges for the developer such as exposing additional parallelism, dealing with different hardware designs and using multiple development frameworks in order to use devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between host application and different hardware accelerators. DKS handles the communication between the host and device, schedules task execution, and provides a library of built-in algorithms. …
Reducing complexity in H.264/AVC motion estimation by using a GPU
2011
H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of spe…
cuBool: Bit-Parallel Boolean Matrix Factorization on CUDA-Enabled Accelerators
2018
Boolean Matrix Factorization (BMF) is a commonly used technique in the field of unsupervised data analytics. The goal is to decompose a ground truth matrix C into a product of two matrices A and $B$ being either an exact or approximate rank k factorization of C. Both exact and approximate factorization are time-consuming tasks due to their combinatorial complexity. In this paper, we introduce a massively parallel implementation of BMF - namely cuBool - in order to significantly speed up factorization of huge Boolean matrices. Our approach is based on alternately adjusting rows and columns of A and B using thousands of lightweight CUDA threads. The massively parallel manipulation of entries …
Combining split-and-merge and multi-seed region growing algorithms for uterine fibroid segmentation in MRgFUS treatments
2016
Uterine fibroids are benign tumors that can affect female patients during reproductive years. Magnetic resonance-guided focused ultrasound (MRgFUS) represents a noninvasive approach that uses thermal ablation principles to treat symptomatic fibroids. During traditional treatment planning, uterus, fibroids, and surrounding organs at risk must be manually marked on MR images by an operator. After treatment, an operator must segment, again manually, treated areas to evaluate the non-perfused volume (NPV) inside the fibroids. Both pre- and post-treatment procedures are time-consuming and operator-dependent. This paper presents a novel method, based on an advanced direct region detection model, …
Hardware-accelerated spike train generation for neuromorphic image and video processing
2014
Recent studies concerning Spiking Neural Networks show that they are a powerful tool for multiple applications as pattern recognition, image tracking, and detection tasks. The basic functional properties of SNN reside in the use of spike information encoding as the neurons are specifically designed and trained using spike trains. We present a novel and efficient frequency encoding algorithm with Gabor-like receptive fields using probabilistic methods and targeted to FPGA for online pro-cessing. The proposed encoding is versatile, modular and, when applied to images, it is able to perform simple image transforms as edge detection, spot detection or removal, and Gabor-like filtering without a…
Frequency spike encoding using Gabor-like receptive fields
2014
Abstract Spiking Neural Networks (SNN) are a popular field of study. For a proper development of SNN algorithms and applications, special encoding methods are required. Signal encoding is the first step since signals need to be converted into spike trains as the primary input to an SNN. We present an efficient frequency encoding system using receptive fields. The proposed encoding is versatile and it can provide simple image transforms like edge detection, spot detection or removal, or Gabor-like filtering. The proposed encoding can be used in many application areas as image processing and signal processing for detection and classification.
Salient Spin Images: A Descriptor for 3D Object Recognition
2018
In the last decades a wide range of algorithms have been devoted to recognize 3D free-from objects under real conditions such as occlusions, clutters, rotation, scale and translation. Spin image is one of these algorithms known to be robust to rotation, translation, occlusions up to 70% and clutters up to 60%, but still suffer from scaling, resolution changes and it is time consuming. In this paper we present a novel approach based on spin images, called salient spin images (SSI). This method enhances spin images algorithm based on its limits. Particularly, it decreases significantly the complexity of the algorithm using DoG detector, it shows a higher performance due to the relevant locali…
Periodic Discrete and Discrete-Time Splines
2018
Periodic discrete splines with different periods and spans are introduced in Sect. 3.4 of Volume I (Averbuch, Neittaanmaki and Zheludev, Spline and Spline Wavelet Methods with Applications to Signal and Image Processing, Springer, Berlin, 2014) [2]. In this chapter, we regard periodic discrete splines as a base for the design of periodic discrete-time wavelets, wavelet packets and wavelet frames. Therefore, only the discrete splines whose spans are 2 are outlined. These discrete splines are linear combinations of the discrete B-splines. So also, the so-called discrete-time splines are discussed in the chapter that are linear combinations of the discrete-time B-splines. The discrete-time B-s…
Transitivity in coherence-based probability logic
2016
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic versions of classical categorical syllogisms and construct a new version of the squa…