MétaCan
Menu
Back to cohort
Record W1979763552 · doi:10.1090/s0025-5718-09-02320-5

The structure of balanced multivariate biorthogonal multiwavelets and dual multiframelets

2009· article· en· W1979763552 on OpenAlexafffund
Bin Han

Bibliographic record

VenueMathematics of Computation · 2009
Typearticle
Languageen
FieldMathematics
TopicMathematical Analysis and Transform Methods
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsBiorthogonal systemOrthonormal basisUnivariateMathematicsWaveletApplied mathematicsProperty (philosophy)OrthogonalizationOrder (exchange)Multiresolution analysisMultivariate statisticsDual (grammatical number)AlgorithmComputer scienceWavelet transformDiscrete wavelet transformArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Multiwavelets and multiframelets are of interest in several applications such as numerical algorithms and signal processing, due to their desirable properties such as high smoothness and vanishing moments with relatively small supports of their generating functions and masks. In order to process and represent vector-valued discrete data efficiently and sparsely by a multiwavelet transform, a multiwavelet has to be prefiltered or balanced. Balanced orthonormal univariate multiwavelets and multivariate biorthogonal multiwavelets have been studied and constructed in the literature. Dual multiframelets include (bi)orthogonal multiwavelets as special cases, but their fundamental prefiltering and balancing property has not yet been investigated in the literature. In this paper we shall study the balancing property of multivariate multiframelets from the point of view of the discrete multiframelet transform. This approach, to our best knowledge, has not been considered so far in the literature even for multiwavelets, but it reveals the essential structure of prefiltering and the balancing property of multiwavelets and multiframelets. We prove that every biorthogonal multiwavelet can be prefiltered with the balancing order matching the order of its vanishing moments; that is, from every given compactly supported multivariate biorthogonal multiwavelet, one can always build another (essentially equivalent) compactly supported biorthogonal multiwavelets with its balancing order matching the order of the vanishing moments of the original one. More generally, we show that if a dual multiframelet can be prefiltered, then it can be equivalently transformed into a balanced dual multiframelet with the same balancing order. However, we notice that most available dual multiframelets in the literature cannot be simply prefiltered with its balancing order matching its order of vanishing moments and they must be designed to possess high balancing orders. The key ingredient of our approach is based on investigating some properties of the subdivision and transition operators acting on discrete vector polynomial sequences, which play a central role in a discrete multiframelet transform and are of interest in their own right. We also establish a new canonical form of a matrix mask, which greatly facilitates the investigation and construction of multiwavelets and multiframelets. In this paper, we obtain a complete criterion and the essential structure for balanced or prefiltered dual multiframelets in the most general setting. Our investigation of the balancing property of a multiframelet deepens our understanding of the multiframelet transform in signal processing and scientific computation.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.341
Teacher spread0.313 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations39
Published2009
Admission routes2
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicMathematical Analysis and Transform MethodsFrench-language works237,207