• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > IPIU (¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥) > IPIU 1997 (Á¦9ȸ ¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥)

IPIU 1997 (Á¦9ȸ ¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) º¹ÇÕ ±×·¡ÇÁ Ç¥ÇöÀ» ÀÌ¿ëÇÑ Ä÷¯ ¿µ»óÀÇ °Ë»ö ±â¹ý
¿µ¹®Á¦¸ñ(English Title) Color Image Retrieval Using Hybrid Graph Representation
ÀúÀÚ(Author) ¹ÚÀαԠ  À±Àϵ¿   ÀÌ»ó¿í   In Kyu Park   Il Dong Yun   Sang Uk Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 09 NO. 01 PP. 0197 ~ 0202 (1997. 01)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In this paper, an effective color image retrieval algorithm is proposed based on a hybrid graph representation, which consists of Modified Color Adjacency Graph (MCAG) and Spatial Variance Graph (SVG). The MCAG, which improves Color Adjacency Graph (CAG), is proposed to enhance the matching sensitivity and managing ability for a large image database, in which color adjacency information as well as color histogram is taken into account. In addition, the SVG is introduced to consider the geometric information in spatial domain. In the SVG, self and mutual variances are adopted as the attributes of each pair of effective nodes of MCAG so that spatial relationship between distinct nodes is properly modeled. After generating graphs, graph matching is performed to retrieve the best matched image by using the proposed similarity measure. Experiments are performed for Swain¡¯s test images and VIRAGE images, which show that the proposed algorithm provides high retrieval performance, compared to the previous works.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå