• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.967-970
• /
• 2020

In a previous work we have done, we presented a monitoring system to automatically detect some dogs' behaviors from videos. However, the input video data used by that system was pre-trimmed to ensure it contained a dog only. In a real-life situation, the monitoring system would continuously receive video data, including frames that are empty and ones that contain people. In this paper, we propose a YOLOv4-based system for automatic object detection and trimming of dog videos. Sequences of frames trimmed from the video data received from the camera are analyzed to detect dogs and people frame by frame using a YOLOv4 model, and then records of the occurrences of dogs and people are generated. The records of each sequence are then analyzed through a rule-based decision tree to classify the sequence, forward it if it contains a dog only or ignore it otherwise. The results of the experiments on long untrimmed videos show that our proposed method manages an excellent detection performance reaching 0.97 in average of precision, recall and f-1 score at a detection rate of approximately 30 fps, guaranteeing with that real-time processing.

• Journal of Information Management
• /
• v.25 no.1
• /
• pp.24-46
• /
• 1994

In this paper I will discuss definitions of hypermedia, multimedia and hypertext. Hypertext is the grouping of relevant information in the form of nodes. These nodes are then connected together through links. In the case of hypertext the nodes contain text or graphics. Multimedia is the combining of different media types for example sound, animation, text, graphics and video for the presentation of information by making use of computers. Hypermedia can be viewed as an extension of hypertext and multimedia. It is based on the concept of hypertext that uses nodes and links in the structuring of information in the system. In this case the nodes consist of an the different data types that are mentioned in the multimedia definition above. The 'node-and-link' concept is used in organisation of the information in hypermedia systems. The 'book' metaphor is an example of the way these systems are implemented. This concept is explained and a few advantages and disadvantages of making use of hypermedia systems are discussed. A new approach for the development of hypermedia systems, namely the knowledge-based approach is now looked into. Joel Peing-Ling Loo proposed this approach because he thought that it is the most effective way for handling this kind of technology. A semantic-based hypermedia model is developed in this approach to formulate solutions for the restrictions in presenting information authoring, maintenance and retrieval. The knowledge-based presentation of information includes the use of conventional data structures. These data structures make use of frames(objects), slots and the inheritance theory that is also used in expert systems. Relations develop between the different objects as these objects are included in the database. Relations can also exist between frames by means of attributes that belong to the frames.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.121-130
• /
• 2007

in a software development, the design or architecture prior to implementing the software is essential for the success. This paper presents a case that we successfully designed a software architecture of radiation monitoring system (RMS) for HANARO research reactor currently operating in KAERI by applying the quality attribute-driven design method which is modified from the attribute-driven design (ADD) introduced by Bass[1]. The quality attribute-driven design method consists of following procedures: eliciting functionality and quality requirements of system as architecture drivers, selecting tactics to satisfy the drivers, determining architectures based on the tactics, and implementing and validating the architectures. The availability, maintainability, and interchangeability were elicited as duality requirements, hot-standby dual servers and weak-coupled modulization were selected as tactics, and client-server structure and object-oriented data processing structure were determined at architectures for the RMS. The architecture was implemented using Adroit which is a commercial off-the-shelf software tool and was validated based on performing the function-oriented testing. We found that the design method in this paper is an efficient method for a project which has constraints such as low budget and short period of development time. The architecture will be reused for the development of other RMS in KAERI. Further works are necessary to quantitatively evaluate the architecture.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.635-645
• /
• 2007

Component technology has been widely accepted as an effective way for building software systems with reusable components, and Microsoft (MS) .NET is one of the recent representative component technologies. Model Driven Architecture (MDA) is a new development paradigm which generates software by transforming design models automatically and incrementally. Transformation of structural models in MDA has been successfully applied. However, transformation of dynamic models and pervasive services, such as transaction service, security service, synchronization service and object pooling are largely remains as an area for further research. The recent enterprise system has multi tier distributed architecture, and the functionality of early mentioned pervasive services is essential for this architecture. .NET platform can implement Component Object Model+ (COM+) component for supporting pervasive services by specify Attribute code. In this paper, we specify the functionalities of the COM+ component offering pervasive services, and then those functionalities are defined by UML profile. By using the profile, the Platform Specific Model (PSM) for .NET/C# is specified, and .NET components are automatically generated through our tool. The development productivity, extensibility, portability, and maintenance of software can be dramatically improved by using of the proposed methods.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.487-496
• /
• 2009

This paper addresses an indexing scheme capable of efficiently processing range queries in a large-scale trajectory database. After discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time intervals and then, by this interval, builds an index for the line segments. Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the previous schemes that store the index totally on the disk. Each time interval index is built as follows: First, the extent of the spatial dimension is divided onto multiple spatial cells to which the line segments are assigned evenly. We use a 2D-tree to maintain information on those cells. Then, for each cell, an additional 3D $R^*$-tree is created on the spatio-temporal space (x, y, t). Such a multi-level indexing strategy can cure the shortcomings of the legacy schemes. Performance results obtained from intensive experiments show that our scheme enhances the performance of retrieve operations by 3$\sim$10 times, with much less storage space.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.1
• /
• pp.23-39
• /
• 2005

As developing satellite communication, the tracking range of the moving objects which move in local area is expanded to the whole world. However previous logistics management system is able to monitor freight which transporting in local area using mobile communication system. In this paper, we propose the reefer container management system that manages the location information and other related information such as temperature, humidity of container using the satellite system. The proposed system consists of three parts; data collector, satellite communication manager, reefer container information manager. And the proposed system uses the moving object index for managing the trajectory of container and tracing the location of container or vessel that is transporting the container, and supports various services such as reefer container and vessel tracking, container control and container statistics to logistic companies like shipper and forwarding agent. And the system can be increasing the quality of container transportation service to the shipper, and it makes the efficient management of reefer container to the shipping company.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.432-446
• /
• 2008

Queries for tracing tag locations are among the most challenging requirements in RFID based applications, including automated manufacturing, inventory tracking and supply chain management. For efficient query processing, a previous study proposed the index scheme for storing tag objects, based on the moving object index, in 3-dimensional domain with the axes being the tag identifier, the reader identifier, and the time. In a different way of a moving object index, the ranges of coordinates for each domain are quite different so that the distribution of query regions is skewed to the reader identifier domain. Previous indexes for tags, however, do not consider the skewed distribution for query regions. This results in producing many overlaps between index nodes and query regions and then causes the problem of traversing many index nodes. To solve this problem, we propose a new disproportional insertion and split policy of the index for RFID tags which is based on the R*-tree. For efficient insertion of tag data, our method derives the weighted margin for each node by using weights of each axis and margin of nodes. Based the weighted margin, we can choose the subtree and the split method in order to insert tag data with the minimum cost. Proposed insertion method also reduces the cost of region query by reducing overlapped area of query region and MBRs. Our experiments show that the index based on the proposed insertion and split method considerably improves the performance of queries than the index based on the previous methods.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.43-51
• /
• 2011

The recent development of the technology for wireless mobile computing and applied technology for location-based services has made it possible to support query processing faster than that in the past. However, some technological limitations on hardware and software still exist. The most critical aspects of query processing are accuracy and speed. For improving the accuracy, it is required that detailed information on the data involved in query processing be saved. In this case, the amount of information on the data increases, which decreases the speed. On the other hand, for increasing the speed, it is necessary to reduce the broadcast cycle, which enables rapid data acquisition as desired. In this case, because of insufficient index information, the listen time for the client increases, which may cause unnecessary energy consumption. Therefore, a trade-off occurs between the accuracy and speed. This paper proposes a hierarchical bitmap-based spatial index (HBI) as a solution for the aforementioned problems. HBI describes an object with 0 and 1 on the Hilbert curve map. It reduces the broadcast cycle by decreasing the index size on the basis of bit information and tree structure. Therefore, it is able to shorten the listen time and query processing time. In addition, HBI enables the detection of the locations of all the objects so that it is possible selectively listen to a broadcast. A performance evaluation of the proposed technique demonstrates that it is excellent.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.