• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1390-1393
• /
• 2013

인터페이스가 제한된 단말에서 정보 검색 서비스를 제공하는 경우, 검색 재현율보다는 정확도가 중요하다. 데이터를 쉽게 구조화할 수 있고 검색 정확도가 중요한 한정된 도메인에서는 시맨틱 검색 기술을 통해 강력한 정보 검색 서비스를 제공할 수 있지만, 사용자 키워드 질의를 시스템 질의로 변환하는 과정에서 다양한 해석들이 존재할 수 있기에 개선의 여지도 많다. 본 논문에서는 해석 정확도와 확장성을 동시에 향상시키기 위한 새로운 모델을 제안한다. 제안 모델은 공간의 구조와 요소들의 해석을 제한함으로써 중간 탐색 공간의 크기를 점진적으로 줄이면서 사용자의 검색 의도는 가능한 보존할 수 있다. 실제 데이터로 이루어진 대용량 지식을 이용해 다른 최신 기술과 비교하여 실험적 평가를 제시하였다.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.463-474
• /
• 2009

To analyze multidimensional data conveniently and efficiently, OLAP (On-Line Analytical Processing) systems or e-business are widely using views in a horizontal form to represent measurement values over multiple dimensions. These views can be stored as materialized views derived from several sources in order to support accesses to the integrated data. The horizontal views can provide effective accesses to complex queries of OLAP or e-business. However, we have a problem of occurring maintenance of the horizontal views since data sources are distributed over remote sites. We need a method that propagates the changes of source tables to the corresponding horizontal views. In this paper, we address incremental maintenance of horizontal views that makes it possible to reflect the changes of source tables efficiently. We first propose an overall framework that processes queries over horizontal views transformed from source tables in a vertical form. Under the proposed framework, we propagate the change of vertical tables to the corresponding horizontal views. In order to execute this view maintenance process efficiently, we keep every change of vertical tables in a differential file and then modify the horizontal views with the differential file. Because the differential file is represented as a vertical form, its tuples should be converted to those in a horizontal form to apply them to the out-of-date horizontal view. With this mechanism, horizontal views can be efficiently refreshed with the changes in a differential file without accessing source tables. Experimental results show that the proposed method improves average performance by 1.2$\sim$5.0 times over the existing methods.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.130-133
• /
• 2003

본 논문에서는 웨이블렛 압축 기반인 SPIHT 알고리즘의 압축효율을 개선시킬 수 있는 방법을 제안한다. 특히 초기치에서 발생될 수 있는 비트소비를 줄임으로써, 낮은 비트율에서 더욱 빠른 점진적인 전송을 구현하였다. 트리구조에 따르는 최적화 된 임계값 설정과 웨이블렛 변환된 계수들의 계수값을 통해 비트율 향상을 얻을 수 있었다.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.258-268
• /
• 2021

Point cloud content is immersive content that represents real-world objects with three-dimensional (3D) points. In the process of acquiring point cloud data or encoding and decoding point cloud data, the resolution of point cloud content could be degraded. In this paper, we propose a method of progressively enhancing the resolution of sequential point cloud contents through inter-frame registration. To register a point cloud, the iterative closest point (ICP) algorithm is commonly used. Existing ICP algorithms can transform rigid bodies, but there is a disadvantage that transformation is not possible for non-rigid bodies having motion vectors in different directions locally, such as point cloud content. We overcome the limitations of the existing ICP-based method by registering regions with motion vectors in different directions locally between the point cloud content of the current frame and the previous frame. In this manner, the resolution of the point cloud content with geometric movement is enhanced through the process of registering points between frames. We provide four different point cloud content that has been enhanced with our method in the experiment.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.568-576
• /
• 2001

Most of clustering algorithms data to degenerate rapidly on high dimensional spaces. Moreover, high dimensional data often contain a significant a significant of noise. which causes additional ineffectiveness of algorithms. Therefore it is necessary to develop algorithms adapted to the structure and characteristics of the high dimensional data. In this paper, we propose a clustering algorithms CLIP using the projection The CLIP is designed to overcome efficiency and/or effectiveness problems on high dimensional clustering and it is the is based on clustering on each one dimensional subspace but we use the incremental projection to recover high dimensional cluster and to reduce the computational cost significantly at time To evaluate the performance of CLIP we demonstrate is efficiency and effectiveness through a series of experiments on synthetic data sets.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.207-210
• /
• 2000

본 논문에서는 신호를 해석하는데 유용한 웨이블렛 변환을 적용하여 장면전환 요소 중 cut과 fade를 검출하는 알고리즘을 제안한다. 제안된 방법은 웨이블렛 저대역 부밴드로부터 각 프레임의 히스토그램을 구한 후 이전 프레임과 현재 프레임사이의 히스토그램 차를 구하여 이 값이 임계값 이상이면 급격한 장면전환(abrut shot transition)인 cut으로 분류한다. 다음으로 페이드인(fade in)이나 페이드 아웃(fade out)등 컷의 지점이 불분명한 점진적 장면전환(gradual scene transition)을 검출하기 위하여 고대역 부밴드에서 추출한 에지성분에 모멘트를 계산하여 인접한 프레임 사이의 변동율을 분석하여 값이 증가하면 페이드 인을 검출하고 반면에 감소하면 페이드 아웃을 검출하게된다. 성능평가를 위하여 실제의 비디오 분할에 적용한 결과 웨이블렛 적용 방법론이 매우 높은 Precision을 갖는다는 것을 알 수 있으며 윤곽정보에 모멘트 정보를 더함으로써 기존의 방법보다 정확한 페이드(fade) 구간을 검출할 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.11-11
• /
• 2001

기존의 웨이브릿 기반 프랙탈 압축 방법은 전 영역에 대하여 최적의 정의역을 탐색하므로, 부호화 과정에서 많은 탐색시간이 소요되는 단점이 있다. 그래서 본 논문에서는 웨이브릿 변환영역에서 SAS(Self Affine System) 기법과 다중 스케일 인자를 이용한 웨이브릿 변환 기반 프랙탈 영상 압축 방법을 제안한다. 웨이브릿 기반 영역에서 정의역과 치역을 구성하고, 각각의 치역 블럭에 대해 모든 정의역 블럭을 탐색하는 것이 아니라, 정의역 탐색과정이 필요 없는 SAS 기법을 도입하여 공간적으로 같은 위치에 있는 상위 레벨 블록을 정의역으로 선택한다 그래서 부호화 과정에서 곱셈 계산량을 감소시켜 고속 부호화를 가능하게 한다. 그리고 SAS 기법의 단점인 화질이 떨어지는 단점을 개선하기 위해, 각 레벨별로 서로 다른 스케일 인자를 사 용하여 화질을 개선한다. 그 결과 화질에는 영향을 미치지 않고 부호화 시간과 압축률이 개선되고, 점진적 전송이 가능한 알고리듬을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.41-49
• /
• 2012

This paper proposes a detection method of wipes including horizontal wipes with linear moving borders, such as horizontal or vertical wipes, Barn Doors, and Iris Rounds with circular moving borders. The suggested method first obtains a difference image between two adjacent frames, and extracts lines and circles by applying Hough transformation to the extracted difference image. Then, we detect wipe transitions by employing an evaluation function that analyzes the number of moving trajectories of lines or circles, their moving direction and magnitude. To evaluate the performance of the suggested algorithm, experimental results show that the proposed method can effectively detect wipe transitions with linear and circular moving borders rather than some existing methods.

• Journal of Convergence for Information Technology
• /
• v.8 no.2
• /
• pp.91-103
• /
• 2018

Refactoring is an engineering technique for securing the quality of existing legacy code, improving the internal structure without changing the functionality of the software. Along with the reuse of open source software, reuse of source code through programming language conversion is increasingly required due to technical or market requirements. In this situation, the refactoring technique including language conversion as well as energy efficiency is considered to be an important means for improving the productivity and the quality of embedded software development. This paper proposes a code refactoring technique that converts the grammar and structure of a programming language into those of a different language through comparison and mapping, in addition to the existing energy efficient refactoring technique. The use of the proposed refactoring technique can expect to improve the competitiveness of the product through rapid software development and quality improvement by coping with the environment change of the software development language and enhancing the reuse of the existing code.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.82-88
• /
• 2000

In this paper, We compare the Harr wavelet of the S+P transform with various integer coefficient filter banks and apply 9/7 ICFB to the wavelet transform. In addition, we propose a entropy-coding method that exploits the multiresolution structure and the feedback of the prediction error, and can efficiently compress the transformed image for progressive transmission. Simulation results are included to compare to the compression ratio using the S+P transform with different types of images.