메뉴 건너뛰기




Volumn , Issue , 2010, Pages 145-152

Polynomial shape from shading

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE SOLUTIONS; ITERATIVE PROCEDURES; LINE SEARCHES; NUMERICAL TECHNIQUES; POLYHEDRAL OBJECTS; POLYNOMIAL SYSTEMS; SEMIDEFINITE PROGRAMMING RELAXATIONS; SHAPE FROM SHADING;

EID: 77955998861     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540219     Document Type: Conference Paper
Times cited : (47)

References (41)
  • 1
    • 33845577449 scopus 로고    scopus 로고
    • A new formulation for shape from shading for non-Lambertian surfaces
    • A. H. Ahmed and A. A. Farag. A new formulation for shape from shading for non-Lambertian surfaces. In Proc. CVPR'06, pages 1817-1824, 2006.
    • (2006) Proc. CVPR'06 , pp. 1817-1824
    • Ahmed, A.H.1    Farag, A.A.2
  • 2
    • 0033874204 scopus 로고    scopus 로고
    • Distribution of points on a sphere with application to star catalogs
    • R. Bauer. Distribution of points on a sphere with application to star catalogs. J. of guidance, control and dynamics, 23(1):130-137, 2000.
    • (2000) J. of Guidance, Control and Dynamics , vol.23 , Issue.1 , pp. 130-137
    • Bauer, R.1
  • 4
    • 44249088324 scopus 로고    scopus 로고
    • Algorithm 875: DSDP5: Software for semidefinite programming
    • S. J. Benson and Y. Ye. Algorithm 875: DSDP5: Software for semidefinite programming. ACM Trans. Math. Software, 34(3), 2008.
    • (2008) ACM Trans. Math. Software , vol.34 , Issue.3
    • Benson, S.J.1    Ye, Y.2
  • 5
    • 67349135634 scopus 로고    scopus 로고
    • Fast and stable polynomial equation solving and its application to computer vision
    • M. Byröd, K. Josephson, and K. Åström. Fast and stable polynomial equation solving and its application to computer vision. IJCV, 84(3):237-256, 2009.
    • (2009) IJCV , vol.84 , Issue.3 , pp. 237-256
    • Byröd, M.1    Josephson, K.2    Åström, K.3
  • 6
    • 0033903046 scopus 로고    scopus 로고
    • Ambiguous shape from shading with critical points
    • J.-D. Durou and D. Piau. Ambiguous shape from shading with critical points. J. of Mathematical Imaging and Vision, 12(2):99-108, 2000.
    • (2000) J. of Mathematical Imaging and Vision , vol.12 , Issue.2 , pp. 99-108
    • Durou, J.-D.1    Piau, D.2
  • 7
    • 85028113208 scopus 로고
    • Camera self-calibration: Theory and experiments
    • O. Faugeras, Q. Luong, and S. Maybank. Camera self-calibration: Theory and experiments. In Proc. CVPR'92, pages 321-334, 1992.
    • (1992) Proc. CVPR'92 , pp. 321-334
    • Faugeras, O.1    Luong, Q.2    Maybank, S.3
  • 8
    • 0030401116 scopus 로고    scopus 로고
    • Exploiting the generic viewpoint assumption
    • W. T. Freeman. Exploiting the generic viewpoint assumption. IJCV, 20(3):243-261, 1996.
    • (1996) IJCV , vol.20 , Issue.3 , pp. 243-261
    • Freeman, W.T.1
  • 9
    • 0242543752 scopus 로고    scopus 로고
    • Speed up of shape from shading using graduated non convexity
    • D. Gelli and D. Vitulano. Speed up of shape from shading using graduated non convexity. In Proc. DGCI'03, pages 504-513, 2003.
    • (2003) Proc. DGCI'03 , pp. 504-513
    • Gelli, D.1    Vitulano, D.2
  • 10
    • 33947537644 scopus 로고    scopus 로고
    • Detecting global optimality and extracting solutions in gloptipoly
    • Springer
    • D. Henrion and J.-B. Lasserre. Detecting global optimality and extracting solutions in gloptipoly. In Positive Polynomials in Control, pages 293-310. Springer, 2005.
    • (2005) Positive Polynomials in Control , pp. 293-310
    • Henrion, D.1    Lasserre, J.-B.2
  • 11
    • 0017478996 scopus 로고
    • Understanding image intensities
    • B. K. P. Horn. Understanding image intensities. Artificial Intelligence, 8(2):201-231, 1977.
    • (1977) Artificial Intelligence , vol.8 , Issue.2 , pp. 201-231
    • Horn, B.K.P.1
  • 13
    • 84898855032 scopus 로고    scopus 로고
    • A shape-from-shading framework for satisfying data-closeness and structure-preserving smoothness constraints
    • R. Huang and W. Smith. A shape-from-shading framework for satisfying data-closeness and structure-preserving smoothness constraints. In Proc. BMVC'09, 2009.
    • Proc. BMVC'09, 2009
    • Huang, R.1    Smith, W.2
  • 14
    • 0034423121 scopus 로고    scopus 로고
    • Instability of the eikonal equation and shape from shading
    • K. Z. I. Barnes. Instability of the eikonal equation and shape from shading. Math. Model. Numer. Anal., 34(1):127-138, 2000.
    • (2000) Math. Model. Numer. Anal. , vol.34 , Issue.1 , pp. 127-138
    • Barnes, K.Z.I.1
  • 15
    • 34247638173 scopus 로고    scopus 로고
    • Globally optimal estimates for geometric reconstruction problems
    • F. Kahl and D. Henrion. Globally optimal estimates for geometric reconstruction problems. IJCV, 74(1):3-15, 2007.
    • (2007) IJCV , vol.74 , Issue.1 , pp. 3-15
    • Kahl, F.1    Henrion, D.2
  • 17
    • 0031098718 scopus 로고    scopus 로고
    • Uniqueness in shape from shading revisited
    • R. Kozera. Uniqueness in shape from shading revisited. JMIV, 7(2):123-138, 1997.
    • (1997) JMIV , vol.7 , Issue.2 , pp. 123-138
    • Kozera, R.1
  • 18
    • 34547492080 scopus 로고    scopus 로고
    • Convergent SDP-relaxations in polynomial optimization with sparsity
    • DOI 10.1137/05064504X
    • J. Lasserre. Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. on Optimization, 17(3):822-843, 2006. (Pubitemid 47265174)
    • (2006) SIAM Journal on Optimization , vol.17 , Issue.3 , pp. 822-843
    • Lasserre, J.B.1
  • 19
    • 0027644836 scopus 로고
    • Shape from shading with a linear triangular element surface model
    • K. M. Lee and C. C. J. Kuo. Shape from shading with a linear triangular element surface model. PAMI, 15(8):815-822, 1993.
    • (1993) PAMI , vol.15 , Issue.8 , pp. 815-822
    • Lee, K.M.1    Kuo, C.C.J.2
  • 20
    • 56749179605 scopus 로고    scopus 로고
    • HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method
    • T. L. Lee, T. Y. Li, and C. H. Tsai. HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method. Computing, 83(2-3):109-133, 2008.
    • (2008) Computing , vol.83 , Issue.2-3 , pp. 109-133
    • Lee, T.L.1    Li, T.Y.2    Tsai, C.H.3
  • 21
    • 20344396845 scopus 로고    scopus 로고
    • YALMIP: A toolbox for modeling and optimization in MATLAB
    • J. Löfberg. YALMIP : A toolbox for modeling and optimization in MATLAB. In Proc. CACSD'04, pages 284-289, 2004.
    • (2004) Proc. CACSD'04 , pp. 284-289
    • Löfberg, J.1
  • 22
    • 77951288110 scopus 로고    scopus 로고
    • A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
    • Z.-Q. Luo and S. Zhang. A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints. SIAM J. on Optimization, 20(4):1716-1736, 2010.
    • (2010) SIAM J. on Optimization , vol.20 , Issue.4 , pp. 1716-1736
    • Luo, Z.-Q.1    Zhang, S.2
  • 23
    • 77950444358 scopus 로고    scopus 로고
    • Solving partial differential equations via sparse sdp relaxations
    • J. N. M. Mevissen, M. Kojima and N. Takayama. Solving partial differential equations via sparse sdp relaxations. Pacific J. of Optimization, 4(2):213-241, 2008.
    • (2008) Pacific J. of Optimization , vol.4 , Issue.2 , pp. 213-241
    • Mevissen, J.N.M.1    Kojima, M.2    Takayama, N.3
  • 25
    • 34250880661 scopus 로고
    • A shape from shading analysis for a single perspective image of a polyhedron
    • M. Penna. A shape from shading analysis for a single perspective image of a polyhedron. PAMI, 11(6):545-554, 1989.
    • (1989) PAMI , vol.11 , Issue.6 , pp. 545-554
    • Penna, M.1
  • 27
    • 33244456611 scopus 로고    scopus 로고
    • A generic and provably convergent shape-from-shading method for orthographic and pinhole cameras
    • E. Prados and O. Faugeras. A generic and provably convergent shape-from-shading method for orthographic and pinhole cameras. IJCV, 65(1-2):97-125, 2005.
    • (2005) IJCV , vol.65 , Issue.1-2 , pp. 97-125
    • Prados, E.1    Faugeras, O.2
  • 28
    • 14944344547 scopus 로고    scopus 로고
    • Global minimization of normal quartic polynomials based on global descent directions
    • L. Qi, Z. Wan, and Y.-F. Yang. Global minimization of normal quartic polynomials based on global descent directions. SIAM J. on Optimization, 15(1):275-302, 2005.
    • (2005) SIAM J. on Optimization , vol.15 , Issue.1 , pp. 275-302
    • Qi, L.1    Wan, Z.2    Yang, Y.-F.3
  • 29
    • 70450186991 scopus 로고    scopus 로고
    • Linear embeddings in non-rigid structure from motion
    • V. Rabaud and S. Belongie. Linear embeddings in non-rigid structure from motion. In Proc. CVPR'09, pages 2427-2434, 2009.
    • (2009) Proc. CVPR'09 , pp. 2427-2434
    • Rabaud, V.1    Belongie, S.2
  • 31
    • 33144473962 scopus 로고    scopus 로고
    • A shape-from-shading method of polyhedral objects using prior information
    • H. Shimodaira. A shape-from-shading method of polyhedral objects using prior information. PAMI, 28(4):612-624, 2006.
    • (2006) PAMI , vol.28 , Issue.4 , pp. 612-624
    • Shimodaira, H.1
  • 32
    • 82455194763 scopus 로고
    • Verifying the "consistency" of shading patterns and 3-D structures
    • P. Sinha and E. Adelson. Verifying the "consistency" of shading patterns and 3-D structures. In Proc. IEEE Workshop on Qualitative Vision, pages 71-80, 1993.
    • (1993) Proc. IEEE Workshop on Qualitative Vision , pp. 71-80
    • Sinha, P.1    Adelson, E.2
  • 35
    • 77955992399 scopus 로고
    • Fast shape from shading
    • R. Szeliski. Fast shape from shading. In Proc. ECCV'90, pages 359-368, 1990.
    • (1990) Proc. ECCV'90 , pp. 359-368
    • Szeliski, R.1
  • 36
    • 33847158335 scopus 로고    scopus 로고
    • Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity
    • H. Waki, S. Kim, M. Kojima, and M. Muramatsu. Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. on Optimization, 17(1):218-242, 2006.
    • (2006) SIAM J. on Optimization , vol.17 , Issue.1 , pp. 218-242
    • Waki, H.1    Kim, S.2    Kojima, M.3    Muramatsu, M.4
  • 37
    • 0001639271 scopus 로고
    • Globally convergent homotopy methods: A tutorial
    • L. T. Watson. Globally convergent homotopy methods: A tutorial. App. Math. and Comp., 31:369-396, 1989.
    • (1989) App. Math. and Comp. , vol.31 , pp. 369-396
    • Watson, L.T.1
  • 38
    • 33744949513 scopus 로고    scopus 로고
    • Unsupervised learning of image manifolds by semidefinite programming
    • K. Q. Weinberger and L. K. Saul. Unsupervised learning of image manifolds by semidefinite programming. IJCV, 70(1):77-90, 2006.
    • (2006) IJCV , vol.70 , Issue.1 , pp. 77-90
    • Weinberger, K.Q.1    Saul, L.K.2
  • 40
    • 0030673581 scopus 로고    scopus 로고
    • Determining a polyhedral shape using interreflections
    • J. Yang, N. Ohnishi, D. Zhang, and N. Sugie. Determining a polyhedral shape using interreflections. In Proc. CVPR'97, pages 110-115, 1997.
    • (1997) Proc. CVPR'97 , pp. 110-115
    • Yang, J.1    Ohnishi, N.2    Zhang, D.3    Sugie, N.4
  • 41
    • 33847053953 scopus 로고    scopus 로고
    • A fast marching formulation of perspective shape from shading under frontal illumination
    • S. Y. Yuen, Y. Y. Tsui, and C. K. Chow. A fast marching formulation of perspective shape from shading under frontal illumination. Pattern Recog. Letters, 28(7):806-824, 2007.
    • (2007) Pattern Recog. Letters , vol.28 , Issue.7 , pp. 806-824
    • Yuen, S.Y.1    Tsui, Y.Y.2    Chow, C.K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.