ÄãºÃ£¬»¶Ó­À´µ½¾­¹ÜÖ®¼Ò [µÇ¼] [×¢²á]

ÉèΪÊ×Ò³ | ¾­¹ÜÖ®¼ÒÊ×Ò³ | Êղر¾Õ¾

Ä£°åÆ¥Å䶨λÑо¿ÓëʵÏÖ_µç×ÓÐÅÏ¢¹¤³Ì±ÏÒµÂÛÎÄ·¶ÎÄ

·¢²¼Ê±¼ä£º2015-01-14 À´Ô´£ºÈË´ó¾­¼ÃÂÛ̳
µç×ÓÐÅÏ¢¹¤³Ì±ÏÒµÂÛÎÄ·¶ÎÄ Ä¿Â¼ ÕªÒªii Abstractii Ŀ¼iii µÚÒ»Õ Ð÷ÂÛ1 1.1¡¢Ç°ÑÔ1 1.2¡¢¿ÎÌâ±³Ó°1 1.3¡¢Ä£°åÆ¥ÅäµÄÓ¦ÓÃ2 1.4¡¢Ñо¿ÏÖ×´2 1.5¡¢Îı¾×éÖ¯3 µÚ¶þÕ ϵͳ¿ª·¢¹¤¾ß¼ò½é4 2.1¡¢Visual C++ 6.0¼ò½é4 2.2¡¢Visual C++ 6.0µÄÓŵã4 2.3¡¢Visual C++ 6.0 MFCÀà¿â4 2.4¡¢±¾ÕÂС½Ú5 µÚÈýÕ ģ°åÆ¥ÅäËã·¨SSDAËã·¨6 3.1¡¢SSDAµÄ»ù±¾Ô­Àí6 3.2¡¢SSDAµÄ»ù±¾Ëã·¨6 3.3¡¢SSDAµÄËã·¨²½ÖèÓëʵÏÖ6 3.4¡¢SSDAÈýÖÖËã·¨7 3.4.1¡¢ÈýÖÖËã·¨µÄ¹²Í¬Óŵã7 3.4.2¡¢ÈýÖÖËã·¨µÄ²»Í¬Ö®´¦7 3.4.3¡¢½á¹û·ÖÎö8 3.4.4¡¢ÈýÖÖËã·¨µÄȱµã9 3.5¡¢±¾ÕÂС½Ú9 µÚËÄÕ ×ܽáÓëÕ¹Íû9 4.1¡¢×ܽá9 4.1.1¡¢È«ÎÄ×ܽá9 4.2¡¢´æÔڵIJ»×ã10 4.2.2¡¢×ÔÉíµÄ²»×ã10 4.1.3¡¢ÏîÄ¿µÄ²»×ã10 4.2¡¢Õ¹Íû10 µÚÎåÕ¡¡ÖÂл10 µÚÁùÕ¡¡²Î¿¼ÎÄÏ×12 ¸½Â¼113 ÕªÒª Ä£°åÆ¥ÅäÊÇÊý×ÖͼÏñ´¦ÀíÖеÄÖØÒªÄÚÈÝ£¬ËüµÄ×÷ÓÃÊÇÔÚԭͼÏñÖÐÕÒµ½ÓÚÄ£°åͼÏñ×îÏà½üµÄ²¿·Ö¡£ ±¾ÎĶÔÄ£°åÆ¥Åä½øÐÐѧϰºÍÑо¿£¬Ö÷Òª½éÉÜÁËÒ»ÖÖ¿ìËÙµÄÆ¥ÅäËã·¨¡ª¡ªSSDA(Sequential Similarity Detection Algorithms)Ëã·¨¡£SSDAËã·¨Êǽ«Ä£°åÔÚԭͼÉÏƽÒƱȽϣ¬Æ½ÒƵ½×îºóÕÒ³öÏàËƶÈ×î´óµÄÒ»¸ö²¿Î»£¬¾ÍÊÇÎÒÃÇÐèÒªÕҵġ£ÔÚSSDAËã·¨ÖÐÓÃÁËÈý¸ö²»Í¬ÐÎʽµÄ¹«Ê½½øÐбà³Ì£¬Í¨¹ý¶Ô²»Í¬Í¼ÏñµÄ´¦Àí£¬¸÷¸ö¹«Ê½¶ÔͼÏñ´¦ÀíµÄʱ¼äºÍ¾«È·¶È½øÐбȽϡ£ ÔÚMicrosoft Windows XPƽ̨ÉÏVisual C++ 6.0¿ª·¢»·¾³Ï£¬²ÉÓÃÉÏÊö·½·¨±àÖÆÁËÄ£°åÆ¥ÅäµÄÈí¼þ¡£ÊµÑéÖ¤Ã÷£¬¸ÃÈí¼þ¶ÔÓڳߴ粻´óµÄÇåÎúͼƬ»ù±¾Äܹ»ÕýÈ·¶¨Î»£¬²¢½øÐÐʶ±ð£¬µäÐͺÄʱΪ0¡«3ÃëÖÓ¡£ ×îºó£¬±¾ÎÄ̽ÌÖÁËSSDAËã·¨µÄ·½·¨µÄÓÅȱµã£¬Ìá³öÁ˽øÒ»²½¹¤×÷µÄ·½Ïò¡£ ¹Ø¼ü×Ö£ºÍ¼ÏñÆ¥Åä ÐòÁÐÏàËÆÐÔ SSDAËã·¨ ͼÏñÄ£°å VC++ Abstract The template match is an important content in the digital picture processing; its function lies in finding the part which is closest to the template picture from the original map. The template match has been studied and researched in this paper, and the emphasis has been put on the SSDA (Sequential Similarity Detection Algorithms) algorithm, which is one kind of fast match algorithm. The SSDA algorithm is to translate and compare the template in the original map, to finally discover the spot which has most greatly similar. Three different forms formulas in the SSDA algorithm have been carried on the programming, and each formula carried on the comparison to the picture processing time and the precision. In the platform of Microsoft Windows XP and the development environment of Visual C++ 6.0, the software about the template match has been compiled using the above method. The experiment proved that, this software can correctly locate and recognize these kind of pictures which are not big in size but clear with the model time consuming at 0 ~3 seconds in usual. Finally, the good and bad points of the SSDA algorithm method have been discussed, and the further direction of research has been proposed in this paper. Key words: Picture match Similar of sequence SSDA algorithm Picture template VC++
¾­¹ÜÖ®¼Ò¡°Ñ§µÀ»á¡±Ð¡³ÌÐò
  • ɨÂë¼ÓÈë¡°¿¼ÑÐѧϰ±Ê¼ÇȺ¡±
ÍƼöÔĶÁ
¾­¼ÃѧÏà¹ØÎÄÕÂ
±êÇ©ÔÆ
¾­¹ÜÖ®¼Ò¾«²ÊÎÄÕÂÍƼö