Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Feature Matching-Based Undersea Panoramic Image Stitching in VR Animation

    The continuous development of virtual reality animation has brought people a new viewing experience. However, there is still a large research space for the construction of virtual scenes. Underwater scenes are complex and diverse, and to obtain more realistic virtual scenes, it is necessary to use video panoramic images as reference modeling in advance. To this end, the study uses the K-means clustering method to extract key frames from underwater video, and adaptively adjusts the number of clusters to improve the extraction algorithm according to the differences in features. To address the problems of low contrast and severe blurring in underwater images, the study uses an improved non-local a priori recovery method to achieve the recovery process of underwater images. Finally, the final underwater panoramic image is obtained by fading-out image fusion and frame to stitching image synthesis strategy. The experimental analysis shows that the runtime of Model 1 is 21.46s, the root mean square error value is 1.89, the structural similarity value is 0.9678, and the average gradient value is 12.59. It can achieve efficient and high-quality panoramic image generation.

  • articleNo Access

    ROBUST MOSAICING USING ZERNIKE MOMENTS

    This paper presents an approach to the registration of individual images to one another to produce a larger composite mosaic. The approach is based on the use of the moments of Zernike orthogonal polynomials to compute the relative scale, rotation and translation between the images. A preliminary stage involves the use of an attention-like operation to estimate potential approximate correspondence points between the images based on extrema of local edge element density. Experimental results illustrate that the technique is effective in a range of environments and over a broad range of image registration parameters. In particular, our method makes few assumptions regarding the image content and yet, unlike several alternative approaches, can perform registration for images with only a limited amount of overlap.

  • chapterNo Access

    ROBUST MOSAICING USING ZERNIKE MOMENTS

    Vision Interface01 Dec 1999

    This paper presents an approach to the registration of individual images to one another to produce a larger composite mosaic. The approach is based on the use of the moments of Zernike orthogonal polynomials to compute the relative scale, rotation and translation between the images. A preliminary stage involves the use of an attention-like operation to estimate potential approximate correspondence points between the images based on extrema of local edge element density. Experimental results illustrate that the technique is effective in a range of environments and over a broad range of image registration parameters. In particular, our method makes few assumptions regarding the image content and yet, unlike several alternative approaches, can perform registration for images with only a limited amount of overlap.