• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.395-398
• /
• 2005

The acquisition of a panoramic image has been popular in recent years due to its large number of applications. In this paper, we deal with generation of a full panoramic mosaic. When it mosaicing consecutive frames, a simple alignment method may lead to local and global alignment errors. These errors can make a full-view panoramic mosaic to be cracked. In order to solve this problem, we propose the bidirectional alignment with multi-anchor (BAMA) algorithm with a basic local alignment formula. Experimental results show that we can create full panoramic mosaics stably through the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.63-72
• /
• 2005

This paper proposes a new method to construct a panorama image from video sequences captured by the video camcoder revolving on the center axis of the tripod. The proposed method is consisted of two algorithms; frame selection and image mosaics. In order to select frames to construct the panorama image, we employ the interpolation search using the information in overlapped areas. This method can search suitable frames quickly. We construct an image mosaic using the projective transform induced from four pairs of quasi-features. The conventional methods select feature points by using only texture information, but the presented method in this paper uses the position of each feature point as well. We make an experiment on the proposed method with real video sequences. The results show that the proposed method is better than the conventional one in terms of image quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.41-50
• /
• 2005

A novel image mosaicking technique suitable for 3D urban visualization is proposed. It is not effective to apply 2D image mosaicking techniques for urban visualization when, for example, one is filming a sequence of images from a side-looking video camera along a road in an urban area. The proposed method presents the roadside scene captured by a side-looking video camera as a continuous set of textured planar faces, which are termed 'multiple planes' in this paper. The exterior parameters of each frame are first calculated through automatically selected matching feature points. The matching feature points are also used to estimate a plane approximation of the scene geometry for each frame. These planes are concatenated to create an approximate model on which images are back-projected as textures. Here, we demonstrate algorithm that creates efficient image mosaics in 3D space from a sequence of real images.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.790-792
• /
• 2003

The remote sensing image server provides advanced image serving capabilities for geospatial image. Wide seamless image mosaics of Landsat 5 over GMS countries, which exceed a 15 GB or more in size per image, can integrate with other GIS map servers. The approach of two improvement algorithms leads to speed up the response time while preserving the data quality. This system does not only provide images on the web, but also provide GIS layers to WMS client map servers. The advantage of this approach is its efficiency lower cost in terms of cost, time and updating to obtain and utilize remote sensing image.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.415-418
• /
• 2001

The automatic construction of large, high-resolution image mosaics is an active area of reasearch in the fields of photogrammetry, computer vision, image processing, and computer graphics. In this study, we describe a automatic mosaicing method that makes a panorama from images by placing camera in a emitted-grid. In the images captured by cameras, there must be a matched area and the area is in the particular area of the image. Initial transformation matrix, there(ore, is calculated from points searched in the partial area. It is possible to find best transformation matrix by Levenberg-Marquardt method. Finally, each images are multiplied by blending function and stitched by the transformation matrix to complete panoramic image.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.143-147
• /
• 2001

본 논문은 연속된 이미지로부터 고속 영상 모자익을 구성하는 새로운 접근을 기술한다. 제안하는 알고리듬은 전체 영상이 아닌, 종첩영역에서 특징점 및 대응점을 찾아 초기 변한 행렬을 구함으로 좀더 정확한 변환식을 표현하도록 하고 계산량을 감소시킨다. 또한 고속으로 모자익을 수행하도록 하기 위해 OpenGL 기반 텍스쳐 매핑을 이용하였다. 기존의 방법은 모든 영상의 픽셀에 변환식을 곱함으로 인해 많은 계산시간을 초래했다. 본 논문에서 제안하는 방법은 OpenGL 기반 텍스쳐 매핑을 이용해 영상의 각 버텍스에 변환식을 곱함으로서 계산시간을 단축시켰다. 그 결과, PC에서 카메라로부터 영상을 받아들여 고속으로 모자익을 구성할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.700-702
• /
• 2004

모자이크는 설러 장의 영상을 하나의 큰 영상으로 만드는 것을 말한다. 본 논문은 asymmetrical closing이라고 불리는 모폴로지에 의한 closing operator를 사용한 영상 모자이크에 관한 연구이다. asymmetrical closing을 하기 위한 structuring element를 소개하고 이것을 이용한 코너 정 추출 방법 및 local maxima에 대해서도 소개한다. 여러 개의 코너 정들 중 조건을 만족하는 tie point들을 이용하여 Perspective 변환 파라미터를 추출하여 최종 모자이크 결과 영상을 생성하게 된다.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1367-1375
• /
• 2017

Recently, the use of land cover maps has been continuously increasing to analyze spatial patterns such as spatial compositions, functions and changes of landscape mosaics. In this paper, we propose a landscape analysis system that extracts patches, which is an element of landscape mosaics, in the land cover map using region-based image processing technique, and computes patch-based measures at patch level and class level. Also we propose a patch-based spatial pattern that can represent spatial relations using the computed measures. To validate the proposed system's effectiveness, we apply to Gwangju metropolitan city and analyze Gwangju's land use and spatial patterns.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1785-1791
• /
• 2003

This paper presents the mosaic method that the video sequence with shift and rotation information after Mellin Transform. The results are used to compute the projection matrix for each image registration. So before registration, we process camera calibration in order to reduce the image warp by camera and then compute the global projection matrix for image registration for reducing errors from rut image to last image. This paper describes the mosaic method that compute duplication and movement information quickly and robust noise using projection matrix on Mellin Transform.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.