Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Efficient Image Denoising by MRF Approximation with Uniform-Sampled Multi-Spanning-Tree

Date

Authors

Sun, Jun

Li, Hongdong

He, Xuming

Publisher

IEEE Computer Society

Abstract

Traditionally, image processing based on Markov Random Field (MRF) is often addressed on a 4-connected grid graph defined on the image. This structure is not computationally efficient. In our work, we develop a multiple-trees structure to approximate the

Keywords

Keywords: Computationally efficient; Grid graphs; Image de-noising; Loopy belief propagation; Markov random field; Maximum a posteriors; Median filter; MRF; Random Walk; Spanning tree; Tree structures; Algorithms; Computational efficiency; Dynamic programming; Imag Image denoising; MAP inference; MRF; Spanning tree

URI

http://hdl.handle.net/1885/64315

Collections

ANU Research Publications

Source

International Conference on Image and Graphics (ICIG 2011) proceedings

Type

Conference paper

DOI

10.1109/ICIG.2011.186

Restricted until

2037-12-31

Downloads

File

Description

01_Sun_Efficient_Image_Denoising_by_2011.pdf (453.12 KB)