Skip navigation
Skip navigation

Guided Informative Image Partitioning

Brewer, Nathan; Liu, Nianjun; Wang, Lei

Description

Image partitioning separates an image into multiple visually and semantically homogeneous regions, providing a summary of visual content. Knowing that human observers focus on interesting objects or regions when interpreting a scene, and envisioning the usefulness of this focus in many computer vision tasks, this paper develops a user-attention adaptive image partitioning approach. Given a set of pairs of oversegments labeled by a user as "should be merged" or "should not be merged", the...[Show more]

dc.contributor.authorBrewer, Nathan
dc.contributor.authorLiu, Nianjun
dc.contributor.authorWang, Lei
dc.coverage.spatialCesme Turkey
dc.date.accessioned2015-12-07T22:23:24Z
dc.date.createdAugust 18-20 2010
dc.identifier.urihttp://hdl.handle.net/1885/20670
dc.description.abstractImage partitioning separates an image into multiple visually and semantically homogeneous regions, providing a summary of visual content. Knowing that human observers focus on interesting objects or regions when interpreting a scene, and envisioning the usefulness of this focus in many computer vision tasks, this paper develops a user-attention adaptive image partitioning approach. Given a set of pairs of oversegments labeled by a user as "should be merged" or "should not be merged", the proposed approach produces a fine partitioning in user defined interesting areas, to retain interesting information, and a coarser partitioning in other regions to provide a parsimonious representation. To achieve this, a novel Markov Random Field (MRF) model is used to optimally infer the relationship ("merge" or "not merge") among oversegment pairs, by using the graph nodes to describe the relationship between pairs. By training an SVM classifier to provide the data term, a graph-cut algorithm is employed to infer the best MRF configuration. We discuss the difficulty in translating this configuration back to an image labelling, and develop a non-trivial post-processing to refine the configuration further. Experimental verification on benchmark data sets demonstrates the effectiveness of the proposed approach.
dc.publisherSpringer
dc.relation.ispartofseriesJoint International Workshops on Structural and Syntactic Pattern Recognition and Statistical Techniques in Pattern Recognition 2010
dc.sourceProceedings of the Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2010) and Statistical Techniques in Pattern Recognition (SPR 2010)
dc.subjectKeywords: Adaptive images; Benchmark data; Data terms; Experimental verification; Graph-cut; Homogeneous regions; Human observers; Image partitioning; Interesting information; Markov random field models; Non-trivial; Post processing; SVM classifiers; Visual content
dc.titleGuided Informative Image Partitioning
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2010
local.identifier.absfor080104 - Computer Vision
local.identifier.ariespublicationu4963866xPUB13
local.type.statusPublished Version
local.contributor.affiliationBrewer, Nathan, College of Engineering and Computer Science, ANU
local.contributor.affiliationLiu, Nianjun, National ICT Australia
local.contributor.affiliationWang, Lei, College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.startpage11
local.identifier.doi10.1007/978-3-642-14980-1_19
local.identifier.absseo970109 - Expanding Knowledge in Engineering
dc.date.updated2016-02-24T11:29:51Z
local.identifier.scopusID2-s2.0-77958459096
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Brewer_Guided_Informative_Image_2010.pdf499.04 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator