Detection and segmentation of generic shapes based on affine modeling of energy in eigenspace

This paper presents a novel approach for detection and segmentation of man made generic shapes in cluttered images. The set of shapes to be detected are members of affine transformed versions of basic geometric shapes such as rectangles, circles etc. The shape set is represented by its vectorial edge map transformed over a wide range of affine parameters. We use vectorial boundary instead of regular boundary to improve the robustness to noise, background clutter and partial occlusion. Our approach consists of a detection stage and a verification stage. In the detection stage, we first derive the energy from the principal eigenvectors of the set. Next, an a posteriori probability map of energy distribution is computed from the projection of the edge map representation in a vectorial eigen-space. Local peaks of the posterior probability map are located and indicate candidate detections. We use energy/probability based detection since we find that the underlying distribution is not Gaussian and resembles a hypertoroid. In the verification stage, each candidate is verified using a fast search algorithm based on a novel representation in angle space and the corresponding pose information of the detected shape is obtained. The angular representation used in the verification stage yields better results than a Euclidean distance representation. Experiments are performed in various interfering distortions, and robust detection and segmentation are achieved