当前位置:网站首页>Wavedec2 in MATLAB, talk about the wavedec2 function [easy to understand]
Wavedec2 in MATLAB, talk about the wavedec2 function [easy to understand]
2022-07-02 15:47:00 【Full stack programmer webmaster】
Hello everyone , I meet you again , I'm your friend, Quan Jun .
wavedec2 function :
1. function : Implementation image ( That is, two-dimensional signal ) Multilayer decomposition of .
Multi-storey , That is, multi-scale .
2. Format :[c,s]=wavedec2(X,N,’wname’)
[c,s]=wavedec2(X,N,Lo_D,Hi_D)( I won't discuss it )
3. Parameter description : To image X use wname Wavelet basis function implementation N Layer decomposition ,
The wavelet basis function here should be selected according to the actual situation , Specific options can be found . Output is c,s.
c Is the decomposition coefficient of each layer ,s Is the decomposition coefficient length of each layer , That's the size .
4.c Structure :c=[A(N)|H(N)|V(N)|D(N)|H(N-1)|V(N-1)|D(N-1)|H(N-2)|V(N-2)|D(N-2)|…|H(1)|V(1)|D(1)]
so ,c It's a row vector , namely :1*(size(X)),(e.g,X=256*256,then c The size is :1*(256*256)=1*65536)
A(N) On behalf of the N Layer low frequency coefficient ,H(N)|V(N)|D(N) On behalf of the N Layer high frequency coefficient , They are horizontal , vertical , Diagonal high frequency , And so on , To H(1)|V(1)|D(1).
s Structure : Is the length of the decomposition coefficient of each layer , The first line is A(N) The length of , The second line is H(N)|V(N)|D(N)| The length of , The third line is
H(N-1)|V(N-1)|D(N-1) The length of , The penultimate line is H(1)|V(1)|D(1) length , The last line is X The length of ( size )
another :MATLAB HELP It's very clear , ha-ha .
wavedec2
Multilevel 2-D wavelet decomposition Syntax [C,S] = wavedec2(X,N,’wname’)
[C,S] = wavedec2(X,N,Lo_D,Hi_D)
Description wavedec2 is a two-dimensional wavelet analysis function.
[C,S] = wavedec2(X,N,’wname’) returns the wavelet decomposition of the matrix X at level N, using the wavelet named in string ‘wname’ (see wfilters for more information).
Outputs are the decomposition vector C and the corresponding bookkeeping matrix S. N must be a strictly positive integer (see wmaxlev for more information).
Instead of giving the wavelet name, you can give the filters. For [C,S] = wavedec2(X,N,Lo_D,Hi_D), Lo_D is the decomposition low-pass filter and Hi_D is the decomposition high-pass filter.
Vector C is organized as C = [ A(N) | H(N) | V(N) | D(N) | … H(N-1) | V(N-1) | D(N-1) | … | H(1) | V(1) | D(1) ]. where A, H, V, D, are row vectors such that A = approximation coefficients H = horizontal detail coefficients V = vertical detail coefficients D = diagonal detail coefficients Each vector is the vector column-wise storage of a matrix.
Matrix S is such that S(1,:) = size of approximation coefficients(N) S(i,:) = size of detail coefficients(N-i+2) for i = 2, …N+1 and S(N+2,:) = size(X)
Examples% The current extension mode is zero-padding (see dwtmode).
% Load original image.
load woman;
% X contains the loaded image.
% Perform decomposition at level 2
% of X using db1.
[c,s] = wavedec2(X,2,’db1′);
% Decomposition structure organization.
sizex = size(X)
sizex =
256 256
sizec = size(c)
sizec =
1 65536
val_s = s
val_s =
64 64
64 64
128 128
256 256
Algorithm For images, an algorithm similar to the one-dimensional case is possible for two-dimensional wavelets and scaling functions obtained from one-dimensional ones by tensor product. This kind of two-dimensional DWT leads to a decomposition of approximation coefficients at level j in four components: the approximation at level j+1, and the details in three orientations (horizontal, vertical, and diagonal). The following chart describes the basic decomposition step for images: So, for J=2, the two-dimensional wavelet tree has the form See Alsodwt, waveinfo, waverec2, wfilters, wmaxlev ReferencesDaubechies, I. (1992), Ten lectures on wavelets, CBMS-NSF conference series in applied mathematics. SIAM Ed. Mallat, S. (1989), “A theory for multiresolution signal decomposition: the wavelet representation,” IEEE Pattern Anal. and Machine Intell., vol. 11, no. 7, pp. 674-693. Meyer, Y. (1990), Ondelettes et opérateurs, Tome 1, Hermann Ed. (English translation: Wavelets and operators, Cambridge Univ. Press. 1993.
Publisher : Full stack programmer stack length , Reprint please indicate the source :https://javaforall.cn/147714.html Link to the original text :https://javaforall.cn
边栏推荐
- 【LeetCode】283-移动零
- /bin/ld: 找不到 -lpam
- 彻底弄懂浏览器强缓存和协商缓存
- [leetcode] 695 - maximum area of the island
- 【LeetCode】977-有序数组的平方
- Moveit obstacle avoidance path planning demo
- How to intercept the value of a key from the JSON string returned by wechat?
- [leetcode] 189 rotation array
- 【Experience Cloud】如何在VsCode中取得Experience Cloud的MetaData
- 提前批院校名称
猜你喜欢
Ant group's large-scale map computing system tugraph passed the national evaluation
PTA 天梯赛习题集 L2-001 城市间紧急救援
Leetcode skimming -- sum of two integers 371 medium
Two traversal sequences are known to construct binary trees
动态规划入门二(5.647.62)
Custom exception
How to intercept the value of a key from the JSON string returned by wechat?
[leetcode] 417 - Pacific Atlantic current problem
【Experience Cloud】如何在VsCode中取得Experience Cloud的MetaData
树-二叉搜索树
随机推荐
2278. Percentage of letters in string
2303. Calculate the total tax payable
2279. Maximum number of backpacks filled with stones
Redux - detailed explanation
数字藏品系统开发(程序开发)丨数字藏品3D建模经济模式系统开发源码
PTA ladder game exercise set l2-001 inter city emergency rescue
(Video + graphic) machine learning introduction series - Chapter 5 machine learning practice
Xpt2046 four wire resistive touch screen
已知兩種遍曆序列構造二叉樹
Aiko ai Frontier promotion (7.2)
[leetcode] 200 number of islands
Wise target detection 23 - pytoch builds SSD target detection platform
[leetcode] 167 - sum of two numbers II - enter an ordered array
怎样从微信返回的json字符串中截取某个key的值?
动态规划入门二(5.647.62)
已知两种遍历序列构造二叉树
密码学基础知识
2278. 字母在字符串中的百分比
6091. 划分数组使最大差为 K
【LeetCode】876-链表的中间结点