To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmai l.com
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single- image superresolution, based upon sparse signal
representation. Research on image statistics suggests that image patches can be well-represented
as a sparse linear combination of elements from an appropriately chosen over-complete
dictionary. Inspired by this observation, we seek a sparse representation for each patch of the
low-resolution input, and then use the coefficients of this representation to generate the high-resolution
output. Theoretical results from compressed sensing suggest that under mild
conditions, the sparse representation can be correctly recovered from the downsampled signals.
By jointly training two dictionaries for the low- and high-resolution image patches, we can
enforce the similarity of sparse representations between the low-resolution and high- resolution
image patch pair with respect to their own dictionaries. Therefore, the sparse representation of a
low-resolution image patch can be applied with the high-resolution image patch dictionary to
generate a high- resolution image patch. The learned dictionary pair is a more compact
representation of the patch pairs, compared to previous approaches, which simply sample a large
amount of image patch pairs , reducing the computational cost substa ntially. The effectiveness of
such a sparsity prior is demonstrated for both general image super-resolution (SR) and the
special case of face hallucination. In both cases, our algorithm generates high-resolution images
that are competitive or even superior in quality to images produced by other similar SR methods.

2. In addition, the local sparse modeling of our approach is naturally robust to noise, and therefore
the proposed algorithm can handle SR with noisy inputs in a more unified framework.
Existing System
This paper presents a new approach to single- image superresolution, based upon sparse signal
representation. Research on image statistics suggests that image patches can be well-represented
as a sparse linear combination of elements from an appropriately chosen over-complete
dictionary. Inspired by this observation, we seek a sparse representation for each patch of the
low-resolution input, and then use the coefficients of this representation to generate the high-resolution
output.
Proposed System
Theoretical results from compressed sensing suggest that under mild conditions, the sparse
representation can be correctly recovered from the downsampled signals. By jointly training two
dictionaries for the low- and high-resolution image patches, we can enforce the similarity of
sparse representations between the low-resolution and high-resolution image patch pair with
respect to their own dictionaries. Therefore, the sparse representation of a low-resolution image
patch can be applied with the high-resolution image patch dictionary to generate a high-resolution
image patch. The learned dictionary pair is a more compact representation of the patch
pairs, compared to previous approaches, which simply sample a large amount of image patch
pairs , reducing the computational cost substantially. The effectiveness of such a sparsity prior is
demonstrated for both general image super-resolution (SR) and the special case of face
hallucination. In both cases, our algorithm generates high-resolution images that are competitive
or even superior in quality to images produced by other similar SR methods. In addition, the
local sparse modeling of our approach is naturally robust to noise, and therefore the proposed
algorithm can handle SR with noisy inputs in a more unified framework.
System Specification
Hardware Requirements:

3. • System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 14’ Colour Monitor.
• Mouse : Optical Mouse.
• Ram : 512 Mb.
Software Requirements:
• Operating system : Windows 7.
• Coding Language : ASP.Net with C#
• Data Base : SQL Server 2008.