Ms. Ruimin Pan Profile

Ruimin Pan

at Auburn Univ

SPIE Involvement:

Author

Publications (2)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 11 March 2005 Paper

Fast Huber-Markov edge-preserving image restoration

Ruimin Pan, Stanley Reeves

Proceedings Volume 5674, (2005) https://doi.org/10.1117/12.587823

KEYWORDS: Image restoration, Convolution, Statistical analysis, Image analysis, Stereolithography, Chemical elements, Video, Image processing, Matrices, Iterative methods

Read Abstract +

In general, image restoration problems are ill posed and need to be regularized. For applications such as realtime video, fast restorations are also needed to keep up with the frame rate. Restoration based on 2D FFT's provides a fast implementation assuming a constant regularization term over the image. Unfortunately, this assumption creates significant ringing artifacts on edges as well as blurrier edges in the restored image. On the other hand, shift-variant regularization will reduce edge artifacts and provide better quality but it destroys the structure that makes use of the 2D FFT possible, thus no longer have the computational efficiency of the FFT. In this paper, we use a Bayesian approach-maximum a posteriori (MAP) estimation to compute an estimate of the original image given the blurred image. To avoid the smoothing of edges, shift-variant regularization must be used. The Huber-Markov random field model is applied to preserve the discontinuities on edges. For fast minimization of the above model, a new algorithm involving the Sherman-Morrison matrix inversion lemma is proposed. This results in a restored image with good edge preservation and less computation. Experiments show restored images with sharper edges. Convergence is fast, and the computational speed can be improved considerably by breaking the image into subimages.

Proceedings Article | 20 August 2003 Paper

Fast restoration and superresolution with edge-preserving regularization

Ruimin Pan, Stanley Reeves

Proceedings Volume 5077, (2003) https://doi.org/10.1117/12.487300

KEYWORDS: Convolution, Super resolution, Image restoration, Passive millimeter wave sensors, Real time imaging, Video, Chemical elements, Stereolithography, Signal to noise ratio, Edge roughness

Read Abstract +

In applications of PMMW imaging such as real-time video, fast restorations are needed to keep up with the frame rate. FFT-based restoration provides a fast implemention but at the expense of assuming that the regularization term is constant over the image. Unfortunately, this assumption can create significant ringing artifacts in the presence of edges as well as edges that are blurrier than necessary. Furthermore,shift-invariant regularization does not allow for the possibility of superresolution. Shift-variant regularization provides a way to vary the roughness penalty as a function of spatial coordinates to reduce edge artifacts and provide a degree of superresolution. Virtually all edge-preserving regularization approaches exploit this concept. However, this approach destroys the structure that makes the use of the FFT possible, since the deblurring operation is no longer shift-invariant. Thus, the restoration methods available for this problem no longer have the computational efficiency of the FFT. We propose a new restoration method for the shift-variant regularization approach that can be implemented in a fast and flexible manner. We decompose the restoration into a sum of two independent restorations. One restoration yields an image that comes directly from an FFT-based approach. This image is a shift-invariant restoration containing the usual artifacts. The other restoration involves a set of unknowns whose number equals the number of pixels with a local smoothing penalty significantly different from the typical value in the image. This restoration represents the artifact correction image. By summing the two, the artifacts are canceled. Because the second restoration has a significantly reduced set of unknowns, it can be calculated very efficiently even though no circular convolution structure exists.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years