• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.281-292
• /
• 2004

Selectivity estimation for spatial query is very important process used in finding the most efficient execution plan. Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count, they can not get such effects in little memory space. Therefore, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results and has a flexible structure to react dynamic update. Our method is based on two techniques : (a) MinSkew partitioning algorithm which deal with skewed spatial datasets efficiently (b) Wavelet transformation which compression effect is proven. The experimental results showed that the MW Histogram which the buckets and wavelet coefficients ratio is 0.3 is lower relative error than MinSkew Histogram about 5%-20% queries, demonstrates that MW histogram gets a good selectivity in little memory.

• Resources Recycling
• /
• v.12 no.3
• /
• pp.46-53
• /
• 2003

Recycling of aluminum dross is an important issue in the secondary aluminum industries. In this study, aluminum dross generated in the domestic secondary aluminum industry was processed to use it as raw material for producing alumina refractories. Sample dross was classified according to its size. The dross smaller than 1 mm was leached with sodium hydroxide solution to extract the remained aluminum from the dross into the solution. and then aluminum hydroxide precipitate was recovered from the leach liquor. The waste residue in the leaching was washed, dried and roasted. Most remained metallic components in the residue was changed into oxide through the processes. The roasted dross was made into alumina castable refractories by mixing with aggregates and a binder. Bending strength of the tested castable specimen was over $25\;kg/\textrm{m}^2$ and compressive strength over $80\;kg/\textrm{cm}^2$, which satisfied the Korean Standard value respectively. From the results, it was suggested that this process could be applicable to recycling of aluminum dross.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.117-128
• /
• 2010

There are many researches related to a simulated shooting training system for replacing the real military and police shooting training. In this paper, we propose the point of impact from a simulated shooting target based on image processing instead of using a sensor based approach. The point of impact is extracted by analyzing the image extracted from the camera on the muzzle of a gun. The final shooting result is calculated by mapping the target and the coordinates of the point of impact. The recognition system is divided into recognizing the projection zone, extracting the point of impact on the projection zone, and calculating the shooting result from the point of impact. We find the vertices of the projection zone after converting the captured image to the binary image and extract the point of impact in it. We present the extracting process step by step and provide experiments to validate the results. The experiments show that exact vertices of the projection area and the point of impact are found and a conversion result for the final result is shown on the interface.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.594-603
• /
• 2007

This paper proposes a watermarking scheme for 3D CAD design drawing. In the proposed scheme, we embed binary watermarks into line, arc, and polygon face components that are the basic component of 3D CAD design drawing. The embedding target component can be selected randomly among three components or by the component distribution in drawing. In line components, a watermark bit is embedded into the ratio of the length of a target line and an average length of lines that are connected into a target line. Furthermore, a watermark bit is embedded into a curvature radius on the basis of a center point in a arc component and also is embedded into a ratio of two sides in a polygonal face component. Experimental results verified that the proposed watermarking has the robustness against Format conversion, rotation translation, scaling, cropping, and layer cutting and also SNR of watermarked component is about 39.89-42.50 dB.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.443-453
• /
• 2008

In this paper, the 1-level DWT(Discrete Wavelet Transform) coefficients of a binary logo image are used as the watermark. The watermark should be inserted in the same band which is equivalent to the host image when the watermark is inserted in the wavelet domain. This is the image fusion of the proposed watermarking method. The watermark is inserted in relatively significant coefficients after the insertion area is defined. The more significant coefficients have the important information because they are identified as the edge and major surface in images. The significant coefficients are defined when their absolute value exceeds the threshold. The standard deviation is used as the weight value of watermark insertion in order to strengthen the weight of the watermark insertion according to the value of the coefficients. The proposed watermarking method is an adaptive scheme, and the proposed two detection algorithms can be adaptively used when the watermarked image is distorted by cropping, filtering, or compression.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.741-747
• /
• 2012

In this paper, we propose a fast and robust framework for detecting and tracking multiple targets. The proposed system includes two modules: object detection module and object tracking module. In the detection module, we preprocess the input images frame by frame, such as gray and binarization. Next after extracting the foreground object from the input images, morphology technology is used to reduce noises in foreground images. We also use a block-based histogram analysis method to distinguish human and other objects. In the tracking module, color-based tracking algorithm and Kalman filter are used. After converting the RGB images into HSV images, the color-based tracking algorithm to track the multiple targets is used. Also, Kalman filter is proposed to track the object and to judge the occlusion of different objects. Finally, we show the effectiveness and the applicability of the proposed method through experiments.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.396-396
• /
• 2017

최근 기후변화에 효과적으로 대응하기 위해서 신뢰성 높은 설계홍수량을 산정할 필요성이 커지고 있다. 설계홍수량 산정법은 홍수빈도해석법과 설계강우법으로 대별된다. 홍수빈도해석법은 홍수량 자료에 대한 통계학적 빈도분석을 실시하여 확률홍수량을 산정하는 방법이다. 홍수빈도해석법은 관측된 자료를 활용하기 때문에 이론적으로 불확실성이 상대적으로 작은 장점을 가지고 있지만, 자료의 수가 적거나 시간에 따라 변하는 유역특성에 대한 불확실성을 함께 고려해야 한다. 관측 유량 자료가 없거나 적은 유역에서는 설계강우법이 주로 사용되고 있다. 설계강우법은 강우자료에 대해서 빈도분석을 실시하여 확률강우량을 산정한 후, 이를 강우-유출 모형에 적용하여 확률 홍수 수문곡선을 작성하고 첨두치를 확률홍수량으로 선정하는 방법이다. 그러나, 설계강우법도 강우-유출 모형에서 유역특성을 나타내는 매개변수 추정과정에서 불확실성을 내포하고 있기 때문에 추정된 홍수량 결과에 대한 불확실성을 감안해야 한다. 또한, 강우량과 홍수량의 발생빈도가 같다는 가정의 명확한 근거가 없다. 더욱이 두 가지 설계홍수량 산정법을 같은 유역에 적용하는 경우라도 종종 매우 다른 결과값을 나타낸다. 따라서, 본 연구에서는 국내 유역의 현실을 고려하여 설계강우법으로 산정된 확률홍수량을 홍수빈도해석법으로 산정된 확률홍수량을 변환할 수 있는 보정식을 개발하였다. 국내 9개의 댐 유역에서 확보된 일 단위 강우량 및 유출량 자료를 홍수빈도해석법과 설계강우법을 적용하여 대상 유역의 설계홍수량을 산정하였다. 그리고, 홍수빈도해석법으로 산정된 설계홍수량을 참값이라 가정한 후, 산정된 설계홍수량의 대상 유역별 오차율을 산정하였다. 이를 바탕으로 홍수빈도해석법과 설계강우법으로 산정된 설계홍수량 간의 관계를 회귀분석을 통하여 설계강우법으로 산정된 확률홍수량을 보정하는 관계식을 제시하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.97-107
• /
• 2006

In this paper, we present a method for the detection and recognition of rectangular markers from a camera image. It converts the camera image to a binary image and extracts contours of objects in the binary image. After that. it approximates the contours to a list of line segments. It finds rectangular markers by using geometrical features which are extracted from the approximated line segments. It normalizes the shape of extracted markers into exact squares by using the warping technique. It extracts feature vectors from marker image by using principal component analysis. It then calculates the distance between feature vector of input marker image and those of standard markers. Finally, it recognizes the marker by using minimum distance method. Experimental results show that the Proposed method achieves 98% recognition rate at maximum for 50 markers and execution speed of 11.1 frames/sec for images which contains eleven markers.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.1-11
• /
• 2012

Recently, we have seen several implementations that virtualize the ARM architecture. Since the current ARM architecture is not possible to be virtualized using the traditional technique called "trap-and-emulation", we usually detect all virtualization sensitive instructions during the run-time of a guest kernel and emulate them virtually rather than executing them directly. The emulation for virtualization is usually implemented either by binary translation or interpretation. Our research is about how to improve the performance of emulation for virtualization based on interpretation. The interpretation usually requires a few steps: instruction fetching, instruction decoding and instruction executing. In this paper, we propose a method that decodes all virtualization sensitive instructions during the compilation time of a guest kernel and reduces the time required for interpretation during the run time of the guest kernel. Our method provides both implementation simplicity and performance improvement of emulation for virtualization based on interpretation.

• Journal of Convergence for Information Technology
• /
• v.11 no.10
• /
• pp.20-26
• /
• 2021

In this paper, we studied the rotation angle estimation methods required for image alignment in an image recognition environment. In particular, a rotation angle estimation method applicable to a low specification embedded-based environment was proposed and compared with the existing method using complex moment. The proposed method estimates the rotation angle through similarity mathcing of the 1D projection profile along the radial axis after converting an image into polar coordinates. In addition, it is also possible to select a method of using vector sum of the projection profile, which more simplifies the calculation. Through experiments conducted on binary pattern images and gray-scale images, it was shown that the estimation error of the proposed method is not significantly different from that of complex moment-based method and requires less computation and system resources. For future expansion, a study on how to match the rotation center in gray-scale images will be needed.