Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Metin Gunsay

dblp:59/4237 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video processing · 55% Multimedia analysis and retrieval · 36% Computational photography and imaging · 8%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
image analysis
0.011995
Point-source localization in blurred images by a frequency-domain eigenvector-based method · IEEE Trans. Image Process. 1995
Image and video processing › image restoration
image deblurring
0.011993
Restoration of blurred star field images by maximally sparse optimization · IEEE Trans. Image Process. 1993
Image and video processing
image restoration
0.011993
Restoration of blurred star field images by maximally sparse optimization · IEEE Trans. Image Process. 1993
Computational photography and imaging
astronomical imaging
0.011993
Restoration of blurred star field images by maximally sparse optimization · IEEE Trans. Image Process. 1993

Methods — techniques the papers use, named apart from their topics

eigenvector-based methods · 0.0l(p) sparseness criterion · 0.0constrained optimization · 0.0
YearPublicationVenuePosition
1995 Point-source localization in blurred images by a frequency-domain eigenvector-based method
Metin Gunsay, Brian D. Jeffs
IEEE Trans. Image Process.1
1994 A subspace decomposition method for point source localization in blurred images
abstract
We address the problem of resolving blurred point sources in intensity images. A new approach to image restoration is introduced which is a 2-D generalization of techniques originating from the field of direction of arrival estimation (DOA). In the 2-D frequency domain, algorithms, such as MUSIC, may be adapted to search for these point sources. A generalization of array smoothing based on a regularization operator is introduced for 2-D arrays in order to achieve rank enhancement in the signal space of the covariance matrix.>
Metin Gunsay, Brian D. Jeffs
ICASSP (5)1
1994 Performance Analysis for a Subspace Decomposition Point-Soure Image Restoration Algorithm
abstract
This paper addresses the problem of resolving and localizing blurred point sources in intensity images, such as atmospherically blurred star images. It is shown that this problem can be modeled in a form similar to that used for sensor array data in direction of arrival (DOA) estimation. A new superresolving restoration algorithm is described as a generalization of eigenstructure decomposition methods popular in DOA estimation. The algorithm includes a signal subspace rank enhancement technique that works in the presence of non-uniform element weighting due to blur. A theoretical analysis of source localization error is presented, and an expression predicting error performance is derived. Restoration examples are presented illustrating the accuracy of the error analysis and demonstrating algorithm performance.>
Brian D. Jeffs, Metin Gunsay
ICIP (2)2
1993 Restoration of blurred star field images by maximally sparse optimization
abstract
The problem of removing blur from, or sharpening, astronomical star field intensity images is discussed. An approach to image restoration that recovers image detail using a constrained optimization theoretic approach is introduced. Ideal star images may be modeled as a few point sources in a uniform background. It is argued that a direct measure of image sparseness is the appropriate optimization criterion for deconvolving the image blurring function. A sparseness criterion based on the l(p) is presented, and candidate algorithms for solving the ensuing nonlinear constrained optimization problem are presented and reviewed. Synthetic and actual star image reconstruction examples are presented to demonstrate the method's superior performance as compared with several image deconvolution methods.
Brian D. Jeffs, Metin Gunsay
IEEE Trans. Image Process.2