Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Fast Segmentation of Large Images

Crisp, D.J., Perry, P. and Redding, N.J.

    The processing of large images is a generic problem in wide area surveillance. An important difficulty is that many image processing algorithms are global rather than local and hence can be infeasible due to the required computing time or memory resources when processing very large images. Consequently there is a need to break such image processing problems into smaller pieces. A similar need also arises when the requirement is to process the imagery on-line as it is being collected. Here, we consider the particular problem of image segmentation. The approach we take is to divide the large image into smaller overlapping tiles. We segment each tile separately and then patch the results together. The main contribution of this paper is our answer to the question of how to handle ambiguities in the overlapping areas. Our solution is applicable to any segmentation algorithm which is based on region margining. The particular algorithm we use is known as the Full Lambda Schedule Algorithm (FLSA). We also include a description of some refinements to the original algorithm which provide speed and efficiency improvements.
Cite as: Crisp, D.J., Perry, P. and Redding, N.J. (2003). Fast Segmentation of Large Images. In Proc. Twenty-Sixth Australasian Computer Science Conference (ACSC2003), Adelaide, Australia. CRPIT, 16. Oudshoorn, M. J., Ed. ACS. 87-93.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007