A graph-cut based algorithm for approximate MRF optimization

This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiment...

Full description

Saved in:
Bibliographic Details
Published in2009 16th IEEE International Conference on Image Processing (ICIP) pp. 2413 - 2416
Main Authors Shabou, A., Tupin, F., Darbon, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2009
Subjects
Online AccessGet full text
ISBN9781424456536
1424456533
ISSN1522-4880
DOI10.1109/ICIP.2009.5414189

Cover

Abstract This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiments show that very good local minima are obtained while keeping the memory usage low.
AbstractList This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiments show that very good local minima are obtained while keeping the memory usage low.
Author Darbon, J.
Shabou, A.
Tupin, F.
Author_xml – sequence: 1
  givenname: A.
  surname: Shabou
  fullname: Shabou, A.
  organization: Inst. TELECOM, TELECOM ParisTech, Paris, France
– sequence: 2
  givenname: F.
  surname: Tupin
  fullname: Tupin, F.
  organization: Inst. TELECOM, TELECOM ParisTech, Paris, France
– sequence: 3
  givenname: J.
  surname: Darbon
  fullname: Darbon, J.
  organization: Dept. of Math., UCLA, Los Angeles, CA, USA
BookMark eNpVj9FKwzAYhSNOcJt7APEmL9CaP03aBLwZxWlhoohej6T9u0XWpqQR1Ke34G68OhwOfHxnQWa975GQa2ApANO3VVm9pJwxnUoBApQ-IytdKBBcCJlLyc7_9SyfkTlIzhOhFLski3H8YIwzyGBO7tZ0H8xwSOrPSK0ZsaHmuPfBxUNHWx-oGYbgv1xnItKn1w31Q3Sd-zHR-f6KXLTmOOLqlEvyvrl_Kx-T7fNDVa63iYNCxgQaJlldgwEthJXaKOTZpF9bbKAF0aAqUChrrOVci3bacmxNLYU1suU6W5KbP65DxN0QJpvwvTudz34BTeRMww
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICIP.2009.5414189
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
EISBN 9781424456550
9781424456543
142445655X
1424456541
EndPage 2416
ExternalDocumentID 5414189
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-1d050cc1a1944b59a8e23009cbed1f14de87e48babb2294f3006efac54ba5f293
IEDL.DBID RIE
ISBN 9781424456536
1424456533
ISSN 1522-4880
IngestDate Wed Aug 27 02:55:48 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-1d050cc1a1944b59a8e23009cbed1f14de87e48babb2294f3006efac54ba5f293
PageCount 4
ParticipantIDs ieee_primary_5414189
PublicationCentury 2000
PublicationDate 2009-Nov.
PublicationDateYYYYMMDD 2009-11-01
PublicationDate_xml – month: 11
  year: 2009
  text: 2009-Nov.
PublicationDecade 2000
PublicationTitle 2009 16th IEEE International Conference on Image Processing (ICIP)
PublicationTitleAbbrev ICIP
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020131
ssj0000453011
Score 1.7443603
Snippet This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and...
SourceID ieee
SourceType Publisher
StartPage 2413
SubjectTerms Graph-cut
Image denoising
Image restoration
Image segmentation
Iterative algorithms
Lattices
Markov random fields
Minimization methods
Optimization methods
Partitioning algorithms
Telecommunications
Title A graph-cut based algorithm for approximate MRF optimization
URI https://ieeexplore.ieee.org/document/5414189
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEJ4AJ0-oYHxnDx4tdKHddhMvhkjQBEOMJNzIvqpEoQbbxPjrnd0uGI0Hb30c2u7Odr7Zme8bgAvBFRUUF1JfZ0mA8ZcKUsbCgDLESEppjN9ctcU9G02ju1k8q8HllgtjjHHFZ6ZjD10uX-eqtFtlXduymqa8DvUkZRVXa7ufgtCkslUfbFkdGaeVisGWNdINqQsBTL-_0Xry58ynO2nIu7eD20klY-mf9qPtivM6wyaMN-9bFZu8dMpCdtTnLynH_37QLrS_-X1ksvVce1Azq31oekBK_HJ_b8HVNXGC1oEqC2L9nSbi9SlfL4rnJUG0S5wi-ccCUa8h44chyfEHtPTMzjZMhzePg1Hg2y0EC8QQRUB1GIfKTh2PIhlzkRqMT0KupNE0o5E2aWKiVAopez0eZXiPmUyoOJIizhA2HEBjla_MIRCRIFDrhTLVEhFKqHnczxSGJkkmGKJ5eQQtOxjzt0pRY-7H4fjvyyew43I4jgF4Co1iXZozhAKFPHc28AX3Uar6
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8JAEN4gHvSECsa3e_BooYXdtpt4MUQCCoQYSLiRfVWJQg22ifHXO7tdMBoP3vo4tN2d7XyzM983CF1xJgMewEJqqSTyIP6SXhyGvheEgJGkVBC_2WqLYdidkPspnZbQ9YYLo7W2xWe6bg5tLl-lMjdbZQ3TsjqI2RbapoQQWrC1NjsqAE4Ka3XhllGSsWqpEG4ZM13TugDCtFprtSd3HrqEZ-CzRq_dGxVClu55PxqvWL_TqaDB-o2LcpOXep6Juvz8Jeb430_aQ7Vvhh8ebXzXPirp5QGqOEiK3YJ_r6KbW2wlrT2ZZ9h4PIX561O6mmfPCwx4F1tN8o854F6NB48dnMIvaOG4nTU06dyN213PNVzw5oAiMi9QPvWlmTxGiKCMxxoiFJ9JoVWQBETpONIkFlyIZpORBO6FOuGSEsFpAsDhEJWX6VIfIcwjgGpNX8RKAEbxFaOtREJwEiU8BDwvjlHVDMbsrdDUmLlxOPn78iXa6Y4H_Vm_N3w4Rbs2o2P5gGeonK1yfQ7AIBMX1h6-ACTKrkc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+16th+IEEE+International+Conference+on+Image+Processing+%28ICIP%29&rft.atitle=A+graph-cut+based+algorithm+for+approximate+MRF+optimization&rft.au=Shabou%2C+A.&rft.au=Tupin%2C+F.&rft.au=Darbon%2C+J.&rft.date=2009-11-01&rft.pub=IEEE&rft.isbn=9781424456536&rft.issn=1522-4880&rft.spage=2413&rft.epage=2416&rft_id=info:doi/10.1109%2FICIP.2009.5414189&rft.externalDocID=5414189
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1522-4880&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1522-4880&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1522-4880&client=summon