• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.618-625
• /
• 2010

Receiving information and transmitting it is the most basic and important thing in numan society. And modern communication is not only transmitting objective information but also a visual communication which shows feeling of each emotions and image-motive. Introduction of Motion graphic which was grown by new media changed opening title sequence to a more expanded genre. The purpose of this research is to announce the new value of opening title sequence. Motion graphic will be used continually as an important way to communicate and also a guideline which could transmit exact informations and emotions to viewers with creative expressions.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.411-418
• /
• 2018

This paper presents a novel three-dimensional (3D) object encryption scheme by combining the use of the virtual optics and the chaotic sequence. A virtual 3D object is digitally produced using a two-dimensional (2D) elemental image array (EIA) created with a virtual pinhole array. Then, through a logistic mapping of chaotic sequence, a final encrypted video can be produced. Such method converts the value of a pixel which is the basic information of an image. Therefore, it gives an improved encryption result compared to other existing methods. Through computational experiments, we were able to verify our method's feasibility and effectiveness.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.477-481
• /
• 2007

A background is a part where do not vary too much or frequently change in an image sequence. Using this assumption, it is presented a background acquisition algorithm for not only static but also dynamic view in this paper. For generating background, we detect a region, where has high correlation rate compared within selected region in the prior pyramid image, from the searching region in the current image. Between a detected region in the current image and a selected region in the prior image, we calculate movement vector for each regions in time sequence. After we calculate whole movement vectors for two successive images, vector histogram is used to determine the camera movement. The vector which has the highest density in the histogram is determined a camera movement. Using determined camera movement, we classify clusters based on pixel intensities which pixels are matched with prior pixels following camera movement. Finally we eliminate clusters which have lower weight than threshold, and combine remained clusters for each pixel to generate multiple background clusters. Experimental results show that we can automatically detect background whether camera move or not.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.176-184
• /
• 1998

We present a sequential factorization method using singular value decomposition (SVD) for recovering both the three-dimensional shape of an object and the motion of camera from a sequence of images. We employ paraperpective projection [6] for camera model to handle significant translational motion toward the camera or across the image. The proposed mthod not only quickly gives robust and accurate results, but also provides results at each frame becauseit is a sequential method. These properties make our method practically applicable to real time applications. Considerable research has been devoted to the problem of recovering motion and shape of object from image [2] [3] [4] [5] [6] [7] [8] [9]. Among many different approaches, we adopt a factorization method using SVD because of its robustness and computational efficiency. The factorization method based on batch-type computation, originally proposed by Tomasi and Kanade [1] proposed the feature trajectory information using singular value decomposition (SVD). Morita and Kanade [10] have extenened [1] to asequential type solution. However, Both methods used an orthographic projection and they cannot be applied to image sequences containing significant translational motion toward the camera or across the image. Poleman and Kanade [11] have developed a batch-type factorization method using paraperspective camera model is a sueful technique, the method cannot be employed for real-time applications because it is based on batch-type computation. This work presents a sequential factorization methodusing SVD for paraperspective projection. Initial experimental results show that the performance of our method is almost equivalent to that of [11] although it is sequential.

• Journal of Korea Multimedia Society
• /
• v.22 no.1
• /
• pp.35-43
• /
• 2019

Template tracking refers to the procedure of finding the most similar image patch corresponding to the given template through an image sequence. In order to obtain more accurate trajectory of the template, the template requires to be updated to reflect various appearance changes as it traverses through an image sequence. To do that, appearance images are used to model appearance variations and these are obtained by the computation of the principal components of the augmented image matrix at every iteration. Unfortunately, it is prohibitively expensive to compute the principal components at every iteration. Thus in this paper, we suggest a new Sliding Window based truncated URV Decomposition (TURVD) algorithm which enables updating their structure by recycling their previous decomposition instead of decomposing the image matrix from the beginning. Specifically, we show an efficient algorithm for updating and downdating the TURVD simultaneously, followed by the rank-one update to the TURVD while tracking the decomposition error accurately and adjusting the truncation level adaptively. Experiments show that the proposed algorithm produces no-meaningful differences but much faster execution speed compared to the typical algorithms in template tracking applications, thereby maintaining a good approximation for the principal components.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.59-74
• /
• 2022

During the last decade, the security of digital images has received considerable attention in various multimedia transmission schemes. However, many current cryptosystems tend to adopt a single-layer permutation or diffusion algorithm, resulting in inadequate security. A hierarchical bilateral diffusion architecture for color image encryption is proposed in response to this issue, based on a hyperchaotic system and DNA sequence operation. Primarily, two hyperchaotic systems are adopted and combined with cipher matrixes generation algorithm to overcome exhaustive attacks. Further, the proposed architecture involves designing pixelpermutation, pixel-diffusion, and DNA (deoxyribonucleic acid) based block-diffusion algorithm, considering system security and transmission efficiency. The pixel-permutation aims to reduce the correlation of adjacent pixels and provide excellent initial conditions for subsequent diffusion procedures, while the diffusion architecture confuses the image matrix in a bilateral direction with ultra-low power consumption. The proposed system achieves preferable number of pixel change rate (NPCR) and unified average changing intensity (UACI) of 99.61% and 33.46%, and a lower encryption time of 3.30 seconds, which performs better than some current image encryption algorithms. The simulated results and security analysis demonstrate that the proposed mechanism can resist various potential attacks with comparatively low computational time consumption.

• Korean Journal of Remote Sensing
• /
• v.20 no.2
• /
• pp.125-137
• /
• 2004

In case of using image sequence taken from a moving camera along a road in an urban area, general video mosaicing technique based on a single baseline cannot create 2-D image mosaics. To solve the drawback, this paper proposed a new image mosaicing technique through 3-D multi-baselines that can create image mosaics in 3-D space. The core of the proposed method is that each image frame has a dependent baseline, an equation of first order, calculated by using ground control point (GCP) of optical flows. The proposed algorithm consists of 4 steps: calculation of optical flows using hierarchical strategy, calculation of camera exterior orientation, determination of multi-baselines, and seamless image mosaics. This paper realized and showed the proposed algorithm that can create efficient image mosaics in 3-D space from real image sequence.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.42-52
• /
• 2017

Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.91-100
• /
• 2016

In FPGA-based real-time image warping systems, image caches are utilized for fast readout of image pixel data and reduction of memory access rate. However, a cache algorithm for a general computer system is not suitable for real-time performance because of time delays from cache misses and on-line computation complexity. In this paper, a simple image cache algorithm is presented for a FPGA-based real-time image warping system. Considering that pixel data access sequence is determined from the 2D coordinate transformation and repeated identically at every image frame, a cache load sequence is off-line programmed to guarantee no cache miss condition, and reduced on-line computation results in a simple cache controller. An overall system structure using a FPGA is presented, and experimental results are provided to show accuracy and validity of the proposed cache algorithm.