In this paper, the authors propose a new approach to image compression based on the principle of Set Partitioning in Hierarchical Tree algorithm （SPIHT）. Our approach, the modified SPIHT （MSPIHT）, distributes entr...In this paper, the authors propose a new approach to image compression based on the principle of Set Partitioning in Hierarchical Tree algorithm （SPIHT）. Our approach, the modified SPIHT （MSPIHT）, distributes entropy differently than SPIHT and also optimizes the coding. This approach can produce results that are a significant improvement on the Peak Signal-to-Noise Ratio （PSNR） and compression ratio obtained by SPIHT algorithm, without affecting the computing time. These results are also comparable with those obtained using the Embedded Zerotree Wavelet （EZW） and Joint Photographic Experts Group 2000 （JPG2） algorithms.展开更多
Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel...Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel and unified technique is proposed in this paper for computing single and iterated set operations efficiently, robustly and exactly. An adaptive octree is combined with a nested constructive solid geometry （CSG） tree by this technique. The intersection handling is restricted to the cells in the octree where intersection actually occurs. Within those cells, a CSG tree template is instanced by the surfaces and the tree is converted to planebased binary space partitioning （BSP） for set evaluation; Moreover, the surface classification is restricted to the ceils in the octree where the surfaces only come from a model and are within the bounding-boxes of other polyhedrons. These two ways bring about the efficiency and scalability of the operations, in terms of runtime and memory. As all surfaces in such a cell have the same classification relation, they are classified as a whole. Robustness and exactness are achieved by integrating plane-based geometry representation with adaptive geometry predicate technique in intersection handling, and by applying divide-and-conquer arithmetic on surface classification. Experimental results demonstrate that the proposed approach can guarantee the robustness of Boolean computations and runs faster than other existing approaches.展开更多
In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tr...In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.展开更多
Unmanned aerial vehicle(UAV)-based imaging systems have many superiorities compared with other platforms,such as high flexibility and low cost in collecting images,providing wide application prospects.However,the acqu...Unmanned aerial vehicle(UAV)-based imaging systems have many superiorities compared with other platforms,such as high flexibility and low cost in collecting images,providing wide application prospects.However,the acquisition of the UAV-based image commonly results in very high resolution and very large-scale images,which poses great challenges for subsequent applications.Therefore,an efficient representation of large-scale UAV images is necessary for the extraction of the required information in a reasonable time.In this work,we proposed a multi-scale hierarchical representation,i.e.binary partition tree,for analyzing large-scale UAV images.More precisely,we first obtained an initial partition of images by an oversegmentation algorithm,i.e.the simple linear iterative clustering.Next,we merged the similar superpixels to build an object-based hierarchical structure by fully considering the spectral and spatial information of the superpixels and their topological relationships.Moreover,objects of interest and optimal segmentation were obtained using object-based analysis methods with the hierarchical structure.Experimental results on processing the post-seismic UAV images of the 2013 Ya’an earthquake and the mosaic of images in the South-west of Munich demonstrate the effectiveness and efficiency of our proposed method.展开更多
To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as cons...To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.展开更多
We calculated a self-thinning exponent of 1.05 for tree mass using the 3/2 power equation in 93 Cunninghamia lanceolata plots.According to Weller’s allometric model,the self-thinning exponent for tree mass was calcul...We calculated a self-thinning exponent of 1.05 for tree mass using the 3/2 power equation in 93 Cunninghamia lanceolata plots.According to Weller’s allometric model,the self-thinning exponent for tree mass was calculated as 1.28 from the allometric exponents h and d.The both self-thinning exponents were significantly lower than 3/2.The self-thinning exponent of organs was estimated to be 1.42 for stems,0.93 for branches,0.96 for leaves,1.35 for roots and 1.28 for shoots,respectively.The self-thinning exponent of stem mass was not significantly different from 3/2,whereas thinning exponents of trees,branches,leaves and roots were significantly lower than 3/2.The stand leaf mass and stand branch mass were constant regardless of the stand density.The scaling relations among branch,leaf,stem,root and shoot mass（MB,ML,MS,MR and MA,respectively） showed that MB and ML scaled as the3/4 power of MS,whereas MS or MA scaled isometrically with respect to MR.展开更多
Small storage space for photographs in formal documents is increasingly necessary in today＇s needs for huge amounts of data communication and storage. Traditional compression algorithms do not sufficiently utilize th...Small storage space for photographs in formal documents is increasingly necessary in today＇s needs for huge amounts of data communication and storage. Traditional compression algorithms do not sufficiently utilize the distinctness of formal photographs. That is, the object is an image of the human head, and the background is in unicolor. Therefore, the compression is of low efficiency and the image after compression is still space-consuming. This paper presents an image compression algorithm based on object segmentation for practical high-efficiency applications. To achieve high coding efficiency, shape-adaptive discrete wavelet transforms are used to transformation arbitrarily shaped objects. The areas of the human head and its background are compressed separately to reduce the coding redundancy of the background. Two methods, lossless image contour coding based on differential chain, and modified set partitioning in hierarchical trees （SPIHT） algorithm of arbitrary shape, are discussed in detail. The results of experiments show that when bit per pixel （bpp）is equal to 0.078, peak signal-to-noise ratio （PSNR） of reconstructed photograph will exceed the standard of SPIHT by nearly 4dB.展开更多
Synthetic aperture radar （SAR） images are corrupted by multiplicative speckle noise which limits the performance of the classical coder/decoder algorithm in spatial domain. The relatively new transform of multiwavel...Synthetic aperture radar （SAR） images are corrupted by multiplicative speckle noise which limits the performance of the classical coder/decoder algorithm in spatial domain. The relatively new transform of multiwavelets can possess desirable features simultaneously, such as orthogonality and symmetry, while scalar wavelets cannot. In this paper we propose a compression scheme combining with speckle noise reduction within the multiwavelet framework. Compared with classical set partitioning in hierarchical trees （SPIHT） algorithm, our method achieves favorable peak signal to noise ratio （PSNR） and superior speckle noise reduction performances.展开更多
The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space wit...The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space without degrading image quality. Compression is required whenever the data handled is huge they may be required to sent or transmitted and also stored. The New Edge Directed Interpolation (NEDI)-based lifting Discrete Wavelet Transfrom (DWT) scheme with modified Set Partitioning In Hierarchical Trees (MSPIHT) algorithm is proposed in this paper. The NEDI algorithm gives good visual quality image particularly at edges. The main objective of this paper is to be preserving the edges while performing image compression which is a challenging task. The NEDI with lifting DWT has achieved 99.18% energy level in the low frequency ranges which has 1.07% higher than 5/3 Wavelet decomposition and 0.94% higher than traditional DWT. To implement this NEDI with Lifting DWT along with MSPIHT algorithm which gives higher Peak Signal to Noise Ratio (PSNR) value and minimum Mean Square Error (MSE) and hence better image quality. The experimental results proved that the proposed method gives better PSNR value (39.40 dB for rate 0.9 bpp without arithmetic coding) and minimum MSE value is 7.4.展开更多
As one of the next generation imaging spectrometers, the interferential spectrometer （iS） possesses the advantages of high throughput, multi-channel and great resolution. The data of IS are produced in the spatial d...As one of the next generation imaging spectrometers, the interferential spectrometer （iS） possesses the advantages of high throughput, multi-channel and great resolution. The data of IS are produced in the spatial domain, but optical applications are in the Fourier domain. Traditional compression methods can only protect the visual quality of interferometer data in the spatial do- main but ignore the distortion in the Fourier domain. The relation between the distortion in the Fourier domain and the compression in the spatial domain is analyzed. By mathematical proof and val- idation with experiments, the relation between spatial and Fourier domains is discovered, and the significance in the Fourier domain is more important as optical path difference （OPD） increasing in the spatial domain. Based on this relation, a novel coding scheme is proposed, which can compress data in the spatial domain while reducing the distortion in the Fourier domain. In this scheme, the bit stream of the set partitioning in hierarchical trees （SPIHT） is truncated by adaptively lifting rate-distortion slopes according to the priorities of OPD based on rate-distortion optimization theory. Experimental results show that the proposed method can provide better protection of spectrum curves in the Fourier domain while maintaining a comparable visual quality in the spatial domain.展开更多
In view of the shortcomes of conventional ElectroCardioGram (ECG) compression algo- rithms,such as high complexity of operation and distortion of reconstructed signal,a new ECG compression encoding algorithm based on ...In view of the shortcomes of conventional ElectroCardioGram (ECG) compression algo- rithms,such as high complexity of operation and distortion of reconstructed signal,a new ECG compression encoding algorithm based on Set Partitioning In Hierarchical Trees (SPIHT) is brought out after studying the integer lifting scheme wavelet transform in detail.The proposed algorithm modifies zero-tree structure of SPIHT,establishes single dimensional wavelet coefficient tree of ECG signals and enhances the efficiency of SPIHT-encoding by distributing bits rationally,improving zero-tree set and ameliorating classifying method.For this improved algorithm,floating-point com- putation and storage are left out of consideration and it is easy to be implemented by hardware and software.Experimental results prove that the new algorithm has admirable features of low complexity, high speed and good performance in signal reconstruction.High compression ratio is obtained with high signal fidelity as well.展开更多
The constrained Viterbi algorithm （C-VA） makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm （VA）. However it can only be used in the concatenate code sch...The constrained Viterbi algorithm （C-VA） makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm （VA）. However it can only be used in the concatenate code scheme because the detection result of cyclic redundancy check code （CRC） is exploited to provide reliable information. In this paper, a different way is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were added to the set partitioning in hierarchical trees （SPIHT） coded image sequence periodically and directly. They were thought to be reliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much better error resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired quality of reconstructed images can be sacrificed.展开更多
文摘In this paper, the authors propose a new approach to image compression based on the principle of Set Partitioning in Hierarchical Tree algorithm （SPIHT）. Our approach, the modified SPIHT （MSPIHT）, distributes entropy differently than SPIHT and also optimizes the coding. This approach can produce results that are a significant improvement on the Peak Signal-to-Noise Ratio （PSNR） and compression ratio obtained by SPIHT algorithm, without affecting the computing time. These results are also comparable with those obtained using the Embedded Zerotree Wavelet （EZW） and Joint Photographic Experts Group 2000 （JPG2） algorithms.
基金supported by the Natural Science Foundation of China under Grant No.61202154 and No.61133009the National Basic Research Project of China under Grant No.2011CB302203+2 种基金Shanghai Pujiang Program under Grant No.13PJ1404500the Science and Technology Commission of Shanghai Municipality Program under Grant No.13511505000the Open Project Program of the State Key Lab of CAD&CG of Zhejiang University under Grant No.A1401
文摘Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel and unified technique is proposed in this paper for computing single and iterated set operations efficiently, robustly and exactly. An adaptive octree is combined with a nested constructive solid geometry （CSG） tree by this technique. The intersection handling is restricted to the cells in the octree where intersection actually occurs. Within those cells, a CSG tree template is instanced by the surfaces and the tree is converted to planebased binary space partitioning （BSP） for set evaluation; Moreover, the surface classification is restricted to the ceils in the octree where the surfaces only come from a model and are within the bounding-boxes of other polyhedrons. These two ways bring about the efficiency and scalability of the operations, in terms of runtime and memory. As all surfaces in such a cell have the same classification relation, they are classified as a whole. Robustness and exactness are achieved by integrating plane-based geometry representation with adaptive geometry predicate technique in intersection handling, and by applying divide-and-conquer arithmetic on surface classification. Experimental results demonstrate that the proposed approach can guarantee the robustness of Boolean computations and runs faster than other existing approaches.
文摘In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.
基金This work was supported in part by the National Key Basic Research and Development Program of China[grant number 2013CB733404]the National Natural Science Foundation of China[grant number 61271401],[grant number 91338113].
文摘Unmanned aerial vehicle(UAV)-based imaging systems have many superiorities compared with other platforms,such as high flexibility and low cost in collecting images,providing wide application prospects.However,the acquisition of the UAV-based image commonly results in very high resolution and very large-scale images,which poses great challenges for subsequent applications.Therefore,an efficient representation of large-scale UAV images is necessary for the extraction of the required information in a reasonable time.In this work,we proposed a multi-scale hierarchical representation,i.e.binary partition tree,for analyzing large-scale UAV images.More precisely,we first obtained an initial partition of images by an oversegmentation algorithm,i.e.the simple linear iterative clustering.Next,we merged the similar superpixels to build an object-based hierarchical structure by fully considering the spectral and spatial information of the superpixels and their topological relationships.Moreover,objects of interest and optimal segmentation were obtained using object-based analysis methods with the hierarchical structure.Experimental results on processing the post-seismic UAV images of the 2013 Ya’an earthquake and the mosaic of images in the South-west of Munich demonstrate the effectiveness and efficiency of our proposed method.
文摘To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.
基金supported by Foundation of Guangdong Forestry Bureau (Nos.4400-F11031,4400-F11055)
文摘We calculated a self-thinning exponent of 1.05 for tree mass using the 3/2 power equation in 93 Cunninghamia lanceolata plots.According to Weller’s allometric model,the self-thinning exponent for tree mass was calculated as 1.28 from the allometric exponents h and d.The both self-thinning exponents were significantly lower than 3/2.The self-thinning exponent of organs was estimated to be 1.42 for stems,0.93 for branches,0.96 for leaves,1.35 for roots and 1.28 for shoots,respectively.The self-thinning exponent of stem mass was not significantly different from 3/2,whereas thinning exponents of trees,branches,leaves and roots were significantly lower than 3/2.The stand leaf mass and stand branch mass were constant regardless of the stand density.The scaling relations among branch,leaf,stem,root and shoot mass（MB,ML,MS,MR and MA,respectively） showed that MB and ML scaled as the3/4 power of MS,whereas MS or MA scaled isometrically with respect to MR.
基金This work was supported by National Natural Science Foundation of China (No.60372066)
文摘Small storage space for photographs in formal documents is increasingly necessary in today＇s needs for huge amounts of data communication and storage. Traditional compression algorithms do not sufficiently utilize the distinctness of formal photographs. That is, the object is an image of the human head, and the background is in unicolor. Therefore, the compression is of low efficiency and the image after compression is still space-consuming. This paper presents an image compression algorithm based on object segmentation for practical high-efficiency applications. To achieve high coding efficiency, shape-adaptive discrete wavelet transforms are used to transformation arbitrarily shaped objects. The areas of the human head and its background are compressed separately to reduce the coding redundancy of the background. Two methods, lossless image contour coding based on differential chain, and modified set partitioning in hierarchical trees （SPIHT） algorithm of arbitrary shape, are discussed in detail. The results of experiments show that when bit per pixel （bpp）is equal to 0.078, peak signal-to-noise ratio （PSNR） of reconstructed photograph will exceed the standard of SPIHT by nearly 4dB.
基金This work was supported by the National Natural Science Foundation of China under Grant No. 60472048.
文摘Synthetic aperture radar （SAR） images are corrupted by multiplicative speckle noise which limits the performance of the classical coder/decoder algorithm in spatial domain. The relatively new transform of multiwavelets can possess desirable features simultaneously, such as orthogonality and symmetry, while scalar wavelets cannot. In this paper we propose a compression scheme combining with speckle noise reduction within the multiwavelet framework. Compared with classical set partitioning in hierarchical trees （SPIHT） algorithm, our method achieves favorable peak signal to noise ratio （PSNR） and superior speckle noise reduction performances.
文摘The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space without degrading image quality. Compression is required whenever the data handled is huge they may be required to sent or transmitted and also stored. The New Edge Directed Interpolation (NEDI)-based lifting Discrete Wavelet Transfrom (DWT) scheme with modified Set Partitioning In Hierarchical Trees (MSPIHT) algorithm is proposed in this paper. The NEDI algorithm gives good visual quality image particularly at edges. The main objective of this paper is to be preserving the edges while performing image compression which is a challenging task. The NEDI with lifting DWT has achieved 99.18% energy level in the low frequency ranges which has 1.07% higher than 5/3 Wavelet decomposition and 0.94% higher than traditional DWT. To implement this NEDI with Lifting DWT along with MSPIHT algorithm which gives higher Peak Signal to Noise Ratio (PSNR) value and minimum Mean Square Error (MSE) and hence better image quality. The experimental results proved that the proposed method gives better PSNR value (39.40 dB for rate 0.9 bpp without arithmetic coding) and minimum MSE value is 7.4.
文摘As one of the next generation imaging spectrometers, the interferential spectrometer （iS） possesses the advantages of high throughput, multi-channel and great resolution. The data of IS are produced in the spatial domain, but optical applications are in the Fourier domain. Traditional compression methods can only protect the visual quality of interferometer data in the spatial do- main but ignore the distortion in the Fourier domain. The relation between the distortion in the Fourier domain and the compression in the spatial domain is analyzed. By mathematical proof and val- idation with experiments, the relation between spatial and Fourier domains is discovered, and the significance in the Fourier domain is more important as optical path difference （OPD） increasing in the spatial domain. Based on this relation, a novel coding scheme is proposed, which can compress data in the spatial domain while reducing the distortion in the Fourier domain. In this scheme, the bit stream of the set partitioning in hierarchical trees （SPIHT） is truncated by adaptively lifting rate-distortion slopes according to the priorities of OPD based on rate-distortion optimization theory. Experimental results show that the proposed method can provide better protection of spectrum curves in the Fourier domain while maintaining a comparable visual quality in the spatial domain.
文摘In view of the shortcomes of conventional ElectroCardioGram (ECG) compression algo- rithms,such as high complexity of operation and distortion of reconstructed signal,a new ECG compression encoding algorithm based on Set Partitioning In Hierarchical Trees (SPIHT) is brought out after studying the integer lifting scheme wavelet transform in detail.The proposed algorithm modifies zero-tree structure of SPIHT,establishes single dimensional wavelet coefficient tree of ECG signals and enhances the efficiency of SPIHT-encoding by distributing bits rationally,improving zero-tree set and ameliorating classifying method.For this improved algorithm,floating-point com- putation and storage are left out of consideration and it is easy to be implemented by hardware and software.Experimental results prove that the new algorithm has admirable features of low complexity, high speed and good performance in signal reconstruction.High compression ratio is obtained with high signal fidelity as well.
基金Project supported by the National Natural Science Foundation of China (Grant No.60372070)
文摘The constrained Viterbi algorithm （C-VA） makes use of some prior reliable information to reduce complexity and improve performance of Viterbi algorithm （VA）. However it can only be used in the concatenate code scheme because the detection result of cyclic redundancy check code （CRC） is exploited to provide reliable information. In this paper, a different way is proposed to provide reliable information for C-VA, which is possible to be used in simple codec. Known bits were added to the set partitioning in hierarchical trees （SPIHT） coded image sequence periodically and directly. They were thought to be reliable information for C-VA in the decoder. Experimental results show that the proposed scheme can obtain much better error resilient ability compared with conventional VA under the extremely inferior channel condition if the best desired quality of reconstructed images can be sacrificed.
