Practical selection of a basis from a redundant tree structure

The problem of selecting a basis within a redundant tree structure naturally arises in the frameworks of wavelet packet transform (WPT) and cosine packet transform (CPT) for signal representation. The "actual" tree has to be consider before performing that selection using suitable informa...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bria, Oscar N.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1997
Materias:
Ciencias Informáticas
Practical Selection
Redundant Tree Structure
Distributed
Parallel processing
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23904
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23904
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Practical Selection
Redundant Tree Structure
Distributed
Parallel processing
spellingShingle Ciencias Informáticas
Practical Selection
Redundant Tree Structure
Distributed
Parallel processing
Bria, Oscar N.
Practical selection of a basis from a redundant tree structure
topic_facet Ciencias Informáticas
Practical Selection
Redundant Tree Structure
Distributed
Parallel processing
description The problem of selecting a basis within a redundant tree structure naturally arises in the frameworks of wavelet packet transform (WPT) and cosine packet transform (CPT) for signal representation. The "actual" tree has to be consider before performing that selection using suitable information cost functions for the branches. The "actual" redundant tree has many constraints. Among them is the bit overhead for coding explicitly the name of the resulting non redundant (prune) tree. Besides, from computational or real time constraints it is convenient to perform sub-optimal top-down tree computation/search instead of the optimal bottom-up tree search after computing the complete tree. Even when a optimal coding of the tree remains an open join coding problem, a practical selection algorithm is reported here that takes the above and others considerations into account. The algorithm has been implemented an tested in the framework of a wavelet based audio coding system. Variations of the algorithm can be used in many practical situations where a subset from an redundant structure has to be chosen with the constraint of minimal bit cost.
format Objeto de conferencia
Objeto de conferencia
author Bria, Oscar N.
author_facet Bria, Oscar N.
author_sort Bria, Oscar N.
title Practical selection of a basis from a redundant tree structure
title_short Practical selection of a basis from a redundant tree structure
title_full Practical selection of a basis from a redundant tree structure
title_fullStr Practical selection of a basis from a redundant tree structure
title_full_unstemmed Practical selection of a basis from a redundant tree structure
title_sort practical selection of a basis from a redundant tree structure
publishDate 1997
url http://sedici.unlp.edu.ar/handle/10915/23904
work_keys_str_mv AT briaoscarn practicalselectionofabasisfromaredundanttreestructure
bdutipo_str Repositorios
_version_ 1764820466387648512

Ejemplares similares