1. C HRISTINE L EW D HEYANI M ALDE E VERARDO U RIBE Y IFAN Z HANG S UPERVISORS : E RNIE E SSER Y IFEI L OU BARCODE RECONITION TEAM

2. UPC B ARCODE What type of barcode? What is a barcode? Structure? Our barcode representation? Vector of 0s and 1s

3. M ATHEMATICAL R EPRESENTATION

4. 0.2 S TANDARD D EVIATION

5. 0.5 S TANDARD D EVIATION

6. 0.9 S TANDARD D EVIATION

7. D ECONVOLUTION

8. S IMPLE M ETHODS OF D ECONVOLUTION Thresholding Basically converting signal to binary signal, seeing whether the amplitude at a specific point is closer to 0 or 1 and rounding to the value its closer to. Wiener filter Classical method of reconstructing a signal after being distorted, using known knowledge of kernel and noise.

9. W IENER F ILTER

10. 0.7 S TANDARD D EVIATION, 0.05 S IGMA N OISE

11. 0.7 S TANDARD D EVIATION, 0.2 S IGMA N OISE

12. 0.7 S TANDARD D EVIATION, 0.5 S IGMA N OISE

13. Non-blind Deblurring using Yu Mao’s Method By: Christine Lew Dheyani Malde

14. Overview 2 general approaches: o -Yifei (blind: don’t know blur kernel) o -Yu Mao (non-blind: know blur kernel General goal: o -Taking a blurry barcode with noise and making it as clear as possible through gradient projection. o -Find method with best results and least error

15. Data Model

16. Classical Method

17. Comparisons for Yu Mao’s Method Yu Mao’s Gradient Projection Wiener Filter

18. Comparisons for Yu Mao’s Method (Cont.) Wiener Filter Yu Mao’s Gradient Projection

19. Jumps How does the number of jumps affect the result ? What happens if we apply the amount of jumps to the different methods of de-blurring? Compared Yu Mao’s method & Wiener Filter Created a code to calculate number of jumps 3 levels of jumps: o Easy: 4 jumps o Medium: 22 jumps o Hard: 45 jumps (regular barcode)

20. Created a code to calculate number of jumps: Jump: when the binary goes from 0 to 1 or 1 to 0 3 levels of jumps: o Easy: 4 jumps o Medium: 22 jumps o Hard: 45 jumps o (regular barcode) What are Jumps

21. How does the number of jumps affect the result (clear barcode)? Compare Yu Mao’s method & Weiner Filter Analyzing Jumps

22. Comparison for Small Jumps (4 jumps) Yu Mao’s Gradient Projection Wiener Filter

23. Comparison for Medium Jumps (22 jumps) Yu Mao’s Gradient Projection Wiener Filter

24. Comparison for Hard Jumps (45 jumps) Wiener Filter Yu Mao’s Gradient Projection

25. Wiener Filter with Varying Jumps - More jumps, greater error - Drastically gets worse with more jumps

26. Yu Mao's Gradient Projection with Varying Jumps - More jumps, greater error - Slightly gets worse with more jumps

27. Conclusion Yu Mao's method better overall: produces less error from jump cases: consistent error rate of 20%-30% Wiener filter did not have a consistent error rate: consistent only for small/medium jumps at 45 jumps, 40%- 50% error rate

28. B LIND D ECONVOLUTION Yifan Zhang Everardo Uribe

29. D ERIVATION OF M ODEL

31. Gradient Projection Projection of Gradient Descent ( first-order optimization) Advantage: Allows us to set a range Disadvantage: Takes very long time Not extremely accurate results Underestimate signal

33. Least Squares estimates unknown parameters minimizes sum of squares of errors considers observational errors

34. Least Squares (cont.) Advantages: return results faster than other methods easy to implement reasonably accurate results great results for low and high noise Disadvantage: doesn’t work well when there are errors in

36. Total Least Squares Least squares data modeling Also considers errors of SVD (C) Singular Value Decomposition Factorization

37. Total Least Squares (Cont.) Advantage: works on data in which others does not better than least squares when more errors in Disadvantages: doesn’t work for most data not in extremities overfits data not accurate takes a long time x