Guided Informative Image Partitioning
-
Altmetric Citations
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.author | Brewer, Nathan | |
---|---|---|
dc.contributor.author | Liu, Nianjun | |
dc.contributor.author | Wang, Lei | |
dc.coverage.spatial | Cesme Turkey | |
dc.date.accessioned | 2015-12-07T22:23:24Z | |
dc.date.created | August 18-20 2010 | |
dc.identifier.uri | http://hdl.handle.net/1885/20670 | |
dc.description.abstract | 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 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.publisher | Springer | |
dc.relation.ispartofseries | Joint International Workshops on Structural and Syntactic Pattern Recognition and Statistical Techniques in Pattern Recognition 2010 | |
dc.source | Proceedings of the Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2010) and Statistical Techniques in Pattern Recognition (SPR 2010) | |
dc.subject | Keywords: 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.title | Guided Informative Image Partitioning | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2010 | |
local.identifier.absfor | 080104 - Computer Vision | |
local.identifier.ariespublication | u4963866xPUB13 | |
local.type.status | Published Version | |
local.contributor.affiliation | Brewer, Nathan, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Liu, Nianjun, National ICT Australia | |
local.contributor.affiliation | Wang, Lei, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 11 | |
local.identifier.doi | 10.1007/978-3-642-14980-1_19 | |
local.identifier.absseo | 970109 - Expanding Knowledge in Engineering | |
dc.date.updated | 2016-02-24T11:29:51Z | |
local.identifier.scopusID | 2-s2.0-77958459096 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Brewer_Guided_Informative_Image_2010.pdf | 499.04 kB | Adobe 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