• Title/Summary/Keyword: Semantic Hierarchy

Search Result 95, Processing Time 0.025 seconds

Layered Video Content Modeling and Browsing (계층화된 비디오 내용 모델링 및 브라우징)

  • Bok, Kyoung-Soo;Lee, Nak-Gyu;Heo, Jeong-Pil;Yoo, Jae-Soo;Cho, Ki-Hyung;Lee, Byoung-Yup
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1115-1126
    • /
    • 2003
  • In this paper, we propose modeling method for video data that represents structural and semantic contents of video data efficiently. Also, a browsing method that helps users easily understand and play the contents of video data is presented. The proposed modeling scheme consists of three layers such as raw data layer, content layer and key frame layer The content layer represents logical hierarchy and semantic contents of video data. We implement two kinds of browsers for playing video data and providing video contents. The playing browser plays video data and Presents the information of currently playing shot. The content browser allows users to browse raw data, structural information and semantic contents of video data.

Semi-automatic Ontology Modeling for VOD Annotation for IPTV (IPTV의 VOD 어노테이션을 위한 반자동 온톨로지 모델링)

  • Choi, Jung-Hwa;Heo, Gil;Park, Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.7
    • /
    • pp.548-557
    • /
    • 2010
  • In this paper, we propose a semi-automatic modeling approach of ontology to annotate VOD to realize the IPTV's intelligent searching. The ontology is made by combining partial tree that extracts hypernym, hyponym, and synonym of keywords related to a service domain from WordNet. Further, we add to the partial tree new keywords that are undefined in WordNet, such as foreign words and words written in Chinese characters. The ontology consists of two parts: generic hierarchy and specific hierarchy. The former is the semantic model of vocabularies such as keywords and contents of keywords. They are defined as classes including property restrictions in the ontology. The latter is generated using the reasoning technique by inferring contents of keywords based on the generic hierarchy. An annotation generates metadata (i.e., contents and genre) of VOD based on the specific hierarchy. The generic hierarchy can be applied to other domains, and the specific hierarchy helps modeling the ontology to fit the service domain. This approach is proved as good to generate metadata independent of any specific domain. As a result, the proposed method produced around 82% precision with 2,400 VOD annotation test data.

An Indexing Technique for Object-Oriented Geographical Databases (객체지향 지리정보 데이터베이스를 위한 색인기법)

  • Bu, Ki-Dong
    • Journal of the Korean association of regional geographers
    • /
    • v.3 no.2
    • /
    • pp.105-120
    • /
    • 1997
  • One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

  • PDF

Cooperative Query Answering Using the Metricized Knowledge Abstraction Hierarchy (계량화된 지식 추상화 계층을 이용한 협력적 질의 처리)

  • Shin, Myung-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.87-96
    • /
    • 2006
  • Most conventional database systems support specific queries that are concerned only with data that match a query qualification precisely. A cooperative query answering supports query analysis, query relaxation and provides approximate answers as well as exact answers. The key problem in the cooperative answering is how to provide an approximate functionality for alphanumeric as well as categorical queries. In this paper, we propose a metricized knowledge abstraction hierarchy that supports multi-level data abstraction hierarchy and distance metric among data values. In order to facilitate the query relaxation, a knowledge representation framework has been adopted, which accommodates semantic relationships or distance metrics to represent similarities among data values. The numeric domains also compatibly incorporated in the knowledge abstraction hierarchy by calculating the distance between target record and neighbor records.

  • PDF

On the Pinocchio Paradox (피노키오 역설에 대하여)

  • Song, Hasuk
    • Korean Journal of Logic
    • /
    • v.17 no.2
    • /
    • pp.233-253
    • /
    • 2014
  • The Pinocchio paradox that Eldridge-Smith suggested is a version of the semantic paradox. But it is unique in the sense that this paradox does not contain a semantic predicate. Tarski's solution which appeals to the hierarchy of language and Kripke's para-completeness which accepts the third truth value cannot solve the Pinocchio paradox. This paper argues that Eldridge-Smith's trial to criticize semantical dialetheism is not successful and that the paradox implies the rule of the truth predicate is inconsistent. That is, the proper diagnosis to this paradox is that the Pinocchio principle should be considered to be potentially inconsistent, which suggests that semantic paradoxes such as the liar paradox arise because the rule of the truth-predicate is inconsistent. The Pinocchio paradox teaches us that consistent view of truth cannot be successful to solve the semantic paradoxes and that we should accept the inconsistent view of truth.

  • PDF

Evaluation Descriptions and Dimension on the Sensibility of Internet Fashion Shopping Mall (인터넷 패션 쇼핑몰에 대한 감성단어추출과 평가차원)

  • 박현희;구양숙
    • Journal of the Korean Home Economics Association
    • /
    • v.40 no.1
    • /
    • pp.135-146
    • /
    • 2002
  • The Purpose of this study was to identify the sensibility elements and the evaluative dimensions of internet fashion shopping mall to supply optimal experience to the customer. First, association words for internet fashion shopping mall by open-ended method and sensibility-expression-adjective feeling as navigating personally 57 shopping mall dealing with fashion products were collected. Collected adjectives were ranked after making index by frequency and diversity. Then, correlation analysis was executed to extract independent adjective and their opposite words. Semantic differential scale was made for internet-fashion-shopping-mall-evaluation. After preliminary investigation with this scale, factor analysis was implemented. 12 sensibility evaluation words were extracted. Then, 200 subjects evaluated satisfaction degree for 8 selected shopping mall. To explain the hierarchy of internet fashion shopping mall, cluster analysis was applied. The understanding of sensibility element and evaluative dimensions of internet fashion shopping mall can be utilized efficiently as basic materials when marketer plans internet shopping mall design and makes marketing strategy.

Multiple Case Marking Constructions in Korean Revisited

  • Ryu, Byong-Rae
    • Language and Information
    • /
    • v.17 no.2
    • /
    • pp.1-27
    • /
    • 2013
  • This paper presents a unified approach to multiple nominative and accusative constructions in Korean. We identify 16 semantic relations holding between two consecutive noun phrases (NPs) in multiple case marking constructions, and propose each semantic relation as a licensing condition on double case marking. We argue that the multiple case marking constructions are merely the sequences of double case marking, which are formed by dextrosinistrally sequencing the pairs of the same-case marked NPs of same or different type. Some appealing consequences of this proposal include a new comprehensive classification of the sequences of same-case NPs and a straightforward account of some long standing problems such as how the additional same-case NPs are licensed, and in what respects the multiple nominative marking and the multiple accusative marking are alike and different from each other.

  • PDF

An Approach for Error Detection in Ontologies Using Concept Lattices (개념격자를 이용한 온톨로지 오류검출기법)

  • Hwang, Suk-Hyung
    • Journal of Information Technology Services
    • /
    • v.7 no.3
    • /
    • pp.271-286
    • /
    • 2008
  • The core of the semantic web is ontology, which supports interoperability among semantic web applications and enables developer to reuse and share domain knowledge. It used a variety of fields such as Information Retrieval, E-commerce, Software Engineering, Artificial Intelligence and Bio-informatics. However, the reality is that various errors might be included in conceptual hierarchy when developing ontologies. Therefore, methodologies and supporting tools are essential to help the developer construct suitable ontologies for the given purposes and to detect and analyze errors in order to verify the inconsistency in the ontologies. In this paper we propose a new approach for ontology error detection based on the Concept Lattices of Formal Concept Analysis. By using the tool that we developed in this research, we can extract core elements from the source code of Ontology and then detect some structural errors based on the concept lattices. The results of this research can be helpful for ontology engineers to support error detection and construction of "well-defined" and "good" ontologies.

English Absolutes, Free Adjuncts, and WITH: A Constructional Analysis

  • Yoo, Eun-Jung
    • Language and Information
    • /
    • v.12 no.2
    • /
    • pp.49-75
    • /
    • 2008
  • English absolutes and free adjuncts, despite their abridged syntactic forms, function as full subordinating adverbial clauses, with their semantic roles varied according to the interpretation of the matrix clauses. This paper investigates how to represent the syntactic structures and semantic variability of absolutes and free adjuncts in a unified way, accounting for overlapping properties among various subtypes of the constructions on the one hand, and differences on the other. In the proposed analysis, the clausal properties of absolutes and free adjuncts are captured by the subject selecting property and the clausal meaning associated with a predicative phrase, thus not calling for a null verb or complementizer. In classifying and defining diverse subtypes of the constructions via type constraints, the present work also provides an account of different uses of with involved in absolutes and free adjuncts.

  • PDF

A hierarchical semantic video object racking algorithm using mathematical morphology

  • Jaeyoung-Yi;Park, Hyun-Sang;Ra, Jong-Beom
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1998.06b
    • /
    • pp.29-33
    • /
    • 1998
  • In this paper, we propose a hierarchical segmentation method for tracking a semantic video object using a watershed algorithm based on morphological filtering. In the proposed method, each hierarchy consists of three steps: First, markers are extracted on the simplified current frame. Second, region growing by a modified watershed algorithm is performed for segmentation. Finally, the segmented regions are classified into 3 categories, i.e., inside, outside, and uncertain regions according to region probability values, which are acquired by the probability map calculated from a estimated motion field. Then, for the remaining uncertain regions, the above three steps are repeated at lower hierarchies with less simplified frames until every region is decided to a certain region. The proposed algorithm provides prospective results in video sequences such as Miss America, Clair, and Akiyo.

  • PDF