WaveletBestBasis[dwd]
计算在 DiscreteWaveletData 对象 dwd 中的最优基表示.
WaveletBestBasis[dwd,cspec]
使用代价指定 cspec 计算最优基表示.
WaveletBestBasis
WaveletBestBasis[dwd]
计算在 DiscreteWaveletData 对象 dwd 中的最优基表示.
WaveletBestBasis[dwd,cspec]
使用代价指定 cspec 计算最优基表示.
更多信息和选项
- WaveletBestBasis[dwd] 返回一个 DiscreteWaveletData odwd 对象,其中已经对最优基进行计算,并且将被诸如 InverseWaveletTransform、WaveletListPlot 等函数使用.
- DiscreteWaveletData odwd 的属性可以使用 odwd["prop"] 求得.
- 与最优基相关的属性包括:
-
"BasisIndex" 用于逆变换的小波的小波索引 "BestBasisBlockView" 最优基的块状网格视图 "BestBasisCostValues" 每个小波系数的代价值 "TreeView" 分解的树状视图,其中突出显示最优基 - WaveletBestBasis[dwd] 等价于 WaveletBestBasis[dwd,"ShannonEntropy"].
- 可能的 cspec 值包括:
-
"ShannonEntropy" 香农熵 
"LogEnergy" 对数能量 
{"Norm",p} 范数,对于
类似
,并且对于
类似 ![-sum_iTemplateBox[{{w, _, i}}, Abs]^p -sum_iTemplateBox[{{w, _, i}}, Abs]^p](Files/WaveletBestBasis.zh/2.png)
{"Threshold",δ} 超过
的元素数目fn 将 fn 应用于系数数组以获取一个代价值 - 一个代价函数 fn 必须满足 fn[{a1,…,am,b1,…,bn}]fn[{a1,…,am}]+fn[{b1,…,bn}] 和 fn[{0,…}]0.
- 最优基是小波分解中给出最低总体代价的完全基.
范例
打开所有单元 关闭所有单元基本范例 (1)
范围 (11)
基本用途 (6)
dwd = WaveletBestBasis[DiscreteWaveletPacketTransform[{1, 1, 2, 3, 2, 2}]]最优基存储在所得的 DiscreteWaveletData 对象中:
dwd["BasisIndex"]dwd[Automatic]小波包变换给出包含一个默认基的 DiscreteWaveletData 对象:
dwd = DiscreteWaveletPacketTransform[{0, 0, 1, 1, 1, 2, 3, 4}];dwd["BasisIndex"]dwd[{"TreeView", Left}]WaveletBestBasis 给出一个具有不同的最优基的新的 DiscreteWaveletData 对象:
WaveletBestBasis[dwd]["BasisIndex"]WaveletBestBasis[dwd][{"TreeView", Left}]Table[WaveletBestBasis[DiscreteWaveletPacketTransform[{1, 2, 8, 6, 0, 7, 6, 3, 8, 3, 5, 9}, Automatic, r]]["BestBasisBlockView"], {r, 4}]dwd = DiscreteWaveletPacketTransform[[image], CDFWavelet[], 3];best = WaveletBestBasis[dwd, "LogEnergy"]{Labeled[WaveletImagePlot[dwd], Text@"default basis"], Labeled[WaveletImagePlot[best], Text@"best basis"]}dwd = DiscreteWaveletPacketTransform[{3.3, 4.3, 0.7, 0.5, 0.6, 2.8, 2.7, 4.9}]cost[coeff_] := -Count[coeff, u_ /; ¬-1 < u < 1]best = WaveletBestBasis[dwd, cost]Count[Last /@ dwd[Automatic], u_ /; -1 < u < 1, ∞]Count[Last /@ best[Automatic], u_ /; -1 < u < 1, ∞]WaveletBestBasis 给出所有可能的小波基中的最优基:
dwd = DiscreteWaveletPacketTransform[RandomReal[1, 32], Automatic, 5];best = WaveletBestBasis[dwd]b[n_, i___] := Prepend[Flatten[Outer[Join, b[n, i, 0], b[n, i, 1], 1], 1], {{i}}]
b[n_, i___] := {{{i}}} /; Length[{i}] == nFramed /@ b[2]ListLogPlot[Table[Length[b[n]], {n, 5}], Joined -> True, PlotMarkers -> Automatic]Total[best["BasisIndex"] /. best["BestBasisCostValues"]]Histogram[Map[Total, RandomSample[b[5], 1000] /. best["BestBasisCostValues"]]]代价函数 (5)
w = {Sqrt[e], Sqrt[1 - e]};对于 "ShannonEntropy",把代价绘制为第一个分量能量
的函数:
Plot[Total[-w^2Log[w^2]], {e, 0, 1}]Plot[Total[Log[w^2]], {e, 0, 1}]Table[Plot[Total[If[0 < p < 2, Abs[w]^p, -Abs[w]^p]], {e, 0, 1}, PlotLabel -> p], {p, {0.5, 1.5, 3}}]Table[Plot[Total[Boole[Thread[Abs[w] > δ]]], {e, 0, 1}, PlotLabel -> δ, Exclusions -> None, PlotRange -> {0, 2}], {δ, {0.3, 0.6, 0.9}}]dwd = DiscreteWaveletPacketTransform[{3.8, 6.5, 0.8, 8.3, 9.5, 5.7, 6., 1.3, 5.2, 7.5, 1., 9.4, 7.8, 6.3, 8.8, 9.8}];Table[Labeled[WaveletBestBasis[dwd, cf]["BestBasisBlockView"], Text@cf], {cf, {"ShannonEntropy", {"Norm", 1}, {"Norm", 3}, "LogEnergy", {"Threshold", 0.5}, {"Threshold", 2}}}]Table[ListLogPlot[Sort[Flatten[Last /@ WaveletBestBasis[dwd, cf][Automatic]]^2], PlotLabel -> cf, Filling -> Axis, PlotRange -> {0.0001, 1000}], {cf, {"ShannonEntropy", {"Norm", 1}, {"Norm", 3}, "LogEnergy", {"Threshold", 0.5}, {"Threshold", 2}}}]dwd = DiscreteWaveletPacketTransform[RandomReal[10, 16]];Table[Labeled[WaveletBestBasis[dwd, c]["BestBasisBlockView"], Text@c], {c, {"ShannonEntropy", {"Norm", 1}, {"Norm", 3}, "LogEnergy", {"Threshold", 0.5}, {"Threshold", 2}}}]int[w_] := Norm[w - Round[w], 2] ^ 2d = RandomReal[3, 16];dwd = WaveletBestBasis[DiscreteWaveletPacketTransform[d, Automatic, 4], int]{int[d], {} /. dwd["BestBasisCostValues"]}Total[dwd["BasisIndex"] /. dwd["BestBasisCostValues"]]ListPlot[Sort@Flatten[dwd["BasisIndex"] /. Normal[dwd]], PlotRange -> All]dwd = DiscreteWaveletPacketTransform[RandomReal[10, 16]]shannon[w_] := Piecewise[{{-w^2Log[w^2], w ≠ 0}}]{WaveletBestBasis[dwd, v Total@Map[shannon, v]]["BestBasisBlockView"], WaveletBestBasis[dwd, "ShannonEntropy"]["BestBasisBlockView"]}loge[w_] := Piecewise[{{Log[w^2], w ≠ 0}}]{WaveletBestBasis[dwd, v Total@Map[loge, v]]["BestBasisBlockView"], WaveletBestBasis[dwd, "LogEnergy"]["BestBasisBlockView"]}pwnorm[w_, p_] := Piecewise[{{Norm[w, p] ^ p, 0 < p < 2}, {-Norm[w, p] ^ p, p ≥ 2}}]{WaveletBestBasis[dwd, pwnorm[#, 3]&]["BestBasisBlockView"], WaveletBestBasis[dwd, {"Norm", 3}]["BestBasisBlockView"]}thr[w_, δ_] := Count[w, u_ /; Abs[u] > δ]{WaveletBestBasis[dwd, thr[#, 1]&]["BestBasisBlockView"], WaveletBestBasis[dwd, {"Threshold", 1}]["BestBasisBlockView"]}推广和延伸 (2)
dwd = WaveletBestBasis[DiscreteWaveletPacketTransform[{1, 2, 3, 5}], {{1}, {0, 1}, {0, 0}}]dwd["BestBasisBlockView"]dwd = WaveletBestBasis[DiscreteWaveletPacketTransform[Range[8]], {{1}, {0, 0, 0}}]dwd[{"TreeView", Left}]应用 (3)
压缩 (3)
使用 WaveletBestBasis 来选择基于阈值的数据压缩的小波基:
data = Table[Sin[x + x ^ 2], {x, 0, 10, 0.01}];WaveletBestBasis[DiscreteWaveletPacketTransform[data, DaubechiesWavelet[4], 4]]dwd = WaveletThreshold[%, {"Hard", 0.1}]Count[Last /@ dwd[Automatic], Except[0.], ∞]Count[Chop[data, 0.2], Except[0], ∞]{ListLinePlot[data], ListLinePlot[InverseWaveletTransform[dwd]]}data = Table[Sin[x + x ^ 2], {x, 0, 10, 0.01}];dwd = DiscreteWaveletPacketTransform[data, DaubechiesWavelet[], 4];dwds = Table[WaveletThreshold[WaveletBestBasis[dwd, {"Threshold", δ}], {"Hard", δ}], {δ, {0.05, 0.1, 0.2, 0.5}}]Table[ListLinePlot[InverseWaveletTransform[d], PlotLabel -> Row[{"non-zero values: ", Count[Last /@ d[Automatic], Except[0.], ∞]}]], {d, dwds}]Length[data]dwd = DiscreteWaveletPacketTransform[[image], CDFWavelet[], 3];dwds = Table[WaveletThreshold[WaveletBestBasis[dwd, {"Threshold", δ}], {"Hard", δ}], {δ, {0.02, 0.05, 0.2, 0.5}}]Table[Labeled[InverseWaveletTransform[d], Text["non-zero values: " <> ToString[Count[Last /@ d[Automatic], Except[0.], ∞]]]], {d, dwds}]ImageChannels[[image]] * Apply[Times, ImageDimensions[[image]]]属性和关系 (4)
dwd = DiscreteWaveletPacketTransform[{0, 0, 1, 1}];best = WaveletBestBasis[dwd];dwd[Automatic]best[Automatic]DiscreteWaveletTransform[{0, 0, 1, 1}][Automatic]非包变换给出具有永久固定基的一个 DiscreteWaveletData 对象:
dwd = DiscreteWaveletTransform[{0, 0, 1, 1, 1, 2, 3, 4}];dwd["BasisIndex"]dwd["TreeView"]WaveletBestBasis[dwd] 的结果具有与 dwd 完全相同的小波系数:
dwd = DiscreteWaveletPacketTransform[{0, 0, 1, 1, 1, 2, 3, 4}];Normal[WaveletBestBasis[dwd]] === Normal[dwd]WaveletBestBasis[dwd]["BasisIndex"] === dwd["BasisIndex"]"BestBasisCostValues" 的 {} 系数是原始数据的代价值:
dwd = WaveletBestBasis[DiscreteWaveletPacketTransform[{1, 2, 1, 1.1}], "LogEnergy"];{} /. dwd["BestBasisCostValues"]Total[Log[{1, 2, 1, 1.1} ^ 2]]Total[dwd["BasisIndex"] /. dwd["BestBasisCostValues"]]可能存在的问题 (5)
DiscreteWaveletTransform 不计算小波系数组成的完全树:
WaveletBestBasis[DiscreteWaveletTransform[{0, 0, 1, 1}]]DiscreteWaveletTransform[{0, 0, 1, 1}]["TreeView"]使用 DiscreteWaveletPacketTransform 以获取完全树:
WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, 1}]]DiscreteWaveletPacketTransform[{0, 0, 1, 1}]["TreeView"]代价函数必须是关于 Join 可加的:
WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, 1}], -Norm[#, 3]&]Norm[{1}, 3] + Norm[{2}, 3] == Norm[{1, 2}, 3]WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, 1}], -Norm[#, 3] ^ 3&]WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, 1}], Total[Exp[Abs[#]]]&]WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, 1}], Total[Exp[Abs[#]] - 1]&]WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, n}]]Table[WaveletBestBasis[DiscreteWaveletPacketTransform[{0, 0, 1, n}]], {n, {0.5, 1, 1.5, 2}}]dwd = DiscreteWaveletPacketTransform[RandomReal[1, 4]];WaveletBestBasis[dwd, {{1}, {1, 0}}]由于 {1,0} 可以从 {1} 计算,一个集不能同时包含 {1} 和 {1,0}:
dwd["TreeView"]{WaveletBestBasis[dwd, {{1}}]["TreeView"], WaveletBestBasis[dwd, {{1, 0}}]["TreeView"]}相关指南
-
▪
- 小波分析
文本
Wolfram Research (2010),WaveletBestBasis,Wolfram 语言函数,https://reference.wolfram.com/language/ref/WaveletBestBasis.html.
CMS
Wolfram 语言. 2010. "WaveletBestBasis." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/ref/WaveletBestBasis.html.
APA
Wolfram 语言. (2010). WaveletBestBasis. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/ref/WaveletBestBasis.html 年
BibTeX
@misc{reference.wolfram_2026_waveletbestbasis, author="Wolfram Research", title="{WaveletBestBasis}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/WaveletBestBasis.html}", note=[Accessed: 15-November-2026]}
BibLaTeX
@online{reference.wolfram_2026_waveletbestbasis, organization={Wolfram Research}, title={WaveletBestBasis}, year={2010}, url={https://reference.wolfram.com/language/ref/WaveletBestBasis.html}, note=[Accessed: 15-November-2026]}