Waveform Segmentation Through Functional Approximation
IEEE Transactions on ComputersPublished 1 July 1973
Theodosios Pavlidis
Citations138
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Waveform segmentation is treated as a problem of piecewise linear uniform (minmax) approximation and can be used for pattern recognition, data compression, and nonlinear filtering not only for waveforms but also for pictures and maps.
Abstract
Waveform segmentation is treated as a problem of piecewise linear uniform (minmax) approximation. Various algorithms are reviewed and a new one is proposed based on discrete optimization. Examples of its applications are shown on terrain profiles, scanning electron microscope data, and electrocardiograms. The processing is sufficiently fast to allow its use on-line. The results of the segmentation can be used for pattern recognition, data compression, and nonlinear filtering not only for waveforms but also for pictures and maps. In the latter case some additional preprocessing is required and it is described in [19].
Keywords
Computer Science
IEEE Transactions on ComputersA Nonlinear Mapping for Data Structure Analysis
3,381 Citations1969John W. Sammon
An algorithm for the analysis of multivariate data is presented along with some experimental results that is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data "structure" is approximately preserved.
Physics Today<i>Analysis of Numerical Methods</i>
2,290 Citations1967Eugene Isaacson, Herbert B. Keller +1 more
Computer Graphics and Image ProcessingAn iterative procedure for the polygonal approximation of plane curves
1,370 Citations1972Urs Ramer
An approximation algorithm is presented which uses an iterative method to produce polygons with a small—but not minimum—number of vertices that lie on the given curve that justifies the abandonment of the minimum-vertices criterion.
Journal of the London Mathematical SocietyINTERPOLATION AND APPROXIMATION
898 Citations1964J. L. B. Cooper
Computers and Biomedical ResearchComputer determination of the constituent structure of biological images
596 Citations1971Russell A. Kirsch
A class of algorithms is described which enables computer quantized images to be decomposed into constituent reflecting the structure of the images, viewed as the morphological precursor to a higher level syntactic analysis.
Communications of the ACMOn the approximation of curves by line segments using dynamic programming
439 Citations1961Richard Bellman
The technique of dynamic programming is applied to approximate a given continuous function g(x) by a finite number of line segments over the interval a,b to determine the constants aSub k, b sub k, k equals 0,..., N - 1 and the points of division u sub 1,..., u sub N-1 in the intervala,b that minimize the function J = N -1k=0 uk+1.
Artificial IntelligenceScene analysis using regions
380 Citations1970Claude R. Brice, Claude L. Fennema
One of the vision projects of the Stanford Research Institute Artificial Intelligence Group is described, which uses regions as basic data and progresses by successive partitioning of the picture toward an interpretable “goal partition”, which is then explored by a heuristic decision tree.
Proceedings of the IEEEState of the art in pattern recognition
294 Citations1968George Nagy
This paper reviews statistical, adaptive, and heuristic techniques used in laboratory investigations of pattern recognition problems and includes correlation methods, discriminant analysis, maximum likelihood decisions minimax techniques, perceptron-like algorithms, feature extraction, preprocessing, clustering and nonsupervised learning.
Information and ControlA formal picture description scheme as a basis for picture processing systems
250 Citations1969Alan Shaw
A formal picture description scheme to be used as the basis for picture processing systems is presented and a series of examples illustrate the capability and limitations of the description scheme.
IEEE Transactions on ComputersA Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties
203 Citations1971Anthony N. Mucciardi, Earl E. Gose
This paper presents seven techniques for choosing good subsets of properties and compares their performance on a nine-class vectorcardiogram classification problem.
Mathematical BiosciencesA method of unconstrained global optimization
200 Citations1970Hans J. Bremermann
It is shown that a global optimization method for fourth degree polynomials can solve systems of polynomial equations in many variables of any degree.
Information and ControlLabeling schemata and syntactic descriptions of pictures
147 Citations1964Raghavan Narasimhan
A specific syntactic descriptive model for classes of pictures composed of linelike elements is proposed and it is shown that a natural extension of ALGOL can be made to serve as an adequate programming language for such a computer.
Proceedings of the IEEEFeature extraction: A survey
138 Citations1969Martin D. Levine
A survey of computer algorithms and philosophies applied to problems of feature extraction and pattern recognition in conjunction with image analysis is presented and the main emphasis is on usable techniques applicable to practical image processing systems.
Communications of the ACMA note on minimal length polygonal approximation to a digitized contour
136 Citations1970Ugo Montanari
A method for extracting a smooth polygonal contour from a digitized image and the determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables.
Computer Graphics and Image ProcessingSegmentation of pictures and maps through functional approximation
93 Citations1972Theodosios Pavlidis
A suboptimal solution to the picture segmentation problem is presented together with examples of its application on the segmentation of maps and pictures from a scanning electron microscope.
Report - Software EngineeringOn Syntactic Pattern Recognition
90 Citations1971K. S. Fu, P. H. Swain
This chapter focuses on syntactic pattern recognition, which adapts the techniques of formal language theory to the problem of representing and analyzing patterns containing a significant syntactic content.
IEEE Transactions on Systems Science and CyberneticsFeature Selection in Pattern Recognition
88 Citations1970K. S. Fu, P. Min +1 more
Computer similation results are presented and compared and feature selection techniques discussed include 1) information theoretic approach, 2) direct estimation of error probability, 3) feature-space transformation, and 4) approach of using stochastic automata model.
SIAM Journal on Numerical AnalysisUniform Approximation by Chebyshev Spline Functions. II: Free Knots
59 Citations1968Larry L. Schumaker
Numerische MathematikChebyshev approximation by spline functions with free knots
55 Citations1971Dietrich Braess
Communications of the ACMFurther remarks on line segment curve-fitting using dynamic programming
46 Citations1962Brian Gluss
The computational procedure is considered more fully, and the similarities to some of Stone's equations are indicated, and it is further shown that an equation for u2 involving no minimization may be found.
IEEE Transactions on ComputersRandomized Pattern Search
39 Citations1972Joseph Lawrence, Kenneth Steiglitz
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' pattern search.
Elsevier eBooksON LINGUISTIC, STATISTICAL AND MIXED MODELS FOR PATTERN RECOGNITION
34 Citations1972Laveen N. Kanal, B. Chandrasekaran
It is shown that it is hybrid linguistic-statistical models that are useful in practice and pointed out the utility of first-order predicate calculus formalism for pattern description in view of the availability of a large body of heuristic techniques for analysis.
Elsevier eBooksSTRUCTURAL PATTERN RECOGNITION: PRIMITIVES AND JUXTAPOSITION RELATIONS**This work was supported by NSF Grant GK-13-622.
32 Citations1972Theodosios Pavlidis
This chapter discusses structural pattern recognition, which includes recognition of objects in photographs through their silhouettes, certain types of wave-forms and all thin line pictures.
Journal of Approximation TheoryUniform piecewise polynomial approximation with variable joints
27 Citations1974T. Pavlidis, A.P Maika
A procedure based on functional iteration is proposed for solving the problem of uniform piecewise polynomial approximation of a function, and a proof for its convergence is given.
Pattern RecognitionUngrammatical grammar in pattern recognition
20 Citations1971Satosi Watanabé
Two examples of structure description are introduced, one of pictorial patterns with a set of group-theoretical rules and the other aSet of rules for linearization of chemical structural formulae, both of which are grammatical in the sense that they are based on production rules.
Mathematics in Science and Engineering/Mathematics in science and engineering2 Statistical Pattern Recognition
20 Citations1970K. S. Fu
This chapter discusses several recent developments in the application of statistical techniques to feature selection, feature ordering, mode estimation, and pattern classification and presents several Bayesian estimation techniques used in the estimation of unknown parameters of a probability density function.
IEEE Transactions on ComputersA Segmentation Technique for Waveform Classification
6 Citations1972Theodosios Pavlidis, Geng Seng Fang
This note describes the determination of waveform segments which contain the information necessary for classification and is successful in discriminating between the vibration record of internal combustion engines before and after repair.
Piecewise Approximation of Functions of Two Variables and Its Application in Topographical Data Reduction.
4 Citations1970Theodosios Pavlidis
A method to obtain variable-boundary piecewise polynomial approximations of functions of two variables f(x,y) is presented, using a two state scan to find segments where groups of certain coefficients do not differ significantly from their average value.