Loading…
Construction of refinable function vector via GTST
The concept of general two-scale similarity transform (GTST) is introduced. By applying GTST, we present an algorithm of constructing a class of compactly supported refinable function vector. In addition, we prove that GTST can preserve the symmetry of the given a refinable function vector, and give...
Saved in:
Published in: | Applied mathematics and computation 2007-12, Vol.194 (2), p.425-430 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The concept of general two-scale similarity transform (GTST) is introduced. By applying GTST, we present an algorithm of constructing a class of compactly supported refinable function vector. In addition, we prove that GTST can preserve the symmetry of the given a refinable function vector, and give a sufficient condition that the corresponding transform matrices
M(
z) and
N(
z) satisfy when GTST can preserve symmetry. Some examples are given. |
---|---|
ISSN: | 0096-3003 1873-5649 |
DOI: | 10.1016/j.amc.2006.12.088 |