Context-sensitive matching of two shapes

Download
2006
Başeski, Emre
The similarity between two shapes is typically calculated by measuring how well the properties and the spatial organization of the primitives forming the shapes agree. But, when this calculations are done independent from the context, i.e. the whole set of shapes in the experiments, a priori significance to the primitives is assigned, which may cause problematic similarity measures. A possible way of using context information in similarity measure between shape A and shape B is using the category information of shape B in calculations. In this study, shapes are represented as depth-1 shape trees and the dissimilarity between two shapes is computed by using an approximate tree matching algorithm. The category information is created as the union of shape trees that are in the same category and this information guides the matching process between a query shape and a shape whose category is known.

Suggestions

3d geometric hashing using transform invariant features
Eskizara, Ömer; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2009)
3D object recognition is performed by using geometric hashing where transformation and scale invariant 3D surface features are utilized. 3D features are extracted from object surfaces after a scale space search where size of each feature is also estimated. Scale space is constructed based on orientation invariant surface curvature values which classify each surface point's shape. Extracted features are grouped into triplets and orientation invariant descriptors are defined for each triplet. Each pose of eac...
Real time traffic sign recognition system on FPGA
Irmak, Hasan; Bulut, Mehmet Mete; Akar, Gözde; Department of Electrical and Electronics Engineering (2010)
In this thesis, a new algorithm is proposed for the recognition of triangular, circular and rectangular traffic signs and it is implemented on an FPGA platform. The system can recognize 32 different traffic signs with high recognition accuracy. In the proposed method, first the image is segmented into red and blue regions, and according to the area of the each segment, the dominant color is decided. Then, Laplacian of Gaussian (LoG) based edge detection is applied to the segmented image which is followed by...
Video shot boundary detection by graph theoretic approaches
Aşan, Emrah; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2008)
This thesis aims comparative analysis of the state of the art shot boundary detection algorithms. The major methods that have been used for shot boundary detection such as pixel intensity based, histogram-based, edge-based, and motion vectors based, are implemented and analyzed. A recent method which utilizes “graph partition model” together with the support vector machine classifier as a shot boundary detection algorithm is also implemented and analyzed. Moreover, a novel graph theoretic concept, “dominant...
SystemC implementation with analog mixed signal modeling for a microcontroller
Mert, Yakup Murat; Aşkar, Murat; Department of Electrical and Electronics Engineering (2007)
In this thesis, an 8-bit microcontroller, PIC 16F871, has been implemented using SystemC with classical hardware design methods. Analog modules of the microcontroller have been modeled behaviorally with SystemC-AMS which is the analog and mixed signal extensions for the SystemC. SystemC-AMS provides the capability to model non-digital modules and synchronization with the SystemC kernel. In this manner, electronic systems that have both digital and analog components can be described and simulated very effect...
Nested local symmetry set
Tarı, Zehra Sibel (Elsevier BV, 2000-08-01)
A local-symmetry-based representation for shapes in arbitrary dimensions and a method for its computation are presented. The method depends on analyzing the Hessian of a specific boundaryness function, v, which is computed as the minimizer of an energy functional. The method is basically a generalized ridge finding scheme in which the ridges are defined in terms of the orbit of the gradient vector del v under the action of the Hessian of v. Once the ridges are determined, the local extrema of the magnitude ...
Citation Formats
E. Başeski, “Context-sensitive matching of two shapes,” M.S. - Master of Science, Middle East Technical University, 2006.