The following pages link to Pattern Recognition Letters (Q65124):
Displaying 50 items.
- Orientation of anisotropic random fields and images (Q3683390) (← links)
- Properties and some fast algorithms of the Haar transform in image processing and pattern recognition (Q3685232) (← links)
- Determination of 3-D object orientation from projections (Q3698334) (← links)
- A simple proof of Rosenfeld's characterization of digital straight line segments (Q3700866) (← links)
- An application of limited branching in clustering (Q3700867) (← links)
- Distances between fuzzy sets (Q3703814) (← links)
- Generalized error bounds in pattern recognition (Q3704916) (← links)
- Classification in a fuzzy environment (Q3707152) (← links)
- Determining hyperspherical classes of observations (Q3709665) (← links)
- Linear, structured covariance estimation: An application to pattern classification for remote sensing (Q3709666) (← links)
- Tessellation graph characterization using rosettas (Q3715156) (← links)
- A generalised learning algorithm based on guard zones (Q3718178) (← links)
- Baum's forward-backward algorithm revisited (Q3723530) (← links)
- Some remarks on fuzzy graphs (Q3765824) (← links)
- Shortest path solves edge-to-edge visibility in a polygon (Q3771676) (← links)
- Interactive curve drawing by segmented Bezier approximation with a control parameter (Q3771678) (← links)
- ‘Continuous’ functions on digital pictures (Q3771679) (← links)
- Rotation-invariant operators and scale-space filtering (Q3773388) (← links)
- Predictive discrimination for autoregressive processes (Q3774740) (← links)
- A new technique for shape analysis using orthogonal polynomials (Q3774992) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- Pattern recognition and categorical shape theory (Q3783618) (← links)
- Relaxation labelling and the entropy of neighbourhood information (Q3783951) (← links)
- Separability of unimodal polygons (Q3784732) (← links)
- Random field identification from a sample: Experimental results (Q3785699) (← links)
- Cramer-Rao bounds for the estimation of means in a clustering problem (Q3790484) (← links)
- Some characterizations of city block distance (Q3791789) (← links)
- Convexity is necessary — A correction (Q3791790) (← links)
- Generating rules for expert systems from observations (Q3792266) (← links)
- Linear time algorithms for an image labelling machine (Q3792296) (← links)
- Translation invariant data-structure for 3-D binary images (Q3792300) (← links)
- On the description of relative position of fuzzy patterns (Q3793757) (← links)
- An algebraic environment to process fuzzy images (Q3793758) (← links)
- A note on Rutovitz' method for parallel thinning (Q3793759) (← links)
- An artificial intelligence approach to speech recognition and understanding (Q3793761) (← links)
- Sequential pattern recognition procedures derived from multiple Fourier series (Q3796568) (← links)
- Perception of a quadrilateral (Q3798290) (← links)
- Sequential inference of Markov networks by dynamic programming for structural pattern recognition (Q3799657) (← links)
- On the relationship of the Markov mesh to the NSHP Markov chain (Q3799658) (← links)
- Recognition and characterization of digitized curves (Q3799660) (← links)
- A note on average distances in digital sets (Q3799661) (← links)
- A general approach to parameter evaluation in fuzzy digital pictures (Q3799663) (← links)
- Efficient computation of two-dimensional Gaussian windows (Q3800968) (← links)
- Properties of fractal intensity surfaces (Q3803949) (← links)
- Parallel algorithm for corner finding on digital curves (Q3804230) (← links)
- Knight's distance in digital geometry (Q3805929) (← links)
- Clustering by mode boundary detection (Q3806602) (← links)
- A fast computational method for minimum square error transform (Q3806685) (← links)
- Corner characterization by differential geometry techniques (Q3815557) (← links)
- A fast algorithm to calculate the Euler number for binary images (Q3815558) (← links)
