文件名称:Fastdiscretecurvelettransforms
介绍说明－－下载内容来自于网络，使用问题请自行百度
This paper describes two digital implementations of a new mathematical transform, namely,
the second generation curvelet transform [12, 10] in two and three dimensions. The first digital
transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is
based on the wrapping of specially selected Fourier samples. The two implementations essentially
differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both
digitaltransformations return a table of digital curvelet coefficients indexed by a scale
parameter, anorientation parameter, and a spatial location parameter. And both implementations are
fast in
the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are
also invertible, with rapid inversion algorithms of about the same complexity.-This paper describes two digital implementations of a new mathematical transform, namely,
the second generation curvelet transform [12, 10] in two and three dimensions. The first digital
transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is
based on the wrapping of specially selected Fourier samples. The two implementations essentially
differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both
digitaltransformations return a table of digital curvelet coefficients indexed by a scale
parameter, anorientation parameter, and a spatial location parameter. And both implementations are
fast in
the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are
also invertible, with rapid inversion algorithms of about the same complexity.
the second generation curvelet transform [12, 10] in two and three dimensions. The first digital
transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is
based on the wrapping of specially selected Fourier samples. The two implementations essentially
differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both
digitaltransformations return a table of digital curvelet coefficients indexed by a scale
parameter, anorientation parameter, and a spatial location parameter. And both implementations are
fast in
the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are
also invertible, with rapid inversion algorithms of about the same complexity.-This paper describes two digital implementations of a new mathematical transform, namely,
the second generation curvelet transform [12, 10] in two and three dimensions. The first digital
transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is
based on the wrapping of specially selected Fourier samples. The two implementations essentially
differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both
digitaltransformations return a table of digital curvelet coefficients indexed by a scale
parameter, anorientation parameter, and a spatial location parameter. And both implementations are
fast in
the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are
also invertible, with rapid inversion algorithms of about the same complexity.
相关搜索： fourier spatial
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Fast discrete curvelet transforms.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。