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.展开更多
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.展开更多
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.展开更多
Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain, which is normalized to simp...Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain, which is normalized to simplify the operation of geometric transformation. The geometric transforma-tion formulas of scale, mirror and rotation for trajectory code-chain are defined, and the reverse de-sign for mechanism trajectory is realized through the analysis and solution of similarity matching between the desired trajectory and the predefined trajectory. The algorithm program and prototype system of reverse design for mechanism trajectory are developed. Application samples show that the method can break the restriction of trajectory patterns in matching, meet the demand of partial match-ing, and overcome the influence of geometric transformation of trajectory on the reverse design for mechanism.展开更多
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%.展开更多
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.展开更多
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.展开更多
文摘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.
基金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.
文摘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 Hi-tech Research and Development Program of China (863 Program, No. 2006AA04Z114)Research Fund for the Doctoral Program of Higher Education, China (No. 20040335060)Provincial Scientific Personnel Educational Foundation of Zhejiang, China (No. R603240).
文摘Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain, which is normalized to simplify the operation of geometric transformation. The geometric transforma-tion formulas of scale, mirror and rotation for trajectory code-chain are defined, and the reverse de-sign for mechanism trajectory is realized through the analysis and solution of similarity matching between the desired trajectory and the predefined trajectory. The algorithm program and prototype system of reverse design for mechanism trajectory are developed. Application samples show that the method can break the restriction of trajectory patterns in matching, meet the demand of partial match-ing, and overcome the influence of geometric transformation of trajectory on the reverse design for mechanism.
基金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%.
文摘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.
文摘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.
