• Title/Summary/Keyword: Object Retrieval

Search Result 357, Processing Time 0.03 seconds

Fast Computation of the Radius of a Bounding Circle in a Binary Image (이진영상에서 바운딩 서클의 빠른 계산방법)

  • Kim Whoi-vul;Ryoo Kwang-seok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.7
    • /
    • pp.453-457
    • /
    • 2005
  • With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

Retrieving Semantic Image Using Shape Descriptors and Latent-dynamic Conditional Random Fields

  • Mahmoud Elmezain;Hani M. Ibrahem
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.10
    • /
    • pp.197-205
    • /
    • 2024
  • This paper introduces a new approach to semantic image retrieval using shape descriptors as dispersion and moment in conjunction with discriminative model of Latent-dynamic Conditional Random Fields (LDCRFs). The target region is firstly localized via the background subtraction model. Then the features of dispersion and moments are employed to k-mean procedure to extract object's feature as second stage. After that, the learning process is carried out by LDCRFs. Finally, SPARQL language on input text or image query is to retrieve semantic image based on sequential processes of Query Engine, Matching Module and Ontology Manger. Experimental findings show that our approach can be successful retrieve images against the mammals Benchmark with rate 98.11. Such outcomes are likely to compare very positively with those accessible in the literature from other researchers.

A Design and Implementation of Arbitrary Retrieval System Using Multi-resolution Edge Mathcing (다중 해상도 에지 정합을 이용한 임의물체 검색 시스템의 설계 및 구현)

  • Lee Kang-ho;Ahn Yonghak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.95-102
    • /
    • 2004
  • In this paper, we proposed multi-resolution search method based on edge information that can be search a partial input pattern and detect a difference of minute shape information in effectively. The proposed method utilizes the small shape differences among objects as much as possible to distinguish an object from similar shaped objects. It consists of the GHT based candidate generation and top-down candidate verfication. The test results show that it can retrieve the correct object even with a part of object in reasonable time.

  • PDF

Analogy-based Reuse of Object Model (아날로지를 기반으로 한 객체모델의 재사용)

  • Bae, Je-Min
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.665-674
    • /
    • 2007
  • Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. Therefore, this paper present analogical matching techniques for the reuse of object models and patterns. And this paper have suggested the object model and the design patterns as reusable components and the representation techniques to store them. Namely, the contents of the paper are as follows. Analogical matching functions to retrieve analogous components from reusable libraries. And the representation of reusable components to be stored in the library in order to support the analogical matching.

Viewpoint Invariant Person Re-Identification for Global Multi-Object Tracking with Non-Overlapping Cameras

  • Gwak, Jeonghwan;Park, Geunpyo;Jeon, Moongu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2075-2092
    • /
    • 2017
  • Person re-identification is to match pedestrians observed from non-overlapping camera views. It has important applications in video surveillance such as person retrieval, person tracking, and activity analysis. However, it is a very challenging problem due to illumination, pose and viewpoint variations between non-overlapping camera views. In this work, we propose a viewpoint invariant method for matching pedestrian images using orientation of pedestrian. First, the proposed method divides a pedestrian image into patches and assigns angle to a patch using the orientation of the pedestrian under the assumption that a person body has the cylindrical shape. The difference between angles are then used to compute the similarity between patches. We applied the proposed method to real-time global multi-object tracking across multiple disjoint cameras with non-overlapping field of views. Re-identification algorithm makes global trajectories by connecting local trajectories obtained by different local trackers. The effectiveness of the viewpoint invariant method for person re-identification was validated on the VIPeR dataset. In addition, we demonstrated the effectiveness of the proposed approach for the inter-camera multiple object tracking on the MCT dataset with ground truth data for local tracking.

Object Categorization Using PLSA Based on Weighting (특이점 가중치 기반 PLSA를 이용한 객체 범주화)

  • Song, Hyun-Chul;Whoang, In-Teck;Choi, Kwang-Nam
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.45-54
    • /
    • 2009
  • In this paper we propose a new approach that recognizes the similar categories by weighting distinctive features. The approach is based on the PLSA that is one of the effective methods for the object categorization. PLSA is introduced from the information retrieval of text domain. PLSA, unsupervised method, shows impressive performance of category recognition. However, it shows relatively low performance for the similar categories which have the analog distribution of the features. In this paper, we consider the effective object categorization for the similar categories by weighting the mainly distinctive features. We present that the proposed algorithm, weighted PLSA, recognizes similar categories. Our method shows better results than the standard PLSA.

  • PDF

Peformance Evaluation of XBench using an Object-Relational DBMS (객체 관계형 DBMS를 이용한 XBench 성능평가)

  • Kim Jae-Uk;Song Yong-Ho;Lee Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.9-17
    • /
    • 2005
  • XML is rapidly spreading as a standard for data representation and exchange, and XML documents are adopted in various applications. According to this trend, researches in database has also focused on efficient storage and retrieval of XML documents. Recently, major (object) relational DBMS vendors support XML functionality, and several native XML DBMSs have been developed in academic or industry side. In addition, various benchmarks have been proposed so as to evaluate these na database performance. In this paper, we evaluate the XBench benchmark using a commercial object-relational DBMS, analyze its performance, and investigate the future improvements of object-relational DBMSs for XML support.

Temporal_based Video Retrival System (시간기반 비디오 검색 시스템)

  • Lee, Ji-Hyun;Kang, Oh-Hyung;Na, Do-Won;Lee, Yang-Won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.631-634
    • /
    • 2005
  • Traditional database systems have been used models supported for the operations and relationships based on simple interval. video data models are required in order to provide supporting temporal paradigm, various object operations and temporal operations, efficient retrieval and browsing in video model. As video model is based on object-oriented paradigm, I present entire model structure for video data through the design of metadata which is used of logical schema of video, attribute and operation of object, and inheritance and annotation. by using temporal paradigm through the definition of time point and time interval in object-oriented based model, we can use video information more efficiently by time variation.

  • PDF

Temporal Video Modeling of Cultural Video (교양비디오의 시간지원 비디오 모델링)

  • 강오형;이지현;고성현;김정은;오재철
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.439-442
    • /
    • 2004
  • Traditional database systems have been used models supported for the operations and relationships based on simple interval. video data models are required in order to provide supporting temporal paradigm, various object operations and temporal operations, efficient retrieval and browsing in video model. As video model is based on object-oriented paradigm, 1 present entire model structure for video data through the design of metadata which is used of logical schema of video, attribute and operation of object, and inheritance and annotation. by using temporal paradigm through the definition of time point and time interval in object-oriented based model, we tan use video information more efficiently by me variation.

  • PDF

An lndexing Technique using Object Relationship Table in Object-Oriented Database Systems (객체지향 데이타베이스 시스템에서 객체 관계성 테이블을 이용한 색인기법)

  • Bu, Ki-Dong;Lee, Sang-Jo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.655-671
    • /
    • 1996
  • Using object relationship table, this study proposes an efficient indexing technique for accessing both aggregation and inheritance hierarchies in object- oriented databases. This indexing technique uses the information on the aggregation and inheritance relationship between classes and the information on referencing instances as meta data. As a result, the technique makes it possible to effectively evaluates various queries navigating between tables. The study compares the proposed technique with the existing indexing techniques and discusses its useful- ness. It also provides the result of simulating its performance in terms of storage and retrieval cost.

  • PDF