• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1347-1359
• /
• 2005

We propose an efficient block classification of the document images using the second-order statistical texture features computed from spatial gray level dependence matrix (SGLDM). We studied on the techniques that will improve the block speed of the segmentation and feature extraction speed and the accuracy of the detailed classification. In order to speedup the block segmentation, we binarize the gray level image and then segmented by applying smoothing method instead of using texture features of gray level images. We extracted seven texture features from the SGLDM of the gray image blocks and we applied these normalized features to the BP (backpropagation) neural network, and classified the segmented blocks into the six detailed block categories of small font, medium font, large font, graphic, table, and photo blocks. Unlike the conventional texture classification of the gray level image in aerial terrain photos, we improve the classification speed by a single application of the texture discrimination mask, the size of which Is the same as that of each block already segmented in obtaining the SGLDM.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.1
• /
• pp.47-56
• /
• 2010

The use of airborne LiDAR data obtained by airborne laser scanners has increased in the field of spatial information such as building modeling. LiDAR data consist of irregularly distributed 3D coordinates and lack visual and semantic information. Therefore, LiDAR data processing is complicate. This study suggested a method of LiDAR data segmentation using roof surface patches from aerial images. Each segmented patch was modeled by analyzing geometric characteristics of the LiDAR data. The optimal functions could be determined with segmented data that fits various shapes of the roof surfaces as flat and slanted planes, dome and arch types. However, satisfiable segmentation results were not obtained occasionally due to shadow and tonal variation on the images. Therefore, methods to remove unnecessary edges result in incorrect segmentation are required.

• The Korean Journal of Applied Statistics
• /
• v.28 no.6
• /
• pp.1171-1180
• /
• 2015

Multidimensional scaling (MDS) is a graphical technique of multivariate analysis to display dissimilarities among individuals into low-dimensional space. We often have two kinds of MDS which are metric MDS and non-metric MDS. Metric MDS can be applied to quantitative data; however, we need additional information about variables because it only shows relationships among individuals. Gower (1992) proposed a method that can represent variable information using trajectories of the pseudo-points for quantitative variables on the metric MDS space. We will call his method a 'replacement method'. However, the trajectory can not be represented even though metric MDS can be applied to binary data when we apply his method to binary data. Therefore, we propose a method to represent information of binary variables using pseudo-points called a 'partition method'. The proposed method partitions pseudo-points, accounting both the rate of zeroes and ones. Our metric MDS using the proposed partition method can show the relationship between individuals and variables for binary data.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.429-435
• /
• 2003

In this paper, we propose improved binary tree vector quantization with consideration of spatial sensitivity which is one of the human visual properties. We combine weights in consideration with the responsibility of human visual system according to changes of three primary color in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. Also we propose the novel quality measure of the quantization images that applies MTF(modulation transfer function) to luminance value of quantization error of color image. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get less quantized level images and can reduce the resource occupied by the quantized image.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.446-448
• /
• 2011

본 논문에서는 조명 보정과 지역적인 밝기 정보를 이용한 유해 영상에서의 피부색 검출 방법을 제안한다. 첫번째, 조명의 영향을 줄이기 위하여 입력 영상을 히스토그램 평활화하여 명암 값의 분포가 한쪽으로 치우치거나 균일하지 못한 영상의 명암 값 분포를 균일화 시켜 영상을 향상될 수 있도록 한다. 그 다음, 평활화 시킨 영상을 25 개의 블록으로 분할한 후, 각 블록에서의 밝기 값에 대한 통해 평균과 왜도를 구한다. 구해진 값들을 영상의 임계값으로 설정하여 이진화 시킨다. 그리고, 평활화시킨 영상의 RGB 값을 Lab 컬러 공간으로 변환한다. 변환된 컬러 공간내의 조명 성분 값인 L(Luminance)값을 추출하여 이를 역변환 한다. 역변환한 L 값은 비정규 조명을 갖는 유해 영상의 조명에 민감한 영향을 제거하기 위하여 평활화 영상에 합한다. 마지막으로, 밝기 임계값을 통해서 얻어진 이진영상내의 객체 영역과 RGB 피부색 임계값을 통한 조명 보정된 평활화 영상내의 피부색 영역의 공통된 영역을 결과값으로 추출한다.

• Journal of Korea Game Society
• /
• v.11 no.2
• /
• pp.161-166
• /
• 2011

In this paper, we propose a novel background segmentation and feature point extraction method of a human motion for the augmented reality game. First, our method transforms input image from RGB color space to HSV color space, then segments a skin colored area using double threshold of H, S value. And it also segments a moving area using the time difference images and then removes the noise of the area using the Hessian affine region detector. The skin colored area with the moving area is segmented as a human motion. Next, the feature points for the human motion are extracted by calculating the center point for each block in the previously obtained image. The experiments on various input images show that our method is capable of correct background segmentation and feature points extraction 12 frames per second.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.4
• /
• pp.151-158
• /
• 2014

In this paper, we introduce an inference system using hard scatter partition method and model the nonlinear process. To do this, we use the hard scatter partition method that partition the input space in the scatter form with the value of the membership degree of 0 or 1. The proposed method is implemented by C-Means clustering algorithm. and is used for the initial center values by means of binary split. by applying the LBG algorithm to compensate for shortcomings in the sensitive initial center value. Hard-scatter-partitioned input space forms the rules in the rule-based system modeling. The premise parameters of the rules are determined by membership matrix by means of C-Means clustering algorithm. The consequence part of the rules is expressed in the form of polynomial functions and the coefficient parameters of each rule are determined by the standard least-squares method. The data widely used in nonlinear process is used to model the nonlinear process and evaluate the characteristics of nonlinear process.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.645-648
• /
• 2006

최근 컴퓨터의 급속한 보급과 영상처리기술의 발달로 금석학 분야는 인문학의 범주를 뛰어넘어 문화 정보 공유의 중요한 위치로 자리매김하게 되었다. 본 연구는 국내에서 처음 시도 되는 것으로, 수천년 정신문화 산물의 정보자료인 탁본을 영상으로 입력하여 디지털 데이터로 전환하고, 이를 공간 영역에서 종합 분석함으로 탁본영상 고유의 특성을 파악하고자 하였다. 탁본 원영상은 흑백의 두 영역으로 분할되는 완벽한 이진영상이나, 탁본뜨기 수작업과정을 거치면서 관측영상에는 영역간 색도의 혼재가 발생하고 얼룩무늬와 문양이 전체 영상에 분포한다. 이와같은 영상으로부터 필요한 문자나 문양의 정보를 추출하기 위한 전단계로 영상에 관한 종합적인 분석 작업을 하였다. 분석 기법으로는 공간분석법을 사용하였다. 역사적으로 유명한 대표적인 탁본을 위시하여 40여개의 탁본영상 샘플을 무작위로 선택하였고, 공간분석을 통해 색도분포특성과 영역간 색도 중복 및 영역형성 양상과 특성을 찾아내었다.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.215-218
• /
• 2014

In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.