• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2949-2955
• /
• 2015

Recently, with the sharp increase of digital visual media such as photographs, animations, and digital videos, it has been necessary to generate mosaic blocks in a static or dynamic image intentionally or unintentionally. In this paper, we suggest a new method for detecting mosaic blocks contained in a color image using boundary features. The suggested method first extracts Canny edges in the image and finds candidate mosaic blocks with the boundary features of mosaic blocks. The method then determines real mosaic blocks after filtering out non-mosaic blocks using geometric features like size and elongatedness features. Experimental results show that the proposed method can detect mosaic blocks robustly rather than other methods in various types of input images.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2002.04a
• /
• pp.187-194
• /
• 2002

본 논문에서는 SPOT 입체영상을 이용하여 광범위한 지역의 DEM을 제작할 경우 DEM 모자이크 과정에서 발생할 수 있는 접합선(seam-line)을 최소화할 수 있는 방법을 연구하였다. 지상의 60km$\times$60km 영역을 촬영할 수 있는 SPOT 위성의 입체 영상으로부터 구성한 단일 모델은 일반적으로 관심 있는 지역의 DEM을 제작하기에 충분히 넓은 지역을 포함할 수 있다. 그러나 광범위한 지역의 DEM 제작을 위해서는, 각각의 입체영상을 통해 제작된 DEM들을 접합해야 하며, 이 때 발생되는 접합선을 효과적으로 제거하는 작업이 필요하다. 이를 위해 SPOT 위성영상의 블록 조정 방법을 이용하여 종횡접합모델을 구성하고 중복되는 인접한 SPOT DEM간의 표고값을 일치시키므로써 DEM 접합선의 발생을 최소화하여 모자이크시 작업량을 줄이고자 한다. 본 논문에서는 기존의 지상기준점과 추가로 관측한 영상접합점을 이용하여 종횡접합 블록을 구성하고 광속조정 방법을 적용하여 블록에 포함된 위성영상의 외부표정요소를 계산하였다. 블록모델을 이용하여 DEM을 제작할 경우 접합선 탐색 및 blending 작업 없이 단순중첩 방법으로도 DEM 모자이크 작업을 빠르게 수행할 수 있음을 확인하였다.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.167-175
• /
• 2002

Image Mosaicing creates a new image by composing video frames or still images that are related, and performed by arrangement, composition and redundancy analysis of images. This paper proposes a hierarchical image mosaicing system using camera and object parameters far efficient video database construction. A tree-based image mosiacing has implemented for high-speed computation time and for construction of static and dynamic image mosaic. Camera parameters are measured by using least sum of squared difference and affine model. Dynamic object detection algorithm has proposed for extracting dynamic objects. For object extraction, difference image, macro block, region splitting and 4-split detection methods are proposed and used. Also, a dynamic positioning method is used for presenting dynamic objects and a blurring method is used for creating flexible mosaic image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.357-360
• /
• 2011

모자이크는 여러 개의 작은 영상들을 모아서 하나의 큰 영상을 만드는 것을 말한다. 본 논문에서는 모자이크 방법 중 하나인 사진을 이용하여 영상을 만드는 포토 모자이크 방법을 컴퓨터 알고리즘으로 구현하는 기술 제안을 한다. 이미지를 원하는 사이즈의 타일로 나눈 다음, 나눠진 타일을 16등분을 한다. 16등분된 이미지 각 요소들에 대하여 RGB 평균값을 계산하여 총 48개 특징값을 추출하여 데이터베이스에 저장해둔다. 그리고 타일과 비교가 될 이미지들은 이미 똑같은 작업을 통하여 데이터베이스에 저장이 되어 있다. 이렇게 저장된 값들을 통하여 유클리드 거리를 통하여 두 이미지의 유사도를 측정하게 된다. 최적의 값을 찾으면 바로 대입하는 것이 아니라 이전에 있던 타일 이미지의 명암값을 새로 삽입되는 타일에 부여를 하여, 부드러운 영상을 만들게 된다. 그리고 타일을 삽입할 때 이전에 사용된 이미지는 배열의 마지막으로 옮겨지게 되며 사용횟수를 체크하여 반복적 사용을 제한하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.10
• /
• pp.61-67
• /
• 2016

With the current high distribution rate of smart devices and the recent development of computing technology, user interest in multimedia, such as photos, videos, and so on, has rapidly increased, which is a departure from the simple pattern of information retrieval. Because of these increasing interests, image processing techniques, which generate and process images for diverse applications, are being developed. In entertainment recently, there are some techniques that present a celebrity's image as a mosaic comprising many small images. In addition, studies into the mosaic technique are actively conducted. However, conventional mosaic techniques result in a long processing time as the number of database images increases, because they compare the images in the databases sequentially. Therefore, to increase search efficiency, this paper proposes an algorithm to generate a mosaic image using a discrete cosine transform (DCT) hash. The proposed photo mosaic-generation algorithm is composed of database creation and mosaic image generation. In database creation, it first segments images into blocks with a predefined size. And then, it computes and stores a DCT hash set for each segmented block. In mosaic generation, it efficiently searches for the most similar blocks in the database via DCT hash for every block of the input image, and then it generates the final mosaic. With diverse experimental results, the proposed photo mosaic-creation algorithm can effectively generate a mosaic, regardless of the various types of images and sizes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.47-55
• /
• 2003

This paper proposes a composition method of mosaic image from the compressed MPEG-2 video stream, in which the displacement between successive frames according to the camera operation is estimated directly from the information involved in the stream. In the proposed method. the approximated optical flow is constructed from motion vectors of macro blocks, and it is used to determine the parameters of the displacements according to the camera operation associated with pan and tilt. The extracted parameters are used to determine the geometric transform of successive video frames in order to construct a mosaic image. The construction of mosaic uses several blending techniques including the one proposed by Nichols in which an analytic weight is used to determine pixel values. Through the experiment, the blending technique based on analytic weights was superior to the others such as averaging and median-based techniques. It provided more smooth changes in background and made use of instantaneous frame information to construct a mosaic. The mosaic in the paper puts the emphasis on the reduction of computation because it is constructed from the motion vectors included in the compressed video without decoding and recalculating exact optical flows. The constructed mosaic can be used in the retrieval of the compressed video as the representative frame of a shot.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.745-747
• /
• 2005

본 논문은 연속 초음파 영상으로부터 모자이크 영상을 구하기 위한 특징점 기반 블록 움직임 추출 방법에서 정확도를 높이고 계산 시간을 줄이기 위해 다해상도(multi-resolution)영상을 이용한 계층적 특징점 기반 블록 움직임 추출 방법을 제시하였다. 초음파 영상에서의 Speckle 노이즈의 영향을 줄이기 위해 저해상도의 영상에서 특징점을 추출하고, 계산 시간을 줄이기 위해 저해상도 영상의 추정된 움직임을 고해상도 영상의 움직임 추정에 적용하여 탐색 범위를 줄였다. 그 결과 계산 시간을 개선하면서 모자이크 영상의 정확도를 높일 수 있었다.

• Journal of IKEEE
• /
• v.6 no.2 s.11
• /
• pp.152-160
• /
• 2002

This paper is the realization of the face recognition system for multimedia application. This system is focused on the design concerning the improvement of recognition rate and the reduction of processing time for face recognition. The non-modificated application of typical RGB color system enables the reduction of time required for color system transform. The neural network and the application of algorithm using face characteristic improves the recognition rate. After mosaicking an image, a face-color block has been selected through the color analysis of mosaic block. The characteristic of the face removes the mis-checked face-color candidate block. Finally, from the face color block, four special values are obtained. These values are processed to the neural network using the back propagation algorithm. The output values are the touchstone to decide the genuineness of face field. The realized system showed 90% of face recognition rate with less than 0.1 second of processing time. This result can be understood as sufficient processing time and recognition rate to find out the face block for multimedia application in dynamic image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.741-744
• /
• 2003

in this paper, we propose a dynamic-based compression system by creating mosaic background and transmitting the change information. A dynamic mosaic of the background is progressively integrated in a single image using the camera motion information. For the camera motion estimation, we calculate perspective projection parameters for each frame sequentially with respect to its previous frame. The camera motion is robustly estimated on the background by discriminating between background and foreground regions. The modified block-based motion estimation is used to separate the background region.