As an elegant generalization of wavelet transform, wavelet packet （WP） provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition ...As an elegant generalization of wavelet transform, wavelet packet （WP） provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quanUzation scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.展开更多
Based on the conception of P(ρ,σ)-set(XP ˉFρ, XPFσ), this paper studied the relation between outer P(ρ,σ)-set and outer P-set: give outer P(ρ,σ)-set and outer P-set relation theorem, outer P(ρ,σ)-set and nu...Based on the conception of P(ρ,σ)-set(XP ˉFρ, XPFσ), this paper studied the relation between outer P(ρ,σ)-set and outer P-set: give outer P(ρ,σ)-set and outer P-set relation theorem, outer P(ρ,σ)-set and numerical value σ relation theorem, outer P(ρ,σ)-set's range;studied other characteristics of outer P(ρ,σ)-set: give the finiteness theorem of outer P(ρ,σ)-set, the set chain theorem of outer P(ρ,σ)-set, the outer P(ρ,σ)-set probability interval finite partition theorem, and its corollary; also give generation, reduction, identification theorem of outer P(ρ,σ)-set, filter generation theorem of outer P(ρ,σ)-set; finally give its application.展开更多
Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened ...Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.展开更多
This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic al...This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.展开更多
基金the Major State Basic Research Development Program(973 Program)(Grant No.2004CB318005)
文摘As an elegant generalization of wavelet transform, wavelet packet （WP） provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quanUzation scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.
基金Foundation item： Supported by the Basic and Frontier Technology Research Projects of Henan Province （132300410289） Supported by the Natural Science Foundation of Fujian Province（2012D112）
文摘Based on the conception of P(ρ,σ)-set(XP ˉFρ, XPFσ), this paper studied the relation between outer P(ρ,σ)-set and outer P-set: give outer P(ρ,σ)-set and outer P-set relation theorem, outer P(ρ,σ)-set and numerical value σ relation theorem, outer P(ρ,σ)-set's range;studied other characteristics of outer P(ρ,σ)-set: give the finiteness theorem of outer P(ρ,σ)-set, the set chain theorem of outer P(ρ,σ)-set, the outer P(ρ,σ)-set probability interval finite partition theorem, and its corollary; also give generation, reduction, identification theorem of outer P(ρ,σ)-set, filter generation theorem of outer P(ρ,σ)-set; finally give its application.
文摘Let Π = B1/B2/… /Bk be any set partition of[n]= {1,2,...,n} satisfying that entries are increasing in each block and blocks are arranged in increasing order of their first entries.Then Callan defined the flattened Π to be the permutation of[n]obtained by erasing the divers between its blocks,and Callan also enumerated the number of set partitions of[n]whose flattening avoids a single3-letter pattern.Mansour posed the question of counting set partitions of[n]whose flattening avoids a pattern of length 4.In this paper,we present the number of set partitions of[n]whose flattening avoids one of the patterns：1234,1243,1324,1342,1423,1432,3142 and 4132.
文摘This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
