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

Recently, studies of relevance feedback to increase the performance of image retrieval has been activated. In this Paper a new region weighting method in region based image retrieval with relevance feedback is proposed to reduce the semantic gap between the low level feature representation and the high level concept in a given query image. The new weighting method determines the importance of regions according to the spatial locations of regions in an image. Experimental results demonstrate that the retrieval quality of our method is about 18% in recall better than that of area percentage approach. and about 11% in recall better than that of region frequency weighted by inverse image frequency approach and the retrieval time of our method is a tenth of that of region frequency approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.760-762
• /
• 2004

본 논문에서 CT영상에서 간 영역을 자동적으로 분할할 수 있는 방법을 제안한다. 밝기의 특성을 이용하여 초기 관심 영역을 추출하기 위해 ATI(Automatic Threshold Intensity)기법을 사용하였다. 간 영역을 최종적으로 추출하기 위해 블럽 컬러링 기법을 사용하였다 기존 블럽 컬러링의 연산속도를 개선하기 위해서 Recoloring table을 이용하였다 제안된 방법을 이용하여 실험한 결과로 간 영역 추출의 성공률 90%를 얻었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.156-159
• /
• 2008

동영상 컨텐츠에 가시적 혹은 비가시적으로 정보를 삽입하는 기술을 동영상 워터마킹이라고 한다. 기하학적인 공격에 강인하도록 설계하기 위하여 특징점 기반의 워터마킹 기법을 바탕으로 하고, 동영상 특성에 맞는 움직임을 고려하여 움직임에 따른 영역을 설정하여 움직임이 많은 영역과 움직임이 적은 영역에 대해 각각 워터마크를 삽입/추출하는 시스템을 설계하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.417-420
• /
• 2003

요즘은 여러 멀티미디어 데이터가 기존의 PC에서 재생되는 것이 아니라 핸드폰, PDA와 같은 이동단말기에서 재생되기가 요구되고 있다 멀티미디어 데이터의 용량이 크고 시간에 종속적인 연속 미디어이기 때문에 데이터의 일부론 미리 가져와서 재생하는 Prefetch기법이 필요하다. 영역 분할 기법과 재생가능성 분석기법을 통해서 멀티미디어 프리젠테이션의 재생가능 여부를 분석하고 재생이 불가능한 프리젠테이션은 EPOB지정을 이용한 Prefetch기법을 적용한 후 재생가능 여부를 판단한다. Prefetch하는 시점과 데이터의 양을 지정함으로서 원활한 멀티미디어 프리젠테이션을 재생 할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.1-9
• /
• 2008

In this paper, to extract object regions in stereo image, we propose an enhanced algorithm that extracts objects combining both of brightness information and disparity information. The approach that extracts objects using both has been studied by Ping and Chaohui. In their algorithm, the segmentation for an input image is carried out using the brightness, and integration of segmented regions in consideration of disparity information within the previously segmented regions. In the regions where the brightness values between object regions and background regions are similar, however, the segmented regions probably include both of object regions and background regions. It may cause incorrect object extraction in the merging process executed in the unit of the segmented region. To solve this problem, in proposed method, we adopt the merging process which is performed in pixel unit. In addition, we perform the bi-directional stereo matching process to enhance reliability of the disparity information and supplement the disparity information resulted from a single directional matching process. Further searching for disparity is decided by edge information of the input image. The proposed method gives good performance in the object extraction since we find the disparity information that is not extracted in the traditional methods. Finally, we evaluate our method by experiments for the pictures acquired from a real stereoscopic camera.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.2B
• /
• pp.121-129
• /
• 2009

In this study, dam-break flows are simulated numerically by using an efficient and accurate Cartesian cut-cell mesh system. In the system, most of the computational domain is discretized by the Cartesian mesh, while peculiar grids are done by a cutcell mesh system. The governing equations are then solved by the finite volume method. An HLLC approximate Riemann solver and TVD-WAF method are employed to calculation of advection flux of the shallow-water equations. To validate the numerical model, the model is applied to some problems such as a steady flow convergence on an ideal bed, a steady flow over an irregular bathymetry, and a rectangular tank problem. The present model is finally applied to a simulation of dam-break flow on an experimental channel. The predicted water surface elevations are compared with available laboratory measurements. A very reasonable agreement is observed.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.4
• /
• pp.301-308
• /
• 2013

In this paper, an accuracy analysis of parallel method based on non-overlapping domain decomposition method is carried out. In this approach, proposed by Tak et al.(2013), the decomposed subdomains do not overlap each other and the connection between adjacent subdomains is determined via simple connective finite element named interfacial element. This approach has two main advantages. The first is that a direct method such as gauss elimination is available even in a singular problem because the singular stiffness matrix from floating domain can be converted to invertible matrix by assembling the interfacial element. The second is that computational time and storage can be reduced in comparison with the traditional finite element tearing and interconnect(FETI) method. The accuracy of analysis using proposed method, on the other hand, is inclined to decrease at cross points on which more than three subdomains are interconnected. Thus, in this paper, an accuracy analysis for a novel non-overlapping domain decomposition method with a variety of subdomain numbers which are interconnected at cross point is carried out. The cause of accuracy degradation is also analyze and establishment of countermeasure is discussed.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.3
• /
• pp.35-41
• /
• 2002

There are many image segmentation methods having been published as the results of research so far, but it is difficult to be partitioned to each similar range that should be extracted into the accurate parameters of image information on the images with noises. Also if it is used to fractal coding, according to amount of noise in image, the image segmentation leads to decreasing of the compression ratio. In this paper, we propose the new quad-tree image segmentation using the box-counting dimension which can estimate the effective image information parameters against the noise properties and apply this method to fractal image coding. As the result of simulation, we confirm that the image segmentation is improved to 31.10% for parameter detection of image information and compression ratio is enhanced to 38.93% for fractal image coding when tested on 10% Gaussian white noise image by the proposed quad-tree method compared with method using existing quad-tree. 

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.4
• /
• pp.21-27
• /
• 2007

The 3D Delaunay triangulation is the most widely used method for the mesh creation via the triangulation of a 3D point cloud. However, the method involves a heavy computational cost and, hence, in many interactive applications, it is not appropriate for surface triangulation. In this paper, we propose an efficient triangulation method to create a surface mesh from a 3D point cloud. We divide a set of object points into multiple subsets and apply the 2D Delaunay triangulation to each subset. A given 3D point cloud is cut into slices with respect to the OBB(Oriented Bounding Box) of the point set. The 2D Delaunay triangulation is applied to each subset producing a partial triangulation. The sum of the partial triangulations constitutes the global mesh. As a postprocessing process, we eliminate false edges introduced in the split steps of the triangulation and improve the results. The proposed method can be effectively applied to various image-based modeling applications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.206-208
• /
• 2000

본 논문은 칼라 정보와 움직임 정보를 이용한 객체 분할 기법의 설계에 대하여 소개한다. 객체 분할 알고리즘은 L*u*v 공간의 칼라 특성과 움직임 특성을 결합하여 설계하였다. 즉 공간 분할은 mean shift 칼라 클러스터링 알고리즘(color clustering algorithm)을 사용하여 중심 칼라 영역에 따라 동일한 칼라 지역으로 통합한다. 시간 분할은 움직임 검출을 위하여 affine six parameter 움직임 모델과 optical flow equation를 이용하여 움직임이 발생한 부분을 검출한다. 다음에 공간 분할과 시간 분할에 따라 결과를 통합하고 MAD(mean absolute difference)를 사용하여 객체를 추출하는 알고리즘을 설계하였다.