• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.970-973
• /
• 2008

본 논문은 대체 서비스 디스커버리를 위한 효과 기반 명세 모델과 매칭 방식을 제안한다. 효과기반이라 함은 시맨틱 웹의 IOPE 모델에서 효과(effect)를 재 정의 하여 서비스 및 디바이스를 명세하는데 사용한다는 말이다. 여기서 효과는 인간이 인지할 수 있는 오감을 사용하며, 오감의 인지는 센서를 통하여 한다. 오감을 이용하여 서비스를 탐색 함으로써, 우리는 서비스의 가용성을 높일 수 있다. 매칭은 서비스를 세 가지의 타입으로 나눈 후 각 타입에 해당하는 항목별로 유사도를 계산하고 각 항목들의 합으로 최종 유사도를 도출해 낸다. 본 연구에서 제안한 효과 기반 서비스 디스커버리는 기존의 시맨틱 서비스 디스커버리보다 서비스의 가용성을 높여 줄 것으로 기대한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.177-186
• /
• 2005

In this Paper. we propose vision-based camera localization technique using 3D information which is created by mapping of DEM and mountain image. Typically, image features for localization have drawbacks, it is variable to camera viewpoint and after time information quantify increases . In this paper, we extract invariance features of geometry which is irrelevant to camera viewpoint and estimate camera extrinsic Parameter through accurate corresponding Points matching by Proposed similarity evaluation function and Graham search method we also propose 3D information creation method by using graphic theory and visual clues, The Proposed method has the three following stages; point features invariance vector extraction, 3D information creation, camera extrinsic Parameter estimation. In the experiments, we compare and analyse the proposed method with existing methods to demonstrate the superiority of the proposed methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.966-974
• /
• 1999

완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.152-161
• /
• 2011

This study examines characteristics of sports movies between Korea and the U.S. Especially, this paper focuses on three different characteristics including structural, internal characteristics and performance of sports movies. The major results are as follows: firstly, there were similarities between two countries in terms of opening year, genre, classification but movie subjects. More specifically, movie opening years were not related to global sports events. In addition, most sports movies were mainly produced by human genre and all age movie classification. However, in terms of sports subjects, although Korean movies were constructed by baseball game, the U.S. movies were based on football game. Secondly, there were also similarities between both sports movies in terms of external characteristics such as gender difference of hero or heroine, internal story structure and their story sources. Most of sports movies have used real stories as movie story. Finally, although many of the U.S. sports movies recorded the high degree of expenditures, three movies recorded the high degree of movie consumption.

• Reproductive and Developmental Biology
• /
• v.30 no.3
• /
• pp.169-174
• /
• 2006

To search of a new porcine pheromonal odorants, the comparative molecular similarity indices analysis(CoMSIA) between porcine odorant binding protein(pOBP) as receptor and ligands of green odorants 2-(Cyclohexyloxy)tetrahydrofurane derivatives as substrate molecule were conducted and disscused quantitatively. In the optimized CoMSIA model(I-AI) with chirality($I:\;C_{1'}(R),\;C_2(S)$) in substrate molecules and atom based fit alignment(AE) of the odorants the statistical PLS results showed the best predictability of the binding affinities based on the LOO cross-validated value ${r^2}_{cv.}\;(q^2=0.856)$ and non cross-validated conventional coefficient(${r^2}_{ncv.}=0.964)$). The structural distinctions of the highest active molecules were able to understand from the interaction between pOBP and green odorants in the contour maps with CoMSIA model.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.362-371
• /
• 2005

Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.

• Journal of The Korean Association For Science Education
• /
• v.40 no.1
• /
• pp.51-60
• /
• 2020

In this study, we propose research methods to explore the nature of earth science by applying the phenomenological approach and NOS-family resemblance approach based on literature review. The phenomenological approach exploring the nature of earth science is a method of collecting, analyzing and synthesizing multifaceted features of earth science from intuitive sensory phenomena without prejudice. As a way of exploring the nature of earth science from a phenomenological point of view, we propose the NOS-family resemblance approach to the NOS. This approach provides a comprehensive explanation of NOS by combining the characteristics shared by different areas of science with distinct differences. Applying this method to exploring the nature of earth science, we can identify both domain-general and domain-specific characteristics that make sub-areas of earth science a 'family.' For example, through the networking of features shared by such sub-areas as geology, atmospheric science, oceanography, astronomy, earth system science, etc., we can extract the family-resemblance characteristics that make these sub-areas a family called earth science. Through these approaches to the nature of earth science, the richness, complexity, and dynamic nature of earth science can be revealed as a whole. In addition, we will be able to grasp the change in the sub-areas that constitute the earth science, which in turn changes the nature of earth science, and to contribute to establishing the status and development system of earth science as a school subject.

• Korean Journal of Microbiology
• /
• v.49 no.2
• /
• pp.211-214
• /
• 2013

Bisphenol A (BPA) is a highly hazardous component to human since it is regarded as one of endocrine disruptors. For the analysis and/or removal of BPA, the searching for the specific ligand with a selective affinity to target BPA is required. In order to find the peptide moiety that specifically binds to BPA, the ultrasound-assisted biopanning was carried out with a phage-displayed peptide library expressing constrained heptamer. After six rounds of positive screening against BPA particles followed by the negative screening against the surface of eppendorf tube, the peptide sequence (CysLysSerLeuGluAsnSerTyrCys) with affinity to BPA was screened based on the order of frequency from the screened phage clones. To further verify the specificity of screened peptide sequence, the cross-binding affinity of the phage peptide toward BPA analogues such as Bisphenol S (BPS) and Bisphenol F (BPF) was also assessed, where the selected phage peptide showed a higher affinity to BPA over BPS and BPF.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.72-78
• /
• 2017

Prior art search is a core process of technology management performed by inventors and applicants, patent examiners, and employees in the patent industry. As a result of insufficient academic research on a systematic prior art search methodology, the process has been often carried out depending on the subjective judgment of researchers. Previous studies on exploring prior arts based on semantics have also have the risk of underestimating the similarity of major prior arts due to the nature of patent documents where the same technical ideas are expressed in various terms. In this study, we propose an effective prior art search methodology based on hierarchical citation analysis, which provides a clear criterion for selecting core prior arts by calculating weights according to the relative importance of the collected patents. In order to verify the feasibility of the proposed methodology, a case study was conducted to explore the core prior art of one patent in the display field. As a result, 10 core prior art candidates were selected out of the 206 precedent patents.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.91-99
• /
• 2019

Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.