• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.694-696
• /
• 2004

With the more sophisticated abilities development of video, object motion analysis and interpretation has become the fundamental task for the computer vision understanding. For that understanding, firstly, we seek a sum of absolute difference algorithm to apply to the motion detection, which was based on the scene. Then we will focus on the moving objects representation in the scene using spatio-temporal relations. The video can be explained comprehensively from the both aspects : moving objects relations and video events intervals.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.11-13
• /
• 2010

Combined with the indeterminate boundaries of spatial objects, n:m correspondences makes an object-based matching be a complex problem. In this study, we model the boundary of a polygon object with fuzzy model and describe their overlapping relations as a weighted bipartite graph. Then corresponding pairs including 1:0, 1:1, 1:n and n:m relations are identified using a spectral singular value decomposition.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.194-204
• /
• 2010

A space, real or virtual, comprises regions as its parts and physical objects residing in them. A coherent and sophisticated representaion scheme for their spatial relations premises the precision and plausibility in its associated agents' inferencing on the spatial relations and the development of events occurring in such a space. The existing spatial models are not suitable for a comprehensive representation of the general spatial relations in that they have limited expressive powers based on the dichotomy between the large and small scales, or support only a small set of topological relations. The representaion model we propose has the following distinctive chracteristics: firstly, our model provides a comprehensive representation scheme to accommodate large and small scale spaces in an integrated fashion; secondly, our model greatly elaborated the spatial relations among the small-scale objects based on their contact relations and the compositional relations among their respective components objects beyond the basic topological relations like disjoint and touch; thirdly, our model further diversifies the types of supported relations by adding the container property besides the soildness together with considering the gravity direction. The resulting integrated spatial knowledge representation scheme considering the gravity allows the diverse spatial relations in the real world to be simulated in a precise manner in relation to the associated spatial events and provides an expression measure for the agents in such a cyber-world to capture the spatial knowledge to be used for recognizing the situations in the spatial aspects.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2807-2814
• /
• 2000

In this paper, we suggest a visual language supporting collaboration with functional attributes. The visual language is a set of visual sentences that consist of object icons and operators. The object icon is a user who participates in collaboration. And, the operator means interactive relations between users according to a point of collaborative time. The functional attributes that support various computing orders provide flexibility of interactive relations on collaboration. Also, using representation both synchronous and asynchronous relations in collaboration, the visual language supports efficiently collaboration than conventional visual languages. And, functional attributes of visual sentences are analyzed using $\lambda$ expressions.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.45-54
• /
• 1995

The relational data model is based on mathematical concept of relations and is well formulated, and so there have been numerous practical applications and studies. However, it is not suitable for representing a complex hierarchical structure, which is the characteristic of most geographical objects. On the other hand, the object-oriented data model can naturally represent a complex hierarchical structure, but there is a difficulty in sharing data with the relational data model which is currently used by most commercial GIS users. Also it has no standard query language with standardized format. In this paper, we propose an Object Grouping based on RDBMS to use data from a traditional relational data model while supporting various concepts of the object-oriented data model, and we applied this data model to design a GIS.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.448-451
• /
• 1999

In this paper, we propose a new object representation method and matching algorithm for object recognition using a 3-fingered robot hand. Each finger tip can measure normal vector and shapes of a contacting surface. Object is represented by the inter-surface description table where the features of a surface are described in the diagonal and the relations between two surfaces are in the upper diagonal. Based on this table, a fast and the efficient matching algorithm has been proposed. This algorithm can be applied to natural quadric objects.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.3
• /
• pp.247-252
• /
• 2010

In this paper, we investigate the relations among formal concepts, attribute oriented concept and object oriented concepts on a complete residuated lattice.

• International Journal of Advanced Culture Technology
• /
• v.4 no.4
• /
• pp.75-80
• /
• 2016

The process of extracting external boundary of an object is a very important process for recognizing an object in the image. The proposed extraction method consists of two processes: External Boundary Extraction and Thinning. In the first step, external boundary extraction process separates the region representing the object in the input image. Then, only the pixels adjacent to the background are selected among the pixels constituting the object to construct an outline of the object. The second step, thinning process, simplifies the outline of an object by eliminating unnecessary pixels by examining positions and interconnection relations between the pixels constituting the outline of the object obtained in the previous extraction process. As a result, the simplified external boundary of object results in a higher recognition rate in the next step, the object recognition process.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.780-787
• /
• 2005

Many researches and validations for the complexity metrics of the object-oriented systems have been studied. Most of them are aimed for the measurement of the partial aspects of the systems, for example, the coupling between objects, the complexity of inheritance structures, the cohesion of methods, and so on. But the software practitioners want to measure the complexity of overall system, not partial. We studied the complexity of the overall structures of object-oriented systems by analyzing the class diagram of UML. The class diagram is composed of classes and their relations. There are three kinds of relations, association, generalization, and aggregation, which are making the structure of object-oriented systems to be difficult to understand. We proposed a heuristic metric to measure the complexity of object-oriented systems by putting together the three kinds of the relations. Tn analyze the complexity of the structure of a object-oriented system for the maintainability of the system, we measured the degree of understandability of it, the reverse engineering time to draw a class diagram from the source codes, and the number of errors in the diagram. The results of this experiment shows that our proposed metric has a considerable relationship with the complexity of object-oriented systems. The metric will be helpful to the software developers for their designing tasks by evaluating the complexity of the structures of object-oriented systems and redesigning tasks , of them for the future maintainability.