• Title/Summary/Keyword: Image retrieve

Search Result 184, Processing Time 0.027 seconds

Image Retrieval with Fuzzy Triples to Support Inexact and Concept-based Match (근사 정합과 개념 기반 정합을 지원하는 퍼지 트리플 기반 이미지 검색)

  • Jeong, Seon-Ho;Yang, Jae-Dong;Yang, Hyeong-Jeong
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.8
    • /
    • pp.964-973
    • /
    • 1999
  • 본 논문에서는 퍼지 트리플을 사용하는 내용 기반 이미지 검색 방법을 제안한다. 이미지 내 객체들 사이의 공간 관계는 내용 기반 이미지 검색을 위해 사용되는 주요한 속성들 중의 하나이다. 그러나, 기존의 트리플을 이용한 이미지 검색 시스템들은 개념 기반 검색 방법을 지원하지 못하고, 방향들 사이의 근사 정합을 처리하지 못하는 문제점을 가지고 있다. 이 문제를 해결하기 위하여 본 논문에서는 개념 기반 정합과 근사 정합을 지원하는 퍼지 트리플을 이용한 이미지 검색 방법을 제안한다. 개념 기반 정합을 위해서는 퍼지 소속성 집합으로 이루어진 시소러스가 사용되며, 근사 정합을 위해서는 방향들 사이의 관계를 정량화 하기 위한 k-weight 함수가 각각 이용된다. 이 두 가지 정합은 퍼지 트리플 간의 퍼지 정합을 통하여 균일하게 지원될 수 있다. 본 논문에서는 또한, 개념 기반 정합과 근사 정합에 대한 검색 효과를 정량적으로 평가하는 작업을 수행한다. Abstract This paper proposes an inexact and a concept-based image match technique based on fuzzy triples. The most general method adopted to index and retrieve images based on this spatial structure may be triple framework. However, there are two significant drawbacks in this framework; one is that it can not support a concept-based image retrieval and the other is that it fails to deal with an inexact match among directions. To compensate these problems, we develope an image retrieval technique based on fuzzy triples to make the inexact and concept-based match possible. For the concept-based match, we employ a set of fuzzy membership functions structured like a thesaurus, whereas for the inexact match, we introduce k-weight functions to quantify the similarity between directions. In fuzzy triples, the two facilities are uniformly supported by fuzzy matching. In addition, we analyze the retrieval effectiveness of our framework regarding the degree of the conceptual matching and the inexact matching.

A Relevance Feedback Method Using Threshold Value and Pre-Fetching (경계 값과 pre-fetching을 이용한 적합성 피드백 기법)

  • Park Min-Su;Hwang Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.9
    • /
    • pp.1312-1320
    • /
    • 2004
  • Recently, even if a lot of visual feature representations have been studied and systems have been built, there is a limit to existing content-based image retrieval mechanism in its availability. One of the limits is the gap between a user's high-level concepts and a system's low-level features. And human beings' subjectivity in perceiving similarity is excluded. Therefore, correct visual information delivery and a method that can retrieve the data efficiently are required. Relevance feedback can increase the efficiency of image retrieval because it responds of a user's information needs in multimedia retrieval. This paper proposes an efficient CBIR introducing positive and negative relevance feedback with threshold value and pre-fetching to improve the performance of conventional relevance feedback mechanisms. With this Proposed feedback strategy, we implement an image retrieval system that improves the conventional retrieval system.

  • PDF

A study on searching image by cluster indexing and sequential I/O (연속적 I/O와 클러스터 인덱싱 구조를 이용한 이미지 데이타 검색 연구)

  • Kim, Jin-Ok;Hwang, Dae-Joon
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.779-788
    • /
    • 2002
  • There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

Content-Based Retrieval System Design for Image and Video using Multiple Fetures (다중 특징을 이용한 영상 및 비디오 내용 기반 검색 시스템 설계)

  • Go, Byeong-Cheol;Lee, Hae-Seong;Byeon, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1519-1530
    • /
    • 1999
  • 오늘날 멀티미디어 정보의 양이 매우 빠른 속도로 증가함에 따라 멀티미디어 데이타베이스에 대한 효율적인 관리는 더욱 중요한 의미를 가지게 되었다. 게다가 영상과 같은 비 문자형태의 데이타에 대한 사용자들의 내용기반 검색욕구 증가로 인해 비디오 인덱싱에 대한 관심은 더욱 고조되고 있다. 따라서 본 논문에서는 우선적으로 분할된 샷 경계면에서 추출된 대표 프레임과 정지 영상 데이타베이스로부터 유사 영상과 유사 대표 프레임을 검색할 수 있는 환경을 제공한다. 우선적으로 영상에 의한 질의는 기존에 주로 사용되어온 색상 히스토그램방식을 탈피하여 본 논문에서 제안하는 CS와 GS방식을 이용하여 색상 및 방향성 정보도 고려하도록 설계하였다. 또한 얼굴에 의한 질의는 대표 프레임으로부터 얼굴 영역을 추출해 내고 얼굴의 경계선 값 및 쌍 직교 웨이블릿 변환에 의해 얻어진 2개의 특징값을 이용하여 유사 인물이 포함된 대표 프레임을 검색해 내도록 설계하였다. Abstract There is a rapid increase in the use of digital video information in recent years, it becomes more important to manage multimedia databases efficiently. There is a big concern about video indexing because users require content-based image retrieval. In this paper, we first propose query-by-image system environment which allows to retrieve similar images from the chosen representative frames or images from the image databases. This algorithm considers not only the discretized color histogram but also the proposed directional information called CS & GS method. Finally, we designe another query environment using query-by-face. In this system , user selects a people in the representative frame browser and then system extracts a face region from that frame. After that system retrieves similar representative frames using 2 features, edge information and biorthogonal wavelet transform.

The Access-Enhanced Search Interface Design for Korean Paintings (다양한 접근점 기반의 한국화 검색 인터페이스에 관한 연구)

  • Seo, Eun-Gyoung;Lee, Won-Kyung
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.2
    • /
    • pp.25-48
    • /
    • 2008
  • The purpose of this study is to suggest retrieval interfaces for Korean paintings which support users to retrieve specific digitalized images of them through various access points and to widely browse based on unique features Korean paintings. The study, first, develops a set of descriptive elements suitable for Korean Paintings. Twenty-six core elements and one hundred seventy-two attributes are selected as descriptive items for Korean paintings based on the opinion of 8 experts. Then, to gam realistic evidence of what descriptive elements of image serve users as access points, it is investigated which elements are used as retrieval access points among 26 core elements by 300 peered users who are consisted with two groups such as common users and domain specialists. The study, in final, designs two(general and advanced) types of search interfaces and display interfaces based on the most popular top 15 descriptive elements. This access-enhanced platform which enables user-oriented searches will satisfy users in image retrieving.

Fast Patch Retrieval for Example-based Super Resolution by Multi-phase Candidate Reduction (단계적 후보 축소에 의한 예제기반 초해상도 영상복원을 위한 고속 패치 검색)

  • Park, Gyu-Ro;Kim, In-Jung
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.4
    • /
    • pp.264-272
    • /
    • 2010
  • Example-based super resolution is a method to restore a high resolution image from low resolution images through training and retrieval of image patches. It is not only good in its performance but also available for a single frame low-resolution image. However, its time complexity is very high because it requires lots of comparisons to retrieve image patches in restoration process. In order to improve the restoration speed, an efficient patch retrieval algorithm is essential. In this paper, we applied various high-dimensional feature retrieval methods, available for the patch retrieval, to a practical example-based super resolution system and compared their speed. As well, we propose to apply the multi-phase candidate reduction approach to the patch retrieval process, which was successfully applied in character recognition fields but not used for the super resolution. In the experiments, LSH was the fastest among conventional methods. The multi-phase candidate reduction method, proposed in this paper, was even faster than LSH: For $1024{\times}1024$ images, it was 3.12 times faster than LSH.

Image Retrieval using Variable Block Size DCT (가변 블록 DCT를 이용한 영상 검색 기법)

  • 김동우;서은주;윤태승;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.423-429
    • /
    • 2001
  • In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.

  • PDF

The Content-Based Image Retrieval by using Color Histogram and Shape-Based Feature Extraction (컬러 히스토그램과 형상 기반 특징 추출을 이용한 내용 기반 영상 검색)

  • Kang, Hyun-Inn;Ju, Yong-Wan;Baek, Kwang-Ryul
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.10
    • /
    • pp.113-122
    • /
    • 1999
  • When we want to retrieve the most similar image from the image database, the color histogram intersection, shape feature and texture feature comparing method are used as a metric to measure the similarity. In order to increase the accuracy of retrievals, we need to integrate two different features. In this paper, the histogram intersection and shape based block histogram intersection method are used. This method results in a high efficient algorithm that meets a similar accuracy and a relatively fast retrieval speed compared to the method of integration of two different features. The Proposed algorithm is tested on retrievals of image database consisting of various 600 images and we implemented that the proposed algorithm gives fast, high efficiency and reliability compared to others.

  • PDF

Complex Color Model for Efficient Representation of Color-Shape in Content-based Image Retrieval (내용 기반 이미지 검색에서 효율적인 색상-모양 표현을 위한 복소 색상 모델)

  • Choi, Min-Seok
    • Journal of Digital Convergence
    • /
    • v.15 no.4
    • /
    • pp.267-273
    • /
    • 2017
  • With the development of various devices and communication technologies, the production and distribution of various multimedia contents are increasing exponentially. In order to retrieve multimedia data such as images and videos, an approach different from conventional text-based retrieval is needed. Color and shape are key features used in content-based image retrieval, which quantifies and analyzes various physical features of images and compares them to search for similar images. Color and shape have been used as independent features, but the two features are closely related in terms of cognition. In this paper, a method of describing the spatial distribution of color using a complex color model that projects three-dimensional color information onto two-dimensional complex form is proposed. Experimental results show that the proposed method can efficiently represent the shape of spatial distribution of colors by frequency transforming the complex image and reconstructing it with only a few coefficients in the low frequency.

A Study on Virtual Reality Management of 3D Image Information using High-Speed Information Network (초고속 정보통신망을 통한 3차원 영상 정보의 가상현실 관리에 관한 연구)

  • Kim, Jin-Ho;Kim, Jee-In;Chang, Chun-Hyon;Song, Sang-Hoon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.12
    • /
    • pp.3275-3284
    • /
    • 1998
  • In this paper, we deseribe a Medical Image Information System. Our system stores and manages 5 dimensional medical image data and provides the 3 dimensional medical data via the Internet. The Internet standard VR format. VRML(Virtual Reality Modeling Language) is used to represent the 3I) medical image data. The 3D images are reconstructed from medical image data which are enerated by medical imaging systems such ans CT(Computerized Tomography). MRI(Magnetic Resonance Imaging). PET(Positron Emission Tomograph), SPECT(Single Photon Emission Compated Tomography). We implemented the medical image information system shich rses a surface-based rendering method for the econstruction of 3D images from 2D medical image data. In order to reduce the size of image files to be transfered via the Internet. The system can reduce more than 50% for the triangles which represent the surfaces of the generated 3D medical images. When we compress the 3D image file, the size of the file can be redued more than 80%. The users can promptly retrieve 3D medical image data through the Internet and view the 3D medical images without a graphical acceleration card, because the images are represented in VRML. The image data are generated by various types of medical imaging systems such as CT, MRI, PET, and SPECT. Our system can display those different types of medical images in the 2D and the 3D formats. The patient information and the diagnostic information are also provided by the system. The system can be used to implement the "Tele medicaine" systems.

  • PDF