메뉴 건너뛰기




Volumn 12, Issue 4, 1990, Pages 377-389

Reconstructing Convex Sets from Support Line Measurements

Author keywords

Computational geometry; computed tomography; constrained optimization; set reconstruction; shape estimation; support fines

Indexed keywords

BIOMEDICAL ENGINEERING--COMPUTERIZED TOMOGRAPHY; MATHEMATICAL TECHNIQUES--ALGORITHMS;

EID: 0025419814     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.50623     Document Type: Article
Times cited : (70)

References (25)
  • 3
    • 26444603401 scopus 로고
    • Ph.D. dissertation, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA
    • P. L. Van Hove, “Silhouette slice theorems,” Ph.D. dissertation, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA, 1986.
    • (1986) Silhouette slice theorems
    • Van Hove, P.L.1
  • 4
    • 0012664415 scopus 로고
    • proposal for Ph.D. research, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA, Apr.
    • J. L. Prince, “Geometric model-based Bayesian estimation from projections,” proposal for Ph.D. research, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA, Apr. 1986.
    • (1986) Geometric model-based Bayesian estimation from projections
    • Prince, J.L.1
  • 5
    • 0021471788 scopus 로고
    • Reconstruction from projections based on detection and estimation of objects—Parts I and II: Performance analysis and robustness analysis
    • D. J. Rossi and A. S. Willsky, “Reconstruction from projections based on detection and estimation of objects—Parts I and II: Performance analysis and robustness analysis,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, no. 4, pp. 886–906, 1984.
    • (1984) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-32 , Issue.4 , pp. 886-906
    • Rossi, D.J.1    Willsky, A.S.2
  • 8
    • 0003890806 scopus 로고
    • Cambridge, MA: MIT Press
    • B. K. P. Horn, Robot Vision. Cambridge, MA: MIT Press, 1986.
    • (1986) Robot Vision
    • Horn, B.K.P.1
  • 9
    • 26444484870 scopus 로고
    • Master's thesis, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA
    • J. M. Humel, “Resolving bilinear data arrays,” Master's thesis, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA, 1986.
    • (1986) Resolving bilinear data arrays
    • Humel, J.M.1
  • 11
    • 0040184337 scopus 로고
    • Ph.D. dissertation, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA
    • J. Greshak, “Reconstructing convex sets,” Ph.D. dissertation, Dep. Elec. Eng., Massachusetts Inst. Technol., Cambridge, MA, 1985.
    • (1985) Reconstructing convex sets
    • Greshak, J.1
  • 12
    • 38249036846 scopus 로고
    • Shape from probing
    • R. Cole and C. Yap, “Shape from probing,” J. Algorithms, vol. 8, pp. 19–38, 1987.
    • (1987) J. Algorithms , vol.8 , pp. 19-38
    • Cole, R.1    Yap, C.2
  • 13
    • 0040184338 scopus 로고
    • Ph.D. dissertation, Dep. Comput. Sci., Univ. Illinois, Urbana
    • S. S. Skiena, “Geometric probing,” Ph.D. dissertation, Dep. Comput. Sci., Univ. Illinois, Urbana, 1988.
    • (1988) Geometric probing
    • Skiena, S.S.1
  • 14
    • 0024088267 scopus 로고
    • Probing convex polygons with X-rays
    • Oct.
    • H. Edelsbrunner and S. S. Skiena, “Probing convex polygons with X-rays,” SIAM J. Comput., vol. 17, pp. 820–882, Oct. 1988.
    • (1988) SIAM J. Comput. , vol.17 , pp. 820-882
    • Edelsbrunner, H.1    Skiena, S.S.2
  • 24
    • 0020826623 scopus 로고
    • A numerically stable dual method for solving strictly convex quadratic programs
    • D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs,” Math. Program., vol. 27, pp. 1–33, 1983.
    • (1983) Math. Program. , vol.27 , pp. 1-33
    • Goldfarb, D.1    Idnani, A.2


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