• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.43-50
• /
• 2005

The Processing domains of spatio-temporal databases are divided into time-series databases for moving objects and sequence databases for discrete historical objects. Recently the selectivity estimation techniques for query optimization in spatio-temporal databases have been studied, but focused on query optimization in time-series databases. There wat no previous work on the selectivity estimation techniques for sequence databates as well. Therefore, we construct T-Minskew histogram for query optimization In sequence databases and propose a selectivity estimation method using the T-Minskew histogram. Furthermore we propose an effective histogram maintenance technique for food performance of the histogram.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.47-52
• /
• 2006

This paper proposes a method of content-based image retrieval using region feature vector in order to overcome disadvantages of existing color histogram methods. The color histogram methods have a weak point that reduces accuracy because of quantization error, and more. In order to solve this, we convert color information to HSV space and quantize hue factor being purecolor information and calculate histogram and then use thus for retrieval feature that is robust in brightness, movement, and rotation. Also we solve an insufficient part that is the most serious problem in color histogram methods by dividing an image into sixteen regions and then comparing each region. We improve accuracy by edge and DC of DCT transformation. As a result of experimenting with 1,000 color images, the proposed method has showed better precision than the existing methods.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.176-183
• /
• 2003

Various techniques including histograms, sampling and parametric techniques have been proposed to estimate query result sizes for the query optimization. Histogram-based techniques are the most widely used form for the selectivity estimation in relational database systems. However, in the spatio-temporal databases for the moving objects, the continual changes of the data distribution suffer the direct utilization of the state of the art histogram techniques. Specifically for the future queries, we need another methodology that considers the updated information and keeps the accuracy of the result. In this paper we propose a novel approach based upon the duality and the marginal distribution to construct a histogram with very little time since the spatio-temporal histogram requires the data distribution defined by query predicates. We use data synopsis method in the dual space to construct spatio-temporal histograms. Our method is robust to changing data distributions during a certain period of time while the objects keep the linear movements. An additional feature of our approach supports the dynamic update incrementally and maintains the accuracy of the estimated result.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2387-2390
• /
• 2003

움직이는 물체의 자동 분할은 컴퓨터 비젼의 여러 응용분야에서 중요한 문제로 대두되고 있다. 본 논문에서는 감시 시스템에서 에지와 적응적 임계값을 이용한 효과적인 자동 움직임 분할 방법을 제안하였다. 먼저 연속 영상에서 현재 영상과 배경 영상과의 차를 얻어서 그 히스토그램을 만든다. 이 때 앞에서 얻은 히스토그램은 영상 잡음의 평균이 0 인 가우시안 분포를 가진다고 가정한다. 그리고, 이 히스토그램을 이용하여 영상잡음의 분산을 찾는다 이 분산 값을 이용하여 적응적 임계값과 움직임 영역창을 결정한다. 적응적 임계값에 의한 결과 영상에서 움직이는 물체를 분할하기 위해 본 논문에서는 움직임 영역창을 이용하는 방법을 제안하였다. 이 움직임 영역창에 의해 더욱 효과적인 움직임 분할이 이루어진다. 또, 잡음의 제거를 위해 수학적 모폴로지(mathematical morphology)와 화소의 연결성이 이용된다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.76-90
• /
• 1999

In this paper, a color image retrieval algorithm is proposed based on color histogram and color texture. The representative color vectors of a color image are made from k-means clustering of its color histogram, and color texture is generated by centering around the color of pixels with its color vector. Thus the color texture means texture properties emphasized by its color histogram, and it is analyzed by Gaussian Markov Random Field (GMRF) model. The proposed algorithm can work efficiently because it does not require any low level image processing such as segmentation or edge detection, so it outperforms the traditional algorithms which use color histogram only or texture properties come from image intensity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.130-132
• /
• 2000

주요 멀티미디어 자료인 이미지는 데이터 특성을 표현하기가 어렵고, 특성추출에서 얻은 데이터가 너무 고차원적이라 이를 저차원의 처리가능한 데이터로 변환하는 과정에서 많은 손실이 있다. 이미지의 특성값을 전체 이미지의 평균값으로 변경하여 저차원 데이터를 얻는 기존의 이미지 전체 특성추출기법이나 고정된 블록의 평균값으로 변경하여 저차원 데이터를 얻는 이미지 블록 특성추출기법은 유사 이미지의 검색이 부정확하다는 단점이 있다. 본 논문에서는 이미지를 가변적인 영역으로 나누어 특성값을 얻고, 히스토그램을 이용하여 효율적으로 유사 이미지를 찾는 영역기반 유사 이미지 검색기법을 제안하고 이를 구현하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.603-610
• /
• 2008

In this paper, we propose an efficient noise reduction algorithm for digital hologram during acquisition and transmission. The proposed algorithm segment a digital hologram with object region and background region after DCT. Then, we adopt a histogram transition method for object region and zero-value change method for background region. The experimental results show that our algorithm has beuer performance than a natural image denoising algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.11
• /
• pp.919-927
• /
• 2013

In this paper, we present a perception-based tone mapping technique using histogram modification for displaying high dynamic range image. HDR (high dynamic range) tone mapping algorithms are used to display HDR image on LDR (low dynamic rnage) devices. Although perception-based tone mapping methods provides better performance, it dose not always produce good results for a wide variety of images. The proposed method reduces dynamic range by using the perception-based tone mapping function and histogram modification. A derivative of perception-based tone mapping function is used as constraint function of histogram and additional compensation process is performed. This method not only improves contrast by adopting different constraints on each pixel value, but also preserves more visual details. In order to prevent over enhancement, histogram modification technique is applied. Furthermore, it can control the rate of image contrast using control parameters. Subjective and objective evaluations show that proposed algorithm is better than existing algorithms.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.97-105
• /
• 2016

We propose a face recognition method using the histograms of multi-resolution segments in order to effectively utilize the local information of faces. Since the variations in faces can occur in various sizes, the DFD method, which uses the histograms from the sub-regions of the same size, is not effective for obtaining local information of faces. In this paper, we first divide an image into several sub-regions and extract the DFD(Discriminant Face Descriptor) from each sub-region. By dividing each sub-region into several segments with multi-resolution and extracting histograms for each segment, we reduce the loss of local information in the process of recognition. The experimental results for the Yale B, AR, CAS-PEAL-R1 databases show that the proposed method improves the recognition performance compared to the existing DFD based method.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.376-379
• /
• 2008

This paper presents an image retrieval algorithm based on feature vector using color of histogram refinement for a faster and more efficient search in the process of content based image retrieval. First, we segment each of R, G, and B images from RGB color image and extract their respective histograms. Secondly, these histograms of individual R, G and B are divided into sixteen of bins each. Finally, we extract the maximum pixel values in each bins' histogram, which are calculated, compared and analyzed, Now, we can perform image retrieval technique using these maximum pixel value. Hence, the proposed algorithm of this paper effectively extracts features by comparing input and database images, making features from R, G and B into a feature vector table, and prove a batter searching performance than the current algorithm that uses histogram matching and ranks, only.