Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Paste phpSoftPro 1.4.1
Bytescout PDF SDK 1.8.1.243
Odoo Crafito Theme 1.0
Uber Clone- Taxi Booking App 4.1
Excel Add-in for BigCommerce 1.7
Online Food Delivery Script php 1.0.3
Break Script | Youtube Clone Script 1.0.3
Advanced Content Manager Magento 2 extension 2.2.x
dbForge Studio for PostgreSQL 1.0
ODBC Driver for Salesforce MC 1.3
Social Media Script 1.0
ByteScout PDF Renderer SDK 9.0.0.3079
Magento Mobile App Builder 2.0.0
Binary MLM Plan 1.0.2
Review Assistant 4.0
Top Code
VISCOM Video Editing SDK ActiveX 8.53
Free Pageant Contest Source Code 1.0
wc_remote 1.0
VISCOM Audio Sound Record Pro ActiveX SDK 1.4
LMD ElPack SE 4.05
DS SQL Tools 1.1
Top Rated
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
PHP Point of sale 10.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Zernike decomposition 1.0
File ID: 79512






Zernike decomposition 1.0
Download Zernike decomposition 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 29
Submit Rating:
Zernike decomposition 1.0 Description
Description: This code was written to deal with "Zernike polynomials" code graciously donated by Paul Fricker via file exchange.
Here you will find a practical example of a function decomposition by
Zernike basis.
The function is F below, feel free to modify
Unlike Paul's example found in 'zernfun2.m' here the domain is the true unit circle, without NaN's filling it up to the unit square.
You will have to download Paul's functions to run this code.

License: Freeware

Related: zernfun, Domain, Found, paul, modifyunlike, circle, Download, Functions, squareyou, filling, nan, basisthe, donated, fricker, graciously, polynomialsquot, quotzernike, exchangehere

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 29



More Similar Code

The Empirical Mode Decomposition is a technique to decompose a given signal into a set of elemental signals called Intrinsic Mode Functions. The Empirical Mode Decomposition is the base of the so-called d-deDUHilbert-Huang Transformd-deDt that comprises also a Hilbert Spectral Analysis and an instantaneous frequency computation. A modified improved algorithm for the Empirical Mode Decomposition is implemented. The output is a set of AM/FM...



GUI for univariate time series modeling and decomposition based on Pandit and Wu (1983)



This is the 2-D Fast DOST Decomposition. The computational complexity is O(NlnN)



Split the signal S(SPACE,TIME) into its downward/upward space
propagating and stationnary components via a 2D Fourier decomposition.
S is a (SPACE,TIME) matrix. We eventually proceed to a space and/or
time filtering. DT,DX are...



This scrip determines the column vector 'x', given the LU decomposition of matrix 'A'.
It performs the forward substitution, finding 'y=L*z', then, by backward substitution: 'z=U*x', determines the values of 'x'.



Quadtree decomposition of RGB image of size M-by-N-by-3. Three thresholds for red,green and blue components are used. For any R or G or B block if the maximum value of the block elements minus the minimum value of the block elements is greater...



It generates a stochastic field on a squared space. Samples are created by Latin hypercube sampling and the spatial correlation is performed by an algorithm based on Cholesky decomposition. Example inside.



The solution of the nearest correlation matrix applies the hypershpere or spectral decomposition methods as outlined in Monte Carlo methods in Finance by Peter Jackel, Chapter 6.

Use CorrelationExample.m that applies a simple example...



This function does the decomposition of a separable nD kernel into
its 1D components, such that a convolution with each of these
components yields the same result as a convolution with the full nD
kernel, at a drastic reduction in...



Using pyramid decomposition and iterative refinement, OF is calculated. Includes a demo and a paper that thoroughly explains the methodology.

User Review for Zernike decomposition
- required fields
     

Please enter text on the image