TL;DR: LOCO-I as discussed by the authors is a low complexity projection of the universal context modeling paradigm, matching its modeling unit to a simple coding unit, which is based on a simple fixed context model, which approaches the capability of more complex universal techniques for capturing high-order dependencies.
Abstract: LOCO-I (LOw COmplexity LOssless COmpression for Images) is the algorithm at the core of the new ISO/ITU standard for lossless and near-lossless compression of continuous-tone images, JPEG-LS. It is conceived as a "low complexity projection" of the universal context modeling paradigm, matching its modeling unit to a simple coding unit. By combining simplicity with the compression potential of context models, the algorithm "enjoys the best of both worlds." It is based on a simple fixed context model, which approaches the capability of the more complex universal techniques for capturing high-order dependencies. The model is tuned for efficient performance in conjunction with an extended family of Golomb (1966) type codes, which are adaptively chosen, and an embedded alphabet extension for coding of low-entropy image regions. LOCO-I attains compression ratios similar or superior to those obtained with state-of-the-art schemes based on arithmetic coding. Moreover, it is within a few percentage points of the best available compression ratios, at a much lower complexity level. We discuss the principles underlying the design of LOCO-I, and its standardization into JPEC-LS.
TL;DR: Various forms of line drawing representation are described, different schemes of quantization are compared, and the manner in which a line drawing can be extracted from a tracing or a photographic image is reviewed.
Abstract: This paper describes various forms of line drawing representation, compares different schemes of quantization, and reviews the manner in which a line drawing can be extracted from a tracing or a photographic image. The subjective aspects of a line drawing are examined. Different encoding schemes are compared, with emphasis on the so-called chain code which is convenient for highly irregular line drawings. The properties of chain-coded line drawings are derived, and algorithms are developed for analyzing line drawings to determine various geometric features. Procedures are described for rotating, expanding, and smoothing line structures, and for establishing the degree of similarity between two contours by a correlation technique. Three applications are described in detail: automatic assembly of jigsaw puzzles, map matching, and optimum two-dimensional template layout
TL;DR: On the use of morphological operators in a class of edge detectors, L. Hertz and R. Schafer a valley-seeking threshold selection technique, and a pattern recognition of binary image objects using morphological shape decomposition.
Abstract: On the use of morphological operators in a class of edge detectors, L. Hertz and R.W. Schafer a valley-seeking threshold selection technique, S.C. Sahasrabudhe and K.S. Das Gupta local characteristics of binary images and their application to the automatic control of low-level robot vision, P.W. Pachowicz corner detection and localization in a pyramid, S. Baugher and A. Rosenfeld parallel-hierarchical image partitioning and region extraction, G.N. Khan and D.F. Gillies invariant architectures for low-level vision, L. Jacobson and H. Wechsler representation - primitives chain code, L. O'Gorman generalized cones - useful geometric properties, K. Rao and G. Medioni vision-based rendering - image synthesis for vision feature algorithms, J.D. Yates, et al recognition - investigation of a number of character recognition algorithms, A.A. Verikas, et al log-polar mapping applied to pattern representation and recognition, J.C. Wilson and R.M. Hodgson pattern recognition of binary image objects using morphological shape decomposition, I. Pitas and N.D. Sidiropoulos a pattern classification approach to multi-level thresholding for image segmentation, J.G. Postaire and M. Ameziane KOR - a knowledge-based object recognition system, C.M. Lee, et al shape decomposition based on perceptual structure, H.S. Kim and K.H. Park three dimensional - the Frobenius metric in image registration, K. Zikan and T.M. Silberberg binocular fusion revisited utilizing a log-polar tessellation, N.C. Griswold, et al an expert system for recovering 3D shape and orientation from a single view, W.J. Shomar, et al integrating intensity and range sensing to construct 3D polyhedra representation, W.N. Lie, et al notes - texture segmentation using topographic labels, T.C. Pong, et al an improved algorithm for labelling connected components in a binary image, X.D. Yang a note on the paper "The Visual Potential - One Convex Polygon", A. Laurentini a string descriptor for matching partial shapes, H.C. Liu and M.D. Srinath formulation and error analysis for a generalized image point correspondence algorithm, S. Fotedar, et al a new surface tracking system in 3D binary images, L.W. Chang and M.J. Tsai.
TL;DR: A novel combination of vision based features in order to enhance the recognition of underlying signs and kurtosis position and principal component analysis, PCA are presented.
TL;DR: This work is motivated by the idea of obtaining various shape features computed directly from the VCC without going to Cartesian-coordinate representation, and presents some results using real shapes.