• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.665-674
• /
• 2007

Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. Therefore, this paper present analogical matching techniques for the reuse of object models and patterns. And this paper have suggested the object model and the design patterns as reusable components and the representation techniques to store them. Namely, the contents of the paper are as follows. Analogical matching functions to retrieve analogous components from reusable libraries. And the representation of reusable components to be stored in the library in order to support the analogical matching.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.2134-2145
• /
• 1997

We present a framework of an intelligent design system for embodiment design of machine tools which can support efficiently and systematically the machine design by utilizing design knowledge such as objects(part), know-how, public, evaluation, and procedures. The design knowledge of machining center has been accumulated through interview with design experts of machine tool companies. The processes of embodiment design of machining center are established and represented by the IDEF0 model from the field surveys. We also introduce a hybrid knowledge representation so that the system can easily deal with various and complicated design knowledge. The intelligent design system is being developed on the basis of object-oriented programming, and all parts of a design object, machining center, are also classified by the object-oriented modeling.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.65-68
• /
• 2000

This paper describes an approach for extracting invariant features using a view-based representation and recognizing an object with a high speed search method in FLIR. In this paper, we use a reformulated eigenspace technique based on robust estimation for extracting features which are robust for outlier such as noise and clutter. After extracting feature, we recognize an object using a partial distance search method for calculating Euclidean distance. The experimental results show that the proposed method achieves the improvement of recognition rate compared with standard PCA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.185-191
• /
• 1999

Mathematical morphology based on set theory has been applied to various areas in image processing. Pitas proposed a object recognition algorithm using Morphological Shape Decomposition(MSD), and a new representation scheme called Morphological Shape Representation(MSR). The Pitas's algorithm is a simple and adequate approach to recognize objects that are rotated 45 degree-units with respect to the model object. However, this recognition scheme fails in case of random rotation. This disadvantage may be compensated by defining small angle increments. However, this solution may greatly increase computational complexity because the smaller the step makes more number of rotations to be necessary. In this paper, we propose a new method for object recognition based on MSD. The first step of our method decomposes a binary shape into a union of simple binary shapes, and then a new tree structure is constructed which ran represent the relations of binary shapes in an object. finally, we obtain the feature informations invariant to the rotation, translation, and scaling from the tree and calculate matching scores using efficient matching measure. Because our method does not need to rotate the object to be tested, it could be more efficient than Pitas's one. MSR has an intricate structure so that it might be difficult to calculate matching scores even for a little complex object. But our tree has simpler structure than MSR, and easier to calculated the matchng score. We experimented 20 test images scaled, rotated, and translated versions of five kinds of automobile images. The simulation result using octagonal structure elements shows 95% correct recognition rate. The experimental results using approximated circular structure elements are examined. Also, the effect of noise on MSR scheme is considered.

• Smart Media Journal
• /
• v.4 no.1
• /
• pp.16-24
• /
• 2015

In this paper, we propose a method for multi-touch tracking using MRF-based particle filters and gesture likelihood estimation Each touch (of one finger) is considered to be one object. One of frequently occurring issues is the hijacking problem which means that an object tracker can be hijacked by neighboring object. If a predicted particle is close to an adjacent object then the particle's weight should be lowered by analysing the influence of neighboring objects for avoiding hijacking problem. We define a penalty function to lower the weights of those particles. MRF is a graph representation where a node is the location of a target object and an edge describes the adjacent relation of target object. It is easy to utilize MRF as data structure of adjacent objects. Moreover, since MRF graph representation is helpful to analyze multi-touch gestures, we describe how to define gesture likelihoods based on MRF. The experimental results show that the proposed method can avoid the occurrence of hijacking problems and is able to estimate gesture likelihoods with high accuracy.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• 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.

• 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.

• Science of Emotion and Sensibility
• /
• v.11 no.4
• /
• pp.501-510
• /
• 2008

The purpose of this study was to investigate whether the orientation of the head position across different categories affect reaction time and accuracy of object recognition. Fifty four right handed undergraduate students were participated in the experiment. Participants performed the word-picture matching tasks, which were different in terms of head direction of object (i.e., Left-headed or Right-headed) and object category (i.e., natural : animal or artificial : tool). Participants were asked to decide whether each picture matched the word which was followed by the picture. For accuracy, no statistically significant difference was found for both animal and tool pictures due to the ceiling effect. Interaction effect of category and orientation were statistically significant, whereas only the main effect of category was significant. In the animal condition, faster reaction times were observed for left to right than right to left presentation, while no statistical significant difference was found in the tool condition. The orientation of the object's canonical representation was different across different categories. The faster RT for the animal condition implies that the canonical representation for animal is left-headed. This could be due to the orientation of the face.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.682-689
• /
• 2019

In part-based image representation, the partial shapes of an object are represented as basis vectors, and an image is decomposed as a linear combination of basis vectors where the coefficients of those basis vectors represent the partial (or local) feature of an object. In this paper, a face recognition for occluded faces is proposed in which face images are represented using non-negative matrix factorization(NMF), one of part-based representation techniques, and recognized using an artificial neural network technique. Standard NMF, projected gradient NMF and orthogonal NMF were used in part-based representation of face images, and their performances were compared. Learning vector quantizer were used in the recognizer where Euclidean distance was used as the distance measure. Experimental results show that proposed recognition is more robust than the conventional face recognition for the occluded faces.