• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      İmge işleme yoluyla çubuk kod yersenimi

      Thumbnail
      View / Download
      553.4 Kb
      Author
      Öktem, R.
      Çetin, A. Enis
      Date
      2005-05
      Source Title
      Proceedings of the IEEE 13th Signal Processing and Communications Applications Conference, SIU 2005
      Publisher
      IEEE
      Pages
      328 - 331
      Language
      Turkish
      Type
      Conference Paper
      Item Usage Stats
      159
      views
      130
      downloads
      Abstract
      Bu özette imge işleme kullanılarak çubuk kod bölgesi çıkarımı ele alınmıştır. Çubuk kodlar birbirine paralel açık-koyu doğrulardan oluştuklarından, ikili bir ayrıt haritasında da belirli bir oryantasyonda birbirine bağlı paralel doğrular olarak ayırdedilirler. Sunulan algoritmalar, bu özellikten yola çıkarak morfoloji ve serbest açı eşiklemesi yolu ile bar koda ait bölgeyi yersemeyi amaçlamaktadır. Ayrıt haritası oluşturmada Sobel işlemi ve ikili altbant dönüşümü kullanılmakta ve her iki yöntem de zaman karmaşıklığı ve performans açısından karşılaştırılmaktadır.
       
      This paper addresses the problem of bar code recognition by use of image processing. Bar codes are composed of parallel alternating dark-light stripes; hence they also appear as parallel lines connected at some orientation in a binary edge map. The proposed algorithms exploit that feature and use morphology and free angle thresholding for localization. Edge map is formed by Sobel operator and binary subband decomposition separately, and the two methods are compared in terms of time complexity and performance. Detailed discussion of test results are also presented. ©2005 IEEE.
      Keywords
      Bar code recognition
      Binary edge maps
      Binary subband decomposition
      Time complexity
      Algorithms
      Bar codes
      Object recognition
      Problem solving
      Image processing
      Permalink
      http://hdl.handle.net/11693/27304
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/SIU.2005.1567687
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy