• Journal of The Korean Association of Information Education
• /
• v.19 no.4
• /
• pp.441-448
• /
• 2015

This paper describes about a software implementation for class analysis and quantization based on our video synchronization method. We proposed a new indexing method, synchronization strategies, and data structure for our analyzer implementation. We implemented a class video analyzer using intelligent multimedia technologies which can play class video selectively. Our proposed method analyzes class videos depending on the time schedule composed of introduction, development and summary stages. We apply our analysis filters to the class videos in the predefined regular intervals. We experimented on the synchronization performance of our proposed method and software. In the experimental, we could demonstrate the effectiveness and practicality of our class analyzing method within the margin of error.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.11-24
• /
• 2008

Region-based image retrieval techniques, which divide image into similar regions having similar characteristics and examine similarities among divided regions, were proposed to support an efficient low-dimensional color indexing scheme. However, color image segmentation techniques are required additionally. The problem of segmentation is difficult because of a large variety of color and texture. It is known to be difficult to identify image regions containing the same color-texture pattern in natural scenes. In this paper we propose an automatic color image segmentation algorithm. The colors in each image are first quantized to reduce the number of colors. The gray level of image representing the outline edge of image is constructed in terms of Fisher's multi-class linear discriminant on quantized images. The gray level of image is transformed into a binary edge image. The edge showing the outline of the binary edge image links to the nearest edge if disconnected. Finally, the final segmentation image is obtained by merging similar regions. In this paper we design and implement a region-based image retrieval system using the proposed segmentation. A variety of experiments show that the proposed segmentation scheme provides good segmentation results on a variety of images.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.35-42
• /
• 2013

Shot boundary detection is an essential step for efficient browsing, sorting, and classification of video data. Robust shot detection method should overcome the disturbances caused by pixel brightness and object movement between frames. In this paper, two shot boundary detection methods are presented to address these problem by using segmentation, object movement, and pixel brightness. The first method is based on the histogram that reflects object movements and the morphological dilation operation that considers pixel brightness. The second method uses the pixel brightness information of segmented and whole blocks between frames. Experiments on digitized video data of National Archive of Korea show that the proposed methods outperforms the existing pixel-based and histogram-based methods.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.49-56
• /
• 2014

This thesis proposes CBIRS/TB method that uses a tablet's color distribution information and form distinctive in content-based search. CBIRS/TB can avoid misuses and improper tablet uses by conducting content-based search in commonly prescribed tablets. The existing FE-CBIRS system is limited to recognizing only the image of color and shape of the tablet, that leads to applying insufficient form-specific information. While CBIRS/TB utilizes average, standard deviation, hue and saturation of each tablets in color, brightness, and contrast, FE-CBIRS has partial-sphere application problem; only applying the typical color of the tablet. Also, in case of the shape-specific-information, Invariant Moment is mainly used for the extracted partial-spheres. This causes delayed processing time and accuracy problems. Therefore, to improve this setback, this thesis indexed color-specific-information of the extracted images into categorized classification for improved search speed and accuracy.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.71-78
• /
• 2009

For more effective index extraction and index weight determination, studies of extracting indices are carried out by using document content as well as structure. However, most of studies are concentrating in calculating the importance of context rather than that of XML tag. These conventional studies determine its importance from the aspect of common sense rather than verifying that through an objective experiment. This paper, for the automatic indexing by using the tag information of XML document that has taken its place as the standard for web document management, classifies major tags of constructing a paper according to its importance and calculates the term weight extracted from the tag of low weight. By using the weight obtained, this paper proposes a method of calculating the final weight while updating the term weight extracted from the tag of high weight. In order to determine more objective weight, this paper tests the tag that user considers as important and reflects it in calculating the weight by classifying its importance according to the result. Then by comparing with the search performance while using the index weight calculated by applying a method of determining existing tag importance, it verifies effectiveness of the index weight calculated by applying the method proposed in this paper.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.357-368
• /
• 2006

This paper discusses the way of processing time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method employs the $L_{\infty}$ as a base distance function for allowing users to issue queries conveniently. In this paper, we extend the prefix-querying method for absorbing $L_1$, which is the most-widely used as a base distance function in time-series subsequence matching under time warping, instead of $L_{\infty}$. We also formally prove that the proposed method does not incur any false dismissals in the subsequence matching. To show the superiority of our method, we conduct performance evaluation via a variety of experiments. The results reveal that our method achieves significant performance improvement in orders of magnitude compared with previous methods.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1733-1748
• /
• 1997

In this paper, we propose the classification scheme and retrieval mechanism which can apply to many application domains in order to construct the software reuse library. Classification scheme which is the core of the accessibility in the reusability, is defined by the hierarchical structure using the agglomerative clusters. Agglomerative cluster means the group of the reuse component by the functional relationships. Functional relationships are measured by the HACM which is the representation method about software components to calculate the similarities among the classes in the particular domain. And clustering informations are added to the library structure which determines the functionality and accuracy of the retrieval system. And the system stores the classification results such as the index information with the weights, the similarity matrix, the hierarchical structure. Therefore users can retrieve the software component using the query which is the natural language. The thesis is studied to focus on the findability of software components in the reuse library. As a result, the part of the construction process of the reuse library was automated, and we can construct the object-oriented reuse library with the extendibility and relationship about the reuse components. Also the our process is visualized through the browse hierarchy of the retrieval environment, and the retrieval system is integrated to the reuse system CARS 2.1.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.402-411
• /
• 2000

It is an important step in video indexing and retrieval to detect shot boundaries on video data. Some approaches are proposed to detect shot changes by computing color histogram differences or the variances of DCT coefficients. However, these approaches do not consider the content or meaningful features in the image data which are useful in high level video processing. In particular, it is desirable to detect these features from compressed video data because this requires less processing overhead. In this paper, we propose a new method to detect shot boundaries from MPEG data using region flow and color information. First, we reconstruct DC images and compute region flow information and color histogram differences from HSV quantized images. Then, we compute the points at which region flow has discontinuities or color histogram differences are high. Finally, we decide those points as shot boundaries according to our proposed algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.2
• /
• pp.71-79
• /
• 2008

This study proposed a content-based image retrieval system that uses RGB maximum frequency indexing and BW clustering in order to deal with existing retrieval errors using histogram. We split RGB from RGB color images, obtained histogram which was evenly split into 32 bins, calculated and analysed pixels of each area at histogram of R, G, B and obtained the maximum value. We indexed the color information obtained, obtained 100 similar images using the values, operated the final image retrieval system using the total number and distribution rate of clusters. The algorithm proposed in this study used space information using the features obtained from R, G, and B and clusters to obtain effective features, which overcame the disadvantage of existing gray-scale algorithm that perceived different images as same if they have the same frequencies of shade. As a result of measuring the performances using Recall and Precision, this study found that the retrieval rate and priority of the proposed algorithm are more outstanding than those of existing algorithm.