• ETRI Journal
• /
• 제34권2호
• /
• pp.292-295
• /
• 2012

Beyond the simple keyword matching methods in contextual advertising, we propose a rich contextual matching (CM) model adopting a classification method for topic targeting and a query expansion method for semantic ad matching. This letter reports on an investigation into the empirical effects of the CM model by comparing the click-through rates (CTRs) of two practical online news advertising systems. Based on the evaluation results from over 100 million impressions, we prove that the average CTR of our proposed model outperforms that of a traditional model.

• Journal of Electrical Engineering and information Science
• /
• 제3권2호
• /
• pp.211-221
• /
• 1998

It is becoming apparent that stereo matching algorithms need much information from high level cognitive processes. Otherwise, conventional algorithms based on bottom-up control alone are susceptible to local minima. We introduce a system that consists of two levels. A lower level, using a usual matching method, is based upon the local neighborhood and a second level, that can integrate the partial information, is aimed at contextual matching. Conceptually, the introduction of bottom-up and top-down feedback loop to the usual matching algorithm improves the overall performance. For this purpose, we model the image attributes using a Markov random field (MRF) and thereupon derive a maximum a posteriori (MAP) estimate. The energy equation, corresponding to the estimate, efficiently represents the natural constraints such as occlusion and the partial informations from the other levels. In addition to recognition, we derive a training method that can determine the system informations from the other levels. In addition to recognition, we derive a training method that can determine the system parameters automatically. As an experiment, we test the algorithms using random dot stereograms (RDS) as well as natural scenes. It is proven that the overall recognition error is drastically reduced by the introduction of contextual matching.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1186-1191
• /
• 1991

This paper represents a new edge relaxation algorithm that enhances the noisy boundary informations in images. The proposed algorithm employes relaxation process that reduces or eliminates ambiguities of derivative operator response via contextual informations. The contextual informations are the neighborhood patterns of a central edge which are estimated using fuzzy pattern matching technique. The algorithm is developed on crack edges. Experimental results show that the proposed scheme is effective even for noisy images or low contrast images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2122-2140
• /
• 2020

Proper and precise embedding of commercial ads within Webpages requires Ad-hoc analysis and understanding of their content. By the successful implementation of this step, both publishers and advertisers gain mutual benefits through increasing their revenues on the one hand, and improving user experience on the other. In this research work, we propose a novel multi-level context-based ads serving approach through which ads will be served at generic publisher websites based on their contextual relevance. In the proposed approach, knowledge encoded in domain-specific and generic semantic repositories is exploited in order to analyze and segment Webpages into sets of contextually-relevant segments. Semantically-enhanced indexes are also constructed to index ads based on their textual descriptions provided by advertisers. A modified cosine similarity matching algorithm is employed to embed each ad from the Ads repository into one or more contextually-relevant segments. In order to validate our proposal, we have implemented a prototype of an ad serving system with two datasets that consist of (11429 ads and 93 documents) and (11000 documents and 15 ads), respectively. To demonstrate the effectiveness of the proposed techniques, we experimentally tested the proposed method and compared the produced results against five baseline metrics that can be used in the context of ad serving systems. In addition, we compared the results produced by our system with other state-of-the-art models. Findings demonstrate that the accuracy of conventional ad matching techniques has improved by exploiting the proposed semantically-enhanced context-based ad serving model.

• 아동학회지
• /
• 제19권2호
• /
• pp.185-200
• /
• 1998

This research examined the development in Korean children of the comprehension of complex sentences. The relative difficulty in comprehension of the temporal conjunctions "before" and "after" was investigated. The order of mention, contextual support, and syntactic appearance was controlled. The role of cognitive strategies and developmental changes in the comprehension of these conjunction was included in this study. Subjects were 90 preschool children between 3 and 5 years of age. The task was a sentence-picture matching problem having 3 types of sentences combining temporally with "before" or "after". The results were that developmental changes in comprehension of the temporal conjunctions "before' and "after" in Korean children depended on the order of mention, contextual support, and such syntactic factors as the position of the subject of the sentence. The importance of the consistency in the occurrence of events and the order of mention in the acquisition of complex sentences among Korean children is similar to the acquisition of complex sentences in other languages.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.248-268
• /
• 2018

The performance of smartphone applications are usually constrained in user interactions due to resource limitation and it promises great opportunities to improve the performance by exploring the smartphone built-in and embedded sensing techniques. However, heterogeneity in techniques, semantic gap between sensor data and usable context, and complexity of contextual situations keep the techniques from seamless integration. Relevant studies mainly focus on feasibility demonstration of emerging sensing techniques, which rarely address both general architectures and comprehensive technical solutions. Based on a proposed functional model, this investigation provides a general architecture to deal with the dynamic context for context-aware automation and decision support. In order to take advantage of the built-in sensors to improve the performance of mobile applications, an ontology-based method is employed for context modelling, linguistic variables are used for heterogeneous context presentation, and semantic distance-based rule matching is employed to customise functions to the contextual situations. A case study on mobile application authentication is conducted with smartphone built-in hardware modules. The results demonstrate the feasibility of the proposed solutions and their effectiveness in improving operational efficiency.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제7권2호
• /
• pp.69-76
• /
• 2018

참조 표현이란 장면 영상 내의 특정 물체를 가리키는 자연어 문장들을 의미한다. 본 논문에서는 참조 표현 이해를 위한 새로운 심층 신경망 모델을 제안한다. 본 논문에서 제안하는 모델은 장면 영상 내 대상 물체의 영역을 찾아내기 위해, 참조 표현에서 언급하는 대상 물체뿐만 아니라 보조 물체, 그리고 대상 물체와 보조 물체 사이의 관계까지 풍부한 정보를 활용한다. 또한 제안 모델에서는 영상 내 각 후보 영역의 적합도 계산을 위해 물체 적합도와 관계 적합도를 참조 표현의 문장 구조에 따라 결합한다. 따라서, 본 모델은 크게 총 네 가지 서브 네트워크들로 구성된다: 언어 표현 네트워크(LRN), 물체 정합 네트워크(OMN), 관계 정합 네트워크(RMN), 그리고 가중 결합 네트워크(WCN). 본 논문에서는 세 가지 서로 다른 참조 표현 데이터집합들을 이용한 실험을 통해, 제안 모델이 현존 최고 수준의 참조 표현 이해 성능을 보인다는 것을 입증하였다.

• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.236-241
• /
• 2009

분산되어 있거나 이기종의 데이터베이스 통합을 위해 많은 연구가 수행되었으며, 특히 데이터베이스 통합을 위해 데이터베이스의 스키마 매칭이 이슈가 되고 있다. 본 연구에서는 해양GIS 데이터베이스 통합을 위해 해양GIS 데이터베이스 구조를 XML 응용스키마로 변환하고 유사도 측정법과 relaxation labeling 기법을 이용하여 매칭 방법을 연구하였다. XML 응용스키마의 항목 간 유사도 측정은 각 항목이 가지고 있는 범주와 속성으로 계산하며, 각 항목이 계층간 의미적 연계관계를 적용하기 위하여 relaxation labeling 기법을 이용하여 초기 유사도 측정값에 반복적으로 적용하여 유사도 측정값의 변이를 측정하였다. 본 연구에서는 해양GIS 메타데이터 응용 스키마의 예시를 들어 알고리즘을 통한 매칭을 시도하였고, 실험 결과 알고리즘에 따른 초기 계산 값의 변화를 확인하였다.

• 대한의용생체공학회:의공학회지
• /
• 제17권4호
• /
• pp.507-514
• /
• 1996

The automated ECG diagnostic systems in hospital have a low P-wave detection capacity in case of some diseases like conduction block. The purpose of this study is to improve the P-wave detection ca- pacity using wavelet transform. The first procedure is to remove baseline drift by subtracting the median filtered signal from the original signal. The second procedure is to cancel ECG's QRS-T complex from median filtered signal to get P-wave candidate. Before we subtracted the templete from QRS-T complex, we estimated the best matching between templete and QRS-T complex to minimize the error. Then, wavelet transform was applied to confirm P-wave. In particular, haiti wavelet was used to magnify P-wave that consisted of low frequency components and to reject high frequency noise of QRS-T complex cancelled signal. Finally, p-wave was discriminated and confirmed by threshold value. By using this method, We can got the around 95.1% P-wave detection. It was compared with contextual information.

• 컴퓨터교육학회논문지
• /
• 제8권5호
• /
• pp.109-118
• /
• 2005

본 논문에서는 음악 데이터베이스의 멜로디와 사용자가 기술한 멜로디의 기하학적 구조를 비교하는 음악 검색 시스템을 제안하고 있다. 시스템은 멜로디의 구조적이고 상황적인 특징들을 분석하여 쿼리 멜로디와 데이터베이스의 멜로디가 일치성을 찾고자 한다. 검색 방법은 사전 처리 단계와 인식 단계로 이루어진 기하하적 해싱 알고리즘에 기반을 두고 있다. 사전 처리 단계 동안 구조적 특징을 찾기 위해서 음악의 멜로디를 여러 개의 프래그먼트(fragment)들로 분할하고 그 프래그먼트의 각 음의 높이 및 길이를 분석한다. 상황적 특징을 찾기 위해서 각 프래그먼트의 중심 화음을 찾는다. 인식 단계 동안 사용자가 입력한 쿼리 멜로디를 여러 개의 프래그먼트들로 분할하고 구조적이고 상황적 특성이 유사한 모든 프래그먼트들을 데이터베이스에서 검색한다. 투표는 각 프래그먼트에 대해 이루어지고 총 득표수가 최대인 음악이 쿼리 멜로디와 일치하는 멜로디를 갖는 음악이 된다. 이러한 접근 방법을 이용하여, 음악 데이터베이스에서 유사한 멜로디를 빠르게 찾을 수 있다. 또한 이 방법은 표절 음악을 감지하는데 적용될 수 있다.