The library includes compiled FIR filters, redundant and non redundant wavelet transform with dynamically sized channels, with applications to denoising and differentiation.
A simple (de)compression program using Run Length Encoding.
Compression is done that easy:
compressedData = rle(originalData);
originalData = rle(compressedData)
function [g] = FFTPF1D (X,binsize, f, P)
Discrete Fourier Transform Low/High Pass Filter.
% This is a simply implement of such a filter for a given 1-D data.
X: the array of you data, each data point is a bin of signal
This function returns N point DFT samples of 2dw band of Fourier transform of a sequence. Typically, fft() returns N samples of Fourier transform ranging from 0 to 2pi. This function takes the N-point DFT samples and returns N-point samples...
Used in image compression, the haar transform is an alternative to the DCT transformation. This file compute an n*n Haar matrix. (same use as "dctmtx")
rilt Regularized Inverse Laplace Transform
[g,yfit,cfg] = rilt(t,y,s,g0,alpha)
Array g(s) is the Inverse Laplace Transform of the array y(t), calculated by a regularized least squares method.
This script is an...
Circular Hough transform based on the gradient field of an image.
1. Operates on grayscale images, NOT B/W bitmaps.
2. NO loops in the implementation of Circular Hough transform, which means faster operation but at the same time larger...
Computes matrices required to transform a state space control system into Controllable or Observable form.
Hough transform for circles in any size.
returns a list of all circles found
(position and radius) in an RGB image.
includes function for:
drawing a circle on an image.
finding the maximum points in a 1d signal.
This is a generalized version of Principal Component Pursuit (PCP) where the sparsity is assumed in a transform domain and not in measurement domain. Moreover the samples obtained are lower dimensional projections.
Fast and Efficient Speech Signal Classification with a Novel Nonlinear Transform
Information Technology Convergence, 2007. ISITC 2007. International Symposium on
23-24 Nov. 2007 Page(s):43 - 47
This m file acquired and processed using chirp Fourier transform spectrum of HR4000 spectrometer
This Hough transform is highly optimized. It uses the midpoint circle algorithm to draw the circles in voting space quickly and without gaps. It also includes an option for searching only part of the image to increase speed if a rough estimate of...
This Face Recognition System uses Kekre Transform for Face recognition depicted through a GUI.This GUI depicts the face recognition system developed through feature extraction by Kekre Transform Algorithm. There are several functions that are...
The numerical inversion of the Laplace transform is a long standing problem due its implicit ill-posedness. These functions implement one of the more well known numerical inversion algorithms, the Weeks method. Particularly new here is the use of...
LAPLACEOFPARETO evaluates the Laplace-Stietljes transform (LST) of the Pareto
distribution with parameters a and b. Specifically, this function evaluates
the LST E[exp(-sX)] of a random variable $X$ which has Pareto distribution
This demonstration is intended for people who know something about the theory of the discrete Fourier transform, and who would find it helpful to see some its properties demonstrated graphically, using a programming language.
Y = DCTN(X) returns the discrete cosine transform (DCT) of X.
X = IDCTN(Y) returns the inverse discrete cosine transform (IDCT) of Y.
Y = DSTN(X) returns the discrete sine transform (DST) of X.
X = IDSTN(Y) returns...
This function generates a Walsh-Matrix which can be used to perform the 1D-Walsh transform on a vector:
>> walsh(4)*[1 2 3 4]'
The returned matrix is internally cached within the function (persistent) which...
Copy&Paste from the file:
%WAT3D 3D Walsh or Hadamard Transform
% WAT3D(X, order) will transform the 3D matrix X to the Walsh or Hadmard
% domain depending on the parameter 'order'.
% If order == 'sequency' or 'walsh'