• Title/Summary/Keyword: Multimedia Documents

Search Result 218, Processing Time 0.017 seconds

An Intelligent Image Retrieval System using XML (XML을 이용한 지능형 이미지 검색 시스템)

  • 홍성용;나연묵
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.1
    • /
    • pp.132-144
    • /
    • 2004
  • With the rapid development of internet technology, the number of internet users and the amount of multimedia information on the internet is ever increasing. Recently, the web sites, such as e-business sites and shopping mall sites, deal with lots of image information. As a result, it is required to support content- based image retrieval efficiently on such image data. This paper proposes an intelligent image retrieval system, which adopts XML, technology. To support object-based col)tent retrieval on product catalog images containing multiple objects, we describe a multi -level metadata structure which represents the local features, global features, and semantics of image data. To enable semantic-based and content-based retrieval on such image data, we design a XML-Schema for the proposed metadata and show how to represent such metadata using XML- documents. We also describe how to automatically transform the retrieval results into the forms suitable for the various user environments, such as web browser or mobile browser, using XSLT The proposed scheme can be easily implemented on any commercial platforms supporting XML technology. It can be utilized to enable efficient image metadata sharing between systems, and it will contribute in improving the retrieval correctness and the user's satisfaction on content-based e-catalog image retrieval.

  • PDF

Hierarchical Automatic Classification of News Articles based on Association Rules (연관규칙을 이용한 뉴스기사의 계층적 자동분류기법)

  • Joo, Kil-Hong;Shin, Eun-Young;Lee, Joo-Il;Lee, Won-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.730-741
    • /
    • 2011
  • With the development of the internet and computer technology, the amount of information through the internet is increasing rapidly and it is managed in document form. For this reason, the research into the method to manage for a large amount of document in an effective way is necessary. The conventional document categorization method used only the keywords of related documents for document classification. However, this paper proposed keyword extraction method of based on association rule. This method extracts a set of related keywords which are involved in document's category and classifies representative keyword by using the classification rule proposed in this paper. In addition, this paper proposed the preprocessing method for efficient keywords creation and predicted the new document's category. We can design the classifier and measure the performance throughout the experiment to increase the profile's classification performance. When predicting the category, substituting all the classification rules one by one is the major reason to decrease the process performance in a profile. Finally, this paper suggested automatically categorizing plan which can be applied to hierarchical category architecture, extended from simple category architecture.

Indexing Methods of Splitting XML Documents (XML 문서의 분할 인덱스 기법)

  • Kim, Jong-Myung;Jin, Min
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.397-408
    • /
    • 2003
  • Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

  • PDF

An Assignment Method of Multidimensional Type Inheritance Indexes for XML Query Processing (XML 질의처리를 위한 다차원 타입상속 색인구조의 할당기법)

  • Lee, Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.1
    • /
    • pp.1-15
    • /
    • 2009
  • This paper presents an assignment method of the multidimensional type inheritance indexes (MD-TIXs) to support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested element and type inheritance hierarchies. In this paper, we have analyzed the strategy of the query processing by using the MD-TIXs, and presented an assignment method of the MD-TIXs in the framework of complex queries, containing conjunctions of nested predicates, each one involving an Xpath having target types or domain types substitution. We first consider MD-TIX operations caused by updating of XML data-bases, and the use of the MD-TIXs in the case of a query containing a single nested predicate. And then, we consider the assignments of the MD-TIXs in the framework of more general queries containing nested predicates over overlapping paths that have common subpaths.

  • PDF

Design and Implementation of Distributed Collaborative Writing System for Engineering Design Process (다자간 협동 공학설계를 위한 DCWA 시스템의 설계 및 구현)

  • 이병걸
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.1
    • /
    • pp.63-76
    • /
    • 2000
  • Most work done in CSCW (Computer Supported Collaborative Work) system has been targeted toward supporting the exchange of documents or messages among group members, and yet support for cognitive aspects such as group organization, division and merge of work, and work flow control. The objective of the study is to provide CSCW environment for the engineering design process such as CAD (Computer Aided Design) and CASE (Computer Aided Software Engineering). The proposed DCWA (Distributed Collaborative Writing Aid) system suggests a mechanism that unifies the group organization, work division, and work flow control in the CAO, CASE, and software simulation tool. In particular, CAD relates the group and work partition by providing expressing the relation of drawing object (e.g., binding, attachment, and proportional scaling) which is owned by different members of group, and CASE combining with the simulation tool supports the flexibility of the work flow control. Simulating the prototype before manu-facturing a product can reduce time and cost in development.

  • PDF

Language Identification by Fusion of Gabor, MDLC, and Co-Occurrence Features (Gabor, MDLC, Co-Occurrence 특징의 융합에 의한 언어 인식)

  • Jang, Ick-Hoon;Kim, Ji-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.277-286
    • /
    • 2014
  • In this paper, we propose a texture feature-based language identification by fusion of Gabor, MDLC (multi-lag directional local correlation), and co-occurrence features. In the proposed method, for a test image, Gabor magnitude images are first obtained by Gabor transform followed by magnitude operator. Moments for the Gabor magniude images are then computed and vectorized. MDLC images are then obtained by MDLC operator and their moments are computed and vectorized. GLCM (gray-level co-occurrence matrix) is next calculated from the test image and co-occurrence features are computed using the GLCM, and the features are also vectorized. The three vectors of the Gabor, MDLC, and co-occurrence features are fused into a feature vector. In classification, the WPCA (whitened principal component analysis) classifier, which is usually adopted in the face identification, searches the training feature vector most similar to the test feature vector. We evaluate the performance of our method by examining averaged identification rates for a test document image DB obtained by scanning of documents with 15 languages. Experimental results show that the proposed method yields excellent language identification with rather low feature dimension for the test DB.

Design and Implementation of XML Document Search System for the Cyber University (가상대학 XML 문서 검색시스템의 설계 및 구현)

  • Kong Beom-Yong;Hwang Byung-Kon;Cho Sae-Hong
    • Journal of Digital Contents Society
    • /
    • v.3 no.2
    • /
    • pp.131-142
    • /
    • 2002
  • This paper announces that, with the emergence of the imaginary university for the remote education, which is based on Web due to the education change, the introduction of the Multimedia contents system using computers and the Internet becomes serious. For this reason, this paper suggests search system for managing the imaginary university documents. For the success of the document management of the imaginary university, document search is regarded as an important issue as well as the executive support and search system of the document management. This paper plans and embodies the imaginary university XML document search system to establish the foundation of increasing efficiency o( affairs using XML document, by aiming at the fact that it will be highlighted as a representative application field as well as the efficiency of the executive affairs, by applying of Multimedia documentary creation system, which is about the imaginary university XML documentary that it is seen distinctly an effect of administrative work being a consequence of new technique application of computers.

  • PDF

An Incremental Web Document Clustering Based on the Transitive Closure Tree (이행적 폐쇄트리를 기반으로 한 점증적 웹 문서 클러스터링)

  • Youn Sung-Dae;Ko Suc-Bum
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2006
  • In document clustering methods, the k-means algorithm and the Hierarchical Alglomerative Clustering(HAC) are often used. The k-means algorithm has the advantage of a processing time and HAC has also the advantage of a precision of classification. But both methods have mutual drawbacks, a slow processing time and a low quality of classification for the k-means algorithm and the HAC, respectively. Also both methods have the serious problem which is to compute a document similarity whenever new document is inserted into a cluster. A main property of web resource is to accumulate an information by adding new documents frequently. Therefore, we propose a new method of transitive closure tree based on the HAC method which can improve a processing time for a document clustering, and also propose a superior incremental clustering method for an insertion of a new document and a deletion of a document contained in a cluster. The proposed method is compared with those existing algorithms on the basis of a pre챠sion, a recall, a F-Measure, and a processing time and we present the experimental results.

  • PDF

A Similarity Measurement and Visualization Method for the Analysis of Program Code (프로그램 코드 분석을 위한 유사도 측정 및 가시화 기법)

  • Lee, Youngjoo;Lee, Jeongjin
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.802-809
    • /
    • 2013
  • In this paper, we propose the similarity measurement method between two program codes by counting the frequency and length of continuous patterns of specifiers and keywords, which exist in two program codes. In addition, we propose the visualization method of this analysis result by formal concept analysis. Proposed method considers adjacencies of specifiers or keywords, which have not been considered in the previous similarity measurements. Proposed method can detect the plagiarism by analyzing the pattern in each function regardless of the order of function call and execution. In addition, the result of the similarity measurement is visualized by the lattice of formal concept analysis to increase the user understanding about the relations between program codes. Experimental results showed that proposed method succeeded in 96% plagiarism detections. Our method could be applied into the analysis of general documents.

Visual Programming Environment for Effective Teaching and Research in Image Processing (영상처리에서 효율적인 교육과 연구를 위한 비주얼 프로그래밍 환경 개발)

  • Lee Jeong Heon;Heo Hoon;Chae Oksam
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.1
    • /
    • pp.50-61
    • /
    • 2005
  • With the wide spread use of multimedia device, the demand for the image processing engineers are increasing in various fields. However there are few engineers who can develop practical applications in the image processing area. To teach practical image processing techniques, we need a visual programming environment which can efficiently present the image processing theories and, at the same time, provide interactive experiments for the theory presented. In this paper, we propose a visual programming environment of the integrated environment for image processing. It consists of the theory presentation systems and experiment systems based on the visual programming environment. The theory presentation systems support multimedia data, web documents and powerpoint files. The proposed system provides an integrated environment for application development as well as education. The proposed system accumulates the teaching materials and exercise data and it manages, an ideal image processing education and research environment to students and instructors.