Volume 12,Issue 11,2001 Table of Contents
2001, 12(11):1581-1585.
Abstract:
Buttyan et al. proposed a simple logic and used it to revise Woo Lam protocol; without proving, they claimed that revised protocol is resistant against the interaction attacks between a protocol and itself. In this paper, in order to show that their results are incorrect, two different attacks on revised protocol are found out and set out in detail for their implementations. The fashions to construct the two attacks are essentially analogous to the ones described by Debbabi etc. except more complicated than them,The further analysis show that the logic of Buttyan etc.has no enough capacity to sufficiently capture protocol flaws,which stem from interaction of protocol itself.This logic needs to be improved.
Buttyan et al. proposed a simple logic and used it to revise Woo Lam protocol; without proving, they claimed that revised protocol is resistant against the interaction attacks between a protocol and itself. In this paper, in order to show that their results are incorrect, two different attacks on revised protocol are found out and set out in detail for their implementations. The fashions to construct the two attacks are essentially analogous to the ones described by Debbabi etc. except more complicated than them,The further analysis show that the logic of Buttyan etc.has no enough capacity to sufficiently capture protocol flaws,which stem from interaction of protocol itself.This logic needs to be improved.
2001, 12(11):1586-1594.
Abstract:
To use a stochastic optimization algorithm to search an optimum placement, the representation of the configuration of a placement is the most important and fundamental issue. A new Constraint Graph based representation SL was devised in the paper to represent the non slicing structure of placement. A nearly O(n) placement algorithm can be designed over the SL representation. With the assumption of the meta grid, we can derive a new concise representation for non slicing structures from SL representation.With assumption of the meta-grid,we can derive a new concise representation for non-slicing structures from SL.We name the new representation as Stairway Grid(SG)model.It needs n(2「lg n」)bits fora placement of nrectangular blocks.The solution space of SGrepresentation,it takes onlyO(n)time to transform it to its corresponding placement.It had been proved that all slicing structures could be represented by SG.And SGmodel also can represent non-slicing structure.Experimental results on SG model demonstrated that it is a concise and effective representation of non-slicing structure.
To use a stochastic optimization algorithm to search an optimum placement, the representation of the configuration of a placement is the most important and fundamental issue. A new Constraint Graph based representation SL was devised in the paper to represent the non slicing structure of placement. A nearly O(n) placement algorithm can be designed over the SL representation. With the assumption of the meta grid, we can derive a new concise representation for non slicing structures from SL representation.With assumption of the meta-grid,we can derive a new concise representation for non-slicing structures from SL.We name the new representation as Stairway Grid(SG)model.It needs n(2「lg n」)bits fora placement of nrectangular blocks.The solution space of SGrepresentation,it takes onlyO(n)time to transform it to its corresponding placement.It had been proved that all slicing structures could be represented by SG.And SGmodel also can represent non-slicing structure.Experimental results on SG model demonstrated that it is a concise and effective representation of non-slicing structure.
2001, 12(11):1595-1600.
Abstract:
A source image is regarded as a polygon, and the extended line of the morphologic conditional skeleton must cross the vertex of a polygon. The convex corners can be obtained through detecting the zero radius of the maximum plate on morphologic skeleton. All the results of corner detection are given by logical hetero or operation between two corner sets of source image and its supplemental image. In addition to the pseudo lattice, corners which are generated by discrete sampling can also be eliminated.This method has very high value in exactly locating the corner,can reduce the computational cost,only requires simple hardware equipment,and is convenient for parallel processing.Because of using large plate to detect corner,this method is good for noise filtering and can be popularized to gray images by using two kinds of large plate.
A source image is regarded as a polygon, and the extended line of the morphologic conditional skeleton must cross the vertex of a polygon. The convex corners can be obtained through detecting the zero radius of the maximum plate on morphologic skeleton. All the results of corner detection are given by logical hetero or operation between two corner sets of source image and its supplemental image. In addition to the pseudo lattice, corners which are generated by discrete sampling can also be eliminated.This method has very high value in exactly locating the corner,can reduce the computational cost,only requires simple hardware equipment,and is convenient for parallel processing.Because of using large plate to detect corner,this method is good for noise filtering and can be popularized to gray images by using two kinds of large plate.
2001, 12(11):1601-1607.
Abstract:
This paper defines the meaning of fairness more suitable for AF PHB in DS network. Besides, this paper argues that responsive and un responsive flows should be treated differently only to their out of profile traffic. In addition, traffic responsiveness should be identified by its behavior rather than simply by protocol. Moreover, two markers, srTCM and trTCM, with eight mapping schemes are examined by simulations to check whether they can provide fairness in DS networks. This paper also defines fairness area as the network load range where the DS network can provide fairness to responsive and un-responsive aggregate by marking without discriminating,and parameters configuration of the area is also given.
This paper defines the meaning of fairness more suitable for AF PHB in DS network. Besides, this paper argues that responsive and un responsive flows should be treated differently only to their out of profile traffic. In addition, traffic responsiveness should be identified by its behavior rather than simply by protocol. Moreover, two markers, srTCM and trTCM, with eight mapping schemes are examined by simulations to check whether they can provide fairness in DS networks. This paper also defines fairness area as the network load range where the DS network can provide fairness to responsive and un-responsive aggregate by marking without discriminating,and parameters configuration of the area is also given.
2001, 12(11):1608-1613.
Abstract:
The automatic recognition of Chinese place names, a special case of the recognition of Chinese special nouns, is an important task in Chinese information processing. The method based on statistical technique can only ensure the recall to some degree, but the precision is relatively low. In this paper, an approach based on transformation is proposed, which can effectively overcome the deficiency caused by statistics. The performance of the approach is evaluated on a real data set, and the precision finally recahes 90.9%,improved by7%.
The automatic recognition of Chinese place names, a special case of the recognition of Chinese special nouns, is an important task in Chinese information processing. The method based on statistical technique can only ensure the recall to some degree, but the precision is relatively low. In this paper, an approach based on transformation is proposed, which can effectively overcome the deficiency caused by statistics. The performance of the approach is evaluated on a real data set, and the precision finally recahes 90.9%,improved by7%.
2001, 12(11):1614-1622.
Abstract:
The current Internet architecture lacks flexibility. The new network services are always postponed by tedious standardization process. The active network makes change through adding computing to network node. In this paper, the background and the motivation of designing active network are described, the new architecture is presented in detail, its effect on network architecture is discussed, and the current researches about active network are summarized. Finally, combining with the conclusion of network dynamics, a novel application based on active network is put forward.
The current Internet architecture lacks flexibility. The new network services are always postponed by tedious standardization process. The active network makes change through adding computing to network node. In this paper, the background and the motivation of designing active network are described, the new architecture is presented in detail, its effect on network architecture is discussed, and the current researches about active network are summarized. Finally, combining with the conclusion of network dynamics, a novel application based on active network is put forward.
2001, 12(11):1623-1629.
Abstract:
In this paper, an improved method is proposed based on the Fuzzy C-means method to deal with medical images. This method includes three steps. The first step is the fuzzy pixels process in which a redundant image is built by FEV (fuzzy expectation value). The second step is the procession of FCM (fuzzy C-means clustering) with original images and their redundant images. The last step is the display of 3D model. This algorithm improves the accuracy of clustering as the redundant image increases the feature of pixels. Several results of medical images are exhibited including CT, spiral CT and MRI, which are processed with the 3D MIPA system developed by the authors. Because better segmentation results have been obtained, the system can represent the anatomy structure of bones and the bones in the joint based on recognition and 3D reconstruction.
In this paper, an improved method is proposed based on the Fuzzy C-means method to deal with medical images. This method includes three steps. The first step is the fuzzy pixels process in which a redundant image is built by FEV (fuzzy expectation value). The second step is the procession of FCM (fuzzy C-means clustering) with original images and their redundant images. The last step is the display of 3D model. This algorithm improves the accuracy of clustering as the redundant image increases the feature of pixels. Several results of medical images are exhibited including CT, spiral CT and MRI, which are processed with the 3D MIPA system developed by the authors. Because better segmentation results have been obtained, the system can represent the anatomy structure of bones and the bones in the joint based on recognition and 3D reconstruction.
2001, 12(11):1630-1638.
Abstract:
Most existing fast out-of-core simplification methods are based only on uniform or approximated uniform sampling and thus hard to perform adaptive sampling according to the detail distribution of the models. The loss of visual fidelity may be large when processing models with non-uniform distribution of detail. In this paper, an efficient high quality out-of-core simplification method is presented. It can deal with models that are too large to be loaded into main memory. This method greatly improves the simplification result of the models whose detail is non-uniform distributed. In this paper, an initial simplified model is first generated by uniform sampling. A statistical analysis of the original model is also performed at the same time, based on which detail shifting and locally refined sampling to the model can be performed. The algorithm greatly improves the quality of the result model while the processing time is still linear to the model size and the memory cost is also small.
Most existing fast out-of-core simplification methods are based only on uniform or approximated uniform sampling and thus hard to perform adaptive sampling according to the detail distribution of the models. The loss of visual fidelity may be large when processing models with non-uniform distribution of detail. In this paper, an efficient high quality out-of-core simplification method is presented. It can deal with models that are too large to be loaded into main memory. This method greatly improves the simplification result of the models whose detail is non-uniform distributed. In this paper, an initial simplified model is first generated by uniform sampling. A statistical analysis of the original model is also performed at the same time, based on which detail shifting and locally refined sampling to the model can be performed. The algorithm greatly improves the quality of the result model while the processing time is still linear to the model size and the memory cost is also small.
2001, 12(11):1639-1646.
Abstract:
Extracting schema from massive information is very difficult for the research on massive information integration in network environment. A new method is presented in this paper, which is about extracting and incremental maintenance of local accurate schema. In this process, the algorithm control the scale of extracted schema within the 'schema diameter' by examining the path distance of the target set and using the Hash class and its path distance operation. This method is very efficient for restrain schema from expanding.
Extracting schema from massive information is very difficult for the research on massive information integration in network environment. A new method is presented in this paper, which is about extracting and incremental maintenance of local accurate schema. In this process, the algorithm control the scale of extracted schema within the 'schema diameter' by examining the path distance of the target set and using the Hash class and its path distance operation. This method is very efficient for restrain schema from expanding.
2001, 12(11):1647-1653.
Abstract:
An efficient IBR (image-based rendering) method is presented in this paper to take full advantage of the graphics card, which can successfully simulate the 3D bump details on surfaces of object. In this new approach, an original texture with a displacement at each pixel is firstly decomposed into a series of new textures with each one having a same displacement value, called layered textures, or LT. Then, these LTs are used to render the novel view by conventional texture mapping. To avoid gaps in the rendered image, some pixels are to be interpolated and extended in the LTs according to the depth difference between neighbor pixels in the original texture. As these LTs ask for much storage and need a lot of time to be installed into the texture, a method is given to compress these LTs and the corresponding rendering method. Experimental results show the new method is efficient, especially in rendering those objects with a smaller depth range compared with their size, such as relief surfaces buildings.
An efficient IBR (image-based rendering) method is presented in this paper to take full advantage of the graphics card, which can successfully simulate the 3D bump details on surfaces of object. In this new approach, an original texture with a displacement at each pixel is firstly decomposed into a series of new textures with each one having a same displacement value, called layered textures, or LT. Then, these LTs are used to render the novel view by conventional texture mapping. To avoid gaps in the rendered image, some pixels are to be interpolated and extended in the LTs according to the depth difference between neighbor pixels in the original texture. As these LTs ask for much storage and need a lot of time to be installed into the texture, a method is given to compress these LTs and the corresponding rendering method. Experimental results show the new method is efficient, especially in rendering those objects with a smaller depth range compared with their size, such as relief surfaces buildings.
2001, 12(11):1654-1659.
Abstract:
As NOW (networks of workstations) is increasingly used to run scientific applications, how to provide high performance I/O for I/O-intensive applications has become one of the crucial components in NOW environments. In the paper, the design and implementation of Collective I/O system on NOW is presented. The system combines the advantages of both DDIO (disk-directed I/O) and two-phase I/O and a series of optimizations such as data sieving are employed. The initial performance evaluations have shown good I/O performance.
As NOW (networks of workstations) is increasingly used to run scientific applications, how to provide high performance I/O for I/O-intensive applications has become one of the crucial components in NOW environments. In the paper, the design and implementation of Collective I/O system on NOW is presented. The system combines the advantages of both DDIO (disk-directed I/O) and two-phase I/O and a series of optimizations such as data sieving are employed. The initial performance evaluations have shown good I/O performance.
2001, 12(11):1660-1666.
Abstract:
Straight lines are very important intermediate level symbol in image analysis. There are many approaches to extracting straight lines, but they all have their particular drawbacks to limit their use. A robust approach to extracting straight lines is proposed in this paper. A series of methods are devised to overcome all kinds of noise in real images. It firstly thins edge points, and then tracksthem to form line support regions by using the Kalman filter, finally line support region is approximated to a line by using a robust method. The experimental results show that this line finder has a perfect performance and is suitable to a wide range of real images.
Straight lines are very important intermediate level symbol in image analysis. There are many approaches to extracting straight lines, but they all have their particular drawbacks to limit their use. A robust approach to extracting straight lines is proposed in this paper. A series of methods are devised to overcome all kinds of noise in real images. It firstly thins edge points, and then tracksthem to form line support regions by using the Kalman filter, finally line support region is approximated to a line by using a robust method. The experimental results show that this line finder has a perfect performance and is suitable to a wide range of real images.
2001, 12(11):1667-1674.
Abstract:
By taking advantages of the features of epipolar lines and depth discontinuities in reference images, an efficient inverse warping algorithm for generating images of novel views is presented by combining multiple reference images taken from different viewpoints. The method proceeds in three steps. Firstly, the reference images are preprocessed for extracting edge pixels by their displacements. Secondly, a reference image is selected as the primary reference image to be warped inversely epipolar line by epipolar line to render the novel view. Because there exists correspondence between epipolar lines on different images and continuous segments formed by paris of edge pixels on epipolar lines are order-kept, the warping process is very fast by computing only pairs of edge pixels in the reference image to obtain generalized disparity of all pixels in the desired image. Finally, holes in the desired image are filled up through searching the corresponding pixels in other reference images. At this stage, some acceleration techniques are given by utilizing the edge information and occlusion relations between objects in reference images.
By taking advantages of the features of epipolar lines and depth discontinuities in reference images, an efficient inverse warping algorithm for generating images of novel views is presented by combining multiple reference images taken from different viewpoints. The method proceeds in three steps. Firstly, the reference images are preprocessed for extracting edge pixels by their displacements. Secondly, a reference image is selected as the primary reference image to be warped inversely epipolar line by epipolar line to render the novel view. Because there exists correspondence between epipolar lines on different images and continuous segments formed by paris of edge pixels on epipolar lines are order-kept, the warping process is very fast by computing only pairs of edge pixels in the reference image to obtain generalized disparity of all pixels in the desired image. Finally, holes in the desired image are filled up through searching the corresponding pixels in other reference images. At this stage, some acceleration techniques are given by utilizing the edge information and occlusion relations between objects in reference images.
2001, 12(11):1675-1679.
Abstract:
In this paper, an uncertain reasoning approach is put forward based on the cognitive structure: a quadruple cognitive structure is adopted to represent the uncertain knowledge, and a two way cognitive inferential structure is used to handle the uncertainty of the inferential rules. The approach presnted in this paper can satisfy the exact probability reasoning; contain the uncertainty of the information, effectively avoid the unknown for the relationship among the rules, and the computing complexity of its briefest inference is linear to the number of inferential nodes.
In this paper, an uncertain reasoning approach is put forward based on the cognitive structure: a quadruple cognitive structure is adopted to represent the uncertain knowledge, and a two way cognitive inferential structure is used to handle the uncertainty of the inferential rules. The approach presnted in this paper can satisfy the exact probability reasoning; contain the uncertainty of the information, effectively avoid the unknown for the relationship among the rules, and the computing complexity of its briefest inference is linear to the number of inferential nodes.
2001, 12(11):1680-1686.
Abstract:
Polyhedral meshes (especially triangle meshes), which are characterized by large amount of triangles, are often used for many applications such as reverse engineering, computer visualization, etc. In order to improve the efficiency of subsequent processing, a simplification process is required to reduce the number of vertices of the mesh under error controlling. An algorithm for mesh simplification with bounded error was present in this paper. And the algorithm has high efficiency and good simplifying results.
Polyhedral meshes (especially triangle meshes), which are characterized by large amount of triangles, are often used for many applications such as reverse engineering, computer visualization, etc. In order to improve the efficiency of subsequent processing, a simplification process is required to reduce the number of vertices of the mesh under error controlling. An algorithm for mesh simplification with bounded error was present in this paper. And the algorithm has high efficiency and good simplifying results.
2001, 12(11):1687-1692.
Abstract:
Many researchers have compared the fault-detecting ability of random testing and partition testing with test cases replacement. Great achievements have been gained. Comparing random testing with partition testing without test cases replacement has not been found in existing documents. However, in practice, especially at the early stage of testing and during module testing, test cases are not replaced. Therefore, it is necessary to compare random with partition testing under this case. In this paper it is done and four findings are proposed. One difference from the results done by Chen and Yu is that when the domain is divided into such subdomains with the same size, the same failures and same test numbers, partition testing performed worst than random testing. How to form a subdomain with heavy failures by use of all kinds of information and then gives it a large number of tests is essential for partition testing.
Many researchers have compared the fault-detecting ability of random testing and partition testing with test cases replacement. Great achievements have been gained. Comparing random testing with partition testing without test cases replacement has not been found in existing documents. However, in practice, especially at the early stage of testing and during module testing, test cases are not replaced. Therefore, it is necessary to compare random with partition testing under this case. In this paper it is done and four findings are proposed. One difference from the results done by Chen and Yu is that when the domain is divided into such subdomains with the same size, the same failures and same test numbers, partition testing performed worst than random testing. How to form a subdomain with heavy failures by use of all kinds of information and then gives it a large number of tests is essential for partition testing.
2001, 12(11):1693-1398.
Abstract:
Until recently, in the literatures of discussing the fault tolerance problem of neural networks, the tolerance about input noise is mainly concerned. The problem is generally transformed into that of optimization and solved by some well-known optimization approach. But only a few dealt with the tolerance due to the network structural failure, i.e., the structural fault tolerance. In the paper, the structural fault tolerance is analyzed by using the covering algorithms. The necessary and sufficient conditions of allowing of single node failure in a neural network and the algorithm for constructing such a network are given. These results reveal the essence of the structural fault tolerance capacity and show a new way for the analysis of the fault tolerance of neural networks.
Until recently, in the literatures of discussing the fault tolerance problem of neural networks, the tolerance about input noise is mainly concerned. The problem is generally transformed into that of optimization and solved by some well-known optimization approach. But only a few dealt with the tolerance due to the network structural failure, i.e., the structural fault tolerance. In the paper, the structural fault tolerance is analyzed by using the covering algorithms. The necessary and sufficient conditions of allowing of single node failure in a neural network and the algorithm for constructing such a network are given. These results reveal the essence of the structural fault tolerance capacity and show a new way for the analysis of the fault tolerance of neural networks.
2001, 12(11):1699-1703.
Abstract:
It is efficient to accelerate volume rendering by avoiding compositing invisible voxels. As for this, a method is proposed in this paper to select voxels to render by the neighboring relation between voxels and the accumulated opacity at pixels, which can efficiently exclude invisible voxels in the rendering process. This method is suitable for both parallel and perspective projections, and it can treat both regular and irregular volumes.
It is efficient to accelerate volume rendering by avoiding compositing invisible voxels. As for this, a method is proposed in this paper to select voxels to render by the neighboring relation between voxels and the accumulated opacity at pixels, which can efficiently exclude invisible voxels in the rendering process. This method is suitable for both parallel and perspective projections, and it can treat both regular and irregular volumes.
2001, 12(11):1704-1709.
Abstract:
Packet delay greatly influences the overall performance of network application, so it is very important to identify the cause and location of delay. Among the many performance measurement and analysis methods, the multi cast based inference method advanced by R.caceres etc. is better than others. But it still has some shortcomings. In this paper, a progressed method is advanced, it reduces probes and has lower time complexity, so it not only reduces loading brought to network and is more efficient. Experiments results showed that the method in this paper is more efficient to capture the delay distribution.
Packet delay greatly influences the overall performance of network application, so it is very important to identify the cause and location of delay. Among the many performance measurement and analysis methods, the multi cast based inference method advanced by R.caceres etc. is better than others. But it still has some shortcomings. In this paper, a progressed method is advanced, it reduces probes and has lower time complexity, so it not only reduces loading brought to network and is more efficient. Experiments results showed that the method in this paper is more efficient to capture the delay distribution.
2001, 12(11):1710-1715.
Abstract:
Currently, the implementation of WEB caching is mostly based on traditional cache updating algorithms. However, due to the diversity of the WEB traffic pattern, the traditional algorithms for cache updating can not be used in WEB environment effectively. In this paper, an optimized model to the problem is presented. The analytic result shows that the key issue for the cache updating algorithms is how the algorithm suits the WEB traffic pattern properly. Based on the Poisson arrival model, a new cache policy, Least Normalized Cost (LNC), is proposed. In addition to the consideration of the average reference time duration, the recently passed time, the size of the WEB file and the cost per unit of file, the dynamic characteristic of WEB access rate is also taken into account. The trace driven simulation shows that the performance of the algorithm LNC is better than that of the existing algorithms proposed in the literature.
Currently, the implementation of WEB caching is mostly based on traditional cache updating algorithms. However, due to the diversity of the WEB traffic pattern, the traditional algorithms for cache updating can not be used in WEB environment effectively. In this paper, an optimized model to the problem is presented. The analytic result shows that the key issue for the cache updating algorithms is how the algorithm suits the WEB traffic pattern properly. Based on the Poisson arrival model, a new cache policy, Least Normalized Cost (LNC), is proposed. In addition to the consideration of the average reference time duration, the recently passed time, the size of the WEB file and the cost per unit of file, the dynamic characteristic of WEB access rate is also taken into account. The trace driven simulation shows that the performance of the algorithm LNC is better than that of the existing algorithms proposed in the literature.
2001, 12(11):1716-1726.
Abstract:
The schema in object-oriented database (OODB) often experiences considerable changes during the development for typical application areas. After the update, the existing application programs based on the formerly schema have to be modified or rewritten, which makes a great deal of application programs obsolete. This paper addresses the problem by providing equivalent schema evolution (ESE) mechanism based on path independence (PI) program. Path-Independence program is employed as OODB's specification formalism for enhancing the adaptability of database program against the schema evolution. Equivalent schema evolution can make the existing path-independence language reuse without any modification after the schema has been updated. In addition, a solution approach of remaining the equivalent schema evolution mechanism is described in this paper as a effective working system, which as its essential feature the system to support virtual relation mechanism and object-evolving technology.
The schema in object-oriented database (OODB) often experiences considerable changes during the development for typical application areas. After the update, the existing application programs based on the formerly schema have to be modified or rewritten, which makes a great deal of application programs obsolete. This paper addresses the problem by providing equivalent schema evolution (ESE) mechanism based on path independence (PI) program. Path-Independence program is employed as OODB's specification formalism for enhancing the adaptability of database program against the schema evolution. Equivalent schema evolution can make the existing path-independence language reuse without any modification after the schema has been updated. In addition, a solution approach of remaining the equivalent schema evolution mechanism is described in this paper as a effective working system, which as its essential feature the system to support virtual relation mechanism and object-evolving technology.
2001, 12(11):1727-1731.
Abstract:
To reconstruct three-dimensional medical images in Internet based on Web and to achieve highly realistic display, getting two-dimensional image of human organs from ultrafast CT as sources, applying the volume rendering techniques to rebuild and display three-dimensional images in Java Applet and Java Application program. This reconstruction can be run in Web browser on many different kinds of computers.The anatomic structure of human organs can be displayed clearly in reconstructed three-dimensional images, espcially the gross morphology of the heart and the trail of the coronary artery. Three-Dimensional medical image reconstruction in Web browser implemented by Jave Applet is feasible, which will prompt clinical use of three-dimensional images. The solid conformation of human organs, especially the anatomic structure of the coronary artery, can be displayed by using three-dimensional reconstruction techniques, which may offer great references to clinic.
To reconstruct three-dimensional medical images in Internet based on Web and to achieve highly realistic display, getting two-dimensional image of human organs from ultrafast CT as sources, applying the volume rendering techniques to rebuild and display three-dimensional images in Java Applet and Java Application program. This reconstruction can be run in Web browser on many different kinds of computers.The anatomic structure of human organs can be displayed clearly in reconstructed three-dimensional images, espcially the gross morphology of the heart and the trail of the coronary artery. Three-Dimensional medical image reconstruction in Web browser implemented by Jave Applet is feasible, which will prompt clinical use of three-dimensional images. The solid conformation of human organs, especially the anatomic structure of the coronary artery, can be displayed by using three-dimensional reconstruction techniques, which may offer great references to clinic.
2001, 12(11):1732-1738.
Abstract:
An approach to the estimation of the motion and structure parameters of brachium and leg based on monocular image sequence is proposed. By using the motion description under the object-centered coordinate system, a non rigid motion model based on the notion of elasticity is developed. The non-rigid motion model and the rigid one are well unified by incorporating the elasticity parameters into the rigid motion model. Based on this model, the motion and structure parameters are estimated using the method of Levenberg-Marquardt. Results show that the metlod is effective and the motion pattern can be reflected to some extent by the elasticity parameters.
An approach to the estimation of the motion and structure parameters of brachium and leg based on monocular image sequence is proposed. By using the motion description under the object-centered coordinate system, a non rigid motion model based on the notion of elasticity is developed. The non-rigid motion model and the rigid one are well unified by incorporating the elasticity parameters into the rigid motion model. Based on this model, the motion and structure parameters are estimated using the method of Levenberg-Marquardt. Results show that the metlod is effective and the motion pattern can be reflected to some extent by the elasticity parameters.
联系方式
- 《Journal of Software 》
- 主办单位：Institute of Software, CAS, China
- 邮编：100190
- 电话：010-62562563
- 电子邮箱：jos@iscas.ac.cn
- 网址：https://www.jos.org.cn
- 刊号：ISSN 1000-9825
- CN 11-2560/TP
- 国内定价：70元
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.
