Example Based Super Resolution

Group Members (Alphabetically listed):Kartik Chamarty

Parth TejaniTopraj GurungYiming Kong

Zhen Guo

Original image

Problem Statement

Bicubic interpolated

Expected high resolution

think, think, think…

Learn it from other images!!!

Relationship?

+||

General idea

Previously LEARNED knowledge (DATABASE)

+

Training Set (database) Generation

7

75

5

Construct database

DATABASE (Training set)

Weight factor α

α =

One pass algorithm

Database search (Nearest Neighbor Search)

• How to Search for Nearest Neighbor Match• Search through everything, one by one– very slow!!– O(n)!! Go through everything

• Faster method?– KD Tree (Matlab has one!)• Recursively divides lookup entries into a tree structure• How fast is it?

– O(log n): Height of the tree

Results (Images)

• Probably show it in the format shown in the following link?– http://people.csail.mit.edu/billf/project%20pages/

sresCode/Markov%20Random%20Fields%20for%20Super-Resolution.html

• Low res, interpolated, supersample,diff,high res• Wednesday:– Faces, Mountains, Cartoon, Flowers– More if needed.

Function Profiles

Conclusion

Additional items

• Code OpenSourced– MENTION IT IS IN GOOGLE CODE

• Powerpoint: everything is shared– DOCS ARE SHARED

• Video of how to do it?– VIDEO TUTORIAL

GUI