• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.139-142
• /
• 2001

컴퓨터 이미지처리는 여러 분야에서 응용되고 있는데 어떤 특성을 만족하는 객체들의 계수를 자동으로 분류시키는 생물학분야, 편지봉투나 일반양식에 인쇄되어 있는 글자를 자동으로 검출하고 인식하며 초음파검사 혹은 X-Ray 촬영에서 이미지를 획득하여 향상시키는 의료분야, 지문 및 얼굴인식 등에 이용되고 있다. 최근 몇 년 동안 이미지인식, 형태론, 이미지데이터 압축에 관한 연구가 진전되면서 본 연구에서 형태론적인 기법을 사용하여 문자인식을 위한 전처리 혹은 후처리 단계에서 사용되는 이미지향상을 위해서 침식, 골격화의 2단계를 적용하여 기종의 연구 방법과 비교하여 이미지획득 시간을 줄이고 이미지를 향상시켜 문자를 인식하는 알고리즘을 제안한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.427-428
• /
• 2016

본 논문은 차량 간 통신을 이용해 차량 간 거리를 줄임으로써 도로의 용량을 증가시키기 위한 효과적인 방법을 제공한다. 차량 간 거리는 차량의 제동능력에 의해 결정된다. 편대운항시스템의 차량 간 통신을 이용해 제동능력에 관련된 계수를 공유함으로써 서로간의 제동거리를 알 수 있다. 따라서 서로의 제동능력을 확인 후 차량 간 최소 거리를 측정하여 도로의 용량을 증가시킬 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.705-708
• /
• 2023

다중밀집 사고를 사전에 방지하기 위해 군중 밀집도를 정확하게 파악하는 것은 중요하다. 기존 방법 중 일부는 군중 계수를 기반으로 군중 밀집도를 추정하거나 원근 왜곡이 있는 데이터를 그대로 학습한다. 이 방식은 물체의 거리에 따라 크기가 달라지는 원근 왜곡에 큰 영향을 받는다. 본 연구는 보행자 깊이 정보를 이용한 군중 밀집도 알고리즘을 제안한다. 보행자의 깊이 정보를 계산하기 위해 편차가 적은 머리 크기를 이용한다. 머리를 탐지하기 위해 OC-Sort를 학습모델로 사용한다. 탐지된 머리의 경계박스 좌표, 실제 머리 크기, 카메라 파라미터 등을 이용하여 보행자의 깊이 정보를 추정한다. 이후 깊이 정보를 기반으로 밀도 맵을 추정한다. 제안 알고리즘은 혼잡한 환경에서 객체의 위치와 밀집도를 정확하게 분석하여 군중밀집 사고를 사전에 방지하는 지능형 CCTV시스템의 기반 기술로 활용될 수 있으며, 더불어 보안 및 교통 관리 시스템의 효율성을 향상하는 데 중요한 역할을 할 것으로 기대한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.9-20
• /
• 2000

In this paper we compare two frequency domain digital watermarking methods for digital Images, namely DCT(Discrete Cosine Transform) based and DFT(Discrete Fourier Transform) based methods. Unlike DCT coefficients, which always have real values, DFT coefficients normally have complex values Therefore, the DFT coefficients have amplitude and phase components Among them, the phase components are known to carry more Important information for the Images. So, we insert the watermark to the phase of the DFT coefficients only This DFT watermarking method is compared with the conventional DCT based watermarking method for the object-based watermarking problem. Experimental results show that the DFT-phase based method IS more robust to general Image processing attacks including resize, lossy compression(JPEG), blurring and median filtering. On the other hand, the DCT based method is more robust to the malicious attack which inserts different watermarks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.297-304
• /
• 2004

In this paper, a mesh simplification algorithm based on wavelet transform and 2D planar sampling is proposed for efficient handling of 3D objects in computer applications. Since 3D vertices are directly transformed with wavelets in conventional mesh compression and simplification algorithms, it is difficult to solve tiling optimization problems which reconnect vertices into faces in the synthesis stage highly demanding vertex connectivities. However, a 3D mesh is sampled onto 2D planes and 2D polygons on the planes are independently simplified in the proposed algorithm. Accordingly, the transform of 2D polygons is very tractable and their connection information Is replaced with a sequence of vertices. The vertex sequence of the 2D polygons on each plane is analyzed with wavelets and the transformed data are simplified by removing small wavelet coefficients which are not dominant in the subjective quality of its shape. Therefore, the proposed algorithm is able to change the mesh level-of-detail simply by controlling the distance of 2D sampling planes and the selective removal of wavelet coefficients. Experimental results show that the proposed algorithm is a simple and efficient simplification technique with less external distortion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.649-658
• /
• 2006

Recently, Software Development was applied to new-approach methods as a various form : client-server system and web-programing, object-orient concept, distributed development with a network environments. On the other hand, it be concerned about the distributed development technology and increasing of object-oriented methodology. These technology is spread out the software quality and improve of software production, reduction of the software develop working. Futures, we considered about the distributed software development technique with a many workstation. In this paper, we discussed optimal release problem based on a stochastic differential equation model for the distributed Software development environments. In the past, the software reliability applied to quality a rough guess with a software development process and approach by the estimation of reliability for a test progress. But, in this paper, we decided to optimal release times two method: first, SRGM with an error counting model in fault detection phase by NHPP. Second, fault detection is change of continuous random variable by SDE(stochastic differential equation). Here, we decide to optimal release time as a minimum cost form the detected failure data and debugging fault data during the system test phase and operational phase. Especially, we discussed to limitation of reliability considering of total software cost probability distribution.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.481-494
• /
• 2008

In this paper we propose Fourier magnitudes based privacy preserving clustering on time-series data. The previous privacy-preserving method, called DFT coefficient method, has a critical problem in privacy-preservation itself since the original time-series data may be reconstructed from privacy-preserved data. In contrast, the proposed DFT magnitude method has an excellent characteristic that reconstructing the original data is almost impossible since it uses only DFT magnitudes except DFT phases. In this paper, we first explain why the reconstruction is easy in the DFT coefficient method, and why it is difficult in the DFT magnitude method. We then propose a notion of distance-order preservation which can be used both in estimating clustering accuracy and in selecting DFT magnitudes. Degree of distance-order preservation means how many time-series preserve their relative distance orders before and after privacy-preserving. Using this degree of distance-order preservation we present greedy strategies for selecting magnitudes in the DFT magnitude method. That is, those greedy strategies select DFT magnitudes to maximize the degree of distance-order preservation, and eventually we can achieve the relatively high clustering accuracy in the DFT magnitude method. Finally, we empirically show that the degree of distance-order preservation is an excellent measure that well reflects the clustering accuracy. In addition, experimental results show that our greedy strategies of the DFT magnitude method are comparable with the DFT coefficient method in the clustering accuracy. These results indicate that, compared with the DFT coefficient method, our DFT magnitude method provides the excellent degree of privacy-preservation as well as the comparable clustering accuracy.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.339-349
• /
• 2008

We present a novel method to estimate the light source direction and relight a face texture image of a single 3D model under arbitrary unknown illumination conditions. We create a virtual irradiance sphere to detect the light source direction from a given illuminated texture image using both normal vector mapping and weighted bilinear interpolation. We then induce a relighting equation with estimated ambient and diffuse coefficients. We provide the result of a series of experiments on light source estimation, relighting and face recognition to show the efficiency and accuracy of the proposed method in restoring the shading and shadows areas of a face texture image. Our approach for face relighting can be used for not only illuminant invariant face recognition applications but also reducing visual load and Improving visual performance in tasks using 3D displays.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1258-1268
• /
• 2004

We propose a new fast, algorithm which is used for detecting frontal face in the frequency domain based on human skin-color using OCT coefficient of dynamic image compression and skin color information. The region where each pixel has a value of skin-color were extracted from U and V value based on DCT coefficient obtained in the process of Image compression using skin-color map in the Y, U, V color space A morphological filter and labeling method are used to eliminate noise in the resulting image We propose the algorithm to detect fastly human face that estimate the directional feature and variance of luminance block of human skin-color Then Extraction of face was completed adaptively on both background have the object analogous to skin-color and background is simple in the proposed algorithm The performance of face detection algorithm is illustrated by some simulation results earned out on various races We confined that a success rate of 94 % was achieved from the experimental results.

• Broadcasting and Media Magazine
• /
• v.11 no.4
• /
• pp.118-131
• /
• 2006

With rapid development in ultra fast communication and digital multimedia, the realistic broadcasting technology, that can stimulate five human senses beyond the conventional audio-visual service is emerging as a new generation broadcasting technology. In this paper, we introduce a haptic broadcasting system and related core system and component techniques by which we can 'touch and feel' objects in an audio-visual scene. The system is composed of haptic media acquisition and creation, contents authoring, in the haptic broadcasting, the haptic media can be 3-D geometry, dynamic properties, haptic surface properties, movement, tactile information to enable active touch and manipulation and passive movement following and tactile effects. In the proposed system, active haptic exploration and manipulation of a 3-D mesh, active haptic exploration of depth video, passive kinesthetic interaction, and passive tactile interaction can be provided as potential haptic interaction scenarios and a home shopping, a movie with tactile effects, and conducting education scenarios are produced to show the feasibility of the proposed system.