• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.41-50
• /
• 2004

Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2919-2925
• /
• 2014

Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2270-2277
• /
• 2016

In modern society, creation and distribution of multimedia contents is being actively conducted. These multimedia information have come out the enormous amount daily, the amount of data is also large enough it can't be compared with past text information. Since it has been increased for a need of the method to efficiently store multimedia information and to easily search the information, various methods associated therewith have been actively studied. In particular, image search methods for finding what you want from the video database or multiple sequential images, have attracted attention as a new field of image processing. Image retrieval method to be implemented in this paper, utilizes the attribute of corner patches based on the corner points of the object, for providing a new method of efficient and robust image search. After detecting the edge of the object within the image, the straight lines using a Hough transformation is extracted. A corner patches is formed by defining the extracted intersection of the straight line as a corner point. After configuring the feature vectors with patches rearranged, the similarity between images in the database is measured. Finally, for an accurate comparison between the proposed algorithm and existing algorithms, the recall precision rate, which has been widely used in content-based image retrieval was used to measure the performance evaluation. For the image used in the experiment, it was confirmed that the image is detected more accurately in the proposed method than the conventional image retrieval methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.143-146
• /
• 2008

In this paper, It presents the method the player will be able to confront when the NPC approach to the player, the NPC which have the property which is similar form grouping. The property of the NPC follows in quality of Game and it decides with separate way. To attribute of the NPC it is composed of conduct pattern, an attack pattern and the weapon pattern back. It considers a priority on the group wild middle which is formed and it judges the attack yes or no of the player. The method that proposed will play an important role in development of a 3D FPS games.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.181-191
• /
• 2002

Video based surveillance systems based on an active camera require a fast algorithm for real time detection and tracking of local motion in the presence of global motion. This paper presents a new fast and efficient motion detection and tracking algorithm using the displaced frame difference (DFD). In the Proposed algorithm, first, a Previous frame is adaptively selected according to the magnitude of object motion, and the global motion is estimated by using only a few confident matching blocks for a fast and accurate result. Then, a DFD is obtained between the current frame and the selected previous frame displaced by the global motion. Finally, a moving object is extracted from the noisy DFD by utilizing the correlation between the DFD and current frame. We implement this algorithm into an active camera system including a pan-tilt unit and a standard PC equipped with an AMD 800MHz processor. The system can perform the exhaustive search for a search range of 120, and achieve the processing speed of about 50 frames/sec for video sequences of 320$\times$240. Thereby, it provides satisfactory tracking results.

• Journal of the Korean Society for information Management
• /
• v.20 no.2
• /
• pp.114-133
• /
• 2003

Recently, the organizations related to cultural contents are gradually expanding access to cultural contents for general public through the distributed network. However, since cultural contents have different characteristics than general contents, the objects, the of cultural contents seldom contain the words generally used for organization and search of information. If the cultural contents system is created without any consideration of such differences. We cannot effectively identify and search resources. Moreover, because the names, expressions and meanings are different between metadata elements of various cultural contents, it is very difficult to interconnect or share information between different systems. In order to solve these problems, proper organization ad management of metadata is vital. In this studym we have comparatively analyzed the data elements of each format based on Dublin Core, EAD, VRA, CDWA, CIMI, and Object ID, the metadata formats approached from various aspects in the cultural contents area. Through this study, we tried to provide the basic materials for integration of cultural contents by securing interoperability of different metadata formats.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.2
• /
• pp.45-56
• /
• 2015

In this paper we propose a very rapid moving object tracking method for an object-based auto focus on a smart phone camera. By considering the limit of non-learning approach on low-performance platforms, we use a sliding-window detection technique based on histogram features. By adapting the integral histogram, we solve the problem of the time-consuming histogram computation on each sub-window. For more speed up, we propose a local candidate search, and an adaptive scaling template method. In addition, we propose to apply a stabilization term in the matching function for a stable detection location. In experiments on our dataset, we demonstrated that we achieved a very rapid tracking performance demonstrating over 100 frames per second on a PC environment.

• Journal of Advanced Navigation Technology
• /
• v.2 no.2
• /
• pp.107-115
• /
• 1998

In this paper, we propose a robust moving object tracking(MOT) method based on motion energy and prediction. MOT consists of two steps: moving object extraction step(MOES) and moving object tracking step(MOTS). For MOES, we use improved motion energy method. For MOTS, we predict the next location of moving object based on distance and direction information among previous instances, so that we can reduce the search space for correspondence. We apply the method to both synthetic and real world sequences and find that the method works well even in the presence of occlusion and disocclusion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2057-2064
• /
• 2010

With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy