中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29231
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 82005/82005 (100%)
造访人次 : 51943232      在线人数 : 3356
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/29231


    题名: WAVELET-BASED SHAPE FROM SHADING
    作者: HSIEH,JW;LIAO,HYM;KO,MT;FAN,KC
    贡献者: 資訊工程研究所
    关键词: ILLUMINANT DIRECTION;MULTIRESOLUTION;REPRESENTATIONS;DECOMPOSITION;EQUATIONS;TEXTURE
    日期: 1995
    上传时间: 2010-06-29 20:17:01 (UTC+8)
    出版者: 中央大學
    摘要: This paper proposes a wavelet-based approach for solving the shape from shading (SFS) problem. The proposed method takes advantage of the nature of wavelet theory, which can be applied to efficiently and accurately represent ''things,'' to develop a faster algorithm for reconstructing better surfaces. To derive the algorithm, the formulation of Horn and Brooks ((Eds.) Shape from Shading, MIT Press, Cambridge, MA, 1989), which combines several constraints into an objective function, is adopted. In order to improve the robustness of the algorithm, two new constraints are introduced into the objective function to strengthen the relation between an estimated surface and its counterpart in the original image. Thus, solving the SFS problem becomes a constrained optimization process. Instead of solving the problem directly by using Euler equation or numerical techniques, the objective function is first converted into the wavelet format. Due to this format, the set of differential operators of different orders which is involved in the whole process can be approximated with connection coefficients of Daubechies bases. In each iteration of the optimization process, an appropriate step size which will result in maximum decrease of the objective function is determined. After finding correct iterative schemes, the solution of the SFS problem will finally be decided. Compared with conventional algorithms, the proposed scheme is a great improvement in the accuracy as well as the convergence speed of the SFS problem. Experimental results, using both synthetic and real images, prove that the proposed method is indeed better than traditional methods. (C) 1995 Academic Press, Inc.
    關聯: GRAPHICAL MODELS AND IMAGE PROCESSING
    显示于类别:[資訊工程研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML549检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明