Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)
Current Result Document : 4 / 5
ÇѱÛÁ¦¸ñ(Korean Title) |
È¥ÇÕ °¡¿ì½Ã¾È ¸ðµ¨°ú ¹Î½¬ÇÁÆ® ÇÊÅ͸¦ ÀÌ¿ëÇÑ ±íÀÌ ¸Ê ºÎÈ£È Àüó¸® ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Depth Map Pre-processing using Gaussian Mixture Model and Mean Shift Filter |
ÀúÀÚ(Author) |
¹Ú¼ºÈñ
À¯Áö»ó
Sung-hee Park
Ji-sang Yoo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 15 NO. 05 PP. 1155 ~ 1163 (2011. 05) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ±íÀÌ ¸Ê(depth map)¿¡ ´ëÇÑ È¿À²ÀûÀÎ ºÎȣȸ¦ À§ÇÏ¿© Àüó¸® ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ÇöÀç 3Â÷¿ø ºñµð¿À ºÎÈ£È(3D video coding : 3DVC)¿¡ ´ëÇÑ Ç¥ÁØÈ°¡ ÁøÇà Áß¿¡ ÀÖÁö¸¸ ¾ÆÁ÷ ±íÀÌ ¸ÊÀÇ ºÎÈ£È ¹æ¹ý¿¡ ´ëÇÑ Ç¥ÁØÀº È®Á¤µÇÁö ¾ÊÀº »óÅÂÀÌ´Ù. Á¦¾ÈÇÏ´Â ±â¹ý¿¡¼´Â ¸ÕÀú ÀÔ·ÂµÈ ±íÀÌ ¸ÊÀÇ È÷½ºÅä±×·¥ ºÐÆ÷¸¦ °¡¿ì½Ã¾È È¥ÇÕ¸ðµ¨(Gaussian mixture model : GMM) ±â¹ÝÀÇ EM(expectation maximization) ±ºÁýÈ ±â¹ýÀ» ÀÌ¿ëÇÏ¿© ºÐ¸®ÇÑ´Ù. ºÐ¸®µÈ È÷½ºÅä±×·¥À» ±â¹ÝÀ¸·Î ±íÀÌ ¸ÊÀ» ¿©·¯ °³ÀÇ ·¹À̾î·Î ºÐ¸®ÇÏ°Ô µÈ´Ù. ºÐ¸®µÈ °¢°¢ÀÇ ·¹À̾¼ ¹è°æ°ú °´Ã¼ÀÇ Æ÷ÇÔ ¿©ºÎ¿¡ µû¶ó ´Ù¸¥ Á¶°ÇÀÇ ¹Î½¬ÇÁÆ® ÇÊÅÍ(mean shift filter)¸¦ Àû¿ëÇÑ´Ù. °á°úÀûÀ¸·Î ¿µ»ó³»ÀÇ °¢ ¿µ¿ª °æ°è´Â ÃÖ´ëÇÑ »ì¸®¸é¼ ¿µ¿ª³»ÀÇ È¼Ò °ª¿¡ ´ëÇؼ´Â Æò±Õ ¿¬»êÀ» ÃëÇÏ¿© ºÎȣȽà ȿÀ²À» ±Ø´ëÈ ÇÏ°íÀÚ ÇÏ¿´´Ù. ´Ù¾çÇÑ ½ÇÇ迵»ó¿¡ ´ëÇÏ¿© Á¦¾ÈÇÑ ±â¹ýÀ» Àû¿ëÇÑ ±íÀÌ ¸ÊÀ» ºÎÈ£ÈÇÏ¿© ºñÆ®À²(bit rate)ÀÌ °¨¼ÒÇÏ°í ºÎÈ£È ½Ã°£µµ ´Ù¼Ò ÁÙ¾îµå´Â °ÍÀ» È®ÀÎ ÇÒ ¼ö ÀÖ¾ú´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.
|
Å°¿öµå(Keyword) |
3Â÷¿ø ºñµð¿À ÄÚµù
ÀÚÀ¯½ÃÁ¡ TV
±íÀÌ ¸Ê
¸ÖƼ ºä
3DVC
FTV
depth-map
multi-view
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|