By Topic

Constrained parallel projection methods for optimal signal estimation and design-constrained inconsistent signal feasibility problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yamada, I. ; Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan ; Ogura, N. ; Goto, A. ; Sakaniwa, K.

The convex set feasibility framework has been widely applied to signal and image processing problems including signal deconvolution, tomographic reconstruction, band limited extrapolation, image restoration and image synthesis. In this paper, we consider convex constrained versions of inconsistent signal feasibility problems. First we derive some new properties of variational nonexpansive operators and convex projections. Based on these properties and fixed point theorems, we propose some types of algorithms called constrained parallel projection methods (CPPM) that solve the convex constrained versions of inconsistent signal feasibility problems

Published in:

Image Processing, 1996. Proceedings., International Conference on  (Volume:3 )

Date of Conference:

16-19 Sep 1996