IMAGE PRUNING USING

BELIEF PROPAGATION

BY,
THAMARAI SELVI,
A18102PCA6603.
 CONTENTS
• INTRODUCTION
• HARDWARE AND SOFTWARE REQUIREMENTS
• ABOUT THE SOFTWARE
• PROJECT DESCRIPTION
• DATABASE TABLE STRUCTURE
• DATA FLOW DIAGRAM
• SAMPLE CODING
• SCREENSHOT
• CONCLUSION
• BIBLIOGRAPHY
 INTRODUCTION

Modern digital technology has made it possible to manipulate multi-dimensional signals with systems that
range from simple digital circuits to advanced parallel computers. The goal of this manipulation can be divided
into three categories:
•Image Processing image in -> image out
•Image Analysis image in -> measurements out
•Image Understanding image in -> high level description out
We will focus on the fundamental concepts of image processing. Space does not permit us to make more
than a few introductory remarks about image analysis. Image Understanding requires an approach that differs
fundamentally from the theme of this book.
Further, we will restrict ourselves to two-dimensional (2D) image processing although most of the
concepts and techniques that are to be described can be extended easily to three or more dimensions. We begin
with certain basic definitions.
An image defined in the "real world" is considered to be a function of two real variables, for example,
a(x,y) with a as the amplitude (e.g. brightness) of the image at the real coordinate position (x,y). An image may
be considered to contain sub-images sometimes referred to as regions-of-interest, ROIs, or simply regions.
 HARDWARE SOFTWARE REQUIREMENTS

HARDWARE SPECIFICATION:
•Processor : 733 MHz Pentium III Processor
•RAM : 128 MB
•Hard Drive : 10GB
•Monitor : 14” VGA COLOR MONITOR
•Keyboard : 104 Keys
•Floppy Drive : 1.44 MB
•Mouse : Logitech Serial Mouse
•Disk Space : 2GB

SOFTWARE SPECIFICATION:
•Platform : JAVA 1.5
•Operating System : Microsoft Windows NT 4.0 or
Windows 2000 or XP
•Tool Used : Swing and Collection API
 ABOUT THE SOFTWARE

JAVA:
• JAVA IS A PROGRAMMING LANGUAGE CREATED BY JAMES GOSLING FROM SUN MICROSYSTEMS
(SUN) IN 1991.
• THE TARGET OF JAVA IS TO WRITE A PROGRAM ONCE AND THEN RUN THIS PROGRAM ON
MULTIPLE OPERATING SYSTEMS.
• THE FIRST PUBLICLY AVAILABLE VERSION OF JAVA (JAVA 1.0) WAS RELEASED IN 1995. SUN
MICROSYSTEMS WAS ACQUIRED BY THE ORACLE CORPORATION IN 2010.
• ORACLE HAS NOW THE STEER MANSHIP FOR JAVA. IN 2006 SUN STARTED TO MAKE JAVA
AVAILABLE UNDER THE GNU GENERAL PUBLIC LICENSE (GPL). ORACLE CONTINUES THIS PROJECT
CALLED OPENJDK.
 PROJECT DESCRIPTION

• AN INTERACTIVE IMAGE COMPLETION METHOD IS PROPOSED BASED ON BELIEF PROPAGATION (BP). BLOCKED AREA OR
AREA WITH LOSS OF INFORMATION IN A TARGET IMAGE IS COMPLETED WITH BP COMBINED WITH TEXTURE SYNTHESIS
IN AN INTERACTIVE WAY.
• THE TARGET IMAGE IS DECOMPOSED BY BP INTO LEVELS OF INTRINSIC MODE FUNCTIONS (IMF) IMAGES, WHILE THE
USER IS ALLOWED TO INDICATE THE STRUCTURAL IMAGE EDGE TO RECOVER IN THE UNKNOWN IMAGE REGIONS. FOR
EACH LEVEL OF IMF IMAGE, FIRST THE TARGET IMAGE PATCHES ALONG USER-SPECIFIED CURVES IN THE UNKNOWN
REGION ARE COMPLETED.
• THEN THE REMAINING TARGET IMAGE PATCHES ARE PRIORITIZED TO COMPLETE ACCORDING TO IMAGE GRADIENT
FEATURE. THE TARGET IMAGE PATCHES ARE COMPLETED BASED ON THE COMBINATION FREQUENCY FEATURE VALUES
FROM BP AND THE TEXTURE SYNTHESIS.
• FINALLY, LEVELS OF COMPLETED IMF IMAGES ARE COMPOUNDED INTO THE RESULT IMAGE. EXPERIMENTS PROVE THAT
THE PROPOSED ALGORITHM IS NOT ONLY ABLE TO RECOVER THE DAMAGED STRUCTURAL AND TEXTURE INFORMATION
OF LARGE SCALE, BUT ALSO COMPLETELY BLOCKED IMAGE STRUCTURES.
DATABASE TABLE DESIGN

Column name Type

Username Varchar(50)

Password Varchar(50)
DATAFLOW DIAGRAM
 SAMPLE CODING

PUBLIC IMAGERESIZER(){
SUPER("MENU");
THIS.SETDEFAULTCLOSEOPERATION(JFRAME.EXIT_ON_CLOSE);

FINAL IMAGERESIZER CLONEOFME = THIS;

WORKER = NEW WORKINGPANEL();

//BUTTONS
JBUTTON LOADIMAGE = NEW JBUTTON("LOAD IMAGE");
LOADIMAGE.SETPREFERREDSIZE(NEW DIMENSION(200, 30));
LOADIMAGE.SETMINIMUMSIZE(LOADIMAGE.GETPREFERREDSIZE());
LOADIMAGE.SETMAXIMUMSIZE(LOADIMAGE.GETPREFERREDSIZE());
LOADIMAGE.SETTOOLTIPTEXT("LOAD AN IMAGE TO RESIZE");
LOADIMAGE.ADDACTIONLISTENER(NEW ACTIONLISTENER(){
PUBLIC VOID ACTIONPERFORMED(ACTIONEVENT AE){
//IF THE BUTTON WAS CLICKED...
//FIRST CHECK TO SEE IF WE ARE ALREADY WORKING ON SOMETHING...
IF(THERESIZER != NULL){
IF(!THERESIZER.ISDISPLAYABLE()){
THERESIZER = NULL;
}
 SCREENSHOTS
• LOGIN PAGE
• MENU PAGE
• CHOOSE IMAGE
• LAPSE
• IMAGE SAVING
• INPUT IMAGE
• OUTPUT IMAGE
 CONCLUSION

• A NOVEL APPROACH UNIFYING IMAGE COMPLETION, TEXTURE SYNTHESIS AND

IMAGE INPAINTING HAS BEEN PRESENTED IN THIS PAPER. IN ORDER TO PROHIBIT
VISUALLY INCONSISTENT RESULTS, WE TRY TO AVOID GREEDY PATCH
ASSIGNMENTS, AND INSTEAD POSE ALL OF THESE TASKS AS A DISCRETE
LABELING PROBLEM WITH A WELL DEFINED GLOBAL OBJECTIVE FUNCTION. TO
SOLVE THIS PROBLEM, A NOVEL OPTIMIZATION SCHEME, PRIORITY-BP, HAS BEEN
PROPOSED, THAT CARRIES TWO VERY IMPORTANT EXTENSIONS OVER STANDARD
BP: PRIORITY-BASED MESSAGE SCHEDULING AND DYNAMIC LABEL PRUNING.
THIS OPTIMIZATION SCHEME DOES NOT RELY ON ANY IMAGE-SPECIFIC PRIOR
KNOWLEDGE AND CAN THUS BE APPLIED TO ALL KINDS OF IMAGES.
 BIBLIOGRAPHY

• [1] J. PORTILLA AND E. P. SIMONCELLI, “A PARAMETRIC TEXTURE MODEL BASED ON JOINT STATISTICS OF
COMPLEX WAVELET COEFFICIENTS.”
• IJCV, VOL. 40, NO. 1, PP. 49–70, 2000.
• [2] D. J. HEEGER AND J. R. BERGEN, “PYRAMID-BASED TEXTURE ANALYSIS/SYNTHESIS,” IN SIGGRAPH, 1995, PP.
229–238.
• [3] Y. W. S. SOATTO, G. DORETTO, “DYNAMIC TEXTURES,” IN INTL. CONF. ON COMPUTER VISION, PP. ”439–446”.
• [4] A. W. FITZGIBBON, “STOCHASTIC RIGIDITY: IMAGE REGISTRATION FOR NOWHERE-STATIC SCENES,” IN ICCV,
2001, PP. 662–669.
• [5] M. SZUMMER AND R. W. PICARD, “TEMPORAL TEXTURE MODELING,” IN PROC. OF INT. CONFERENCE ON IMAGE
PROCESSING, VOL. 3,
• 1996, PP. 823–826.
THANK YOU