Experiments on the entire image-stitching algorithm (II): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.

<p>Experiments on the entire image-stitching algorithm (II): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.</p

The second experiment on the corner matching efficiency: (a) Selected corners (using our algorithm) from two original images; (b) Corner matching by traditional RANSAC algorithm (NCC rough match); (c) Initial set of matching-corner pairs in our algorithm; (d) Final set of matching-corner pairs in our algorithm.

<p>The second experiment on the corner matching efficiency: (a) Selected corners (using our algorithm) from two original images; (b) Corner matching by traditional RANSAC algorithm (NCC rough match); (c) Initial set of matching-corner pairs in our algorithm; (d) Final set of matching-corner pairs in our algorithm.</p

Experiments on the entire image-stitching algorithm (IV): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.

<p>Experiments on the entire image-stitching algorithm (IV): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.</p

Experiments on the entire image-stitching algorithm (V): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.

<p>Experiments on the entire image-stitching algorithm (V): (a) Video image 1; (b) Video image 2 (reference image); (c) Video image 3; (d) Generated video panoramic image.</p

The Sigmoid function, where it is clearly demonstrated that the critical value range of is [−5, 5].

<p>The Sigmoid function, where it is clearly demonstrated that the critical value range of is [−5, 5].</p

Efficiency comparison between traditional RANSAC and our algorithm (I).

<p>Efficiency comparison between traditional RANSAC and our algorithm (I).</p

Qualitative and quantitative amalysis on three different algorithms (II).

<p>Qualitative and quantitative amalysis on three different algorithms (II).</p

Two initially matching-corner pairs, and , along with their respective midpoints: between and and between and .

<p>Two initially matching-corner pairs, and , along with their respective midpoints: between and and between and .</p

The first experiment on the corner matching efficiency: (a) Selected corners (using our algorithm) from two original images; (b) Corner matching by traditional RANSAC algorithm (NCC rough match); (c) Initial set of matching-corner pairs in our algorithm; (d) Final set of matching-corner pairs in our algorithm.

<p>The first experiment on the corner matching efficiency: (a) Selected corners (using our algorithm) from two original images; (b) Corner matching by traditional RANSAC algorithm (NCC rough match); (c) Initial set of matching-corner pairs in our algorithm; (d) Final set of matching-corner pairs in our algorithm.</p

Experiments on corner selection: (a) Original image; (b) Harris detector; (c) The regional corner-selection algorithm; (d) Our algorithm with ; (e) Our algorithm with ; (f) Our algorithm with .

<p>Experiments on corner selection: (a) Original image; (b) Harris detector; (c) The regional corner-selection algorithm; (d) Our algorithm with ; (e) Our algorithm with ; (f) Our algorithm with .</p