找回密码
 注册
查看: 398|回复: 0

R语言 wavethresh包 getarrvec()函数中文帮助文档(中英文对照)

[复制链接]
发表于 2012-10-1 17:20:18 | 显示全部楼层 |阅读模式
getarrvec(wavethresh)
getarrvec()所属R语言包:wavethresh

                                        Compute and return weaving permutation for conversion from wst objects to wd class objects.
                                         计算并返回转换从WST对象WD类对象编织排列。

                                         译者:生物统计家园网 机器人LoveR

描述----------Description----------

Computes weaving permutation for conversion from wst objects to wd
计算编织的置换转换wst对象的wd


用法----------Usage----------


getarrvec(nlevels, sort=TRUE)



参数----------Arguments----------

参数:nlevels
The number of levels in the non-decimated transform for which the permutation is to be computed.
number of levels的非抽取变换中的排列是要计算。


参数:sort
If TRUE then compute permutation for indexing a wst object. If FALSE then compute permutation for indexing a wd object.
如果TRUE然后计算排列索引wst对象。如果FALSE然后计算排列索引wd对象。


Details

详细信息----------Details----------

Conversion of wst objects into wd objects and vice versa can be carried out using the convert.wst and convert.wd functions. These latter functions depend on this getarrvec function to compute the permutation which maps coefficients from one ordering to the other.
可以使用wst和wd函数进行转换convert.wst到convert.wd对象,反之亦然对象。后面的这些功能取决于在此getarrvec功能的排列从一个排序的映射系数计算。

This function returns a matrix which gives the necessary permutations for scale levels 1 to nlevels-1. If you want to get the permutation for the level 0 coefficients of the wst object you will have to call the levarr function directly.
这个函数返回一个矩阵,提供了必要的规模水平排列为1到nlevels-1。如果你想置换为0级系数wst“对象,你将不得不调用levarr功能,直接。

This permutation is described in Nason, Sapatinas and Sawczenko, 1998.
这种排列在利晨,Sapatinas和Sawczenko的1998年。

The function that actually computes the permutations is levarr. This function just combines the results from levarr.
计算排列的功能,实际上是levarr。这个函数仅仅是从levarr相结合的结果。


值----------Value----------

A matrix with nlevels-1 columns. Column 1 corresponds to scale level nlevels-1 in the wst object, and column nlevels-1 corresponds to scale level 1 in the wst object. Replace wst by wd if sort=FALSE.
nlevels-1的列的矩阵。第1列对应于扩展级nlevels-1wst对象和列nlevels-1对应于扩展1级wst对象。更换wstwd如果sort=FALSE。


RELEASE----------RELEASE----------

Version 3.6 Copyright Guy Nason 1997
版本3.6版权所有1997年盖利晨


(作者)----------Author(s)----------


G P Nason



参见----------See Also----------

convert, convert.wd, convert.wst, levarr, wst, wst.object, wpst.
convert,convert.wd,convert.wst,levarr,wst,wst.object,wpst。


实例----------Examples----------


#[]
# What would the permutation be for a wst[置换的WST]
# object with 4 levels?[对象的4个级别?]
#[]
arrvec <- getarrvec(4)
#arrvec[arrvec]
#      [,1] [,2] [,3] [[1] [2] [3]]
# [1,]    1    1    1[[1] 1 1 1]
# [2,]    9    9    9[[2,] 9 9 9]
# [3,]    2    5    5[[3] 2 5 5]
# [4,]   10   13   13[[4] 10 13 13]
# [5,]    3    2    3[[5] 3 2 3]
# [6,]   11   10   11[[6] 11 10 11]
# [7,]    4    6    7[[7] 4 6 7 8 9 10]
# [8,]   12   14   15[[8] 12 14 15]
# [9,]    5    3    2[[9] 5 3 2]
#[10,]   13   11   10[[10] 13 11 10]
#[11,]    6    7    6[[11] 6 7 6]
#[12,]   14   15   14[[12] 14 15 14]
#[13,]    7    4    4[[13] 7 4 4]
#[14,]   15   12   12[[14] 15 12 12]
#[15,]    8    8    8[[15] 8 8 8]
#[16,]   16   16   16[[16] 16 16 16]
#[]
# The permutation for level 3 is in column 1[在第1列的排列为第3级是]
# The permutation for level 2 is in column 2[2级的排列在第2列]
# The permutation for level 1 is in column 3.[1级的排列是在第3栏。]
#[]
# The following shows that the above is the right permutation (for level 2[以上是正确的排列如下所示(2级]
# at least.[至少。]
#[]
# Start off with some random normal data![刚开始时随机一些正常的数据!]
#[]
myrand <- rnorm(1:16)
#[]
# Now take both the time ordered non-decimated wavelet[同时命令的时间非抽取小波]
# transform and the packet ordered non-decimated wavelet[改造,并下令非抽取小波包]
# transform.[变换。]
#[]
myrwdS <- wd(myrand, type="station")
myrwst <- wst(myrand)
#[]
# Let's look at the level 2 coefficients of myrwdS[让我们的2级系数myrwdS的看]
#[]
accessD(myrwdS, level=2)
# [1] -0.73280829 -0.97892279  1.33305777  1.46320165 -0.94790098[[1] -0.73280829 -0.97892279 1.33305777 1.46320165 -0.94790098]
# [6] -1.39276215  0.40023757  0.82517249 -0.56317955 -0.89408713[[6] -1.39276215 0.40023757 0.82517249 -0.56317955 -0.89408713]
#[11]  0.77166463  1.56204870 -0.34342230 -1.64133182  0.08235115[[11] 0.77166463 1.56204870 -0.34342230 -1.64133182 0.08235115]
#[16]  1.05668106[[16] 1.05668106]
#[]
# Let's look at the level 2 coefficients of myrwst[让我们来看看2级系数myrwst]
#[]
accessD(myrwst, level=2)
# [1] -0.73280829 -0.94790098 -0.56317955 -0.34342230  1.33305777[[1] -0.73280829 -0.94790098 -0.56317955 -0.34342230 1.33305777]
# [6]  0.40023757  0.77166463  0.08235115 -0.97892279 -1.39276215[[6] 0.40023757 0.77166463 0.08235115 -0.97892279 -1.39276215]
#[11] -0.89408713 -1.64133182  1.46320165  0.82517249  1.56204870[[11] -0.89408713 -1.64133182 1.46320165 0.82517249 1.56204870]
#[16]  1.05668106[[16] 1.05668106]
#[]
# O.k. So the coefficients are the same, but they are not in the[好吧。因此,系数是相同的,但它们不是在]
# same order as in myrwdS. So let's use the permutation in the[顺序相同在myrwdS。因此,让我们在使用置换]
# second column of arrvec to reorder the myrwst coefficients[第二列arrvec,重新排序myrwst系数]
# to have the same order as the myrwdS ones[具有相同的顺序作为myrwdS子里]
#[]
accessD(myrwst, level=2)[arrvec[,2]]
# [1] -0.73280829 -0.97892279  1.33305777  1.46320165 -0.94790098[[1] -0.73280829 -0.97892279 1.33305777 1.46320165 -0.94790098]
# [6] -1.39276215  0.40023757  0.82517249 -0.56317955 -0.89408713[[6] -1.39276215 0.40023757 0.82517249 -0.56317955 -0.89408713]
#[11]  0.77166463  1.56204870 -0.34342230 -1.64133182  0.08235115[[11] 0.77166463 1.56204870 -0.34342230 -1.64133182 0.08235115]
#[16]  1.05668106[[16] 1.05668106]
#[]
# These coefficients have the correct ordering.[这些系数有正确的顺序。]

转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。


注:
注1:为了方便大家学习,本文档为生物统计家园网机器人LoveR翻译而成,仅供个人R语言学习参考使用,生物统计家园保留版权。
注2:由于是机器人自动翻译,难免有不准确之处,使用时仔细对照中、英文内容进行反复理解,可以帮助R语言的学习。
注3:如遇到不准确之处,请在本贴的后面进行回帖,我们会逐渐进行修订。
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则

手机版|小黑屋|生物统计家园 网站价格

GMT+8, 2024-11-25 15:34 , Processed in 0.029093 second(s), 15 queries .

Powered by Discuz! X3.5

© 2001-2024 Discuz! Team.

快速回复 返回顶部 返回列表