• Journal of Internet Computing and Services
• /
• v.19 no.2
• /
• pp.1-7
• /
• 2018

Due to advances in DNA sequencing technologies, its medical value continues to grow. However, once genome data leaked, it cannot be revoked, and disclosure of personal genome information impacts a large group of individuals. Therefore, secure techniques for managing genomic big data should be developed. We first propose a privacy-preserving inner product protocol for large data sets using the homomorphic encryption of Gentry et al., and then we introduce an efficient privacy-preserving DNA matching protocol based on the proposed protocol. Our efficient protocol satisfies the requirements of correctness, confidentiality, and privacy.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.586-590
• /
• 2010

In this paper we formally define the linear detrending subsequence matching and propose its efficient index-based solution. To this end, we first present the notion of LD-windows. We eliminate the linear trend from a subsequence rather than each window itself and obtain LD-windows by dividing the subsequence into windows. Using the LD-windows we present a lower bounding theorem of the index-based solution and formally prove its correctness. Based on this lower bounding theorem, we then propose the index building and subsequence matching algorithms, respectively. Finally, we show the superiority of our index- based solution through experiments.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.110-116
• /
• 2014

Pattern matching algorithms are widely used in computer security systems such as computer networks, ubiquitous networks, sensor networks, and so on. However, the advances in information technology causes grow on the amount of data and increase on the computation complexity of pattern matching processes. Therefore, there is a strong demand for a novel high performance pattern matching algorithms. In light of this fact, this paper newly proposes a suffix tree based pattern matching algorithm. The suffix tree is constructed based on the suffix values of all patterns. Then, the shift nodes which informs how many characters can be skipped without matching operations are added to the suffix tree in order to boost matching performance. The proposed algorithm reduces memory usage on the suffix tree and the amount of matching operations by the shift nodes. From the performance evaluation, our algorithm achieved 24% performance gain compared with the traditional algorithm named as Wu-Manber.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1080-1087
• /
• 2005

Significant computations for full search (FS) motion estimation have been a big obstacle in real-time video coding and recent MPEG-4 AVC (advanced video coding) standard requires much more computations than conventional MPEG-2 for motion estimation. To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast elimination of impossible candidate motion vectors. We obtain faster elimination of inappropriate motion vectors using efficient matching units from localization of complex area in image data and dithering order based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination (PDE) algorithm, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.173-186
• /
• 2013

Web-based map services provide various geographic information that users want to get by continuous updating of data. Those map services provide different information for a geographic object respectively. It causes several problems, and most of all various information cannot be integrated and provided. To resolve the problem, this paper proposes a system which can integrate diverse geographic information and provide users rich geographic information. In this paper, a hybrid schema matching (HSM) algorithm is proposed and the algorithm is a mixture of the adapter-based semantic processing method, static semantic management-based approach, and dynamic semantic management-based approach. A comparative evaluation is described to show effectiveness of the proposed algorithm. The proposed algorithm in this paper improves the accuracy of schema matching because of registration and management of schemas of new semantic information. The proposal enables vocabulary-based schema matching using various schemas, and it thus also supports high usability. Finally, the proposed algorithm is cost-effective by providing the progressive extension of relationships between schema meanings.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.485-487
• /
• 2009

The Spatial Image contents of Geomorphology 3-D environment is focused by the requirement and importance in the fields such as, national land development plan, telecommunication facility management, railway construction, general construction engineering, Ubiquitous city development, safety and disaster prevention engineering. The currently used DEM system using contour lines, which embodies geographic information based on the 2-D digital maps and facility information has limitation in implementation in reproducing the 3-D spatial city. Moreover, this method often neglects the altitude of the rail way infrastructure which has narrow width and long length. This As the results, We confirmed the solutions of varieties application for railway facilities management using 3-D spatial image contents and database design. Also, I suggested that U-city using topographical modeling about matching methods of high density elevation value using 3-D aerial photo with laser data are best approach for detail stereo modeling and simulation.

• The Journal of the Korea Contents Association
• /
• v.18 no.5
• /
• pp.256-264
• /
• 2018

This study performed statistical matching using population census microdata and financial panel data. It generated the national basic data for simulation including income and property. Using this data the basic old-age pension, which is one of the biggest benefits, simulation was performed by applying the micro simulation methodology. In addition, we verified the coherence of the analysis results by comparing simulation basic data and financial panel data, basic old-age pension pilot simulation analysis results and basic old&-age pension actual beneficiary data.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2011.02a
• /
• pp.36-36
• /
• 2011

반도체 공정 신호는 주기 신호와 비주기 신호로 구분된다. 특정 패턴을 가지는 주기 신호는 해당 파라미터(parameter)에 대해서 패턴 매칭을 수행하여 관리하는 연구가 진행되고 있다. 반면 비주기 신호 데이터의 경우에는 패턴 매칭 방법을 수행할 수 없다. 또한 반도체 공정에서 얻을 수 있는 두 개 타입의 데이터는 그 파라미터가 방대하기 때문에 현재 실제 공정에 적용되고 있는 방식인 각각 하나의 파라미터에 대해 관리도(control chart)를 구성해 관리하는 것은 많은 비용과 시간의 낭비를 초래한다. 따라서 두 타입 데이터의 여러 개의 파라미터를 동시에 관측할 수 있고 파라미터간의 내재된 상관관계를 고려할 수 있는 장점을 가진 분석 기법에 대한 연구가 필요하다. 주기 신호의 이상탐지를 위한 기존 연구는 신호를 구간으로 나누어 구간별로 SPC 차트적용 시키는 방법, 각 시점 마다 측정되는 값을 하나의 변수로 고려하여 Hotelling's T square, PCA, PLS 등과 같은 다변량 통계 분석을 적용 시키는 방법들이 제시되어 왔다. 이러한 방법들은 다양한 특성을 가지는 주기신호를 분석하고 이상을 탐지 하는데 많은 한계점을 가진다. 이에 본 논문은 다양한 형태를 가지는 신호의 특성을 반영하여 자기구상지도를 기반으로 신호의 분류와 공정의 이상을 탐지하는 기법을 제안한다. 제안하는 기법은 자기구상지도를 이용하여 복잡한(고차원, 시계열) 신호를 2차원 상의 노드로 맵핑시킴으로써 신호의 특질(feature)을 추출하고 새로 표현된 신호의 특질을 기반으로 Logistic regression을 적용시켜 이상을 탐지 한다. 다양한 이상 상황을 가진 반도체 공정 신호를 사용하여 제안한 이상탐지 성능을 평가하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.72-75
• /
• 2020

조립 부품 이미지에 해당하는 3D CAD 모델 매칭 기술은 최근 로봇 조립 기술의 발전으로 필요성이 대두되고 있다. 이미지 기반 3 차원 모델 매칭 연구는 진행되어 왔지만 가구 부품 이미지와는 특성이 다른 RGB[5] 이미지나 스케치 이미지를 다루는[1] 접근들이었다. 딥러닝을 사용하는 스케치 이미지 기반 3 차원 물제 검색 연구에서는 대부분 3 차원 이미지를 다각도에서 렌더링한 view 이미지들에서 feature를 추출하고 pooling 하여 하나의 feature를 출력한다. 그러나 기존의 view pooling 방식은 단순한 평균 방식으로, 부품 이미지에 따른 view를 반영하기에는 한계가 있었다. 따라서 본 논문에서는 조립 부품 이미지 기반 3 차원 물체 검색을 위해 query 부품 이미지에 따라 다른 view 이미지에 집중할 수 있는 방식의 attentional view pooling을 제안한다. 또한 조립 부품 데이터의 특성 상 class 당 CAD 모델이 하나인 상황이므로 학습 데이터가 터무니없이 부족하여 이를 해결하기 위한 학습 데이터 증강 방법을 제안한다. 실험은 의자 부품 11가지에 대해 진행하였고 이를 통해 제안하는 방식의 성능을 입증하였다.