English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51773783      Online Users : 401
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/12671


    Title: Efficient Auto-Focus Algorithm Utilizing Discrete Difference Equation Prediction Model for Digital Still Cameras
    Authors: Chen, Chih-ming;Hong, Chin-Ming;Chuang, Han-Chun
    Chen, Chih-ming
    陳志銘
    Keywords: Difference equations;Predictive models;Digital cameras;Lenses;Focusing;Search methods;Particle measurements;Image resolution;Turning;Software algorithms
    Date: 2006-12
    Issue Date: 2008-12-05 12:03:18 (UTC+8)
    Abstract: Most digital still cameras employ the passive auto-focus scheme to achieve these goals. Measuring the sharpness of an image using passive auto-focus is time-consuming, particularly for digital still cameras with mega-pixels resolutions. However, the auto-focus search algorithm for digital still cameras needs to be fast and real-time. This study presents an efficient real-lime auto-focus (AF) algorithm combining the discrete difference equation prediction model (DDEPM) and bisection search method for digital still cameras. The proposed auto-focus algorithm uses both the coarse search procedure with DDEPM and the fine search procedure with bisection search method to perform the auto-focus process for digital still cameras. The coarse search procedure utilizes the precise forecasting ability of the DDEPM model to determine the turning points of the focus value curve, thus skipping some unnecessary detection points on the focus value curve. This procedure can be used to move the lens quickly to the neighborhood region of the best-focused lens position during AF processes. After the coarse search is finished, the fine search procedure is used to find the best-focused lens position according to the coarse search result. The proposed scheme increases the auto-focus speed since it reduces the number of detection points required for the focus value curve when searching the neighboring region of the best-focused lens position, and also reduces the lens backlash times. The proposed algorithm is implemented herein on an HP digital camera including control software. The experimental results indicate that the proposed AF algorithm is very reliable and requires few focusing iterations
    Relation: IEEE Transactions on Consumer Electronics, 52(4), 1135-1143
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1109/TCE.2006.273125
    DOI: 10.1109/TCE.2006.273125
    Appears in Collections:[圖書資訊與檔案學研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML21422View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback