The performance of a balanced, nonseparable orthogonal multiwavelet for edge detection is analized. We present two alternative methods to meet this objective: in the first one the normed fine detail coefficients of the multiwavelet transform are thresholded, in the other, we adapt the modulus maxima algorithm to nonseparable multiwavelets. Results are highly satisfactory.

2 Multiwavelets In this paper the efficient implementation of discrete multiwavelet transforms is examined. These rransforms can be used for image coding. The presented architecture is based on lattice structures and computationally efficient CORDICbased p-rotations. An exemplary VLSI-implementation for a multiwavelet-based lapped orthogonal transform is presented.

Breast cancer continues to be a significant public health problem in the world. The diagnosing mammography method is the most effective technology for early detection of the breast cancer. However, in some cases, it is difficult for radiologists to detect the typical diagnostic signs, such as masses and microcalcifications on the mammograms. Dense region in digital mammographic images are usual...

Applying the theorems of Mobius inverse and Dirichlet inverse, a general algorithm to obtain biorthogonal functions based on generalized Fourier series analysis is introduced. In the algorithm, the orthogonal function can be not only Fourier or Legendre series, but also can be any one of all orthogonal function systems. These kinds of biorthogonal function sets are used as scramble signals to c...

There exist efficient methods to compute the wavelet coefficients of a function f(t) from its point samples f ( T [n + τ ] ) , n ∈ N. However, in many applications the available samples are average samples of the type ∫∞ −∞ f ( T [t + n + τ ] ) u(t)dt, where the averaging function u(t) reflects the characteristic of the acquisition device. In this work, methods to compute the coefficients in a ...

The problem of solving a system of linear equations is equivalent to the computation of biorthogonal polynomials and to the bordering method which is a procedure for solving recursively a sequence of linear systems with increasing dimensions. In some cases, the biorthogonal polynomials can be computed recursively thus leading to procedures for solving linear systems. The particular cases of Han...

The eigenvectors of a symmetric matrix can be chosen to form a biorthogonal set with respect to the identity and to the matrix itself. Similarly, the eigenvectors of a symmetric de nite linear pencil can be chosen to be biorthogonal with respect to the pair.This paper presents the three sets of matrix weights, with respect to which the eigenvectors of the symmetric de nite quadratic pencil are ...

We will be concerned with the solution of an elliptic boundary value problem in one dimension with polynomial coeecients. In a Galerkin approach, we employ biorthogonal wavelets adapted to a diierential operator with constant coeecients, and use the reenement equations to set up the system of linear equations with exact entries (up to round-oo). For the solution of the linear equation, we const...