:::

詳目顯示

回上一頁
題名:A Transformation-Invariant Relaxation Scheme for Feature Mapping
書刊名:師大學報
作者:陳世旺戴建耘 引用關係
出版日期:1995
卷期:40
頁次:頁111-134
主題關鍵詞:特徵元件匹配空間轉移不變性鬆弛法架構
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:9
     截至目前為止已有不少供幾何特徵匹配用之鬆弛法架構被提出來,這 些架構雖然宣稱可以對空間轉移具有不變性,但是實際上,大部份只能處理和旋 轉及平移有關的轉移,對於具有尺度因素的轉換則儘量避免,因此便有各種不同 的假設被加諸於所考慮的問題,例如假設我們已知景深值,因此可以先將物件的 尺度正規化後再比對,或者假設物形是完整的,於是物形和模型問的尺度比率事 先可以推知。本篇文章提出一種新的架構,它能夠同時對旋轉,平移,和尺度具 有不變性,此外,新架構也能處理變形物件及不完整物形。我們的實驗結果顯示 新的架構確具有可行性。
     A large number of relaxation schemes for feature mapping, claimed to be invariantto transformation, have been reported. However, most of them can deal with transformations involving only rotation and translation, but not scaling. To stay away from theissue of scaling, unrealistic assumptions have to be imposed, such as the conjectures thatrange data are available so that objects can be rescaled before mapping, and that objectshapes are complete so that ratios between object shapes and prototypes can be figuredout beforehand. In this paper, we propose a relaxation scheme which is able to be invariant at a time to rotation, translation, as well as scaling. In addition, the proposedscheme can also cope with shapes that may be distorted and incomplete. Our schemehas been tested on both synthetic and real data. Experimental results manifest that theproposed scheme is applicable.
期刊論文
1.Chen, S. W.、Jain, A. K.(1992)。Strategies of Multiple-View and Multiple-Matching for 3D Object Recognition。Journal of Computer Vision, Graphics, and Image Processing: Image Understanding。  new window
2.Cucka, P.、Rosenfeld, A.(1992)。Linear Feature Compatibility for Pattern-Matching Relaxation。Pattern Recognition,25(2),189-196。  new window
3.Fischler, M. A.、Bolles, R. C.(1986)。Perceptual Organization and Curve Partitioning。IEEE Trans. Pattern Analysis and Machine Intelligence,8(1),100-105。  new window
4.Hummel, R. A.、Zucker, S. W.(1983)。On the Foundations of Relaxation Labeling Processes。IEEE Trans. Pattern Analysis and Machine Intelligence,5,267-287。  new window
5.Peleg, S.(1980)。A New Probabilistic Relaxation Scheme。IEEE Trans. Pattern Analysis and Machine Intelligence,2,362。  new window
6.Ranade, S.、Rosenfeld, A.(1980)。Point Pattern Matching by Relaxation。Pattern Recognition,12(4),269-276。  new window
7.Taxt, T.、BØeslviken, E.(1991)。Relaxation Using Models from Quantum Mechanics。Pattern Recognition,24(7),695-710。  new window
8.Ton, J. C.、Jain, A. K.(1989)。Registering Landsat Images using Point Pattern Matching。IEEE Trans. Geoscience and Remoting Sensing,27(5),642-651。  new window
9.Geman, S.、Geman, D.(1984)。Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images。IEEE Transactions on Pattern Analysis and Machine Intelligence,6(6),721-741。  new window
學位論文
1.Hinton, G. E.(1979)。Relaxation and its Role in Vision(博士論文)。University of Edinburgh。  new window
2.Yu, S. S.(1990)。A Study on the Relaxation Process: Applications and Neural Network Implementations(博士論文)。National Chiao Tung Univ.,Hsinchu。  new window
圖書
1.Dennis, J. E. Jr.、Schnabel, R. B.(1983)。Numerical Methods for Unconstrained Optimization and Nonlinear Equations。Englewood Cliffs, New Jersey:Prentice-Hall, Inc.。  new window
圖書論文
1.Richards, W.、Hoffman, D. D.(1987)。Codon Constraints on Closed 2D Shapes。Readings in Computer Vision。Morgan Kaufmann Pub. Inc.。  new window
2.Waltz, D. L.(1975)。Understanding Line Drawings of Scenes with Shadows。The Psychology of Computer Vision。New York:McGraw-Hill。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
無相關期刊論文
 
無相關博士論文
 
無相關書籍
 
無相關著作
 
QR Code
QRCODE