Learning joint intensity-depth sparse representations

IEEE Transactions on Image Processing

Volumn 23, Issue 5, 2014, Pages 2122-2132

  Tosic, Ivana ^a,b   Drewes, Sarah ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Ricoh Innovations Inc   (United States)

^c DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^d MathWorks GmbH   (Germany)

Author keywords

dictionary learning; hybrid image depth sensors; Sparse approximations

Indexed keywords

LEARNING ALGORITHMS;

DICTIONARY LEARNING; DICTIONARY LEARNING ALGORITHMS; IMAGE DEPTH; JOINT SPARSITY MODELS; OVER-COMPLETE DICTIONARIES; SPARSE APPROXIMATIONS; SPARSE REPRESENTATION; STATE-OF-THE-ART METHODS;

THREE DIMENSIONAL;

EID: 84898681407     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2014.2312645     Document Type: Article

References (28)

1. T. Ringbeck and B. Hagebeuker, "A 3D time of flight camera for objectdetection," in Proc. Opt. 3-D Meas. Tech., 2007, pp. 1-10.
2. T. Oggier et al., "An all-solid-state optical range camera for 3D real-timeimaging with sub-centimeter depth resolution (SwissRanger)," Proc.SPIE, vol. 5200, pp. 534-545, Feb. 2004.
3. (2014, Mar.). Microsoft Kinect, Microsoft Corp., Redmond, WA, USA [Online]. Available: http://www.xbox.com/en-US/kinect
4. A. Kubota, A. Smolic, M. Magnor, M. Tanimoto, T. Chen, and C. Zhang,"Multiview imaging and 3DTV," IEEE Signal Process. Mag., vol. 24,no. 6, pp. 10-21, Nov. 2007. (Pubitemid 350201595)
5. B. A. Olshausen and D. Field, "Sparse coding with an overcompletebasis set: A strategy employed by V1?" Vis. Res., vol. 37, no. 23,pp. 3311-3325, 1997. (Pubitemid 27493805)
6. M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations,"Neural Comput., vol. 12, no. 2, pp. 337-65, 2000.
7. M. Elad and M. Aharon, "Image denoising via sparse and redundantrepresentations over learned dictionaries," IEEE Trans. Image Process.,vol. 15, no. 12, pp. 3736-3745, Dec. 2006. (Pubitemid 44811686)
8. I. Tošíc, B. A. Olshausen, and B. J. Culpepper, "Learning sparserepresentations of depth," IEEE J. Sel. Topics Signal Process., vol. 5,no. 5, pp. 941-952, Sep. 2011.
9. Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energyminimization via graph cuts," IEEE Trans. Pattern Anal. Mach. Intell.,vol. 23, no. 11, pp. 1222-1239, Nov. 2001. (Pubitemid 33137959)
10. S. Bakin, Adaptive Regression and Model Selection in Data MiningProblems. ACT, Australia: Australian Nat. Univ., 1999.
11. L. Meier, S. Van De Geer, and P. Bühlmann, "The group lasso for logisticregression," J. R. Statist. Soc., Ser. B (Statist. Methodol.), vol. 70, no. 1,pp. 53-71, 2008.
12. E. J. Candés and T. Tao, "Decoding by linear programming," IEEETrans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
13. E. J. Candès, J. Romberg, and T. Tao, "Stable signal recovery fromincomplete and inaccurate measurements," Commun. Pure Appl. Math.,vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
14. D. L. Donoho, "For most large underdetermined systems of equations,the minimal-1-norm near-solution approximates the sparsest nearsolution,"Commun. Pure Appl. Math., vol. 59, no. 7, pp. 907-934, 2006.
15. S. Jokar and M. E. Pfetsch, "Exact and approximate sparse solutions ofunderdetermined linear equations," SIAM J. Sci. Comput., vol. 31, no. 1,pp. 23-44, 2008.
16. T. Tsuchiya, "A convergence analysis of the scaling-invariant primal-dualpath-following algorithms for second-order cone programming," Optim.Methods Softw., vol. 11, nos. 1-4, pp. 141-182, 1998.
17. E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primaldualinterior-point method for conic quadratic optimization," Math.Program., vol. 95, no. 2, pp. 249-277, 2003. (Pubitemid 44757855)
18. (2014, Mar.). IBM ILOG CPLEX Optimizer. IBM,Armonk, NY, USA [Online]. Available: http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/
19. B. A. Turlach, W. N. Venables, and S. J. Wright, "Simultaneous variableselection," Technometrics, vol. 47, no. 3, pp. 349-363, 2005.
20. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II:Convex relaxation," Signal Process., vol. 86, no. 3, pp. 589-602, 2006. (Pubitemid 43106573)
21. M. Yuan and Y. Lin, "Model selection and estimation in regression withgrouped variables," J. R. Statist. Soc., Ser. B (Statist. Methodol.), vol. 68,no. 1, pp. 49-67, 2006. (Pubitemid 43415335)
22. L. Zelnik-Manor, K. Rosenblum, and Y. C. Eldar, "Dictionary optimizationfor block-sparse representations," IEEE Trans. Signal Process.,vol. 60, no. 5, pp. 2386-2395, May 2012.
23. A. Chambolle, "An algorithm for total variation minimization andapplications," J. Math. Imag. Vis., vol. 20, no. 1-2, pp. 89-97, 2004.
24. D. Scharstein and R. Szeliski, "A taxonomy and evaluation of dense twoframestereo correspondence algorithms," Int. J. Comput. Vis., vol. 47,nos. 1-3, pp. 7-42, 2002. (Pubitemid 34428419)
25. B. Potetz and T. S. Lee, "Scene statistics and 3D surface perception,"in Computational Vision: From Surfaces to Objects, C. W. Tyler, Ed.London, U.K.: Chapman & Hall, 2010, ch. 1, pp. 1-25.
26. (2014, Mar.). pmdtechnologies, Siegen, Germany [Online]. Available:http://www.pmdtec.com/
27. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, "Imagequality assessment: From error visibility to structural similarity," IEEETrans. Image Process., vol. 13, no. 4, pp. 600-612, Apr. 2004.
28. N. Silberman, D. Hoiem, P. Kohli, and R. Fergus, "Indoor segmentationand support inference from RGBD images," in Proc. 12th ECCV, 2012,pp. 746-760.