
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N. Katzir, M. Lindenbaum, M. Porat, "Curve Segmentation Under Partial Occlusion," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 5, pp. 513519, May, 1994.  
BibTex  x  
@article{ 10.1109/34.291446, author = {N. Katzir and M. Lindenbaum and M. Porat}, title = {Curve Segmentation Under Partial Occlusion}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {5}, issn = {01628828}, year = {1994}, pages = {513519}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.291446}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Curve Segmentation Under Partial Occlusion IS  5 SN  01628828 SP513 EP519 EPD  513519 A1  N. Katzir, A1  M. Lindenbaum, A1  M. Porat, PY  1994 KW  image segmentation; image recognition; transforms; curve segmentation; partial occlusion; 2D shape boundary segmentation; partially occluded object recognition; smooth boundary curve; similarity transformation invariance; intersection point existence conditions; gray level images VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
2D shape boundary segmentation is required as a fundamental and important stage in the recognition of partially occluded objects. We introduce here a new segmentation method capable of extracting a controlled number of segments along a smooth boundary curve. This new approach is invariant to similarity transformation, and partial occlusion has only marginal influence on the segmentation of the visible part. The basic concept is to transform the curve into another one which intersects itself. Points of intersection of the new curve are retransformed to the original curve and serve as endpoints of segments. Properties of the transform are discussed, and conditions for existence of intersection points are given. Simulation results of gray level images are presented, and advantages of our method over conventional approaches relying on singular points of the curvature are discussed.
[1] C. T. Zahn and R. Z. Roskies, "Fourier description for plane close curves,"IEEE Trans. Comput., vol. C21, pp. 269281, Mar. 1972.
[2] S. A. Dudani, K. J. Breeding, and R. B. McGhee, "Aircraft identification by moment invariants,"IEEE Trans. Comput., vol. C26, pp. 3946, Jan. 1977.
[3] A. Kalvin, E. Schonberg, J. Schwartz, and M. Sharir, "Twodimensional, modelbased, boundary matching using footprints."Int. J. Robotics Res., vol. 5, no. 4, pp. 3855, 1986.
[4] J. L. Turney, T. N. Mudge, and R. A. Volz, "Recognizing partially occluded parts,"IEEE Trans. Pattern Anal, Machine Intell., vol. PAMI7, pp. 410421, July 1985.
[5] J. Hong and H. J. Wolfson, "An improved modelbased matching method using footprints," inProc. Ninth Int. Conf. Pattern Recognition, Rome, Italy, Nov. 1418, 1988.
[6] J. W. Gorman, O. R. Mitchell, and F. P. Kuhl, "Partial shape recognition using dynamic programming,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI10, pp. 257266, Mar. 1988.
[7] D. P. Huttenlocher and S. Ullman, "Object recognition using alignment," inProc. 1st Int. Conf. on Comput. Vision, London, 1987, pp. 102111.
[8] Y. Lamdan, J. T. Schwartz, and H. J. Wolfson, "On recognition of 3D objects from 2D images," inProc. IEEE Int. Conf. Robotics Automat., Apr. 1988.
[9] A. Rosenfeld and J. S. Weszka, "An improved method of angle detection on digital curves,"IEEE Trans. Comput., vol. C24, pp. 940941, Sept. 1975.
[10] H. Freeman and L. S. Davis, "A cornerfinding algorithm for chaincoded curves,"IEEE Trans. Comput., vol. C26, pp. 297303, Mar. 1977.
[11] M.A. Fischler and R. C. Bolles, "Perceptual organization and curve partitioning,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 100105, 1986.
[12] E. E. Milios, "Shape matching using curvature processes,"Comp. Vision Graphics Image Processing, vol. 47, pp. 203226, 1989.
[13] F. Moktarian and A. Mackworth, "Scalebased description and recognition of planar curves and twodimensional shapes,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 3443, Jan. 1986.
[14] H. Asada and M. Brady, "The curvature primal sketch,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI8, no. 1, pp. 214, 1986.
[15] D. D. Hoffman and W. A. Richards, "Representing smooth plane curves for recognition: Implications for figureground reversal," inAAAI82 Nat. Conf. on Artificial Intell., pp. 58, 1982.
[16] J. J. Stocker,Differential Geometry. New York: WileyInterscience, 1969.
[17] M. P. Do Carmo,Differential geometry of curves and surfaces. Englewood Cliffs, NJ: PrenticeHall, 1976.
[18] I. Faux and M. Pratt,Computational Geometry for Design and Manufacture. Ellis Horwood, 1979.
[19] L. O'Gorman, "Curvilinear feature detection from curvature estimation," inProc. Int. Conf. on Pattern Recognition, Rome, Italy, 1988, pp. 11161119.
[20] K. Deguchi, "Multiscale curvatures for contour feature extraction," inProc. Int. Conf. on Pattern Recognit., Rome, Italy, 1988, pp. 11131115.
[21] N. Katzir, M. Lindenbaum, and M. Porat, "Curve segmentation under partial occlusion," EE PUB No. 730, Technion, Haifa 1989.
[22] B. Chazelle and H. Edelsbrunner, "An optimal algorithm for intersecting line segments in the plane," inProc. 29th Annu. Symp. Foundations of Computer Science, Oct. 1988, pp. 590600.
[23] J. L. Bentley and T. A. Ottmann, "Algorithms for reporting and counting geometric intersections,"IEEE Trans. Comput., vol. C28, pp. 643647, Sept. 1979.
[24] N. Katzir and B. Sidlesky, "A fast intersectionfinding algorithm," Internal Rep., Computer Vision Lab., Technion, Haifa, 1992.