general method for perfect reconstruction subband processing of finite length signals using linear extensions a general approach to the nonexpansive m band decomposition of finite length signals is presented the technique is based on linear signal extensions and can be applied to all types of linear and nonlinear phase m band perfect reconstruction filter banks the signal expansion is described by a linear transformation on the input signal and the extended subband samples can be easily found using simple matrix computations

new perspectives and improvements on the symmetric extension filter bank for subband wavelet image compression in subband wavelet image coding size limited subband decompositions are ordinarily used to avoid increasing the number of samples that need to be coded to reduce coding distortions that can occur at the borders the symmetric extension filter bank is typically employed this paper introduces some new perspectives and improvements to that decomposition the symmetric extension filter bank is couched in the cyclic frequency domain providing a framework that accommodates fir and iir filters in a natural way all with perfect reconstruction iir filters with both rational and irrational transfer functions can be implemented and in the context of symmetric extension can accommodate iirs that effectively have perfect stopband suppression enhancements to the filter bank at a tree structured system level are also presented and include the application of spectral reversal correction and a transition band normalization approach to designing the constituent filters of the symmetric extension wavelet packet transform

computational complexity of a cost allocation approach to a fixed cost spanning forest problem we present a computational analysis of a game theoretic approach to a cost allocation problem arising from a graph optimization problem referred to as the fixed cost spanning forest fcsf problem the customers in the fcsf problem represented by nodes in a graph g are in need of service that can be produced at some facilities yet to be constructed the cost allocation problem is concerned with the fair distribution of the cost of providing the service among customers we formulate this cost allocation problem as a cooperative game referred to as the fcsf game in general the core of a fcsf game may be empty however for the case when g is a tree it is shown that the core is not empty moreover we prove that in this case core points can be generated in strongly polynomial time we further provide a nonredundant characterization of the core of the fcsf game defined over a tree in the special case when all nodes are communities this is shown to lead in some instances to a strongly polynomial algorithm for computing the nucleolus

minimum cost spanning tree games we consider the problem of cost allocation among users of a minimum cost spanning tree network it is formulated as a cooperative game in characteristic function form referred to as a minimum cost spanning tree m c s t game we show that the core of a m c s t game is never empty in fact a point in the core can be read directly from any minimum cost spanning tree graph associated with the problem for m c s t games with efficient coalition structures we define and construct m c s t games on the components of the structure we show that the core and the nucleolus of the original game are the cartesian products of the cores and the nucleoli respectively of the induced games on the components of the efficient coalition structure

invertible deinterlacing with sampling density preservation theory and design a novel class of deinterlacing for intra frame field based motion picture coding such as motion jpeg2000 as well as an inter frame based coding without the support of interlaced scanning video such as mpeg 1 is developed this technique has two features sampling density preservation and invertibility these features mean that the amount of deinterlaced pictures is not increased and the original pictures can be perfectly reconstructed this deinterlacing technique is a kind of sampling lattice alteration and is regarded as a generalization of conventional field interleaving and field separation with the help of multidimensional m d multirate theory it is shown that the design problem of such a system that is invertible deinterlacer with sampling density preservation can be replaced to finding a 2 spl times 2 multivariable polynomial matrix with a monomial determinant this problem resembles the design of two channel m d maximally decimated perfect reconstruction finite impulse response fir filterbanks the inverse system which is referred to as a reinterlacer is given as fir when the dual deinterlacing system is fir a practical design procedure is provided by suggesting three constraints considered to be preferable normalization regularity and vertical symmetry the significance of the procedure is verified by showing some design examples of deinterlacing and reinterlacing filters simulation results show that the developed method causes fewer comb shaped artifacts than conventional field interleaving

the application of multiwavelet filterbanks to image processing multiwavelets are a new addition to the body of wavelet theory realizable as matrix valued filterbanks leading to wavelet bases multiwavelets offer simultaneous orthogonality symmetry and short support which is not possible with scalar two channel wavelet systems after reviewing this theory we examine the use of multiwavelets in a filterbank setting for discrete time signal and image processing multiwavelets differ from scalar wavelet systems in requiring two or more input streams to the multiwavelet filterbank we describe two methods repeated row and approximation deapproximation for obtaining such a vector input stream from a one dimensional 1 d signal algorithms for symmetric extension of signals at boundaries are then developed and naturally integrated with approximation based preprocessing we describe an additional algorithm for multiwavelet processing of two dimensional 2 d signals two rows at a time and develop a new family of multiwavelets the constrained pairs that is well suited to this approach this suite of novel techniques is then applied to two basic signal processing problems denoising via wavelet shrinkage and data compression after developing the approach via model problems in one dimension we apply multiwavelet processing to images frequently obtaining performance superior to the comparable scalar wavelet transform

symmetric extension compatible reversible integer to integer wavelet transforms symmetric extension is explored as a means for constructing nonexpansive reversible integer to integer iti wavelet transforms for finite length signals two families of reversible iti wavelet transforms are introduced and their constituent transforms are shown to be compatible with symmetric extension one of these families is then studied in detail and several interesting results concerning its member transforms are presented in addition some new reversible iti structures are derived that are useful in conjunction with techniques like symmetric extension last the relationship between symmetric extension and per lifting step extension is explored and some new results are obtained in this regard

analysis synthesis techniques for subband image coding analysis synthesis systems designed for low bit rate image coding their impact on overall system quality and their computational complexity are discussed the investigation focuses on the design of analysis synthesis systems for image coding and the perceptual impact of these systems at low bit rates two objectives are emphasized in developing these systems confining the total size of the subband images to be equal to the original image size and designing the filters so that perceptual distortion is not introduced by the analysis synthesis system methods based on circular convolution and symmetric extensions are developed and discussed in detail the theory design and implementation of both recursive and nonrecursive filtering systems are discussed methods are introduced which display advantages over conventional quadrature mirror filter based approaches

on m channel linear phase fir filter banks and application in image compression this paper investigates the theory and structure of a large subclass of m channel linear phase perfect reconstruction fir filter banks systems with analysis and synthesis filters of length l sub i k sub i m spl beta where spl beta is an arbitrary integer 0 spl les spl beta m and k sub i is any positive integer for this subclass of systems we first investigate the necessary conditions for the existence of linear phase perfect reconstruction filter banks lpprfbs next we develop a complete and minimal factorization for all even channel linear phase paraunitary systems the most general lapped orthogonal transforms to date finally several design examples as well as comparisons with previous generalized lapped orthogonal transforms genlots in image compression are presented to confirm the validity of the theory

preservation of subband symmetry in multirate signal coding the article derives necessary and sufficient conditions for a multirate linear phase fir filter bank acting on a symmetrically extended finite length input signal to produce either symmetric or antisymmetric downsampled subbands such techniques have gained popularity for image coding applications and we provide the solution to a key technical problem in terms of the input and filter symmetries and the downsampling ratio

generalized network problems yielding totally balanced games a class of multiperson mathematical optimization problems is considered and is shown to generate cooperative games with nonempty cores the class includes but is not restricted to numerous versions of network flow problems it was shown by owen that for games generated by linear programming optimization problems optimal dual solutions correspond to points in the core we identify a special class of network flow problems for which the converse is true i e every point in the core corresponds to an optimal dual solution

generalized unequal length lapped orthogonal transform for subband image coding generalized linear phase lapped orthogonal transforms with unequal length basis functions gullots are considered the length of each basis of the proposed gullot can be different from each other whereas all the bases of the conventional genlot are of equal length in general for image coding application the long basis for a low frequency band and the short basis for a high frequency one are desirable to reduce the blocking and the ringing artifact simultaneously therefore the gullot is suitable especially for a subband image coding in order to apply the gullot to a subband image coding we also investigate the size limited structure to process the finite length signal which is important in practice finally some design and image coding examples are shown to confirm the validity of the proposed gullot

fuzzy cooperative games arising from linear production programming problems with fuzzy parameters abstract in the present study we consider a production model in which multiple decision makers pool resources to produce finished goods such a production model which is assumed to be linear can be formulated as mathematical programming problems with fuzzy parameters from the viewpoint of experts imprecise or fuzzy understanding of the nature of parameters in a problem formulation process it is shown that a cooperative game with values of coalitions represented by fuzzy numbers arises from the linear production programming problem with fuzzy parameters and such a game is referred to as a fuzzy linear production programming game the values of coalitions of the game can be obtained by employing a parametric approach to solving the linear production programming problem with fuzzy parameters it is proven that the core of the game is not empty and an interval in the core is computed by using the ideas of sensitivity analysis and the duality theory of linear programming problems

solutions based on fuzzy goals in fuzzy linear programming games abstract in this paper we deal with linear programming problems with fuzzy parameters from the viewpoint of experts imprecise or fuzzy understanding of the nature of parameters in a problem formulation process and consider fuzzy linear programming games arising from the linear programming problems constructing fuzzy goals of coalitions with respect to payoff in order to suitably reflect fuzzy environments in which the linear programming games are formulated we define solutions maximizing minimal fuzzy goal and solutions maximizing the sum of fuzzy goals and develop computational methods for obtaining the solutions finally we give a numerical example to illustrate construction of a fuzzy linear programming game and derivation of the solutions

on computational methods for solutions of multiobjective linear production programming games abstract in this paper we consider a production model in which multiple decision makers pool resources to produce finished goods such a production model which is assumed to be linear can be formulated as a multiobjective linear programming problem it is shown that a multi commodity game arises from the multiobjective linear production programming problem with multiple decision makers and such a game is referred to as a multiobjective linear production programming game the characteristic sets in the game can be obtained by finding the set of all the pareto extreme points of the multiobjective programming problem it is proven that the core of the game is not empty and points in the core are computed by using the duality theory of multiobjective linear programming problems moreover the least core and the nucleolus of the game are examined finally we consider a situation that decision makers first optimize their multiobjective linear production programming problem and then they examine allocation of profits and or costs computational methods are developed and illustrative numerical examples are given

a development of symmetric extension method for subband image coding describes the development of a technique for subband image coding called the symmetric extension method which utilizes the nature of a symmetrically extended image to achieve high quality coding there are however some restrictions on the usable subband coding system the development is done based on the property of a symmetrically extended signal in the analysis process to remove the restriction the behavior of the sequence after two processes filtering and decimation is examined and formulated the development extends the application area of the technique

cost allocation for a tree network with heterogeneous customers we analyze a cost allocation problem which could naturally arise from a situation wherein a tree networkt n 0 e serving heterogeneous customers has to be constructed the customers located atn require some service from a central supplier located at vertex 0 the customers have heterogeneous preferences for the level or quality of service received from the central supplier we formulate the above cost allocation problem as a cooperative game referred to as anextended tree game the extended tree game is a proper extension of megiddo s 1978 tree game wherein all the customers have identical preferences regarding the level of service received we prove that an extended tree game is convex and we show that its shapley value can be computed in p n time wherep is the number of distinct preference levels we further provide a complete facial description of the core polytope of an extended tree game and demonstrate that even when there are only two classes of customers the number of nonredundant core constraints could be exponential in n nevertheless we are able to construct an p n algorithm to check the core membership of an arbitrary cost allocation which can be used to construct an p n 3 combinatorial algorithm to compute the nucleolus of an extended tree game finally we show that the complements of the facet defining coalitions for the core are all connected in an auxiliary tree graph with node setn

linear production games with fuzzy control the aim of this paper is to analyse linear production with committee control situations arising when controllers face the possibility of graduating their options in order to model these situations we consider several kinds of fuzzy controls which can be modelled as different simple fuzzy games an lp game which is an extension of lp games with committee control introduced in curiel et al on balanced games and games with committee control or spectrum 11 1989 83 88 is obtained and its core is studied

convergent ritz approximations of the set of stabilizing controllers abstract a necessary and sufficient condition for linear exponential sums to be dense in l p is derived under this condition a ritz approximation converges which has been proposed to solve linear control problems state space representations of orthonormal basis functions for multivariable systems are given

cost allocation in the chinese postman problem this paper considers a cost allocation problem that arises from a delivery problem associated with the chinese postman problem cpp a delivery problem is described by a connected undirected graph in which each edge belongs to a different player a cost function on the edges of this graph and a fixed vertex which is referred to as the post office assume that the post office is providing some service to the players the nature of this service which can be thought of as mail delivery requires that a server will travel along the edges of the graph and returns to the post office the cost allocation problem is concerned with the cost of providing the service to all players a specific cost allocation rule is introduced and characterized further the class of delivery problems gives rise to a new class of cooperative combinatorial optimization games called delivery games it is shown that the outcome of the allocation rule with respect to a bridge connected euler graph is a core element of the corresponding delivery game

the extended luenberger observer for nonlinear systems abstract for nonlinear single input single output systems dot x f x u y h x u the relationships for a state transformation into the nonlinear observer canonical form are developed it is possible to dimension a nonlinear observer by an eigenvalue assignment without solving the nonlinear partial differential equations for the transformation if the transformed nonlinearities are linearized about the reconstructed state with reference to the extended kalman filter algorithm this nonlinear observer design is called the extended luenberger observer

boundary operation of 2 d nonseparable linear phase paraunitary filter banks this paper proposes a boundary operation technique of 2 d nonseparable linear phase paraunitary filter banks ns lppufbs for size limitation the proposed technique is based on a lattice structure consisting of the 2 d separable block discrete cosine transform and nonseparable support extension processes the bases are allowed to be anisotropic with the fixed critically subsampling overlapping orthogonal symmetric real valued and compact support properties first the blockwise implementation is developed so that the basis images can be locally controlled the local control of basis images is shown to maintain orthogonality this property leads a basis termination bt technique as a boundary operation the technique overcomes the drawback of ns lppufbs that the popular symmetric extension method is invalid through some experimental results of diagonal texture coding the significance of the bt is verified

subband coding of images subband coding has become quite popular for the source encoding of speech this paper presents a simple yet efficient extension of this concept to the source coding of images we specify the constraints for a set of two dimensional quadrature mirror filters qmf s for a particular frequency domain partition and show that these constraints are satisfied by a separable combination of one dimensional qmf s bits are then optimally allocated among the subbands to minimize the mean squared error for dpcm coding of the subbands also an adaptive technique is developed to allocate the bits within each subband by means of a local variance mask optimum quantization is employed with quantizers matched to the laplacian distribution subband coded images are presented along with their signal to noise ratios snr s the snr performance of the subband coder is compared to that of the adaptive discrete cosine transform dct vector quantization and differential vector quantization for bit rates of 0 67 1 0 and 2 0 bits per pixel for 256 256 monochrome images the adaptive subband coder has the best snr performance

on the core of network synthesis games we use polynomial formulations to show that several rational and discrete network synthesis games including the minimum cost spanning tree game satisfy the assumptions of owen s linear production game model we also discuss computational issues related to finding and recognizing core points for these classes of games

a generalized linear production model a unifying model we introduce a generalized linear production model whose attractive feature being that the resources held by any subset of producerss is not restricted to be the vector sum of the resources held by the members ofs we provide sufficient conditions for the non emptiness of the core of the associated generalized linear production game and show that if the core of the game is not empty then a solution in it can be produced from a dual optimal solution to the associated linear programming problem our generalized linear production model is a proper generalization of the linear production model introduced by owen and it can be used to analyze cooperative games which cannot be studied in the ordinary linear production model framework we use the generalized model to show that the cooperative game induced by a network optimization problem in which players are the nodes of the network has a non empty core we further employ our model to prove the non emptiness of the core of two other classes of cooperative games which were not previously studied in the literature and we also use our generalized model to provide an alternative proof for the non emptiness of the core of the class of minimum cost spanning tree games thus it appears that the generalized linear production model is a unifying model which can be used to explain the non emptiness of the core of cooperative games generated by various seemingly different optimization models

totally balanced games arising from controlled programming problems a cooperative game in characteristic function form is obtained by allowing a number of individuals to esercise partial control over the constraints of a generally nonlinear mathematical programming problem either directly or through committee voting conditions are imposed on the functions defining the programming problem and the control system which suffice to make the game totally balanced this assures a nonempty core and hence a stable allocation of the full value of the programming problem among the controlling palyers in the linear case the core is closely related to the solutions of the dual problem applications are made to a variety of economic models including the transferable utility trading economies of shapley and shubik and a multishipper one commodity transshipment model with convex cost functions and concave revenue functions dropping the assumption of transferable utility leads to a class of controlled multiobjective or pareto programming problems which again yield totally balanced games

canonical form observer design for non linear time variable systems an observer of canonical phase variable form for non linear time variable systems is introduced the development of this non linear time variable form requires regularity of the non linear time variable observability matrix of the system from the relationships derived during the development it follows that a non linear time variable observer can be dimensioned by an eigenvalue assignment with respect to the canonical state coordinates if a linearization of system non linearities about the reconstructed state trajectories is permissible this is an assumption similar to that of the extended kalman filter based on a linearization about the current estimate

on reconstruction methods for processing finite length signals with paraunitary filter banks new expressions are developed for the perfect reconstruction of the boundary regions of a finite length signal after subband processing the time invariant filter bank is required to be uniform and paraunitary using fir filters regardless of phase or symmetry they accommodate a linear boundary extension in the analysis section and avoid periodic extensions or storage of extended subband signals the reconstruction methods are based on the formulation of linear systems that are built as a function of the filters

lower and upper bounds for linear production games abstract we study the problem of allocating the total profit of a production enterprise among the resource owners using the game theoretic framework introduced by owen owen g 1975 on the core of linear production games mathematical programming 9 358 370 we provide lower upper bounds on the values of the game by aggregating over columns rows of the lp problem by choosing aggregation weights corresponding to optimal solutions of the primal dual lp problem we can create new games whose core form a superset subset of the original core an estimate of the resulting error in terms of an core is obtained by solving a mixed integer programming problem and we also suggest an iterative procedure for improving the bounds using a set of numerical examples we investigate how the performance of the aggregation approach depends on the structure of the problem data

algorithmic aspects of the core of combinatorial optimization games we discuss an integer programming formulation for a class of cooperative games we focus on algorithmic aspects of the core one of the most important solution concepts in cooperative game theory central to our study is a simple but very useful observation that the core for this class is nonempty if and only if an associated linear program has an integer optimal solution based on this we study the computational complexity and algorithms to answer important questions about the cores of various games on graphs such as maximum flow connectivity maximum matching minimum vertex cover minimum edge cover maximum independent set and minimum coloring

m channel nonlinear phase filter banks in image compression structure design and signal extension this paper describes a transform coding technique based on m channel perfect reconstruction filter banks with a nonlinear phase in contrast with linear phase filter banks the nonlinearity provides an extra degree of freedom that can be used to design a more efficient transform we present new lattice structures of paraunitary and perfect reconstruction biorthogonal filter banks which can be implemented with a lower computational complexity and or represented by a few free parameters through the decomposition of the lattice blocks and the displacement across the delay block we further discuss a smooth extension method for nonlinear phase filter banks to obtain a nonexpansive transform the promise of our proposed approaches is demonstrated through several design examples extended signals and compression results

a luenberger like observer for nonlinear systems a state observer is proposed for nonlinear continuous time systems which extends the well known luenberger observer in particular on the basis of simple assumptions on the regularity of the system equations observability and the global holder condition for suitable functions which are generally satisfied for physically meaningful dynamic systems the global asymptotic convergence of the estimated state towards the true state is shown finally some examples of applications are also reported showing the effectiveness of the proposed observer

on the core and nucleolus of minimum cost spanning tree games we develop two efficient procedures for generating cost allocation vectors in the core of a minimum cost spanning tree m c s t game the first procedure requires o n 2 elementary operations to obtain each additional point in the core wheren is the number of users the efficiency of the second procedure which is a natural strengthening of the first procedure stems from the special structure of minimum excess coalitions in the core of an m c s t game this special structure is later used i to ease the computational difficulty in computing the nucleolus of an m c s t game and ii to provide a geometric characterization for the nucleolus of an m c s t game this geometric characterization implies that in an m c s t game the nucleolus is the unique point in the intersection of the core and the kernel we further develop an efficient procedure for generating fair cost allocations which in some instances coincide with the nucleolus finally we show that by employing sterns transfer scheme we can generate a sequence of cost vectors which converges to the nucleolus

on some network flow games we analyze three subclasses of cooperative games arising from network optimization problems in which the resources such as arcs or nodes in the network are controlled by individuals who have conflicting objectives the first subclass of cooperative games is induced by network optimization problems over directed augmented trees we show that for this subclass of games the kernel coincides with the nucleolus and that the nucleolus can be characterized as the unique revenue allocation vector in which every pair of arc owners who are adjacent in the tree are located symmetrically with respect to their bargaining range we further give a linear characterization of the core of this subclass of games which is then used to provide a more explicit representation of the nucleolus and to construct a strongly polynomial algorithm for generating it the second subclass of cooperative games is induced by maximum flow problems in simple undirected networks we provide a useful parametric representation of the core of this subclass of games which is used to characterize the nucleolus and the intersection of the core and the kernel explicitly we show that the intersection of the core and the kernel consists of all revenue allocations in the core which assign equal payoffs to any pair of unseparated arc owners we further demonstrate that among the core vectors the nucleolus is the unique revenue allocation vector in which the smallest allocations are maximized in a lexicographical sense the third cooperative game that we study is the assignment game introduced by shapley and shubik 1972 this game is induced by the assignment problem which can be cast as a network optimization problem we investigate the relationship between the kernel and the core of the assignment game and provide a necessary and sufficient condition for the core to be contained in the kernel we further show that in general the intersection of the kernel and the core is not a convex set we also exhibit that under certain conditions the nucleolus has a simple characterization as the unique vector in the core in which the smallest revenue allocations are maximized in a lexicographical sense finally we consider the horse market example of bohm bawerk 1923 for which it is shown that the core is contained in the kernel and that the nucleolus is the midpoint of the core

symmetric extension methods for m channel linear phase perfect reconstruction filter banks the symmetric extension method has been shown to he an efficient way for subband processing of finite length sequences this paper presents an extension of this method to general linear phase perfect reconstruction filter banks we derive constraints on the length and symmetry polarity of the permissible filter banks and propose a new design algorithm in the algorithm different symmetric sequences are formulated in a unified form based on the circular symmetry framework the length constraints in symmetrically extending the input sequence and windowing the subband sequences are investigated the effect of shifting the input sequence is included when the algorithm is applied to equal length filter banks we explicitly show that symmetric extension methods can always be constructed to replace the circular convolution approach

gibbs phenomenon removal and digital filtering directly through the fast fourier transform the gibbs phenomenon in the fourier transform is due to a periodicity discrepancy between the waveform and its sinusoidal representations in the time domain data flipping baseline tilting or digital comparison completes the periodicity of the waveform and thus removes the gibbs phenomenon this facilitates digital filtering directly through the fast fourier transform such a filtering is unique and exact with its stop band totally zeroed out and passband fully passed it accomplishes lowpass bandpass highpass bandstop notch or single frequency pass simply by manipulating the band limits

dynamic linear programming games with risk averse players motivated by situations in which independent agents wish to cooperate in some uncertain endeavor over time we study dynamic linear programming games which generalize classical linear production games to multi period settings under uncertainty we specifically consider that players may have risk averse attitudes towards uncertainty and model this risk aversion using coherent conditional risk measures for this setting we study the strong sequential core a natural extension of the core to dynamic settings we characterize the strong sequential core as the set of allocations that satisfy a particular finite set of inequalities that depend on an auxiliary optimization model and then leverage this characterization to establish sufficient conditions for emptiness and non emptiness qualitatively whereas the strong sequential core is always non empty when players are risk neutral our results indicate that cooperation in the presence of risk aversion is much more difficult we illustrate this with an application to cooperative newsvendor games where we find that cooperation is possible when it least benefits players and may be impossible when it offers more benefit

nonlinear observers for autonomous lipschitz continuous systems this paper considers the state observation problem for autonomous nonlinear systems an observation mapping is introduced which is defined by applying a linear integral operator rather than a differential operator to the output of the system it is shown that this observation mapping is well suited to capture the observability nature of smooth as well as nonsmooth systems and to construct observers of a remarkably simple structure a linear state variable filter followed by a nonlinearity the observer is established by showing that observability and finite complexity of the system are sufficient conditions for the observer to exist and by giving an explicit expression for its nonlinearity it is demonstrated that the existence conditions are satisfied and hence our results include a new observer which is not high gain for the wide class of smooth systems it is shown that the observer can as well be designed to realize an arbitrary finite accuracy rather than ultimate exactness on a compact region of the state space this requires only observability of the system a corresponding numerical design procedure is described which is easy to implement and computationally feasible for low order systems

application of the convergence of the control net of box splines to scale space filtering in this correspondence we propose a new approach to scale space filtering using a box spline representation of multidimensional signals the use of box splines is motivated by their ability to handle complex geometries better than tensor product b splines the box spline we use is defined by a set of vectors invariant under the multiplication by a sampling matrix we show that such a box spline satisfies a dilation equation which is the basis for the scale space filtering we propose several numerical applications in 2d conclude the correspondence

size limited filter banks for subband image compression a size limited filter bank slfb is a maximally decimated filter bank operating on a finite length duration input signal resulting in subband components whose total number of independent samples is equal to the number of input samples a theoretical framework for the design analysis and implementation of such filter banks resulting from applying fir separable filter banks to finite length signals is presented the concept of maximizing theoretical coding gain tcg using optimal bit allocation is generalized for this special case using tcg the relative merits of various different slfbs are addressed

downsampling versus folding in the dct domain signals can be split into subbands using ideal bandpass filters in the discrete cosine transform dct domain we show that decimation by band folding is not equivalent to downsampling but results in two convolution operations that involve both the odd and even samples of the signal