• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.157-160
• /
• 2002

Scene change detection is the fundamental process of automatic video indexing and retrieving. In this paper we propose a method which utilizes both compressed and uncompressed domain methods to detect scene change in a video. Candidate locations for scene change are estimated from DC images and motion vector information in compressed domain. And candidate frames are verified using edge histogram distance and color histogram distance, in uncompressed domain. The experimental results show that scene change can be detected fast and correctly by proposed method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.57-66
• /
• 2008

There have been proposed various copyright protection protocols in network-based digital multimedia distribution framework. However, most of conventional copyright protection protocols are focused on the stability of copyright information embedding/extracting and the access control to data suitable for user's authority but overlooked the privacy of copyright owner and user in authentication process of copyright and access information. In this paper, we propose a solution that builds a privacy-preserving proof of copyright ownership of digital contents in conjunction with keyword search scheme. The appeal of our proposal is three-fold: (1) content providers maintain stable copyright ownership in the distribution of digital contents; (2) the proof process of digital contents ownership is very secure in the view of preserving privacy; (3) the proposed protocol is the copyright protection protocol added by indexing process but is balanced privacy and efficiency concerns for its practical use.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.526-539
• /
• 2012

This paper proposes a high capacity data hiding method using high frequence secret data indexing algorithm. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. In this paper, first, calculating data iteration frequency of the secret message and make up the high frequency data index matrix (HFDT) using high frequence data's location information. Next, HFDT uses to that data hiding process on the cover image and recovering process on the stego image. The experimental results demonstrate the efficiency of the proposed high frequency secret data indexing method. For the data hiding method, experiments are conducted for four cases: 2 pattern secret data (2PD), 4 pattern secret data (4PD), 8 pattern secret data (8PD) and higher pattern secret data (HPD). When comparing the proposed method with other data hiding methods, for the HPD case, the results show that the proposed method has a good PSNR and more capacity, and for the other case, the results show that the proposed method has a higher PSNR and larger capacity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.10-19
• /
• 2003

Caption information in news videos can be useful for video indexing and retrieval since it usually suggests or implies the contents of the video very well. In this paper, a new algorithm for extracting and recognizing characters from news video is proposed, without a priori knowledge such as font type, color, size of character. In the process of text region extraction, in order to improve the recognition rate for videos with complex background at low resolution, continuous frames with identical text regions are automatically detected to compose an average frame. The image of the averaged frame is projected to horizontal and vertical direction, and we apply region filling to remove backgrounds to produce the character. Then, K-means color clustering is applied to remove remaining backgrounds to produce the final text image. In the process of character recognition, simple features such as white run and zero-one transition from the center, are extracted from unknown characters. These feature are compared with the pre-composed character feature set to recognize the characters. Experimental results tested on various news videos show that the proposed method is superior in terms of caption extraction ability and character recognition rate.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.601-616
• /
• 2004

Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.4 s.175
• /
• pp.811-823
• /
• 2000

In design and manufacturing airframe structures which are composed of a lot of sub-assemblies and large complex profile shapes it is difficult to reduce so called hardware variations. Accordingly cost increasing factors for manufacturing airframe parts are much more than other machine parts because of the variability of fabricated details and assemlies. To improve cost and quality, accurate assembly methods and DPD techniques are proposed in this paper which are based upon using CAD/CAM techniques, the concept of KC's and the coordinated datum and index throughout the design, tooling, manufacturing and inspection. The proposed methods are applied to produce fuselage frame assemblies and related engineering aspects are described regarding the design of parts and tools in the context of concurrent digital definition. First articles and consequent mass production of frame assemblies shows a great improvement of the process capability ratio from 0.7 by the past processes to 1.0 by the proposed methods in addition to the cost reduction due to the less number of tools, reduced total assembly times and the space compaction needed by massive inventory. The need to achieve better Cpk, however, and future studies to be investigated will be addressed briefly.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.9-15
• /
• 2016

Symmetry is everywhere in the world around us from galaxy to microbes. From ancient times symmetry is considered to be a reflection of the harmony of universe. Symmetry is not only a significant clue for human cognitive process, but also useful information for computer vision such as image understanding system. Application areas include face detection and recognition, indexing of image database, image segmentation and detection, analysis of medical images, and so on. The technique used in this paper extracts edges, and the perpendicular bisector of any two edge points is considered to be a candidate axis of symmetry. The coefficients of candidate axis are accumulated in the coefficient space. Then the axis of symmetry is determined to be the line for which the coefficient histogram has maximum value. In this paper, an improved method is proposed that utilizes the directional information of edges, which is a byproduct of the edge detection process. Experiment on 20 test images shows that the proposed method performs 22.7 times faster than the original method. In another test on 5 images with 4% salt-and-pepper noise, the proposed method detects the symmetry successfully, while the original method fails. This result reveals that the proposed method enhances the speed and accuracy of detection process at the same time.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.4
• /
• pp.92-98
• /
• 2010

Virtual ground modeling is one of key topic for real-time vehicle dynamic simulation. This paper discusses about the virtual 3D road modeling process using parametric surface concept. General road data is a type of lumped position vector so interpolation process is required to compute contact of internal surface. The parametric surface has continuity and linearity within boundaries and functions are very simple to find out contact point. In this paper, the parametric surface formula is adopted to road modeling to calculate road hight. Position indexing method is proposed to reduce memory size and resource possession, and a simple mathematical method for contact patch searching is also proposed. The developed road process program is tested in dynamic driving simulation on off-road. Conclusively, the new virtual road program shows high performance of road hight computation in vast field of off-road simulation.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.19-29
• /
• 2004

Recently, studies have been performed to improve the cache performance of the R-Tree in main memory. A general mothed to improve the cache performance of the R-Tree is to reduce size of an entry so that a node can store more entries and fanout of it can increase. However, this method generally requites additional process to reduce information of entries and do not support incremental updates. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems efficiently, this paper proposes and evaluates the PR-Tree that is an extended R-Tree indexing method using prefetching in main memory. The PR-Tree can produce a wider node to optimize prefetching without additional modifications on the R-Tree. Moreover, the PR-Tree reduces cache miss rates that occur in moving between a parent node and a child node. In our simulation, the search performance, the update performance, and the node split performance of the PR-Tree improve up to 38%. 30%, and 67% respectively, compared with the original R-Tree.