A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇...A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇ s code. Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours. The surface is composed of the pieces reconstructed from the correspondence points. Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.展开更多
Software projects are becoming larger and more complicated. Managing those projects is based on several software development methodologies. One of those methodologies is software version control, which is used in the ...Software projects are becoming larger and more complicated. Managing those projects is based on several software development methodologies. One of those methodologies is software version control, which is used in the majority of worldwide software projects. Although existing version control systems provide sufficient functionality in many situations, they are lacking in terms of semantics and structure for source code. It is commonly believed that improving software version control can contribute substantially to the development of software. We present a solution that considers a structural model for matching source code that can be used in version control.展开更多
A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently und...A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.展开更多
In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper inyestigates ...In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper inyestigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.展开更多
Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detaile...Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detailed textural information, which is desirable in multi-spectral image matching. Experiments on two multi-spectral data sets demonstrate that the proposed descriptor can yield significantly better results than some state-of- the-art descriptors.展开更多
A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algo...A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.展开更多
Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λ...Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.展开更多
Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new...Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.展开更多
A novel Code-Matched interleaver is proposed which decreases the number of the low weight codewords to improve the performance of the Turbo code. The modified design can adapt more kinds of Turbo codes determined by t...A novel Code-Matched interleaver is proposed which decreases the number of the low weight codewords to improve the performance of the Turbo code. The modified design can adapt more kinds of Turbo codes determined by the generator matrix, while it doesn＇t decrease the bit error rate performance of Turbo codes at moderate to high signal to noise ratio. At the same time, in Rayleigh fading channel, the new Code-Matched interleaver can also debase the error floor.展开更多
This paper proposes a new block matching criterion called the bit-correlation matching function for image sequence coding. When using the identical fast searching algorithm, the bit-correlation matching function not o...This paper proposes a new block matching criterion called the bit-correlation matching function for image sequence coding. When using the identical fast searching algorithm, the bit-correlation matching function not only results in nearly the same accuracy in displacement estimation as the mean square error function, but also makes the algorithm low in computation complexity and easy to parallel implementation, thus reducing the coding time of image sequence efficiently.展开更多
A screen content coding （SCC） algorithm that uses a primary reference buffer （PRB） and a secondary reference buffer （SRB） for string matching and string copying is proposed. PRB is typically the traditional reco...A screen content coding （SCC） algorithm that uses a primary reference buffer （PRB） and a secondary reference buffer （SRB） for string matching and string copying is proposed. PRB is typically the traditional reconstructed picture buffer which provides reference string pixels for the current pixels being coded. SRB stores a few of recently and frequently referenced pixels for repetitive reference by the current pixels being coded. In the encoder, searching of optimal reference string is performed in both PRB and SRB, and either a PRB or SRB string is selected as an optimal reference string on a string-by-string basis. Compared with HM-16.4＋SCM-40 reference software, the proposed SCC algorithm can improve coding performance measured by bit-distortion rate reduction of average 4.19% in all-intra configuration for text and graphics with motion category＇ of test sequences defined by JCT-VC common test condition.展开更多
This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the tradit...This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the traditional prediction model was proposed 26 years ago. It is straight forward but not accurate enough. The proposed back propagation neural network has 5 inputs, 5 neutrons and 1 output. Because of its simplicity, it requires very little calculation power which is negligible compared with existing computation complexity. The test results show 10% - 30% higher prediction accuracy and PSNR improvement up to 0.3 dB. The above advantages make it a feasible replacement of the current model.展开更多
在一些修船企业建立的修船结算系统和电子价格库中,人工匹配结算编码步骤易出错且耗时长,直接影响结算效率。为解决该问题,提出一种基于多特征融合的修船结算编码智能匹配复合模型。采用来自变换器的双向编码器表示(Bidirectional Encod...在一些修船企业建立的修船结算系统和电子价格库中,人工匹配结算编码步骤易出错且耗时长,直接影响结算效率。为解决该问题,提出一种基于多特征融合的修船结算编码智能匹配复合模型。采用来自变换器的双向编码器表示(Bidirectional Encoder Representations from Transformers,BERT)模型将工程内容文本表示为词向量,采用卷积神经网络(Convolutional Neural Network,CNN)模型提取文本的局部特征,采用双向长短期记忆网络结合注意力机制(Bidirectional Long Short-Term Memory with Attention Mechanism,BiLSTM-Attention)模型提取上下文特征,得到对应的结算编码。试验结果表明,所提出的复合模型在整体准确率方面实现显著提升,充分证明该复合模型在处理复杂文本分类任务中的优势。展开更多
The Company Law(2023 Revision)must match with the Civil Code.On the one hand,because the Company Law is systematically subordinate to the Civil Code,its internal value and external normative system should highly coord...The Company Law(2023 Revision)must match with the Civil Code.On the one hand,because the Company Law is systematically subordinate to the Civil Code,its internal value and external normative system should highly coordinate with the Civil Code.In addition,the"General Part"Book of the Civil Code provides nearly 3o direct general provisions on legal persons and for-profit legal persons.As a result,the Company Law is subject to a kind of clear and direct limitation within this scope.Accordingly,it may incorporate much more detailed provisions but shall contain no conflicting provisions.On the other hand,the Civil Code has adopted a special open system model,with special space and flexibility for other laws to match with it.Besides,since the Company Law and other specific laws were enacted relatively early and have evolved independently for a long time,they have a space of autonomy to some extent in practice.From the perspective of legislative matching relationship,the Company Law should be revised based on five circumstances by adopting different matching strategies according to different matching requirements.展开更多
To obtain the form error of micro-structured surfaces robustly and accurately, a form er- ror evaluation method was developed based on the real coded genetic algorithm （RCGA）. The meth- od employed the average squar...To obtain the form error of micro-structured surfaces robustly and accurately, a form er- ror evaluation method was developed based on the real coded genetic algorithm （RCGA）. The meth- od employed the average squared distance as the matching criterion. The point to surface distance was achieved by use of iterative method and the modeling of RCGA for the surface matching was also presented in detail. Parameter selection for RCGA including the crossover rate and population size was discussed. Evaluation results of series simulated surfaces without form error show that this method can achieve the accuracy of root mean square deviation （ Sq ） less than 1 nm and surface pro- file error （ St ） less than 4 nm. Evaluation of the surfaces with different simulated errors illustrates that the proposed method can also robustly obtain the form error with nano-meter precision. The e- valuation of actual measured surfaces further indicates that the proposed method is capable of pre- cisely evaluating micro-structured surfaces.展开更多
A mean-match correlation vector quantizer (MMCVQ) was presented for fast image encoding. In this algorithm, a sorted codebook is generated regarding the mean values of all codewords. During the encoding stage, high co...A mean-match correlation vector quantizer (MMCVQ) was presented for fast image encoding. In this algorithm, a sorted codebook is generated regarding the mean values of all codewords. During the encoding stage, high correlation of the adjacent image blocks is utilized, and a searching range is obtained in the sorted codebook according to the mean value of the current processing vector. In order to gain good performance, proper THd and NS are predefined on the basis of experimental experiences and additional distortion limitation. The expermental results show that the MMCVQ algorithm is much faster than the full-search VQ algorithm, and the encoding quality degradation of the proposed algorithm is only 0.3～0.4 dB compared to the full-search VQ.展开更多
文摘A new method for solving the tiling problem of surface reconstruction is proposed. The proposed method uses a snake algorithm to segment the original images, the contours are then transformed into strings by Freeman＇ s code. Symbolic string matching technique is applied to establish a correspondence between the two consecutive contours. The surface is composed of the pieces reconstructed from the correspondence points. Experimental results show that the proposed method exhibits a good behavior for the quality of surface reconstruction and its time complexity is proportional to mn where m and n are the numbers of vertices of the two consecutive slices, respectively.
文摘Software projects are becoming larger and more complicated. Managing those projects is based on several software development methodologies. One of those methodologies is software version control, which is used in the majority of worldwide software projects. Although existing version control systems provide sufficient functionality in many situations, they are lacking in terms of semantics and structure for source code. It is commonly believed that improving software version control can contribute substantially to the development of software. We present a solution that considers a structural model for matching source code that can be used in version control.
基金This project is supported by National Natural Science Foundation of China(No.50475176) and Municipal Natural Science Foundation of Beijing(No.KZ200511232019).
文摘A coding-based method to solve the image matching problems in stereovision measurement is presented. The solution is to add and append an identity ID to the retro-reflect point, so it can be identified efficiently under the complicated circumstances and has the characteristics of rotation, zooming, and deformation independence. Its design architecture and implementation process in details based on the theory of stereovision measurement are described. The method is effective on reducing processing data time, improving accuracy of image matching and automation of measuring system through experiments.
基金Supported by the Key Laboratory of Precise Engineer & Industry Surveying, State Bureau of Surveying and Mapping(No.PF2009-12)the Key Laboratory of Mapping from Space of State Bureau of Surveying and Mapping(No. 200810)
文摘In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper inyestigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.
文摘Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detailed textural information, which is desirable in multi-spectral image matching. Experiments on two multi-spectral data sets demonstrate that the proposed descriptor can yield significantly better results than some state-of- the-art descriptors.
文摘A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.
基金Supported by the National Natural Science Foundation of China(61071221,10831002)
文摘Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.
基金Project(60202005) supported by the National Natural Science Foundation of China
文摘Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.
文摘A novel Code-Matched interleaver is proposed which decreases the number of the low weight codewords to improve the performance of the Turbo code. The modified design can adapt more kinds of Turbo codes determined by the generator matrix, while it doesn＇t decrease the bit error rate performance of Turbo codes at moderate to high signal to noise ratio. At the same time, in Rayleigh fading channel, the new Code-Matched interleaver can also debase the error floor.
基金Supported by the National Natural Science Foundation of ChinaNational Key Lab. on Integrated Serrices Network
文摘This paper proposes a new block matching criterion called the bit-correlation matching function for image sequence coding. When using the identical fast searching algorithm, the bit-correlation matching function not only results in nearly the same accuracy in displacement estimation as the mean square error function, but also makes the algorithm low in computation complexity and easy to parallel implementation, thus reducing the coding time of image sequence efficiently.
基金supported in part by National Natural Science Foundation of China under Grant No.61201226 and 61271096Natural Science Foundation of Shanghai under Grant No.12ZR1433800Specialized Research Fund for the Doctoral Program under Grant No.20130072110054
文摘A screen content coding （SCC） algorithm that uses a primary reference buffer （PRB） and a secondary reference buffer （SRB） for string matching and string copying is proposed. PRB is typically the traditional reconstructed picture buffer which provides reference string pixels for the current pixels being coded. SRB stores a few of recently and frequently referenced pixels for repetitive reference by the current pixels being coded. In the encoder, searching of optimal reference string is performed in both PRB and SRB, and either a PRB or SRB string is selected as an optimal reference string on a string-by-string basis. Compared with HM-16.4＋SCM-40 reference software, the proposed SCC algorithm can improve coding performance measured by bit-distortion rate reduction of average 4.19% in all-intra configuration for text and graphics with motion category＇ of test sequences defined by JCT-VC common test condition.
文摘This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the traditional prediction model was proposed 26 years ago. It is straight forward but not accurate enough. The proposed back propagation neural network has 5 inputs, 5 neutrons and 1 output. Because of its simplicity, it requires very little calculation power which is negligible compared with existing computation complexity. The test results show 10% - 30% higher prediction accuracy and PSNR improvement up to 0.3 dB. The above advantages make it a feasible replacement of the current model.
文摘在一些修船企业建立的修船结算系统和电子价格库中,人工匹配结算编码步骤易出错且耗时长,直接影响结算效率。为解决该问题,提出一种基于多特征融合的修船结算编码智能匹配复合模型。采用来自变换器的双向编码器表示(Bidirectional Encoder Representations from Transformers,BERT)模型将工程内容文本表示为词向量,采用卷积神经网络(Convolutional Neural Network,CNN)模型提取文本的局部特征,采用双向长短期记忆网络结合注意力机制(Bidirectional Long Short-Term Memory with Attention Mechanism,BiLSTM-Attention)模型提取上下文特征,得到对应的结算编码。试验结果表明,所提出的复合模型在整体准确率方面实现显著提升,充分证明该复合模型在处理复杂文本分类任务中的优势。
文摘The Company Law(2023 Revision)must match with the Civil Code.On the one hand,because the Company Law is systematically subordinate to the Civil Code,its internal value and external normative system should highly coordinate with the Civil Code.In addition,the"General Part"Book of the Civil Code provides nearly 3o direct general provisions on legal persons and for-profit legal persons.As a result,the Company Law is subject to a kind of clear and direct limitation within this scope.Accordingly,it may incorporate much more detailed provisions but shall contain no conflicting provisions.On the other hand,the Civil Code has adopted a special open system model,with special space and flexibility for other laws to match with it.Besides,since the Company Law and other specific laws were enacted relatively early and have evolved independently for a long time,they have a space of autonomy to some extent in practice.From the perspective of legislative matching relationship,the Company Law should be revised based on five circumstances by adopting different matching strategies according to different matching requirements.
基金Supported by the Programme of Introducing Talents of Discipline to Universities (B07018)
文摘To obtain the form error of micro-structured surfaces robustly and accurately, a form er- ror evaluation method was developed based on the real coded genetic algorithm （RCGA）. The meth- od employed the average squared distance as the matching criterion. The point to surface distance was achieved by use of iterative method and the modeling of RCGA for the surface matching was also presented in detail. Parameter selection for RCGA including the crossover rate and population size was discussed. Evaluation results of series simulated surfaces without form error show that this method can achieve the accuracy of root mean square deviation （ Sq ） less than 1 nm and surface pro- file error （ St ） less than 4 nm. Evaluation of the surfaces with different simulated errors illustrates that the proposed method can also robustly obtain the form error with nano-meter precision. The e- valuation of actual measured surfaces further indicates that the proposed method is capable of pre- cisely evaluating micro-structured surfaces.
文摘A mean-match correlation vector quantizer (MMCVQ) was presented for fast image encoding. In this algorithm, a sorted codebook is generated regarding the mean values of all codewords. During the encoding stage, high correlation of the adjacent image blocks is utilized, and a searching range is obtained in the sorted codebook according to the mean value of the current processing vector. In order to gain good performance, proper THd and NS are predefined on the basis of experimental experiences and additional distortion limitation. The expermental results show that the MMCVQ algorithm is much faster than the full-search VQ algorithm, and the encoding quality degradation of the proposed algorithm is only 0.3～0.4 dB compared to the full-search VQ.
