5 research outputs found

    Image Retreival Using Weighted Color Co-occurrence Histogram

    Get PDF
    Color image retrieval is to search color images using queries represented by image descriptors, which usually describe color distribution and relation of color pixels in an image. A color co-occurrence histogram (CCH) among the descriptors captures information on the spatial layout of colors within an image. It has shown excellent performance on color image retrieval, but requires many bins to describe contents of images and has bad effect on the similarity of same contents images, in which the size of homogeneous color regions are highly different. To resolve these problems and to improve retrieval performance, this thesis proposes a weighted CCH and two image retrieval methods using it. Generally the process of image retrieval using a CCH has three steps. The first step is to get the CCH from a query image. The second step is to compute similarity between CCHs of the query image and reference images. The last step is to sort reference images by the similarities and to visualize them. The proposed retrieval methods weight main diagonal and off-diagonal elements of a CCH in the first and/or the second steps mentioned above. Experiments have shown that the proposed methods with a few bins outperform some conventional methods when large weight is given on off-diagonal elements regardless of color quantization levels. We believe that the effectiveness of the method is caused by the characteristics describing the size and the coherence of homogeneous color regions and being robust to size variation of the color regions. Moreover, the image retrieval performance is little affected by the threshold, which is an energy level of valid bins, regardless of color quantization levels. The proposed methods use contents of images effectively, so they can be effectually used in the other content-based applications such as color image classification, color object tracking, and video cut detection.μ œοΌ‘μž₯ μ„œ λ‘  = 1 1.1 μ—°κ΅¬μ˜ λ°°κ²½ = 1 1.2 μ œμ•ˆν•œ 방법 = 3 μ œοΌ’μž₯ λ‚΄μš©κΈ°λ°˜ μ˜μƒκ²€μƒ‰μ„ μœ„ν•œ 컬러 기술자 = 6 2.1 λ‚΄μš©κΈ°λ°˜ μ˜μƒκ²€μƒ‰ μ‹œμŠ€ν…œ = 6 2.2 μ»¬λŸ¬μ˜μƒμ„ μœ„ν•œ 기술자 = 7 μ œοΌ“μž₯ 컬러 λ™μ‹œλ°œμƒ νžˆμŠ€ν† κ·Έλž¨μ— μ˜ν•œ μ˜μƒκ²€μƒ‰ = 19 3.1 컬러 λ™μ‹œλ°œμƒ νžˆμŠ€ν† κ·Έλž¨μ˜ 문제점 = 19 3.2 λŒ€κ°μ„±λΆ„κ³Ό λΉ„λŒ€κ°μ„±λΆ„μ˜ μ˜μƒκΈ°μˆ  = 24 3.3 λŒ€κ°μ„±λΆ„κ³Ό λΉ„λŒ€κ°μ„±λΆ„μ˜ μ˜μƒκ²€μƒ‰ μ„±λŠ₯ = 29 μ œοΌ”μž₯ κ°€μ€‘μΉ˜λ₯Ό λ‘” 컬러 λ™μ‹œλ°œμƒ νžˆμŠ€ν† κ·Έλž¨μ„ μ΄μš©ν•œ μ˜μƒκ²€μƒ‰ = 36 4.1 λŒ€κ°μ„±λΆ„ 및 λΉ„λŒ€κ°μ„±λΆ„μ— κ°€μ€‘μΉ˜λ₯Ό λ‘” μ˜μƒκ²€μƒ‰ = 38 4.1.1 λŒ€κ°μ„±λΆ„ 및 λΉ„λŒ€κ°μ„±λΆ„μ— κ°€μ€‘μΉ˜λ₯Ό λ‘” CCH = 38 4.1.2 빈 개수 μΆ•μ†Œμ™€ μœ μ‚¬λ„ μΈ‘μ • = 42 4.2 λŒ€κ°μ„±λΆ„, λΉ„λŒ€κ°μ„±λΆ„ 및 κ°€μ€‘μΉ˜μ— μ˜ν•œ μ˜μƒκ²€μƒ‰ = 46 4.2.1 CCH의 νšλ“κ³Ό 빈 제거 = 46 4.2.2 μœ μ‚¬λ„ μΈ‘μ • = 48 μ œοΌ•μž₯ μ‹€ν—˜ 및 κ³ μ°° = 52 5.1 μ‹€ν—˜ν™˜κ²½ 및 μ„±λŠ₯평가 방법 = 52 5.2 μ‹€ν—˜κ²°κ³Ό 및 κ³ μ°° = 55 μ œοΌ–μž₯ κ²° λ‘  = 79 μ°Έκ³  λ¬Έν—Œ = 8
    corecore