Search Results for author:
Found 23 papers, 1 papers with code
Low-complexity Multidimensional DCT Approximations
In general, the suggested methods showed competitive performance at a considerably lower computational cost.
Improved Point Estimation for the Rayleigh Regression Model
The Rayleigh regression model was recently proposed for modeling amplitude values of synthetic aperture radar (SAR) image pixels.
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm.
Robust Rayleigh Regression Method for SAR Image Processing in Presence of Outliers
The presence of outliers (anomalous values) in synthetic aperture radar (SAR) data and the misspecification in statistical image models may result in inaccurate inferences.
DCT Approximations Based on Chen's Factorization
In this paper, two 8-point multiplication-free DCT approximations based on the Chen's factorization are proposed and their fast algorithms are also derived.
Prediction Intervals in the Beta Autoregressive Moving Average Model
In this paper, we propose five prediction intervals for the beta autoregressive moving average model.
Wavelength-Resolution SAR Ground Scene Prediction Based on Image Stack
This paper presents five different statistical methods for ground scene prediction (GSP) in wavelength-resolution synthetic aperture radar (SAR) images.
Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
These approximate DFT (ADFT) algorithms have significantly reduced circuit complexity and power consumption compared to traditional FFT approaches while trading off a subtle loss in computational precision which is acceptable for digital beamforming applications in RF antenna implementations.
Autoregressive Model for Multi-Pass SAR Change Detection Based on Image Stacks
Applying AR model for each pixel position in the image stack, we obtained an estimated image of the ground scene which can be used as a reference image for CDA.
Low-complexity Three-dimensional Discrete Hartley Transform Approximations for Medical Image Compression
In this work, we present a set of multiplierless DHT approximations, which can be implemented with fixed-point arithmetic.
A Class of Low-complexity DCT-like Transforms for Image and Video Coding
The novel transforms perform close to or outperform the current state-of-the-art DCT approximations.
Data-independent Low-complexity KLT Approximations for Image and Video Coding
The Karhunen-Lo\`eve transform (KLT) is often used for data decorrelation and dimensionality reduction.
Low-complexity Rounded KLT Approximation for Image Compression
Because its computation depends on the matrix of covariances of the input signal, the use of the KLT in real-time applications is severely constrained by the difficulty in developing fast algorithms to implement it.
A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
Particularly, the discrete cosine transform (DCT) has proven to be convenient for data compression, being employed in well-known image and video coding standards such as JPEG, H. 264, and the recent high efficiency video coding (HEVC).
Low-complexity 8-point DCT Approximation Based on Angle Similarity for Image and Video Coding
Practical applications in image and video coding demonstrate the relevance of the proposed transformation.
DCT-like Transform for Image Compression Requires 14 Additions Only
A low-complexity 8-point orthogonal approximate DCT is introduced.
Multimedia Data Structures and Algorithms Applications Computation
Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
Image and video compression simulations in popular standards shows good performance of the proposed transform.
Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding
An orthogonal 16-point approximate discrete cosine transform (DCT) is introduced.
A Class of DCT Approximations Based on the Feig-Winograd Algorithm
A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed.
A Discrete Tchebichef Transform Approximation for Image and Video Coding
In this paper, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT).
Improved 8-point Approximate DCT for Image and Video Compression Requiring Only 14 Additions
The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio.
A DCT Approximation for Image Compression
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced.
A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only
A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced.
