liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
ON NONLOCAL IMAGE COMPLETION USING AN ENSEMBLE OF DICTIONARIES
Linköping University, Department of Science and Technology, Media and Information Technology. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Media and Information Technology. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-7765-1747
2016 (English)In: 2016 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), IEEE , 2016, p. 2519-2523Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we consider the problem of nonlocal image completion from random measurements and using an ensemble of dictionaries. Utilizing recent advances in the field of compressed sensing, we derive conditions under which one can uniquely recover an incomplete image with overwhelming probability. The theoretical results are complemented by numerical simulations using various ensembles of analytical and training-based dictionaries.

Place, publisher, year, edition, pages
IEEE , 2016. p. 2519-2523
Series
IEEE International Conference on Image Processing ICIP, ISSN 1522-4880
Keywords [en]
compressed sensing; image completion; nonlocal; inverse problems; uniqueness conditions
National Category
Computer Vision and Robotics (Autonomous Systems)
Identifiers
URN: urn:nbn:se:liu:diva-134107DOI: 10.1109/ICIP.2016.7532813ISI: 000390782002114ISBN: 978-1-4673-9961-6 (print)OAI: oai:DiVA.org:liu-134107DiVA, id: diva2:1067518
Conference
23rd IEEE International Conference on Image Processing (ICIP)
Available from: 2017-01-22 Created: 2017-01-22 Last updated: 2018-11-23
In thesis
1. Sparse representation of visual data for compression and compressed sensing
Open this publication in new window or tab >>Sparse representation of visual data for compression and compressed sensing
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The ongoing advances in computational photography have introduced a range of new imaging techniques for capturing multidimensional visual data such as light fields, BRDFs, BTFs, and more. A key challenge inherent to such imaging techniques is the large amount of high dimensional visual data that is produced, often requiring GBs, or even TBs, of storage. Moreover, the utilization of these datasets in real time applications poses many difficulties due to the large memory footprint. Furthermore, the acquisition of large-scale visual data is very challenging and expensive in most cases. This thesis makes several contributions with regards to acquisition, compression, and real time rendering of high dimensional visual data in computer graphics and imaging applications.

Contributions of this thesis reside on the strong foundation of sparse representations. Numerous applications are presented that utilize sparse representations for compression and compressed sensing of visual data. Specifically, we present a single sensor light field camera design, a compressive rendering method, a real time precomputed photorealistic rendering technique, light field (video) compression and real time rendering, compressive BRDF capture, and more. Another key contribution of this thesis is a general framework for compression and compressed sensing of visual data, regardless of the dimensionality. As a result, any type of discrete visual data with arbitrary dimensionality can be captured, compressed, and rendered in real time.

This thesis makes two theoretical contributions. In particular, uniqueness conditions for recovering a sparse signal under an ensemble of multidimensional dictionaries is presented. The theoretical results discussed here are useful for designing efficient capturing devices for multidimensional visual data. Moreover, we derive the probability of successful recovery of a noisy sparse signal using OMP, one of the most widely used algorithms for solving compressed sensing problems.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2018. p. 158
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1963
National Category
Media Engineering
Identifiers
urn:nbn:se:liu:diva-152863 (URN)10.3384/diss.diva-152863 (DOI)9789176851869 (ISBN)
Public defence
2018-12-14, Domteatern, Visualiseringscenter C, Kungsgatan 54, Campus Norrköping, Norrköping, 09:15 (English)
Opponent
Supervisors
Available from: 2018-11-23 Created: 2018-11-23 Last updated: 2018-11-23Bibliographically approved

Open Access in DiVA

fulltext(1297 kB)11 downloads
File information
File name FULLTEXT03.pdfFile size 1297 kBChecksum SHA-512
9adfbdcf318aa915135bc565599568a0a657a12abaac929852f90215d466c230f0847dbbfc09958d6a2cef01431ad5f7eb7868a64e8a8c01375f3df61d13ff08
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Miandji, EhsanUnger, Jonas

Search in DiVA

By author/editor
Miandji, EhsanUnger, Jonas
By organisation
Media and Information TechnologyFaculty of Science & Engineering
Computer Vision and Robotics (Autonomous Systems)

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 130 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf