DocumentCode :
1721783
Title :
Two Applications of Graph-Cuts to Image Processing
Author :
Cooke, Tristrom
Author_Institution :
ISR Div., Defence Sci. & Technol. Organ., Edinburgh, SA
fYear :
2008
Firstpage :
498
Lastpage :
504
Abstract :
Graph-cut methods have become an intensive area of research in image processing, with applications to stereo vision, binary thresholding, classification and image de-noising amongst other areas. This paper describes novel graph-cut implementations for use in two applications: 2D optical flow and interactive object delineation. The optical flow implementation is based on recursive application of graph-cuts, and is shown to perform favourably with state-of-the-art methods. The delineation method is novel in that it requires only a single point to be selected for a delineation to be achieved, and uses a different type of graph topology compared to the traditional methods.
Keywords :
graph theory; image sequences; 2D optical flow; graph-cut methods; image processing; interactive object delineation; Australia; Computer applications; Computer vision; Digital images; Image denoising; Image motion analysis; Image processing; Layout; Stereo vision; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Digital Image Computing: Techniques and Applications (DICTA), 2008
Conference_Location :
Canberra, ACT
Print_ISBN :
978-0-7695-3456-5
Type :
conf
DOI :
10.1109/DICTA.2008.32
Filename :
4700063
Link To Document :
بازگشت