• Title/Summary/Keyword: 파노라마 가상현실

Search Result 42, Processing Time 0.016 seconds

Generation of Spatial Adjacency Map and Contents File Format for Ultra Wide Viewing Service (울트라 와이드 뷰잉 서비스를 위한 공간 유사도 맵 생성 및 울트라 와이드 뷰잉 콘텐츠 저장 방법)

  • Lee, Euisang;Kang, Dongjin;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.22 no.4
    • /
    • pp.473-483
    • /
    • 2017
  • Since the advent of 3D and UHD contents, demand for high-quality panoramic images has been increasing. The UWV(Ultra-Wide Viewing) service uses a wider viewing angle than conventional panoramas to provide a lively experience for users and enhance their understanding of the event. In this paper, we propose a spatial adjacency map generation method and an UWV file storage format technology to provide UWV service. The spatial adjacency map measures the similarity between images and generate the position information of the images based on similarity. And the stitching time of the image can be shortened through the generated position information. Through the spatial adjacency map, we generate the large screen content quickly. The UWV file format which is based on ISOBMFF process spatial adjacency map and videos and support random access. In this paper, we design the UWV player to verify the spatial adjacency map and UWV file format and show the result of experiments.

Parameter Analysis for Time Reduction in Extracting SIFT Keypoints in the Aspect of Image Stitching (영상 스티칭 관점에서 SIFT 특징점 추출시간 감소를 위한 파라미터 분석)

  • Moon, Won-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.23 no.4
    • /
    • pp.559-573
    • /
    • 2018
  • Recently, one of the most actively applied image media in the most fields such as virtual reality (VR) is omni-directional or panorama image. This image is generated by stitching images obtained by various methods. In this process, it takes the most time to extract keypoints necessary for stitching. In this paper, we analyze the parameters involved in the extraction of SIFT keypoints with the aim of reducing the computation time for extracting the most widely used SIFT keypoints. The parameters considered in this paper are the initial standard deviation of the Gaussian kernel used for Gaussian filtering, the number of gaussian difference image sets for extracting local extrema, and the number of octaves. As the SIFT algorithm, the Lowe scheme, the originally proposed one, and the Hess scheme which is a convolution cascade scheme, are considered. First, the effect of each parameter value on the computation time is analyzed, and the effect of each parameter on the stitching performance is analyzed by performing actual stitching experiments. Finally, based on the results of the two analyses, we extract parameter value set that minimize computation time without degrading.