• DocumentCode
    3079413
  • Title

    An ingenious technique for symbol identification from high noise CAPTCHA images

  • Author

    Kapoor, Dhruv ; Bangar, H. ; Sethi, Ankit

  • Author_Institution
    Dept. of Electron. & Electr. Eng., Indian Inst. of Technol. Guwahati, Guwahati, India
  • fYear
    2012
  • fDate
    7-9 Dec. 2012
  • Lastpage
    103
  • Abstract
    This paper examines the problem of decoding a unique CAPTCHA that has very high noise levels with only partially visible symbols with variable spacing but no skewing. An ingenious method for decoding is proposed that starts with preprocessing the image and identifies symbols first before removing them from the image, unlike a number of existing methods. The algorithm is expected to be very fast owing to a reduction of the image matrix into a number of small segments that codify information in a lossy way that still allows for template matching for symbol identification. Character identification is attempted using both a Neural Network based approach and a mean square error method and their performance is compared and it is shown that the latter is significantly faster without being much less accurate. The CAPTCHA decoding strategy should offer insight into better methods of designing CAPTCHA´s and into decoding strategies for other applications such as OCR.
  • Keywords
    character recognition; image coding; image matching; matrix algebra; mean square error methods; neural nets; character identification; high noise CAPTCHA images; image decoding; image matrix; ingenious technique; mean square error method; neural network; symbol identification; template matching; Character recognition; Decoding; Histograms; Image segmentation; Neural networks; Noise; Vectors; CAPTCHA; Euclidean distance; Neural Networks; component labeling; decoding; mean square error; segmentation; template matching;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    India Conference (INDICON), 2012 Annual IEEE
  • Conference_Location
    Kochi
  • Print_ISBN
    978-1-4673-2270-6
  • Type

    conf

  • DOI
    10.1109/INDCON.2012.6420596
  • Filename
    6420596