首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 93 毫秒
1.
针对SAR图像去噪过程中存在降低相干斑与保持有效细节这一矛盾,提出了一种基于四点插值细分小波的SAR图像去噪算法,该方法将小波和细分方法相融合,将四点插值细分规则应用到细分小波中,提出了图像去噪的新方法.该算法先用四点插值细分小波对原始图像进行分解,然后用Bayes自适应阈值及阈值函数对图像进行去噪,最后对去噪的小波系数进行重构,并通过等效视数、边缘保持指数等评价指标对去噪结果进行了评价.实验结果表明,算法的等效视数、边缘保持指数都有所提高,去噪效果得到了优化.  相似文献   

2.
利用逼近型细分构造插值型细分是细分领域中的一个重要问题,目前可以给出插值型细分生成函数的研究还非常少.本文给出一个生成函数的统一公式,该公式由逼近型细分的生成函数与一个子生成函数构成.该公式对应一个插值型细分或者逼近型细分,这个取决于子生成函数的选取.该公式在理论和实际中都很重要.首先,这个公式适用于任意伸缩矩阵的多元基本型细分;其次,不论是一元细分还是多元细分,推导这个统一公式都不需要求解线性方程组;再次,这个公式具有显著的几何意义,应用方便;最后,从理论上分析诱导细分的零条件和多项式再生性,本文发现这些性质不仅与逼近型细分的零条件有关,而且与逼近型细分的多项式再生性有关,从而对细分格式的构造有指导意义.本文给出3个例子来说明这个统一公式.  相似文献   

3.
龚大平  徐树荣 《应用数学》1993,6(2):168-171
本文讨论了二次样条插值的定解条件,在l_1模意义下给出了一类最佳二次样条插值的概念,以及寻找最佳二次样条插值的定解条件的方法.最后讨论了误差估计问题,并给出了实际算例.  相似文献   

4.
韩国强 《计算数学》1989,11(2):212-219
在实际问题中,尤其是统计问题,碰到的不一定是点态插值,而是要满足某种平均泛函条件.本文讨论算子样条积分平均插值,给出一种新的、计算稳定的求解算法.  相似文献   

5.
高俊斌 《数学杂志》1994,14(2):252-260
本文首先在CT细分三角形剖分上,建立起六次二阶光滑样样函数空间的维数结论。利用我们的构造性证明方法,给出了该空间中的一个C^2有限元插值格式,并给出有限元的计算方法。  相似文献   

6.
本文提出了求值插值细分曲线上任意有理参数的算法.通过构造与细分格式相关的矩阵,m进制分解给定有理数以及特征分解循环节对应算子乘积,计算得到控制顶点权值,实现对称型静态均匀插值细分曲线的求值.本文给出了四点细分和四点Ternary细分曲线的求值实例.算法可以推广到求值其他非多项式细分格式中.  相似文献   

7.
基于函数值的有理三次插值样条曲线的区域控制   总被引:1,自引:1,他引:0  
邓四清  方逵  谢进  陈福来 《计算数学》2008,30(2):167-176
将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题.构造了一种基于函数值的分母为三次的C~1连续有理三次插值样条.这种有理三次插值样条中含有二个调节参数,因而给约束控制带来了方便.对该种插值曲线的区域控制问题进行了研究,给出了将其约束于给定的折线、二次曲线之上、之下或之间的充分条件.最后给出了数值例子.  相似文献   

8.
一类二次保形拟插值函数的研究   总被引:1,自引:0,他引:1  
通过讨论一种保形拟插值的基函数与二次规范B-样条函数之间的关系,提出了一类二次保形拟插值样条函数,得到了这类保形拟插值函数在具有线性再生性质,并保持原有数据点列的单调性和凸性时分别应满足的条件,并给出几个应用实例.  相似文献   

9.
P-集合是把动态特性引入到有限普通集合X内,改进有限普通集合X得到的.层次P-集合是对普通P-集合的扩展,具有层次结构和链式结构.利用层次P-集合的性质,研究层次P-集合属性元素与规律,给出层次结构间属性元素的关系及度量,给出链式结构中属性元素的关系及度量,给出属性规律.  相似文献   

10.
本文在模糊Lagrange插值的基础上,引进了模糊牛顿插值公式及其适定性定理和求法。并针对“非结点”型边界条件给出了模糊样条函数的具体表示。  相似文献   

11.
Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.

A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.

  相似文献   


12.
A generic technique for the construction of diversity of interpolatory subdivision schemes on the base of polynomial and discrete splines is presented in the paper. The devised schemes have rational symbols and infinite masks but they are competitive (regularity, speed of convergence, computational complexity) with the schemes that have finite masks. We prove exponential decay of basic limit functions of the schemes with rational symbols and establish conditions, which guaranty the convergence of such schemes on initial data of power growth. Mathematics subject classifications (2000) 65D17, 65D07, 93E11  相似文献   

13.
In this paper we develop tools for the analysis of net subdivision schemes, schemes which recursively refine nets of bivariate continuous functions defined on grids of lines, and generate denser and denser nets. Sufficient conditions for the convergence of such a sequence of refined nets, and for the smoothness of the limit function, are derived in terms of proximity to a bivariate linear subdivision scheme refining points, under conditions controlling some aspects of the univariate functions of the generated nets. Approximation orders of net subdivision schemes, which are in proximity with positive schemes refining points are also derived. The paper concludes with the construction of a family of blending spline-type net subdivision schemes, and with their analysis by the tools presented in the paper. This family is a new example of net subdivision schemes generating C1 limits with approximation order 2.  相似文献   

14.
We introduce a general definition of refinable Hermite interpolants and investigate their general properties. We also study a notion of symmetry of these refinable interpolants. Results and ideas from the extensive theory of general refinement equations are applied to obtain results on refinable Hermite interpolants. The theory developed here is constructive and yields an easy-to-use construction method for multivariate refinable Hermite interpolants. Using this method, several new refinable Hermite interpolants with respect to different dilation matrices and symmetry groups are constructed and analyzed.

Some of the Hermite interpolants constructed here are related to well-known spline interpolation schemes developed in the computer-aided geometric design community (e.g., the Powell-Sabin scheme). We make some of these connections precise. A spline connection allows us to determine critical Hölder regularity in a trivial way (as opposed to the case of general refinable functions, whose critical Hölder regularity exponents are often difficult to compute).

While it is often mentioned in published articles that ``refinable functions are important for subdivision surfaces in CAGD applications", it is rather unclear whether an arbitrary refinable function vector can be meaningfully applied to build free-form subdivision surfaces. The bivariate symmetric refinable Hermite interpolants constructed in this article, along with algorithmic developments elsewhere, give an application of vector refinability to subdivision surfaces. We briefly discuss several potential advantages offered by such Hermite subdivision surfaces.

  相似文献   


15.
In this paper we develop a novel approach to construct non-stationary subdivision schemes with a tension control parameter which can reproduce functions in a finite-dimensional subspace of exponential polynomials. The construction process is mainly implemented by solving linear systems for primal and dual subdivision schemes respectively, which are based on different parameterizations. We give the theoretical basis for the existence, uniqueness, and refinement rules of schemes proposed in this paper. The convergence and smoothness of the schemes are analyzed as well. Moreover, conics reproducing schemes are analyzed based on our theory, and a new idea that the tensor parameter ωk of the schemes can be adjusted for conics generation is proposed.  相似文献   

16.
This paper presents a new method for exact evaluation of a limit surface generated by stationary interpolatory subdivision schemes and its associated tangent vectors at arbitrary rational points. The algorithm is designed on the basis of the parametric m-ary expansion and construction of the associated matrix sequence. The evaluation stencil of the control points on the initial mesh is obtained, through computation, by multiplying the finite matrices in a sequence corresponding to the expansion sequence and eigendecomposition of the contractive matrix related to the period of rational numbers. The method proposed in this paper works for other non-polynomial subdivision schemes as well.  相似文献   

17.
We study the convergence of multivariate subdivision schemes with nonnegative finite masks. Consequently, the convergence problem for the multivariate subdivision schemes with nonnegative finite masks supported on centered zonotopes is solved. Roughly speaking, the subdivision schemes defined by these masks are always convergent, which gives an answer to a question raised by Cavaretta, Dahmen and Micchelli in 1991.

  相似文献   


18.
一类新的细分曲线方法   总被引:6,自引:1,他引:5  
Subdivision defines a smooth curve or surface as the limit of a sequence of successive refinements based on initial control polygon or grid.Usually the curve refinements is the basis of the corresponding surface rules. In this paper we analyze previous subdivision scheme according to theories about convergence of N.Dyn and M.F Hassan. In terms of binary and ternary subdivision schemes general construction about curve‘s refinements are studied.Two approximating curve subdivision schemes with neighboring four control points are derived,the generating limit curves can both reach the smoothness of C^1 over the initial polygon using the two schemes and the tolerances of them are given according to the method of [7].  相似文献   

19.
A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending on the combination (2L,m), the proposed scheme suggests different subdivision rules. Second, the scheme turns out to be a 2L-point interpolatory scheme with a tension parameter. The conditions for convergence and smoothness are also studied. Dedicated to Prof. Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A05, 41A25, 41A30, 65D10, 65D17. Byung-Gook Lee: This work was done as a part of Information & Communication fundamental Technology Research Program supported by Ministry of the Information & Communication in Republic of Korea. Jungho Yoon: Corresponding author. Supported by the Korea Science and Engineering Foundation grant (KOSEF R06-2002-012-01001).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号