Automatic Detection of Circular Objects by Ellipse Growing Mitsuo OKABE, Kenichi KANATANI, and Naoya OHTA 1. [4], [5], [18], [19] [14], [17] [28], [32

Similar documents
(a) (b) (c) Canny (d) 1 ( x α, y α ) 3 (x α, y α ) (a) A 2 + B 2 + C 2 + D 2 + E 2 + F 2 = 1 (3) u ξ α u (A, B, C, D, E, F ) (4) ξ α (x 2 α, 2x α y α,

IPSJ SIG Technical Report Taubin Ellipse Fitting by Hyperaccurate Least Squares Yuuki Iwamoto, 1 Prasanna Rangarajan 2 and Kenichi Kanatani

, ( ξ/) ξ(x), ( ξ/) x = x 1,. ξ ξ ( ξ, u) = 0. M LS ξ ξ (6) u,, u M LS 3).,.. ξ x ξ = ξ(x),, 1. J = (ξ ξ, V [ξ ] 1 (ξ ξ )) (7) ( ξ, u) = 0, = 1,..., N

4. C i k = 2 k-means C 1 i, C 2 i 5. C i x i p [ f(θ i ; x) = (2π) p 2 Vi 1 2 exp (x µ ] i) t V 1 i (x µ i ) 2 BIC BIC = 2 log L( ˆθ i ; x i C i ) + q

28 Horizontal angle correction using straight line detection in an equirectangular image

2007/8 Vol. J90 D No. 8 Stauffer [7] 2 2 I 1 I 2 2 (I 1(x),I 2(x)) 2 [13] I 2 = CI 1 (C >0) (I 1,I 2) (I 1,I 2) Field Monitoring Server

Vol.-CVIM-7 No.7 /3/8 NLPCA kernel PCA KPCA 4),) NLPCA KPCA NLPCA KPCA principle curve principle surface KPCA ) ),),6),8),),3) ) Jacobian KPCA PCA ) P

IPSJ SIG Technical Report Vol.2012-CG-149 No.13 Vol.2012-CVIM-184 No /12/4 3 1,a) ( ) DB 3D DB 2D,,,, PnP(Perspective n-point), Ransa

3 1 Table 1 1 Feature classification of frames included in a comic magazine Type A Type B Type C Others 81.5% 10.3% 5.0% 3.2% Fig. 1 A co

a) Extraction of Similarities and Differences in Human Behavior Using Singular Value Decomposition Kenichi MISHIMA, Sayaka KANATA, Hiroaki NAKANISHI a

xx/xx Vol. Jxx A No. xx 1 Fig. 1 PAL(Panoramic Annular Lens) PAL(Panoramic Annular Lens) PAL (2) PAL PAL 2 PAL 3 2 PAL 1 PAL 3 PAL PAL 2. 1 PAL

258 5) GPS 1 GPS 6) GPS DP 7) 8) 10) GPS GPS ) GPS Global Positioning System

Duplicate Near Duplicate Intact Partial Copy Original Image Near Partial Copy Near Partial Copy with a background (a) (b) 2 1 [6] SIFT SIFT SIF

[2] OCR [3], [4] [5] [6] [4], [7] [8], [9] 1 [10] Fig. 1 Current arrangement and size of ruby. 2 Fig. 2 Typography combined with printing

[1] SBS [2] SBS Random Forests[3] Random Forests ii

2003/3 Vol. J86 D II No Fig. 1 An exterior view of eye scanner. CCD [7] CCD PC USB PC PC USB RS-232C PC

untitled

IPSJ SIG Technical Report Vol.2009-CVIM-168 No /8/ (2003) Costeira Kanade (1998) AIC Vidal (2005) GPCA Taubin 3 2 EM Multi-stage Opt

Silhouette on Image Object Silhouette on Images Object 1 Fig. 1 Visual cone Fig. 2 2 Volume intersection method Fig. 3 3 Background subtraction Fig. 4

IPSJ SIG Technical Report Vol.2009-CVIM-167 No /6/10 Real AdaBoost HOG 1 1 1, 2 1 Real AdaBoost HOG HOG Real AdaBoost HOG A Method for Reducing

1 Kinect for Windows M = [X Y Z] T M = [X Y Z ] T f (u,v) w 3.2 [11] [7] u = f X +u Z 0 δ u (X,Y,Z ) (5) v = f Y Z +v 0 δ v (X,Y,Z ) (6) w = Z +

(MIRU2008) HOG Histograms of Oriented Gradients (HOG)

本文6(599) (Page 601)

2 Fig D human model. 1 Fig. 1 The flow of proposed method )9)10) 2.2 3)4)7) 5)11)12)13)14) TOF 1 3 TOF 3 2 c 2011 Information

LED a) A New LED Array Acquisition Method Focusing on Time-Gradient and Space- Gradient Values for Road to Vehicle Visible Light Communication Syunsuk

VRSJ-SIG-MR_okada_79dce8c8.pdf

Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t)

光学

IPSJ SIG Technical Report 1, Instrument Separation in Reverberant Environments Using Crystal Microphone Arrays Nobutaka ITO, 1, 2 Yu KITANO, 1

Fig. 3 Flow diagram of image processing. Black rectangle in the photo indicates the processing area (128 x 32 pixels).

1 Fig. 1 Extraction of motion,.,,, 4,,, 3., 1, 2. 2.,. CHLAC,. 2.1,. (256 ).,., CHLAC. CHLAC, HLAC. 2.3 (HLAC ) r,.,. HLAC. N. 2 HLAC Fig. 2

IPSJ SIG Technical Report iphone iphone,,., OpenGl ES 2.0 GLSL(OpenGL Shading Language), iphone GPGPU(General-Purpose Computing on Graphics Proc

Accuracy Improvement by Compound Discriminant Functions for Resembling Character Recognition Takashi NAKAJIMA, Tetsushi WAKABAYASHI, Fumitaka KIMURA,

(a) 1 (b) 3. Gilbert Pernicka[2] Treibitz Schechner[3] Narasimhan [4] Kim [5] Nayar [6] [7][8][9] 2. X X X [10] [11] L L t L s L = L t + L s

Run-Based Trieから構成される 決定木の枝刈り法

IPSJ SIG Technical Report Vol.2010-CVIM-170 No /1/ Visual Recognition of Wire Harnesses for Automated Wiring Masaki Yoneda, 1 Ta

3: 2: 2. 2 Semi-supervised learning Semi-supervised learning [5,6] Semi-supervised learning Self-training [13] [14] Self-training Self-training Semi-s

Sobel Canny i

IPSJ SIG Technical Report GPS LAN GPS LAN GPS LAN Location Identification by sphere image and hybrid sensing Takayuki Katahira, 1 Yoshio Iwai 1

Study on Application of the cos a Method to Neutron Stress Measurement Toshihiko SASAKI*3 and Yukio HIROSE Department of Materials Science and Enginee

5b_08.dvi

& Vol.5 No (Oct. 2015) TV 1,2,a) , Augmented TV TV AR Augmented Reality 3DCG TV Estimation of TV Screen Position and Ro

On the Limited Sample Effect of the Optimum Classifier by Bayesian Approach he Case of Independent Sample Size for Each Class Xuexian HA, etsushi WAKA

情報処理学会研究報告 IPSJ SIG Technical Report Vol.2017-CG-166 No /3/ HUNTEXHUNTER1 NARUTO44 Dr.SLUMP1,,, Jito Hiroki Satoru MORITA The

K 2 X = 4 MWG(f), X P 2 F, υ 0 : X P 2 2,, {f λ : X λ P 1 } λ Λ NS(X λ ), (υ 0 ) λ : X λ P 2 ( 1) X 6, f λ K X + F, f ( 1), n, n 1 (cf [10]) X, f : X

(3.6 ) (4.6 ) 2. [3], [6], [12] [7] [2], [5], [11] [14] [9] [8] [10] (1) Voodoo 3 : 3 Voodoo[1] 3 ( 3D ) (2) : Voodoo 3D (3) : 3D (Welc

Vol. 44 No. SIG 9(CVIM 7) ) 2) 1) 1 2) 3 7) 1) 2) 3 3) 4) 5) (a) (d) (g) (b) (e) (h) No Convergence? End (f) (c) Yes * ** * ** 1


it-ken_open.key

SICE東北支部研究集会資料(2013年)

2014/3 Vol. J97 D No. 3 Recognition-based segmentation [7] 1 DP 1 Conditional random field; CRF [8] [10] CRF / OCR OCR [11], [1

11) 13) 11),12) 13) Y c Z c Image plane Y m iy O m Z m Marker coordinate system T, d X m f O c X c Camera coordinate system 1 Coordinates and problem

THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE.

(a) (b) 2 2 (Bosch, IR Illuminator 850 nm, UFLED30-8BD) ( 7[m] 6[m]) 3 (PointGrey Research Inc.Grasshopper2 M/C) Hz (a) (b

IPSJ SIG Technical Report Vol.2014-DPS-158 No.27 Vol.2014-CSEC-64 No /3/6 1,a) 2,b) 3,c) 1,d) 3 Cappelli Bazen Cappelli Bazen Cappelli 1.,,.,.,

A Graduation Thesis of College of Engineering, Chubu University Pose Estimation by Regression Analysis with Depth Information Yoshiki Agata

2 (March 13, 2010) N Λ a = i,j=1 x i ( d (a) i,j x j ), Λ h = N i,j=1 x i ( d (h) i,j x j ) B a B h B a = N i,j=1 ν i d (a) i,j, B h = x j N i,j=1 ν i

% 2 3 [1] Semantic Texton Forests STFs [1] ( ) STFs STFs ColorSelf-Simlarity CSS [2] ii

数学の基礎訓練I

JAMSTEC Rep. Res. Dev., Volume 12, March 2011, 27 _ 35 1,2* Pb 210 Pb 214 Pb MCA 210 Pb MCA MCA 210 Pb 214 Pb * 2

,4) 1 P% P%P=2.5 5%!%! (1) = (2) l l Figure 1 A compilation flow of the proposing sampling based architecture simulation

2006/11 Vol. J89 D No. 11 [10] [15], [16] [5], [17] [21] Tamura [5] RGB 2% [17] Yannis [18] Li [19] 35 1% Hoover [20] fuzzy convergence 50 82% %

IPSJ SIG Technical Report Vol.2012-CG-148 No /8/29 3DCG 1,a) On rigid body animation taking into account the 3D computer graphics came

3 2 2 (1) (2) (3) (4) 4 4 AdaBoost 2. [11] Onishi&Yoda [8] Iwashita&Stoica [5] 4 [3] 3. 3 (1) (2) (3)

12 DCT A Data-Driven Implementation of Shape Adaptive DCT

, 3, STUDY ON IMPORTANCE OF OPTIMIZED GRID STRUCTURE IN GENERAL COORDINATE SYSTEM 1 2 Hiroyasu YASUDA and Tsuyoshi HOSHINO

Vol. 23 No. 4 Oct Kitchen of the Future 1 Kitchen of the Future 1 1 Kitchen of the Future LCD [7], [8] (Kitchen of the Future ) WWW [7], [3

1 Table 1: Identification by color of voxel Voxel Mode of expression Nothing Other 1 Orange 2 Blue 3 Yellow 4 SSL Humanoid SSL-Vision 3 3 [, 21] 8 325

20 Method for Recognizing Expression Considering Fuzzy Based on Optical Flow

proc.dvi


1., 1 COOKPAD 2, Web.,,,,,,.,, [1]., 5.,, [2].,,.,.,, 5, [3].,,,.,, [4], 33,.,,.,,.. 2.,, 3.., 4., 5., ,. 1.,,., 2.,. 1,,

IPSJ SIG Technical Report 1,a) 1,b) 1,c) 1,d) 2,e) 2,f) 2,g) 1. [1] [2] 2 [3] Osaka Prefecture University 1 1, Gakuencho, Naka, Sakai,

9_18.dvi

IS1-09 第 回画像センシングシンポジウム, 横浜,14 年 6 月 2 Hough Forest Hough Forest[6] Random Forest( [5]) Random Forest Hough Forest Hough Forest 2.1 Hough Forest 1 2.2

IPSJ-CVIM

2.2 6).,.,.,. Yang, 7).,,.,,. 2.3 SIFT SIFT (Scale-Invariant Feature Transform) 8).,. SIFT,,. SIFT, Mean-Shift 9)., SIFT,., SIFT,. 3.,.,,,,,.,,,., 1,

IPSJ SIG Technical Report Vol.2010-MPS-77 No /3/5 VR SIFT Virtual View Generation in Hallway of Cybercity Buildings from Video Sequen

JIS Z803: (substitution method) 3 LCR LCR GPIB

Summary 3D cinemas are becoming real thanks to digital image processing technology. The most feasible and stable technology based on the binocular dis

untitled

No. 3 Oct The person to the left of the stool carried the traffic-cone towards the trash-can. α α β α α β α α β α Track2 Track3 Track1 Track0 1

特集_03-07.Q3C

,,.,.,,.,.,.,.,,.,..,,,, i

THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE k

IPSJ SIG Technical Report Vol.2009-CVIM-168 No /9/ Latest Algorithm for 3-D Reconstruction from Two Views Kento Yamada, 1 Yasu

28 TCG SURF Card recognition using SURF in TCG play video

I

Computer Security Symposium October ,a) 1,b) Microsoft Kinect Kinect, Takafumi Mori 1,a) Hiroaki Kikuchi 1,b) [1] 1 Meiji U

1

SICE東北支部研究集会資料(2004年)

untitled

8.dvi


Vol. 43 No. 7 July 2002 ATR-MATRIX,,, ATR ITL ATR-MATRIX ATR-MATRIX 90% ATR-MATRIX Development and Evaluation of ATR-MATRIX Speech Translation System

Fig. 3 3 Types considered when detecting pattern violations 9)12) 8)9) 2 5 methodx close C Java C Java 3 Java 1 JDT Core 7) ) S P S

Vol.-ICS-6 No.3 /3/8 Input.8.6 y.4 Fig....5 receptive field x 3 w x y Machband w(x =

23 Fig. 2: hwmodulev2 3. Reconfigurable HPC 3.1 hw/sw hw/sw hw/sw FPGA PC FPGA PC FPGA HPC FPGA FPGA hw/sw hw/sw hw- Module FPGA hwmodule hw/sw FPGA h

main.dvi

Spin Image [3] 3D Shape Context [4] Spin Image 2 3D Shape Context Shape Index[5] Local Surface Patch[6] DAI [7], [8] [9], [10] Reference Frame SHO[11]

Transcription:

Automatic Detection of Circular Objects by Ellipse Growing Mitsuo OKABE, Kenichi KANATANI, and Naoya OHTA 1. [4], [5], [18], [19] [14], [17] [28], [32] [6], [21], [27] Fujitsu Cadtech, Ltd., Oyama-shi, 323-0807 Japan Department of Information Technology, Okayama University, Okayama-shi, 700-8530 Japan Department of Computer Science, Gunma University, Kiryushi, 376-8515 Japan 5 5 5 3 2 3 2 [2], [3], [7] [10], [22] [26], [31], [33] [39] D II Vol. J85 D II No. 12 pp. 1823 1831 2002 12 1823

2002/12 Vol. J85 D II No. 12 edge detection voting for the center of the circle voting for the radius of the circle ellipse growth outlier detection ellipse fitting Does the edge segment mostly cover the ellipse? no yes search for the other segment end Fig. 1 1 Flowchart of the procedure. [2] 2 [30] 3 2 1 LMedS [29] 1 2. 2. 1 Sobel 1 8 8 Fig. 2 2 The evolute of an ellipse and its singularities. 61 2. 2 [11] 4 2 [1] 2 4 3 [16] P k 2 P C r 3(a) C γr k k = 30, γ = 1/10 1/ r 1 4 5 3. 2. 3 C 1 3 1824

3 Fig. 3 (a) (b) (c) (a) P k 2. (b) C R e R2 /2s 2 cos φ R (c) δ (a) Voting around the center of the circle passing through P and the two points away from it by k pixels on both sides. (b) A pixel away from the estimated center C by distance R votes the value R with weight e R2 /2s 2 cos φ. (c) Fitting an ellipse to the longest edge segment inside the region within distance δ from the estimated ellipse. C P R [11] R 1 e R2 /2s 2 cos φ 2 φ P Sobel CP 3(b) s C R s 1/4 R ±1 e 1/2 R 1 ) e R2 /2s 2 C s cos φ 0 C 0 6 3. 2. 4 δ 2 e x2 3(c) [12], [13], [15] 3 [18] Ax 2 +2Bxy+Cy 2 +2f(Dx+Ey)+f 2 F =0 (1) f AC B 2 > 0 (2) x Q x/f A B D x = y/f, Q = B C E (3) 1 D E F (1) [14], [16] (x, Qx) = 0 (4) (a, b) a, b 3 http://www.ail.cs.gunma-u.ac.jp/labo/program.html 1825

2002/12 Vol. J85 D II No. 12 δ Q (+), Q ( ) 1 S c c ( A S = B B C ), c = c = (c, S 1 c) F (5) 2 S λ 1, λ 2 ( D E u 1, u 2 3 1, 2 1 = 2 = c ( c/λ 1 ± δ/f) 2 c (6) ( c/λ 2 ± δ/f) 2 4 S (+), S ( ) ( ) S (±) = U 1 2 ) U (7) U u 1, u 2 2 2 5 Q (+), Q ( ) Q (±) = ( S (±) S (±) S 1 c (S (±) S 1 c) F +(c, S 1 (S (±) S)S 1 c) (8) (4) δ (x, Q (+) x)(x, Q ( ) x) < 0 (9) (1) 2 δ = 4 (2) δ 1 δ = 10 2. 5 LMedS [29] ) 4 Fig. 4 Judging if the edge segment covers more than half of the ellipse. 4 (3) {x α }, α = 1,..., N Q m = O, S m = 1 {x α } 5 2 5 Q (1) A, B,..., F (2) 3 S = med N (x α, Qx α ) 2 α=1 (10) P k Qx α 2 P k = diag(1, 1, 0) 1, 1, 0 Q x α [15] 4 S < S m Q m Q, S m S 10 S > = S m x α (x α, Qx α) 2 < 10Sm (11) P k Qx α 2 [29] σ σ 1.4826 S m Q 2.13σ e 2. 6 4 1826

(a) (b) (c) 5 (a) (b) (c) Fig. 5 Estimation of the center of the initial circle. (a) The detected circle and the fitted ellipse. (b) Voting for the center. (c) Simple Hough transform. 0 100 200 300 400 R (a) 0 100 200 300 400 R 6 R (a) (b) Fig. 6 The number of votes (ordinate) for the radius R of the initial circle (abscissa). (a) Proposed method. (b) Simple voting. (b) e 4 1 + γ (6) 1 = λ 1 (1 ± γ) 2, λ(±) 2 = λ 2 (1 ± γ) 2 (12) 1 ± γ γ = 1.2 20 e e 4, e 1 e, e (10) 100 4 e, e (11) 3. 5(a) 5(b) 5(c) 1 [11] 6(a) R 6(b) ±1 1 [11] 6(a) 0 7(a) 1827

2002/12 Vol. J85 D II No. 12 (a) (b) 7 Fig. 7 (a) (b)(1) (2) (3) (4) (a) The edge image used. (b) (1) The initial circle, (2) the hyperbola resulting from the ellipse growing, (3) the ellipse fitted by LMedS, and (4) the ellipse fitted after detecting another segment. δ = 10 7(b) (1) (2) (3) (4) 8 1, 2 4, 5 500 333 18 CPU Pentium III 600MHz OS Linux [32] 9 768 512 700 6.45cm 59.4 27.3cm [17], [28], [32] 4. 1 2 (2) No. 13680432 [1],,, 1976. [2],,,, PRMU98-123, Nov. 1998. [3] Y. C. Cheng and S. C. Lee, A new method for quadratic curve detection using K-RANSAC with acceleration techniques, Pattern Recognit., vol.28, no.5, pp.663 682, May 1995. [4] W. Chojnacki, M. J. Brooks, and A. van den Hen- 1828

論文 楕円成長法による円形物体の自動検出 図 8 当てはめ例 上段はエッジ画像 下段は初期円と当てはめた楕円を原画像に重ねた もの Fig. 8 Examples of ellipse fitting: the edge images (upper rows); the initial circles and the fitted ellipses superimposed on the original images (lower rows). 1829

2002/12 Vol. J85 D II No. 12 Fig. 9 9 Calibration of a turntable. gel, Rationalising the renormalisation method of Kanatani, J. Math. Imaging Vision, vol.14, no.1, pp.21 38, Feb. 2001. [5] W. Chojnacki, M. J. Brooks, A. van den Hengel, and D. Gawley, On the fitting of surfaces to data with covariances, IEEE Trans. Pattern Anal. & Mach. Intell., vol.22, no.11, pp.1294 1303, Nov. 2000. [6] D. B. Cooper and N. Yalabik, On the computational cost of approximating and recognizing nose-perturbed straight lines and quadratic arcs in the plane, IEEE Trans. Comput., vol.25, no.10, pp.1020 1032, Oct. 1976. [7],,, θ-ρ, D-II, vol.j74-d-ii, no.9, pp.1184 1191, Sept. 1991. [8] N. Guil and E. L. Zapata, Lower order circle and ellipse Hough transform, Pattern Recognit., vol.30, no.10, pp.1729 1744, Oct. 1997. [9] C.-T. Ho and L.-H. Chen, A fast ellipse/circle detector using geometric symmetry, Pattern Recognit., vol.28, no.1, pp.117 124, Jan. 1995. [10] C. L. Huang, Elliptical feature extraction via an improved Hough transform, Pattern Recognit. Lett., vol.10, no.2, pp.93 100, Feb. 1989. [11] D. Ioannou, W. Huda, and A. F. Laine, Circle recognition through a 2D Hough Trnasform and radius histogramming, Image Vision Comput., vol.17, pp.15 26, Jan. 1999. [12],,, vol.35, no.2, pp.201 209, Feb. 1994. [13],,, 1995. [14] K. Kanatani, Geometric Computation for Machine Vision, Oxford University Press, Oxford, 1993. [15] K. Kanatani, Statistical Optimization for Geometric Computation: Theory and Practice, Elsevier, Amsterdam, 1996. [16],,, 1998. [17] K. Kanatani and W. Liu, 3-D interpretation of conics and orthogonality, CVGIP: Image Understanding, vol.58, no.3, pp.286 301, Nov. 1993. [18] Y. Kanazawa and K. Kanatani, Optimal conic fitting and reliability evaluation, IEICE Trans. Inf. & Syst., vol.e79-d, no.9, pp.1323 1328, Sept. 1996. [19] Y. Leedan and P. Meer, Heteroscedastic regression in computer vision: Problems with bilinear constraint, Int. J. Comput. Vision, vol.37, no.2, pp.127 150, June 2000. [20] B. Matei and P. Meer, Reduction of bias in maximum likelihood ellipse fitting, Proc. 15th Int. Conf. Pattern Recognit., vol.3, pp.801 806, Barcelona, Spain, Sept. 2000. [21],,,, D-II, vol.j84-d-ii, no.2, pp.287 294, Feb. 2001. [22],,, D-II, vol.j81-d-ii, no.9, pp.2074 2085, Sept. 1998. [23],,, Hough, D-II, vol.j72-d-ii, no.10, pp.1760 1764, Oct. 1989. [24] D. Pao, H. F. Li, and R. Jayakumar, A decomposable parameter space for the detection of ellipses, Pattern Recognit., vol.14, no.12, pp.951 958, Dec. 1993. [25] G. Roth and M. D. Levine, Extracting geometric primitives, CVGIP: Image Understanding, vol.58, no.1, pp.1 22, July 1993. [26] G. Roth and M. D. Levine, Geometric primitive extraction using a genetic alorithm IEEE Trans. Pattern Anal. & Mach. Intell., vol.16, no.9, pp.901 905, Sept. 1994. [27] P. L. Rosin and G. A. W. West, Nonparametric segmentation of curves into various representations, IEEE Trans. Pattern Anal. & Mach. Intell., vol.17, no.12, pp.1140 1153, Dec. 1995. [28] C. A. Rothwell, A. Zisserman, C. I. Marinos, D. A. Forsyth, and J. L. Mundy, Relative motion and pose from arbitrary plane curves, Image Vision Computing, vol.10, no.4, pp.250 262, May 1992. [29] P. J. Rousseeuw and A. M. Leroy, Robust Regression and Outlier Detection, Wiley, New York, 1987. [30], Hough,, vol.32, no.2, pp.179 187, Feb. 1991. [31] S. Tsuji and F. Matsumoto, Detection of ellipses by 1830

a modified Hough transform, IEEE Trans. Comput., vol.27, no.8, pp.777 781, Aug. 1978. [32],,,, 6, pp.291 298,, June 2000. [33],,,, D-II, vol.j82-d-ii, no.12, pp.2221 2229, Dec. 1999. [34],,,, Li-Lavin-Le Master, D-II, vol.j76-d-ii, no.12, pp.2504 2512, Dec. 1993. [35],, Hough, D-II, vol.j73-d-ii, no.2, pp.159 166, Feb. 1990. [36] W.-Y. Wu and M.-J. J. Wang, Elliptical object detection by using its geometric properties, Pattern Recognit., vol.26, no.10, pp.1449 1500, Oct. 1993. [37],,,,, D-II, vol.j72-d-ii, no.7, pp.1009 1016, July 1989. [38] H. K. Yuen, J. Illingworth, and J. Kittler, Detecting partially occluded ellpises using the Hough transform, Image Vision Comput., vol.7, no.1, pp.31 37, Feb. 1989. [39] J. H. Yoo and I. K. Seth, An ellipse detection method from the polar and pole definition of conics, Pattern Recognit., vol.26, no.2, pp.307 315, Feb. 1993. 3 (1), (3) f x y z Q r Q det Q = 1 det Q = 0 2 [14], [16] Q λ 1, λ 2, λ 3 u 1, u 2, u 3 λ 3 < 0 < λ 1 < = λ 2 [14] [ ] λ 2 λ 1 λ 1 λ 3 n = N u 2 ± u 3 (A 1) λ 2 λ 3 λ 2 λ 3 n 1 n 3 < = 0 d = λ 3 1 r. (A 2) x C = Z[Q 1 n] (A 3) Z[ ] Z 1 r C = dx C (n, x C ) (A 4) θ = cos 1 n 3 (A 5) 14 1 21 6 20 1999 2001 1972 1979 IEEE 1983 1985 1987 N[ ] 2 1831