Real-time subimage detection in a given texture using pyramid processing

M. Sankar Kishore; B. L. Deekshatulu

doi:10.1117/12.23530

Abstract

We are considering a texture as an image consisting of number of different subimages. An attempt is made to findout all(different) subimages present in a given textured image and the number of times such subimages are repeating. By taking the advantage of the Burt pyramid processing algorithm a system has been developed to solve the above problem in real time. The hardware setup is also presented in this paper. In this analysis two dimensional entropy is used o solve the above said problem.

Citation Download Citation

M. Sankar Kishore, M. Sankar Kishore, B. L. Deekshatulu, B. L. Deekshatulu, } "Real-time subimage detection in a given texture using pyramid processing", Proc. SPIE 1349, Applications of Digital Image Processing XIII, (1 November 1990); doi: 10.1117/12.23530; https://doi.org/10.1117/12.23530

ACCESS THE FULL ARTICLE

PERSONAL SIGN IN
Full access may be available with your subscription

Email or Username Forgot your username?

Password Forgot your password?

Show

Remember Email/Username on this computer

Remember Password

No SPIE account? Create an account
or Institutional Sign In via Shibboleth

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $14.40

Non-members: $18.00 ADD TO CART

Show All Keywords

Keywords/Phrases

Search In:

Publication Years