• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.817-826
• /
• 2002

In Korean dialogue honorification phenomenon may occur, an honorific pronoun may be used, and a subject or an object may be completely omitted when it can be recovered based on context. This paper proposes that in order to process Korean dialogue in which such distinct linguistic phenomena occur and to construct its representation structure we mark and use the following information explicitly, not implicitly : information about dialogue participants, information about the speech act of an utterance, information about the relative order of social status for the people involved in dialogue, and information flow among utterances of dialogue. In addition, this paper presents a method of marking and using such situational information and an appropriate representation structure of Korean dialogue. In this paper we set up Korean dialogue representation structure by modifying and extending DRT (Discourse Representation Theory) and SDRT (Segmented Discourse Representation Theory). Futhermore, this paper shows how to process Korean dialogue computationally and construct its representation structure by using Prolog programming language, and then applies such representation structure to spontaneous Korean dialogue to know its validity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.813-829
• /
• 2022

In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.8
• /
• pp.727-732
• /
• 2008

In this paper, the state-space representation of generalized complimentary filter is proposed. Complementary filter has the suitable structure to merge information from sensors whose frequency regions are complementary. First, the basic concept and structure of complementary filter is introduced. And then the structure of the generalized filter and its state-space representation are proposed. The state-space representation of complementary filter is able to design the complementary filter by applying modern filtering techniques like Kalman filter and $H_{\infty}$ filter. To show the usability of the proposed state-space representation, the design of Inertial Navigation System(INS) vertical channel damping loop using Global Positioning System(GPS) is described. The proposed GPS/INS damping loop lends the structure of Baro/INS(Barometer/INS) vertical channel damping loop that is an application of complementary filter. GPS altitude error has the non-stationary statistics although GPS offers navigation information which is insensitive to time and place. Therefore, $H_{\infty}$ filtering technique is selected for adding robustness to the loop. First, the state-space representation of GPS/INS damping loop is acquired. And next the weighted $H_{\infty}$ norm proposed in order to suitably consider characteristics of sensor errors is used for getting filter gains. Simulation results show that the proposed filter provides better performance than the conventional vertical channel loop design schemes even when error statistics are unknown.

• Korean journal of communication and information
• /
• v.20
• /
• pp.57-109
• /
• 2003

The purpose of this study was to investigate narrative structure and meaning structure of pictures In TV reporting. TV reporting consists of linguistic representation and pictural representation with which implicate specific meanings. In the past, the latter has been considered as a kind of added material to the former. But, todays, the latter has been considered more important than the latter in implicating specific meanings. Therefore, the author analysed pictures of TV reporting. Specifically, he selected KBS TV news coverage on '9 11 Disaster of U.S.' with various semiological research methods. Through this study, firstly, It was found that the pictural representation was organized with specific narrative structure applied for linguistic representation. Secondly, its meaning was more important than one of linguistic representation. Thirdly, its styles and structures tended to confine range, abstract and limitation of meanings presented by linguistic representation. Fourthly, images of the pictural representation could be interpreted with narrative structures of linguistic representation.

• Genomics & Informatics
• /
• v.11 no.3
• /
• pp.155-160
• /
• 2013

Structural information has been a major concern for biological and pharmaceutical studies for its intimate relationship to the function of a protein. Three-dimensional representation of the positions of protein atoms is utilized among many structural information repositories that have been published. The reliability of the torsional system, which represents the native processes of structural change in the structural analysis, was partially proven with previous structural alignment studies. Here, a web server providing structural information and analysis based on the backbone torsional representation of a protein structure is newly introduced. The web server offers functions of secondary structure database search, secondary structure calculation, and pair-wise protein structure comparison, based on a backbone torsion angle representation system. Application of the implementation in pair-wise structural alignment showed highly accurate results. The information derived from this web server might be further utilized in the field of ab initio protein structure modeling or protein homology-related analyses.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.61-68
• /
• 2003

In this paper, a representation method for structure information retrieval without schema and DTD of XML documents is presented. While existing researches have used DTD or schema to extract structure information, we extract structure information directly from XML documents. Especially the well-formed XML documents are only required to retrieve documents in the proposed method. Thus it can retrieve more general and various documents easily compared to the existing XML retrieval systems requiring DTD or schema. Experimental result indicates that the proposed method retrieves effectively structure information of XML documents independently to DTD information.

• Language and Information
• /
• v.8 no.2
• /
• pp.1-25
• /
• 2004

This paper examines two different approaches to resolving a theoretical problem which the bottom-up approach version of Discourse Representation Theory of Kamp et al. (2003) faces in dealing with anaphoric relations between pronouns and their potential antecedents in conditional sentences where consequent clauses precede their corresponding conditional clauses. In one of the approaches, every element is processed in the order of occurrence and conditional operators in a non-sentence-initial position cause the ongoing DR to split in two with the same index. The definition of accessibility is accordingly modified so that the right DR can be accessible from the left DR. In the other approach, a different type of discourse representation structure, K ${\Leftarrow}$ K, is introduced, which allows us to resolve the target problem without modifying accessibility proposed in Kamp et al. (2003). Compatibility of these two approaches with the bottom-up version of DRT is evaluated by examining their applicability to the analysis of quantified sentences where pronominal expressions precede generalized quantifiers.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.48-60
• /
• 2004

XML documents consist of elements that are basic units of information. When the structure of XML documents is changed dynamically, we need to update structure information efficiently without changing the information of the index structure for fast retrieval. In this paper, we propose a dynamic indexing model scheme that updates the index structure in real time as the structure of XML documents is changed by insertion and deletion of elements. Our dynamic indexing model consists of a structure information representation method and a dynamic index structure. The structure information representation method supports various types of structure retrievals. Our dynamic index structure processes various structural queries efficiently. We show through various experiments that our method outperforms existing ones in processing various types of queries such as content based queries, structural queries and hybrid queries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1702-1709
• /
• 1994

In the postprocessing of Hangul recognition system, the storage structure of contextual information is an important matter for the recognition rate and speed of the entire system. Trie in general is used to represent the context as word dictionary, but the memory space efficiency of the structure is low. Therefore we propose a new structure for word dictionary that has better space efficiency and the equivalent merits of trie. Because Hangul is a compound language, the language can be represented by phonemes or by characters. In the representation by phonemes(P-mode) the retrieval is fast, but the space efficiency is low. In the representation by characters(C-mode) the space efficiency is high, but the retrieval is slow. In this paper the two representation methods are combined to form a hybrid representation(H-mode). At first an optimal level for the combination is selected by two characteristic curves of node utilization and dispersion. Then the input words are represented with trie structure by P-mode from the first to the optimal level, and the rest are represented with sequentially linked list structure by C-mode. The experimental results for the six kinds of word set show that the proposed structure is more efficient. This result is based on the fact that the retrieval for H-mode is as fast as P-mode and the space efficiency is as good as C-mode.