提出一种基于形态变换的非刚体运动的广义内插方法。通过对非刚体的凸剖分及凸子集全局优化匹配，与传统的线性内插方法相比，解决了任意非同拓扑结构（包括有孔及凹多边形）的内插问题。理论证明，此种内插方法是一种全局优化的内插方法，并证明了此方法的正确性，讨论了不同凸剖分对内插的影响，把非刚体的运动分解为非刚体的变形与刚体的旋转。实验证明，此内插方法效果自然，质量好，速度快，可用于非刚体运动描述及二维动画关键帧的内插。

A fast corner detection algorithm based on the morphologic skeleton is proposed in this paper. The method differs from traditional chain-code-based corner detection algorithms in that the source image is represented as a polygon, and the corners are obtained through detecting the zero radius of the maximum plate on the morphologic skeleton. The result of the corner detection is achieved by using logical hetero-OR operation between two corner sets of the source image and its complement set. In addition, the pseudo-lattice corners generated by discrete sampling can also be eliminated. Experiments show that this method leads to results of good quality and robustness to noise with a low computational cost.

A new technique is presented for computing continuous shape transformations between polyhedral objects. The polyhedron shape transformations can be divided into polyhedron metamorphosis and bi-directional local rigid body rotation transformation. By decomposing two objects into sets of individual convex sub-objects respectively and establishing the matching between two subsets, the approach can solve the metamorphosis problem of two non-homotopic objects (including concave objects and holey objects). Compare with other methods, this metamorphosis algorithm can be executed automatic for arbitrary polyhedrons and no need user interaction. The user has the ability to choose an automatic matching or to select interactively pairs of corresponding matching of convex subsets to obtain a specially effects. Experiments show that this method can generate natural, high-fidelity, eye-pleasing metamorphosis results with simple computation.

This paper presents a new technique for non-rigid body interpolation based on generalized morphologic morphing. Non-rigid body interpolation can be divided into non-rigid body metamorphosis and local rigid body rotation. By constructing mappings between the two convex subsets, this approach can solve the metamorphosis problem of two non-homotopic objects. Based on the model of normal vector sphere for polyhedrons, a fast morphologic summation algorithm for two convex polyhedrons is also proposed; this method avoids much excrescent computation and is faster than most classical implementation. This paper provides proof of the principle of metamorphosis and discusses the different results of the metamorphosis process of the different objects. It is shown by the experiments that this approach can be applied to automatic font composition and interpolation between two key-frames in 3D computer animation and many other practical applications.

Many practical applications in medical image processing field require robust and valid 3D image segmentation results. In this paper, we present a semi-automatic iterative segmentation approach for 3D medical image by combining a 2D boundary tracking algorithm and a boundary mapping process. Upon each of the consecutive slice, the boundary tracking process is accomplished in an alternate procedure of the morphological dilatation and the multi-label front propagation. The multi-label front propagation method is developed on the foundation of minimal path theory and fast sweeping evolution method to ensure the efficiency, and speed of the boundary tracking algorithm. This 3D image segmentation approach can easily extract the close and smooth boundary of the desired object from a 2D medical image series. This approach is efficient and reliable, and requires very limited user intervention. Some experimental results are also presented to demonstrate the efficacy of this approach.