• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.571-573
• /
• 1998

정보전달에 있어서 멀티미디어 정보가 차지하는 비중이 점점 증대됨에 따라 멀티미디어 데이터 암호화의 필요성이 부각되고 있는 실정이다. 그러나 기존의 암호화에 일반적으로 적용되어온 DES(Data Encription Standard)와 같은 전통적인 암호화 알고리즘은 멀티미디어 데이터를 암호화하여 실시간으로 처리하기에는 충분히 신속하지 못한 단점이 있다. 그래서 본 논문에서는 디지털 이미지 프로세싱 기법중 압축기법과암호화 기법을 일련의 과정으로 통합하여 멀티미디어 정보의 중요부분을 차지하는 디지털 이미지의 실시간 암호화 처리기법을 연구하였다. 디지털 이미지의 저주파수 성분과 고주파수 성분을 다단계의 레벨로 분리하여 각 대역별로 성분을 집중시킨 후 임의의 배치 순서로 재배치하는 방법을 통해 DCT(Discrete Cosine Transform)과정 및 양자화과정을 거친 공간주파수 성분을 Zig-Zag순서가 아닌 임의의 배치 순서로 재배열할 때 발생되는 이미지의 크기가 상대적으로 커지는 점과 저주파수 성분이 주요 성분으로 구성된 이미지의 경우 해독이 비교적 용이하다는 점, 또한 약간의 응용으로 각 블록의 DC값만을 추출하여 이미지의 주요 내용을 파악할 수 있는 문제점을 해결하였다.

• Journal of the HCI Society of Korea
• /
• v.8 no.2
• /
• pp.21-27
• /
• 2013

Recently, the use of floating hologram has increased in many different aspects, such as exhibitions, education, advertisements, and so on. Especially, the floating hologram that makes use of half-mirror is widely used. Nevertheless, half-mirror, unfortunately, cannot lead users to the perfect three dimensional hologram experience. Even though it can make the vision look to be up on the air, it does not have the capacity to display itself up on the air, which is the ultimate goal of hologram. In addition, it looks inconsistent when a real object is located behind the half-mirror in order to show the convergence of the two (object and the half-mirror). In this paper, we did the study on comparison of 3D space perception for the stereoscopic AR holography. At first, we applied stereoscopic technology to the half-mirror hologram system for the accurate and realistic AR environment. Then, the users can feel as if the real 3D object behind half-mirror and the reflected virtual image are converged much better in the 3D space. Furthermore, by using depth camera, the location and direction of graphics can be controlled to change depending on the user's point of view. This is the effective way to produce augmented stereoscopic images simply and accurately through half-mirror film without any additional devices. What we saw from the user test were applying 3D images and user interaction leads the users to have 3D spatial awareness and realism more effectively and accurately.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.93-96
• /
• 2015

The SIFT method is well-known for robustness against various image transformations, and is widely used for image retrieval and matching. The SIFT method extracts keypoints using scale space analysis, which is different from conventional keypoint detection methods that depend only on the image space. The SIFT method has also been extended to use higher-order scale space derivatives for increasing the number of keypoints detected. Such detection of additional keypoints detected was shown to provide performance gain in image retrieval experiments. Herein, a sigma based normalization method for keypoint detection is introduced using higher-order scale space derivatives.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.182-188
• /
• 2004

This paper proposes to synthesize facial images from a few parameters for the pose and the expression of their constituent components. This parameterization makes the representation, storage, and transmission of face images effective. But it is difficult to parameterize facial images because variations of face images show a complicated nonlinear manifold in high-dimensional data space. To tackle this problem, we use an LLE (Locally Linear Embedding) technique for a good representation of face images, where the relationship among face images is preserving well and the projected manifold into the reduced feature space becomes smoother and more continuous. Next, we apply a snake model to estimate face feature values in the reduced feature space that corresponds to a specific pose and/or expression parameter. Finally, a synthetic face image is obtained from an interpolation of several neighboring face images in the vicinity of the estimated feature value. Experimental results show that the proposed method shows a negligible overlapping effect and creates an accurate and consistent synthetic face images with respect to changes of pose and/or expression parameters.

• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.113-122
• /
• 2005

In this paper, we propose a multi-watermarking algorithm to satisfy two purposes: fragility against malicious attacks and robustness against non-malicious attacks. The algorithm can be used for image authentication using coefficients of Discrete Wavelet Transform(DWT). In the proposed method, watermarks are generated by combining binary image with some features extracted from the subband LL3, and then they are embedded into both the spatial and frequency domain. That is, on the spatial domain they are embedded into the Least Significant Bit(LSB) of all pixels of image blocks, and on the frequency domain the coefficients of the subband LH2 and HL2 are adjusted according to the watermarks. Thus the algorithm not only resists malicious attack but also permits non-malicious attacks such as blurring, sharpening, and JPEG compression.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.104-107
• /
• 2007

인간은 초점정보를 이용하여 단안만으로도 공간의 깊이를 지각할 수 있다. 이것은 한 번에 하나의 대상물에만 초점을 맞출 수 있고 그 외의 부분은 흐림 현상을 유도함으로써 이루어진다. 이는 초점이 맞는 대상물체로부터 멀어지면 멀어질수록 흐림 현상이 강해지는 원리를 이용한 것으로 주파수 성분의 변화량에 대한 연산과 깊은 관련이 있다. 본 논문에서는 이와 같은 인간의 시각 시스템의 요소 중 하나인 초점정보를 모방하여 초점거리가 다른 각각의 이미지들에 각각의 가중치를 부여하였다. 그리고 각 이미지들을 일정 블록으로 각각 분할하여 초점이 가장 잘 맞는 블록을 찾아내어 하나의 이미지로 통합하였다. 이때 각 영역은 자신이 속했던 이미지의 가중치를 따르게 한다. 각 이미지에서 가장 포커스 수치가 높은 영역을 찾기 위한 방법으로 주파수 영역 기반 처리와 공간 영역 기반 처리를 결합 하였다. 주파수 기반으로는 FFT(Fast Fourier Transform)에서 고주파 부분의 영역을 뽑아내어 포커스수치를 계산하였으며, 공간 영역 처리 기반으로는 이웃픽셀과의 차이가 임계값이하인 것을 제외한 영역을 뽑아내어 저주파 영역의 연산을 제거하는 방법과 단순히 Laplacian measure만을 사용하여 저주파까지도 포함한 방법의 두 가지를 적용하였다. 최종적으로 3개의 포커스 측정값을 결합시켜 포커스 수치를 계산한 후 각 블록의 가중치에 맞게 하나의 이미지로 통합하여 상대적 깊이지도를 생성하였다.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.2
• /
• pp.9-15
• /
• 2012

In this paper, we propose a method to segment a color image into several meaningful regions. We suppose that the meaningful region has a set of colors with high frequency in the color image. To find these colors, the color image is represented as several sets of color points in RGB space. And when we use the density of points defined in this method, color belonging to a dense region of color points in RGB space refers to the color that appeared frequently in the image. Eventually, we can find meaningful regions by looking for regions with high density of color points using our level set function in RGB space. However, if a meaningful region does not have a contiguous region of the sufficient size in the image, this is not a meaningful region but meaningless region. Thus, the pixels in the meaningless region are assigned to the biggest meaningful region belonging to its neighboring pixels in the color image. Our method divides the color image into meaningful regions by applying the density of color points to level set function in RGB space. This is different from the existing level set method that is defined only in 2D image.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.06a
• /
• pp.173-174
• /
• 2011

본 논문에서는 그림을 그려서 원하는 이미지를 그리고, 이를 인식하여 상품을 찾아주는 정보전달 방식을 제안한다. 사용자가 원하는 이미지에 맞는 상품을 검색할 수 있도록 하는데, 그림 그리기가 가능하고, 개인의 "공감", "신뢰"를 실현하는 공간과 개인과 기업을 연결해주는 정보성 검색으로 쇼핑몰을 연계하는 것을 목표로 한다. 본문 내에서는 고객이 직접 찾는 디자인을 간단히 그리면 비슷한 그림의 상품이 나오게 되는 공간을 제작, 상품이 나오면 기업과의 연계를 통하여 구매로까지 이어질 수 있는 공간을 제시하는 것을 목표로 한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.7
• /
• pp.2579-2585
• /
• 2010

This paper proposes a dynamic human pose tracking method using motion-based search strategy from an image sequence obtained from a monocular camera. The proposed method compares the image features between 3D human model projections and real input images. The method repeats the process until predefined criteria and then estimates 3D human pose that generates the best match. When searching for the best matching configuration with respect to the input image, the search region is determined from the estimated 2D image motion and then search is performed randomly for the body configuration conducted within that search region. As the 2D image motion is highly constrained, this significantly reduces the dimensionality of the feasible space. This strategy have two advantages: the motion estimation leads to an efficient allocation of the search space, and the pose estimation method is adaptive to various kinds of motion.