Bin Han

Prof. Dr. Bin Han

Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, AB T6G 2G1, Canada

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2004 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
IDIngrid Daubechie
Ingrid Daubechie
Bin HanBin Han
Bin Han

15 August 2008 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
Bin HanBin Han
Bin Han
ZSZuowei Shen
Zuowei Shen

1 May 2001 in Journal of Approximation Theory
Verified
Journal Article
Open access
PDF file
Bin HanBin Han
Bin Han
Multiwavelets are generated from refinable function vectors by using multiresolution analysis. In this paper we investigate the approximation properties of a multivariate refinable function vector associated with a general dilation matrix in terms of both the subdivision operator and the order of sum rules satisfied by the matrix refinement mask. Based on a fact about the sum rules of biorthogonal multiwavelets, a coset by coset (CBC) algorithm is presented to construct biorthogonal multiwavelets with arbitrary order of vanishing moments. More precisely, to obtain biorthogonal multiwavelets, we have to construct primal and dual masks. Given any primal matrix mask a and a general dilation matrix M, the proposed CBC algorithm reduces the construction of all dual masks of a, which satisfy the sum rules of arbitrary order, to a problem of solving a well organized system of linear equations. We prove in a constructive way that for any given primal mask a with a dilation matrix M and for any positive integer k, we can always construct a dual mask ã of a such that ã satisfies the sum rules of order k. In addition, we provide a general way for the construction of Hermite interpolatory matrix masks in the univariate setting with any dilation factors. From such Hermite interpolatory masks, smooth Hermite interpolants, including the well known cubic Hermite splines as a special case, are obtained and are used to construct biorthogonal multiwavelets. As an example, a C3 Hermite interpolant with support [−3, 3] is presented. Then we shall apply the CBC algorithm to such Hermite interpolatory masks to construct biorthogonal multiwavelets. Several examples of biorthogonal multiwavelets are provided to illustrate the general theory. In particular, a C1 dual function vector with support [−4, 4] of the cubic Hermite splines is given.

30 November 2008 in Applied and Computational Harmonic Analysis
Verified
Journal Article
Closed access
PDF file
MEMartin Ehler
Martin Ehler
Bin HanBin Han
Bin Han

31 January 2005 in Applied and Computational Harmonic Analysis
Verified
Journal Article
Closed access
PDF file
Bin HanBin Han
Bin Han
QMQun Mo
Qun Mo

28 January 2013 in Mathematical Modelling of Natural Phenomena
Verified
Journal Article
Open access
PDF file
Bin HanBin Han
Bin Han
As one of the major directions in applied and computational harmonic analysis, the classical theory of wavelets and framelets has been extensively investigated in the function setting, in particular, in the function space L 2(ℝ d ). A discrete wavelet transform is often regarded as a byproduct in wavelet analysis by decomposing and reconstructing functions in L 2(ℝ d ) via nested subspaces of L 2(ℝ d ) in a multiresolution analysis. However, since the input/output data and all filters in a discrete wavelet transform are of discrete nature, to understand better the performance of wavelets and framelets in applications, it is more natural and fundamental to directly study a discrete framelet/wavelet transform and its key properties. The main topic of this paper is to study various properties of a discrete framelet transform purely in the discrete/digital setting without involving the function space L 2(ℝ d ). We shall develop a comprehensive theory of discrete framelets and wavelets using an algorithmic approach by directly studying a discrete framelet transform. The connections between our algorithmic approach and the classical theory of wavelets and framelets in the function setting will be addressed. Using tensor product of univariate complex-valued tight framelets, we shall also present an example of directional tight framelets in this paper.