Skip to main navigation Skip to search Skip to main content

Sparsity analysis of endoscopy images

  • Tzu Hao Su
  • , Si Ching Pan
  • , Xutao Wei
  • , Yu Liang Chiang
  • , Ting Lan Lin
  • , Yangming Wen
  • , Zhaoyi Liu
  • , Shih Lun Chen
  • , Ho Yin Lee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Sparsity analysis of images is important to understand the image characteristic and its possible potential in applications. In this paper, normal images and endoscopy image are investigated for their sparsity using K-SVD algorithm that finds a dictionary basis with minimal number of non-zero coefficients in the transformed domain to have minimal prediction error. The results show that the endoscopy image has lower prediction error and lower number of non-zero coefficients in the transformed domain. This indicates the fact that one can develop a better endoscopy image encoder with better prediction mechanism, and a better endoscopy image decoder with better error concealment method to recover data contaminated by the noise, both based on the idea of sparsity.

Original languageEnglish
Title of host publication2017 IEEE 6th Global Conference on Consumer Electronics, GCCE 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-2
Number of pages2
ISBN (Electronic)9781509040452
DOIs
StatePublished - 19 Dec 2017
Event6th IEEE Global Conference on Consumer Electronics, GCCE 2017 - Nagoya, Japan
Duration: 24 Oct 201727 Oct 2017

Publication series

Name2017 IEEE 6th Global Conference on Consumer Electronics, GCCE 2017
Volume2017-January

Conference

Conference6th IEEE Global Conference on Consumer Electronics, GCCE 2017
Country/TerritoryJapan
CityNagoya
Period24/10/1727/10/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Keywords

  • K-SVD
  • OMP
  • endoscopy image
  • sparsity representation

Fingerprint

Dive into the research topics of 'Sparsity analysis of endoscopy images'. Together they form a unique fingerprint.

Cite this