Invariant planar shape recognition using dynamic alignment

doi:10.1016/0031-3203(88)90058-1

Pattern Recognition

Volume 21, Issue 3, 1988, Pages 235-239

https://doi.org/10.1016/0031-3203(88)90058-1 Get rights and content

Abstract

Closed planar shapes are modelled by an ordered sequence that represents the Euclidean distance between the centroid and all contour pixels of the shape. Shapes belonging to the same class have similar sequences, hence a procedure for classifying shapes is based on the degree of similarity between these sequences. In order to determine the similarity between sequences, a dynamic alignment process is developed to find the best correspondence between the sequences. Optimum alignment is obtained by expanding segments of the sequences to minimize a dissimilarity function between the sequences. Normalization with respect to scaling and rotation is described and an example illustrating the use of dynamic alignment for the classification of noisy shapes is presented.

References (5)

H. Sakoe et al.
Dynamic programming optimization for spoken word recognition
IEEE Trans. Acoust. Speech Signal Process ASSP-26
(1978)
C. Myers
Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
IEEE Trans. Acoust. Speech Signal Process ASSP-28
(1980)

There are more references available in the full text version of this article.

Cited by (36)

Performance evaluation of time-frequency image feature sets for improved classification and analysis of non-stationary signals: Application to newborn EEG seizure detection
2017, Knowledge-Based Systems
Citation Excerpt :
However, it is still dependent on segmentation imperfections [23]. Signatures of 2D shapes developed in [24,25] can be computed by expressing the distance of the ROI boundaries from its centroid as a function of the angle formed from this centroid to the considered boundary point. Signatures reduce the dimensionality of the 2D representation to a 1D curve, therefore facilitating the shape description task.
This study demonstrates that a time-frequency (TF) image pattern recognition approach offers significant advantages over standard signal classification methods that use t-domain only or f-domain only features. Two approaches are considered and compared. The paper describes the significance of the standard TF approach for non-stationary signals; TF signal (TFS) features are defined by extending t-domain or f-domain features to a joint (t, f) domain resulting in e.g. TF flatness and TF flux. The performance of the extended TFS features is comparatively assessed using Receiver Operating Characteristic (ROC) analysis Area Under the Curve (AUC) measure. Experimental results confirm that the extended TFS features generally yield improved performance (up to 19%) when compared to the corresponding t-domain and f-domain features.
The study also explores a second approach based on novel TF image (TFI) features that further improves TF-based classification of non-stationary signals. New TFI features are defined and extracted from the (t, f) domain; they include TF Hu invariant moments, TF Haralick features, and TF Local Binary Patterns (LBP). Using a state-of-the-art classifier, different metrics based on confusion matrix performance are compared for all extended TFS features and TFI features. Experimental results show the improved performance of TFI features over both TFS features and t-domain only or f-domain only features, for all TF representations and for all the considered performance metrics. The experiment is validated by comparing this new proposed methodology with a recent study, utilizing the same large and complex data set of EEG signals, and the same experimental setup. The resulting classification results confirm the superior performance of the proposed TFI features with accuracy improvement up to 5.52%.
Third-order moment spectrum and weighted fuzzy classifier for robust 2-D object recognition
2003, Computers and Mathematics with Applications
In this paper, a robust position, scale, and rotation invariant system for the recognition of closed 2-D noise corrupted images using the bispectral features of a contour sequence and the weighted fuzzy classifier are derived. The higher-order spectrum based on third-order moment, called a bispectrum, is applied to the contour sequences of an image to extract a 15-dimensional feature vector for each of the 2-D images. This bispectral feature vector, which is invariant to shape translation, scale, and rotation transformation, can be used to represent a 2-D planar image and is fed into a weighted fuzzy classifier for the recognition process. The experiments with eight different shapes of aircraft images are presented to illustrate the high performance of the proposed system even when the image is significantly corrupted by noise.
A system for model-based object recognition in perspective aerial images
1998, Pattern Recognition
Recognition of objects in complex, perspective aerial imagery is difficult because of occlusion, shadow, clutter and various forms of image degradation. This paper presents a system for aircraft recognition under real-world conditions. The particular approach is based on the use of a hierarchical database of object models and involves three key processes: (a) The qualitative object recognition process performs heterogeneous model-based symbolic feature extraction and generic object recognition; (b) The refocused matching and evaluation process refines the extracted features for more specific classification with input from (a); and (c) The primitive feature extraction process regulates the extracted features based on their saliency and interacts with (a) and (b). Experimental results showing the qualitative recognition of aircraft in perspective, aerial images are presented.
Detecting Perceptually Parallel Curves: Criteria and Force-Driven Optimization
1997, Computer Vision and Image Understanding
We have developed several theorems for the detection of parallel curves in the continuous space. In this paper, we studied issues in carrying the continuous algorithm to the discrete case and also the perceptual characteristics leading to human recognition of parallelism. By formulating these properties in terms of several distinctive forces, we developed a force-driven model as a new optimization strategy to perform correspondence establishment between points in the matching curves. This force-driven mechanism provides a good coupling (or correspondence matching) result, which is the prerequisite for the correct detection of parallelism between curves. Convergence of the algorithm and implementation efficiency are also investigated and discussed. Experimental results on the relative weightings of these forces also shed light on the perceptual priority imposed by the human vision system.
A discrepancy measure for improved clustering
1995, Pattern Recognition
A discrepancy measure is proposed to improve the clustering of patterns which experience non-linear distortions. The discrepancy measure is an outcome of a non-linear alignment procedure which optimally aligns the elements of patterns in order to minimize the dissimilarity between the patterns. The K-means clustering algorithm is modified to use the discrepancy measure to compute the similarity between patterns and the cluster centers. A series of clustering experiments were conducted on identical data using the modified and standard K-means algorithm. The results obtained show that clustering performance of the modified algorithm is significantly superior to that of the standard algorithm.
Robust automatic target recognition using a localized boundary representation
1995, Pattern Recognition
A localized classification approach which includes a localized target boundary representation, a set of local features to characterize parts of a target boundary, and a feature matching method is developed to classify highly degraded targets. Each pixel on the target boundary is represented by the perpendicular Euclidean distance between the boundary pixel and the chord connecting the end-points of a window centered on the boundary pixel. The resulting localized representation is quite robust with respect to noise and missing segments in the targets. A local feature is the segment of the localized representation between two points selected on the target boundary. The two points on the boundary may be specified or randomly selected. The reference features of a hypothesized target class are compared with segments of the localized representation of the test target to determine a dissimilarity measure between the hypothesized target class and the test target. Segments of the test target may also be matched with the reference localized contour sequences of the targets. The test target is assigned to a target class using a minimum mismatch rule. Results from a series of experiments conducted on three targets show that it is possible to classify targets experiencing high levels of noise and high percentages of missing segments in partial targets.

View all citing articles on Scopus

View full text

Invariant planar shape recognition using dynamic alignment

Abstract

Dynamic programming optimization for spoken word recognition

IEEE Trans. Acoust. Speech Signal Process ASSP-26

Performance tradeoffs in dynamic time warping algorithms for isolated word recognition

IEEE Trans. Acoust. Speech Signal Process ASSP-28