The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distributio...The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translation. Dynamic Programming (DP) algorithm is used to measure the distance between the ECPDHs. The effectiveness of the proposed method is demonstrated using some standard tests on MPEG-7 shape database. The results show the precision and recall of our method over other recent methods in the literature.展开更多
The global boundness and existence are presented for the kind of the Rosseland equation with a general growth condition. A linearized map in a closed convex set is defined. The image set is precompact, and thus a fixe...The global boundness and existence are presented for the kind of the Rosseland equation with a general growth condition. A linearized map in a closed convex set is defined. The image set is precompact, and thus a fixed point exists. A multi-scale expansion method is used to obtain the homogenized equation. This equation satisfies a similar growth condition.展开更多
In this paper, the linear stability of symplectic methods for Hamiltonian systems is studied. In par- ticular, three classes of symplectic methods are considered： symplectic Runge-Kutta （SRK） methods, symplectic pa...In this paper, the linear stability of symplectic methods for Hamiltonian systems is studied. In par- ticular, three classes of symplectic methods are considered： symplectic Runge-Kutta （SRK） methods, symplectic partitioned Runge-Kutta （SPRK） methods and the composition methods based on SRK or SPRK methods. It is shown that the SRK methods and their compositions preserve the ellipticity of equilibrium points uncondi- tionally, whereas the SPRK methods and their compositions have some restrictions on the time-step.展开更多
文摘The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translation. Dynamic Programming (DP) algorithm is used to measure the distance between the ECPDHs. The effectiveness of the proposed method is demonstrated using some standard tests on MPEG-7 shape database. The results show the precision and recall of our method over other recent methods in the literature.
基金Supported by the National Basic Research Program of China(973 Program)(No.2012CB025904)the National Natural Science Foundation of China(No.90916027)
文摘The global boundness and existence are presented for the kind of the Rosseland equation with a general growth condition. A linearized map in a closed convex set is defined. The image set is precompact, and thus a fixed point exists. A multi-scale expansion method is used to obtain the homogenized equation. This equation satisfies a similar growth condition.
基金Supported by the National Natural Science Foundation of China (No. 10926064,10571173)the Scientific Research Foundation of Hebei Education Department (No. 2009114)
文摘In this paper, the linear stability of symplectic methods for Hamiltonian systems is studied. In par- ticular, three classes of symplectic methods are considered： symplectic Runge-Kutta （SRK） methods, symplectic partitioned Runge-Kutta （SPRK） methods and the composition methods based on SRK or SPRK methods. It is shown that the SRK methods and their compositions preserve the ellipticity of equilibrium points uncondi- tionally, whereas the SPRK methods and their compositions have some restrictions on the time-step.
