• 沒有找到結果。

視覺模型與分析 Vision Modeling and Analysis

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "視覺模型與分析 Vision Modeling and Analysis"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

輔仁大學 95 學年度課程綱要表

開 課 系 所

名 稱 及 代 碼

電 子 工 程 學 系 碩士班

開課科目代碼 G-5060-15561 選

別

必修 選修

學分數

上 下

V 3

課 程 名 稱 (中英文並列)

視覺模型與分析

Vision Modeling and Analysis

任 課 教 授 (中英文並列)

王 元 凱

Yuan-Kai Wang

課程目標 視覺分析為影像處理之進階。本課程希望除講授理論之外，也

能讓學生熟悉並體驗實作技巧。

課程綱要

1. Introduction 2. Motion analysis 3. Optical flow

4. Motion-based Segmentation 5. Shape analysis

6. Active contour 7. Active shape model 8. Texure analysis 9. Markov random field 10.Depth analysis

11.Camera calibration 12.Image structure

13.Multiresolution analysis and pyramids

先 修 課 程 線性代數、機率與統計、數位影像處理

建議續修科目 圖形辨識(Pattern Recognition)、機器學習(Machine Learning)

指定教材

(用書、器材) Computer Vision, L. G. Shapiro, G. C. Stockman, Prentice Hall, 2001

參考書目

• Image Processing, Analysis, and Machine Vision, 2nd, M.

Sonka, V. Hlavac, and R. Boyle, Brooks/Cole Publishing, 1999

• Computer Vision: a modern approach, D. A. Forsyth and J.

Ponce, Prentice Hall, 2003

參考文獻

立即下載 ( DOC - 1 頁 - 35.50 KB )

相關文件

Mathematical preliminaries and error analysis

A floating point number in double precision IEEE standard format uses two words (64 bits) to store the number as shown in the following figure.. 1 sign

Mathematical preliminaries and error analysis

A floating point number in double precision IEEE standard format uses two words (64 bits) to store the number as shown in the following figure.. 1 sign

Mathematical preliminaries and error analysis

In this report, formats were specified for single, double, and extended precisions, and these standards are generally followed by microcomputer manufactures using

Algorithm Design and Analysis Divide and Conquer (2)

Textbook Chapter 4.3 – The substitution method for solving recurrences Textbook Chapter 4.4 – The recursion-tree method for solving recurrences Textbook Chapter 4.5 – The master

Algorithm Design and Analysis

• Thinking: solve easiest case + combine smaller solutions into the original solution.. • Easy to find an

Algorithm Design and Analysis Divide and Conquer (3)

Textbook Chapter 33.4 – Finding the closest pair of points.. Closest Pair of

Algorithm Design and Analysis Divide and Conquer (1)

Textbook Chapter 4.3 – The substitution method for solving recurrences Textbook Chapter 4.4 – The recursion-tree method for solving recurrences Textbook Chapter 4.5 – The master

Algorithm Design and Analysis Amortized Analysis

Calculate the amortized cost of each operation based on the potential function 4. Calculate total amortized cost based on