Technique s for constructing full view panoramic mosaics from sequences of images are pres ented. The goal of this work is to remove too many limitations for pure panning motion. The best reference block is important...Technique s for constructing full view panoramic mosaics from sequences of images are pres ented. The goal of this work is to remove too many limitations for pure panning motion. The best reference block is important for the block-matching method for improving the robustness and performance. It is automatically selected in the h igh-frequency image, which always contains the plenty visible features. In orde r to reduce accumulated registration errors, the global registration using the p hase-correlation matching method with rotation adjustment is applied to the who le sequence of images, which results in an optimal image mosaic with resolving t ranslational or rotational motion. The local registration using the Levenberg-M arquardt iterative non-linear minimization algorithm is applied to compensating for small amounts of motion parallax introduced by translations of the camera a nd other unmodeled distortions, then minimizing the discrepancy after applying t he global registration. The accumulated misregistration errors may cause a visib le gap between the two images. A smoothing filter is introduced for removing the visible artifact.展开更多
With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
Let G be a simple graph with no isolated vertices. A set S of vertices of G is a total dominating set if every vertex of G is adjacent to some vertex in S . The total domination number of G , den...Let G be a simple graph with no isolated vertices. A set S of vertices of G is a total dominating set if every vertex of G is adjacent to some vertex in S . The total domination number of G , denoted by γ t (G) , is the minimum cardinality of a total dominating set of G . It is shown that if G is a graph of order n with minimum degree at least 3, then γ t (G)≤n/2 . Thus a conjecture of Favaron, Henning, Mynhart and Puech is settled in the affirmative.展开更多
The total chromatic number xT（G） of a graph G is the minimum number of colors needed to color the elements（vertices and edges） of G such that no adjacent or incident pair of elements receive the same color, G is c...The total chromatic number xT（G） of a graph G is the minimum number of colors needed to color the elements（vertices and edges） of G such that no adjacent or incident pair of elements receive the same color, G is called Type 1 if xT（G） =△（G）＋1. In this paper we prove that the join of a complete bipartite graph Km,n and a cycle Cn is of Type 1.展开更多
The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an inter...The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.展开更多
文摘Technique s for constructing full view panoramic mosaics from sequences of images are pres ented. The goal of this work is to remove too many limitations for pure panning motion. The best reference block is important for the block-matching method for improving the robustness and performance. It is automatically selected in the h igh-frequency image, which always contains the plenty visible features. In orde r to reduce accumulated registration errors, the global registration using the p hase-correlation matching method with rotation adjustment is applied to the who le sequence of images, which results in an optimal image mosaic with resolving t ranslational or rotational motion. The local registration using the Levenberg-M arquardt iterative non-linear minimization algorithm is applied to compensating for small amounts of motion parallax introduced by translations of the camera a nd other unmodeled distortions, then minimizing the discrepancy after applying t he global registration. The accumulated misregistration errors may cause a visib le gap between the two images. A smoothing filter is introduced for removing the visible artifact.
文摘With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
文摘Let G be a simple graph with no isolated vertices. A set S of vertices of G is a total dominating set if every vertex of G is adjacent to some vertex in S . The total domination number of G , denoted by γ t (G) , is the minimum cardinality of a total dominating set of G . It is shown that if G is a graph of order n with minimum degree at least 3, then γ t (G)≤n/2 . Thus a conjecture of Favaron, Henning, Mynhart and Puech is settled in the affirmative.
文摘The total chromatic number xT（G） of a graph G is the minimum number of colors needed to color the elements（vertices and edges） of G such that no adjacent or incident pair of elements receive the same color, G is called Type 1 if xT（G） =△（G）＋1. In this paper we prove that the join of a complete bipartite graph Km,n and a cycle Cn is of Type 1.
基金Supported by the Natural Science Foundation of Henan Province（082300460190） Sponsored by Program for Science and Technology Innovation Talents in Universities of Henan Province.
文摘The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.
