• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1395-1398
• /
• 2003

최근 위치기반 기술의 급속한 발전으로 인하여 이동 객체를 효율적으로 관리하기 위한 색인 구조의 필요성이 증가하고 있다. 본 논문에서는 KDB-트리를 기반으로 하는 새로운 형태의 시공간 색인 구조인 TPKDB-트리 (Time Parameterized KDB-Tree)를 제안한다. 제안하는 색인 구조는 갱신 비용을 최소화 하여 이동 객체 검색의 효율성을 증가시키고 노드 내에 포함되어 있는 이동 객체의 변화를 시간에 대한 파라미터로 유지함으로서 효율적으로 이동 객체의 미래 위치 검색을 지원한다. 또한, 공간활용도를 최대화하기 위해 EFP 분할 (Enhanced First Division Splitting) 기법을 제안한다. 제안하는 색인 구조의 우수성을 입증하기 위해 실험을 통해 다른 색인 구조차의 성능 비교를 수행한다.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1294-1302
• /
• 2015

A lot of image quality assessment metrics that can precisely reflect the human visual system (HVS) have previously been researched. The Structural SIMilarity (SSIM) index is a remarkable HVS-aware metric that utilizes structural information, since the HVS is sensitive to the overall structure of an image. However, SSIM fails to deal with color difference in terms of the HVS. In order to solve this problem, the Structural and Hue SIMilarity (SHSIM) index has been selected with the Hue, Saturation, Intensity (HSI) model as a color space, but it cannot reflect the HVS-aware color difference between two color images. In this paper, we propose a new image quality assessment method for a color image by using a CIE Lab color space. In addition, by using a support vector machine (SVM) classifier, we also propose an optimization system for applying optimal metric according to the types of distortion. To evaluate the proposed index, a LIVE database, which is the most well-known in the area of image quality assessment, is employed and four criteria are used. Experimental results show that the proposed index is more consistent with the other methods.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1835-1838
• /
• 2003

Texts in natural images contain significant and detailed informations about the images. Thus, to extract those texts correctly, we suggest a text extraction method using color variance feature. Generally, the texts in images have color variations with the backgrounds. Thus, if we express those variations in 3 dimensional RGB color space, we can emphasize the text regions that can be hard to be captured with a method using intensity variations in the gray-level images. We can even make robust extraction results with the images contaminated by light variations. The color variations are measured by color variance in this paper. First, horizontal and vertical variance images are obtained independently, and we can fine that the text regions have high values of the variances in both directions. Then, the two images are logically ANDed to remove the non-text components with only one directional high variance. We have applied the proposed method to the multiple kinds of the natural images, and we confirmed that the proposed feature can help to find the text regions that can he missed with the following features - intensity variations in the gray-level images and/or color continuity in the color images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.69-78
• /
• 2002

This paper addresses a method to automatically detect out a person's face from a given image that consists of a hair and face view of the person and a complex background scene. Out method involves an effective detection algorithm that exploits the spatial distribution characteristics of human skin color via an adaptive fuzzy color classifier (AFCC), The universal skin-color map is derived on the chrominance component of human skin color in Cb, Cr and their corresponding luminance. The desired fuzzy system is applied to decide the skin color regions and those that are not. We use RGB model for extracting the hair color regions because the hair regions often show low brightness and chromaticity estimation of low brightness color is not stable. After some preprocessing, we apply convex-hull to each region. Consequent face detection is made from the relationship between a face's convex-hull and a head's convex-hull. The algorithm using the convex-hull shows better performance than the algorithm using pattern method. The performance of the proposed algorithm is shown by experiment. Experimental results show that the proposed algorithm successfully and efficiently detects the faces without constrained input conditions in color images.

• Science of Emotion and Sensibility
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2008

We developed the decision support system by using the fuzzy theory. This system designs harmonious color space according to the linguistic input. This input represents the atmosphere which the user want. If the linguistic input of adjective image scale is given in the developed system, the relation between the adjective and color is supposed as fuzzy relation. The color which match with the whole atmosphere of color space is selected. The search region of harmonious color decision is controlled by the knowledge on color harmony of Moon-Spencer. Harmonious color is selected by it.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• Journal of Conservation Science
• /
• v.38 no.2
• /
• pp.154-165
• /
• 2022

The color appearance of cultural heritage are essential factors for manufacturing technique interpretation, conservation treatment usage, and condition monitoring. Therefore, this study systematically established color reproduction procedures based on the digital color management system for the portrait of Gwon Eungsu. Moreover, various application strategies for recording and conserving the cultural heritage were proposed. Overall color reproduction processes were conducted in the following order: photography condition setting, standard color measurements, digital photography, color correction, and color space creation. Therefore, compared with the color appearance, the digital image applied to a camera maker profile indicated an average color difference of 𝜟10.1. However, the digital reproduction result based on the color management system exhibits an average color difference of 𝜟1.1, which is close to the color appearance. This means that although digital photography conditions are optimized, recording the color appearance is difficult when relying on the correction algorithm developed by the camera maker. Therefore, the digital color reproduction of cultural heritage is required through color correction and color space creation based on the raw digital image, which is a crucial process for documenting the color appearance. Additionally, the recording of color appearance through digital color reproduction is important for condition evaluation, conservation treatment, and restoration of cultural heritage. Furthermore, standard data of imaging analysis are available for discoloration monitoring.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2140-2146
• /
• 2009

Since tags do not have location informations, the identifiers of tags which are symbolic data are used as the location informations. Therefore, it is difficult to define the proxmity between two trajectories of tags and inefficient to process the user queries for tags. In this paper, we define the perceptual space to model the location of a tag and propose the proximity of the perceptual spaces. The proximity of the perceptual spaces is composed of the static proximity and dynamic proximity. Using the proximity of the perceptual spaces, it is possible to measure the proximity between two trajectories of tags and build the efficient indexes for tag trajectories. We evaluated the performance of the proposed proximity function for tag trajectories on the IR-tree and the $R^*$-tree.