Sequential image completion for high-speed large-pixel number sensing

Akira Hirabayashi, Naoki Nogami, Takashi Ijiri, Laurent Condat

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We propose an algorithm that enhances the number of pixels for high-speed camera imaging to suppress its main problem. That is, the number of pixels reduces when the number of frames per second (fps) increases. To this end, we suppose an optical setup that block-randomly selects some percent of pixels in an image. Then, the proposed algorithm reconstructs the entire image from the selected partial pixels. In this algorithm, two types of sparsity are exploited. One is within each frame and the other is induced from the similarity between adjacent frames. The latter further means not only in the image domain but also in a sparsifying transformed domain. Since the cost function we define is convex, we can find the optimal solution using a convex optimization technique with small computational cost. Simulation results show that the proposed method outperforms the standard approach for image completion by the nuclear norm minimization.

Original languageEnglish
Title of host publication2016 24th European Signal Processing Conference, EUSIPCO 2016
PublisherEuropean Signal Processing Conference, EUSIPCO
Pages948-952
Number of pages5
Volume2016-November
ISBN (Electronic)9780992862657
DOIs
Publication statusPublished - 2016 Nov 28
Externally publishedYes
Event24th European Signal Processing Conference, EUSIPCO 2016 - Budapest, Hungary
Duration: 2016 Aug 282016 Sep 2

Other

Other24th European Signal Processing Conference, EUSIPCO 2016
CountryHungary
CityBudapest
Period16/8/2816/9/2

Fingerprint

Pixels
Convex optimization
High speed cameras
Cost functions
Imaging techniques
Costs

Keywords

  • Compressed sensing
  • Convex optimization
  • High-speed camera
  • Image completion
  • Sparsity

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Hirabayashi, A., Nogami, N., Ijiri, T., & Condat, L. (2016). Sequential image completion for high-speed large-pixel number sensing. In 2016 24th European Signal Processing Conference, EUSIPCO 2016 (Vol. 2016-November, pp. 948-952). [7760388] European Signal Processing Conference, EUSIPCO. https://doi.org/10.1109/EUSIPCO.2016.7760388

Sequential image completion for high-speed large-pixel number sensing. / Hirabayashi, Akira; Nogami, Naoki; Ijiri, Takashi; Condat, Laurent.

2016 24th European Signal Processing Conference, EUSIPCO 2016. Vol. 2016-November European Signal Processing Conference, EUSIPCO, 2016. p. 948-952 7760388.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hirabayashi, A, Nogami, N, Ijiri, T & Condat, L 2016, Sequential image completion for high-speed large-pixel number sensing. in 2016 24th European Signal Processing Conference, EUSIPCO 2016. vol. 2016-November, 7760388, European Signal Processing Conference, EUSIPCO, pp. 948-952, 24th European Signal Processing Conference, EUSIPCO 2016, Budapest, Hungary, 16/8/28. https://doi.org/10.1109/EUSIPCO.2016.7760388
Hirabayashi A, Nogami N, Ijiri T, Condat L. Sequential image completion for high-speed large-pixel number sensing. In 2016 24th European Signal Processing Conference, EUSIPCO 2016. Vol. 2016-November. European Signal Processing Conference, EUSIPCO. 2016. p. 948-952. 7760388 https://doi.org/10.1109/EUSIPCO.2016.7760388
Hirabayashi, Akira ; Nogami, Naoki ; Ijiri, Takashi ; Condat, Laurent. / Sequential image completion for high-speed large-pixel number sensing. 2016 24th European Signal Processing Conference, EUSIPCO 2016. Vol. 2016-November European Signal Processing Conference, EUSIPCO, 2016. pp. 948-952
@inproceedings{b44eac01a56d49689ba2bd64f893fe05,
title = "Sequential image completion for high-speed large-pixel number sensing",
abstract = "We propose an algorithm that enhances the number of pixels for high-speed camera imaging to suppress its main problem. That is, the number of pixels reduces when the number of frames per second (fps) increases. To this end, we suppose an optical setup that block-randomly selects some percent of pixels in an image. Then, the proposed algorithm reconstructs the entire image from the selected partial pixels. In this algorithm, two types of sparsity are exploited. One is within each frame and the other is induced from the similarity between adjacent frames. The latter further means not only in the image domain but also in a sparsifying transformed domain. Since the cost function we define is convex, we can find the optimal solution using a convex optimization technique with small computational cost. Simulation results show that the proposed method outperforms the standard approach for image completion by the nuclear norm minimization.",
keywords = "Compressed sensing, Convex optimization, High-speed camera, Image completion, Sparsity",
author = "Akira Hirabayashi and Naoki Nogami and Takashi Ijiri and Laurent Condat",
year = "2016",
month = "11",
day = "28",
doi = "10.1109/EUSIPCO.2016.7760388",
language = "English",
volume = "2016-November",
pages = "948--952",
booktitle = "2016 24th European Signal Processing Conference, EUSIPCO 2016",
publisher = "European Signal Processing Conference, EUSIPCO",

}

TY - GEN

T1 - Sequential image completion for high-speed large-pixel number sensing

AU - Hirabayashi, Akira

AU - Nogami, Naoki

AU - Ijiri, Takashi

AU - Condat, Laurent

PY - 2016/11/28

Y1 - 2016/11/28

N2 - We propose an algorithm that enhances the number of pixels for high-speed camera imaging to suppress its main problem. That is, the number of pixels reduces when the number of frames per second (fps) increases. To this end, we suppose an optical setup that block-randomly selects some percent of pixels in an image. Then, the proposed algorithm reconstructs the entire image from the selected partial pixels. In this algorithm, two types of sparsity are exploited. One is within each frame and the other is induced from the similarity between adjacent frames. The latter further means not only in the image domain but also in a sparsifying transformed domain. Since the cost function we define is convex, we can find the optimal solution using a convex optimization technique with small computational cost. Simulation results show that the proposed method outperforms the standard approach for image completion by the nuclear norm minimization.

AB - We propose an algorithm that enhances the number of pixels for high-speed camera imaging to suppress its main problem. That is, the number of pixels reduces when the number of frames per second (fps) increases. To this end, we suppose an optical setup that block-randomly selects some percent of pixels in an image. Then, the proposed algorithm reconstructs the entire image from the selected partial pixels. In this algorithm, two types of sparsity are exploited. One is within each frame and the other is induced from the similarity between adjacent frames. The latter further means not only in the image domain but also in a sparsifying transformed domain. Since the cost function we define is convex, we can find the optimal solution using a convex optimization technique with small computational cost. Simulation results show that the proposed method outperforms the standard approach for image completion by the nuclear norm minimization.

KW - Compressed sensing

KW - Convex optimization

KW - High-speed camera

KW - Image completion

KW - Sparsity

UR - http://www.scopus.com/inward/record.url?scp=85006041172&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006041172&partnerID=8YFLogxK

U2 - 10.1109/EUSIPCO.2016.7760388

DO - 10.1109/EUSIPCO.2016.7760388

M3 - Conference contribution

VL - 2016-November

SP - 948

EP - 952

BT - 2016 24th European Signal Processing Conference, EUSIPCO 2016

PB - European Signal Processing Conference, EUSIPCO

ER -