• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.11
• /
• pp.2711-2722
• /
• 1993

Most of the current 2-D object recognition systems are model-based. In such systems, the representation of each of a known set of objects are precompiled and stored in a database of models. Later, they are used to recognize the image of an object in each instance. In this thesis, the approach method for the 2-D object recognition is treating an object boundary as a string of structral units and utilizing string matching to analyze the scenes. To reduce string matching time, models are rebuilt by means of fuzzy c-means clustering algorithm. In this experiments, the image of objects were taken at initial position of a robot from the CCD camera, and the models are consturcted by the proposed algorithm. After that the image of an unknown object is taken by the camera at a random position, and then the unknown object is identified by a comparison between the unknown object and models. Finally, the amount of translation and rotation of object from the initial position is computed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4198-4213
• /
• 2020

Data encryption, particularly application-level data encryption, is a common solution to protect data confidentiality and deal with security threats. Application-level encryption is a process in which data is encrypted before being sent to the database. However, cryptography transforms data and makes the query difficult to execute. Various studies have been carried out to find ways in order to implement a searchable encrypted database. In the current paper, we provide a new encrypting method and querying on encrypted data (ZSDB) for different data types. It is worth mentioning that the proposed method is based on secret sharing. ZSDB provides data confidentiality by dividing sensitive data into two parts and using the additional server as Dictionary Server. In addition, it supports required operations on various types of data, especially LIKE operator functioning on string data type. ZSDB dedicates the largest volume of execution tasks on queries to the server. Therefore, the data owner only needs to encrypt and decrypt data.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.159-164
• /
• 2005

In a computing environment connected pan-based computers and a server by Internet, This paper describes a language learning system evaluating the quality of a handwriting string. For the purpose of the system, this paper explains how to retrieve reference data from a database, how to evaluate the quality of a handwriting string using global and local features. The Proposed system can evaluate the qualify of a handwriting string as well as a handwriting character. The qualify can be computed in the case of different language between reference and input. Therefore, we expect that the system is very useful not only for training on handwriting but also learning a language.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.121-128
• /
• 2004

This paper proposes a quality evaluation system of a handwriting string written by electronic pen. For the purpose of the system, this paper describes how to retrieve reference data from a database, how to evaluate the quality of a handwiting string using global and local features. Also, it explains how to optionally recognize a grade of a handwriting string at using global and how to diagnose stroke order at using local. The quality can be evaluated in the case of different language between reference and input by the system. Therefore, we expect that the system is very useful not only for training on handwriting but also for learning a language.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1923-1932
• /
• 1998

This paper deals with a 2-D objects recognition algorithm. And in this paper, we present an algorithm which can reduce the computation time in model retrieval by means of hashing technique instead of using the binary~tree method. In this paper, we treat an object boundary as a string of structural units and use an attributed string matching algorithm to compute similarity measure between two strings. We select from the privileged strings a privileged string wIth mmimal eccentricity. This privileged string is treated as the reference string. And thell we wllstructed hash table using the distance between privileged string and the reference string as a key value. Once the database of all model strings is built, the recognition proceeds by segmenting the scene into a polygonal approximation. The distance between privileged string extracted from the scene and the reference string is used for model hypothesis rerieval from the table. As a result of the computer simulation, the proposed method can recognize objects only computing, the distance 2-3tiems, while previous method should compute the distance 8-10 times for model retrieval.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.270-275
• /
• 2007

Motion capture technology is widely used for manufacturing animation since it produces high quality character motion similar to the actual motion of the human body. However, motion capture has a significant weakness due to the lack of an industry wide standard for archiving and retrieving motion capture data. In this paper, we propose a framework to integrate, store and retrieve heterogeneous motion capture data files effectively. We define a standard format for integrating different motion capture file formats. Our standard format is called MCML (Motion Capture Markup Language). It is a markup language based on XML (eXtensible Markup Language). The purpose of MCML is not only to facilitate the conversion or integration of different formats, but also to allow for greater reusability of motion capture data, through the construction of a motion database storing the MCML documents. We propose a fuzzy string searching method to retrieve certain MCML documents including strings approximately matched with keywords. The method can be used to retrieve desired series of frames included in MCML documents not entire MCML documents.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.550-555
• /
• 2009

A violin plays an essential role among string instruments. It has an extremely strong expressive power that can be conveyed through beautiful timbre when played correctly. However, a beginner who attempts to play the violin will be most likely to face difficulties in placing his or her fingers on a specific point of the fingerboard or in bowing the violin on a specific string. In order to resolve this difficulty, the database of a professional violinist's bowing skills were inserted beforehand. By doing so, a beginner can emulate professional's violin by comparing his playing with the constructed database that is programmed in the computer. Accordingly, the results are displayed on the monitor after being evaluated by the performance evaluation function using a fuzzy logic.

• Herbal Formula Science
• /
• v.31 no.3
• /
• pp.171-182
• /
• 2023

Objectives : Saposhnikoviae Radix (SR) and Glehniae Radix (GR) have been frequently used in traditional medicine to treat diseases related to 'wind' syndrome, but there have been cases where it has been mixed in a state where the plant of origin is not clear. In this study, to select materials for conducting preclinical cerebral infarction research, the network pharmacology analysis method was used to select suitable medicinal materials for the study. Methods : In this study, a Traditional Chinese Medicine Systems Pharmacology Database and Analysis Platform (TCMSP) based network pharmacology analysis method was used, and oral bioavailability (OB), drug likeness (DL), Caco-2 and BBB permeability were utilized to select compounds with potential activity. For the values of each variable used in this study, OB ≥ 20%, DL ≥ 0.18, Caco-2 ≥ 0, and BBB ≥ -0.3 were applied, then networks of bioactive compounds, target proteins, and target diseases was constructed. STRING database was used to construct a protein-protein interaction network. Results : It was confirmed that SR rather than GR has various target proteins and target diseases based on network pharmacological analysis using TCMSP database. And it was analyzed that the bioactive compounds only in SR act more on neurovascular diseases, and both drugs are expected to be effectively used for cardiovascular diseases. Conclusions : In our future study, SR will be used in an ischemic stroke mouse model, and the mechanism of action will be explored focusing on apoptosis and cell proliferation.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.244-260
• /
• 2007

The operator LIKE of the database language SQL is a string pattern search operator. By providing the string pattern, the operator can identify column values that match with the string pattern. As a phonetic symbol, each Korean syllable is composed either of a leading sound and a medial sound or of a leading sound, a medial sound, and a trailing sound. As a search pattern of Korean syllables of the operator LIKE, in addition to the traditional Korean search pattern, this paper proposes a new search pattern that is based on leading sounds and medial sounds of Korean. With the new Korean search pattern, Korean syllables having specific leading sounds, specific medial sounds, or both specific leading sounds and medial sounds can be found. Formulating predicates equivalent with the new Korean search pattern by way of existing SQL operators is cumbersome and might cause the portability problem of applications depending on the underlying character set of the DBMS. This paper presents algorithms for the execution of the operator LIKE considering the new Korean search pattern based on the characters that are represented in KS X 1001, which is a Korean standard code for information interchange of Korean and Chinese.