With Newton＇s interpolating formula, we construct a kind of block based Newton-like blending osculatory interpolation.The interpolation provides us many flexible interpolation schemes for choices which include the ex...With Newton＇s interpolating formula, we construct a kind of block based Newton-like blending osculatory interpolation.The interpolation provides us many flexible interpolation schemes for choices which include the expansive Newton＇s polynomial inter- polation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of the interpolation.展开更多
We construct general structures of one and two variable interpolation function, without depending on the existence of divided difference or inverse differences, and we also discuss the block based osculatory interpola...We construct general structures of one and two variable interpolation function, without depending on the existence of divided difference or inverse differences, and we also discuss the block based osculatory interpolation in one variable case. Clearly, our method offers marly flexible interpolation schemes for choices. Error terms for the interpolation are determined and numerical examples are given to show the effectlveness of the results.展开更多
Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the e...Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG- 4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.展开更多
Newton＇s polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate res...Newton＇s polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets （blocks）, then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton＇s method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton＇s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method.展开更多
Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborh...Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.展开更多
1 Scope This standard specifies the definition, classification, technical requirements, test methods, inspection rules, packing, marking, transportation and quality certificate of corundum block containing plastic ph...1 Scope This standard specifies the definition, classification, technical requirements, test methods, inspection rules, packing, marking, transportation and quality certificate of corundum block containing plastic phase.展开更多
In the literature, many works on determining inspection interval by the delay time concept generally assumed that the time of inspection span and the time of failure renewal are negligible. However, in realistic cases...In the literature, many works on determining inspection interval by the delay time concept generally assumed that the time of inspection span and the time of failure renewal are negligible. However, in realistic cases, the above time should not be neglected for both the time itself and its effect. In order to model the effect of the possible overlapping of inspection span with failure downtime on determining the optimal inspection interval, we propose a block-based inspection model for a single component-based on delay time concept. We further compare this model with the age-based model to show the practical sense. The developed models are also demonstrated by numerical examples.展开更多
Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensa...Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensation still present some non-vertical/non-horizontal orientations, and the conventional discrete cosine transform （DCT） may generate many high-frequency coefficients. To solve this problem, in this paper we propose a video coding approach by using GBP and reordering DCT （RDCT） techniques. In the proposed approach, GBP is first applied to partition the macroblocks. Then, before performing DCT, a reordering operation is used to adjust the pixel positions of the residual macroblocks based on the partition information. In this way, the partition information of GBP can be used to represent the reordering information of RDCT, and the bitrate can be reduced. Experimental results show that, compared to H.264/AVC, the proposed method achieves on average 6.38% and 5.69% bitrate reductions at low and high bitrates, respectively.展开更多
基金Supported by the Key Project Foundation of the Department of Education of Anhui Province(No.KJ2008A027)the Project Foundation of the Department of Education of Anhui Province(No.KJ2010B182)
文摘With Newton＇s interpolating formula, we construct a kind of block based Newton-like blending osculatory interpolation.The interpolation provides us many flexible interpolation schemes for choices which include the expansive Newton＇s polynomial inter- polation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of the interpolation.
基金The Grant (11RC05) of Scienti/fic Research Foundation for Talents of Hefei Universitythe Grant (11KY06ZR) of Scientific Research Foundation Hefei University+1 种基金the Key Project Foundation (KJ2008A027) of the Department of Education of Anhui Provincethe Project Foundation (KJ2010B182,KJ2011B152, KJ2011B137) of the Department of Education of Anhui Province
文摘We construct general structures of one and two variable interpolation function, without depending on the existence of divided difference or inverse differences, and we also discuss the block based osculatory interpolation in one variable case. Clearly, our method offers marly flexible interpolation schemes for choices. Error terms for the interpolation are determined and numerical examples are given to show the effectlveness of the results.
文摘Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG- 4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.
基金Project supported by the National Natural Science Foundation of China under Grant No.10171026 and No.60473114, and the Anhui Provincial Natural Science Foundation, China under Grant No.03046102.
文摘Newton＇s polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets （blocks）, then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton＇s method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton＇s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method.
文摘Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.
文摘1 Scope This standard specifies the definition, classification, technical requirements, test methods, inspection rules, packing, marking, transportation and quality certificate of corundum block containing plastic phase.
文摘In the literature, many works on determining inspection interval by the delay time concept generally assumed that the time of inspection span and the time of failure renewal are negligible. However, in realistic cases, the above time should not be neglected for both the time itself and its effect. In order to model the effect of the possible overlapping of inspection span with failure downtime on determining the optimal inspection interval, we propose a block-based inspection model for a single component-based on delay time concept. We further compare this model with the age-based model to show the practical sense. The developed models are also demonstrated by numerical examples.
基金Project supported by the National Natural Science Foundation of China （No. 61102135）, the Fundamental Research Funds for the Central Universities, China （No. 2010121063）, and the Science and Technique Commission Foundation of Fujian Province, China （No. 2011 H6028）
文摘Geometry based block partitioning （GBP） has been shown to achieve better performance than the tree structure based block partitioning （TSBP） of H.264. However, the residual blocks of GBP mode after motion compensation still present some non-vertical/non-horizontal orientations, and the conventional discrete cosine transform （DCT） may generate many high-frequency coefficients. To solve this problem, in this paper we propose a video coding approach by using GBP and reordering DCT （RDCT） techniques. In the proposed approach, GBP is first applied to partition the macroblocks. Then, before performing DCT, a reordering operation is used to adjust the pixel positions of the residual macroblocks based on the partition information. In this way, the partition information of GBP can be used to represent the reordering information of RDCT, and the bitrate can be reduced. Experimental results show that, compared to H.264/AVC, the proposed method achieves on average 6.38% and 5.69% bitrate reductions at low and high bitrates, respectively.
