Proceedings Article•
Image Processing
01 Jan 1994-
TL;DR: The main focus in MUCKE is on cleaning large scale Web image corpora and on proposing image representations which are closer to the human interpretation of images.
Abstract: MUCKE aims to mine a large volume of images, to structure them conceptually and to use this conceptual structuring in order to improve large-scale image retrieval. The last decade witnessed important progress concerning low-level image representations. However, there are a number problems which need to be solved in order to unleash the full potential of image mining in applications. The central problem with low-level representations is the mismatch between them and the human interpretation of image content. This problem can be instantiated, for instance, by the incapability of existing descriptors to capture spatial relationships between the concepts represented or by their incapability to convey an explanation of why two images are similar in a content-based image retrieval framework. We start by assessing existing local descriptors for image classification and by proposing to use co-occurrence matrices to better capture spatial relationships in images. The main focus in MUCKE is on cleaning large scale Web image corpora and on proposing image representations which are closer to the human interpretation of images. Consequently, we introduce methods which tackle these two problems and compare results to state of the art methods. Note: some aspects of this deliverable are withheld at this time as they are pending review. Please contact the authors for a preview.
Citations
More filters
TL;DR: Fractal analysis provides a quantitative measure of trabeculation and has high reproducibility and accuracy for LVNC diagnosis when compared to current CMR criteria.
Abstract: Left ventricular noncompaction (LVNC) is a myocardial disorder characterized by excessive left ventricular (LV) trabeculae. Current methods for quantification of LV trabeculae have limitations. The aim of this study is to describe a novel technique for quantifying LV trabeculation using cardiovascular magnetic resonance (CMR) and fractal geometry. Observing that trabeculae appear complex and irregular, we hypothesize that measuring the fractal dimension (FD) of the endocardial border provides a quantitative parameter that can be used to distinguish normal from abnormal trabecular patterns. Fractal analysis is a method of quantifying complex geometric patterns in biological structures. The resulting FD is a unitless measure index of how completely the object fills space. FD increases with increased structural complexity. LV FD was measured using a box-counting method on CMR short-axis cine stacks. Three groups were studied: LVNC (defined by Jenni criteria), n=30(age 41±13; men, 16); healthy whites, n=75(age, 46±16; men, 36); healthy blacks, n=30(age, 40±11; men, 15). In healthy volunteers FD varied in a characteristic pattern from base to apex along the LV. This pattern was altered in LVNC where apical FD were abnormally elevated. In healthy volunteers, blacks had higher FD than whites in the apical third of the LV (maximal apical FD: 1.253±0.005 vs. 1.235±0.004, p<0.01) (mean±s.e.m.). Comparing LVNC with healthy volunteers, maximal apical FD was higher in LVNC (1.392±0.010, p<0.00001). The fractal method was more accurate and reproducible (ICC, 0.97 and 0.96 for intra and inter-observer readings) than two other CMR criteria for LVNC (Petersen and Jacquier). FD is higher in LVNC patients compared to healthy volunteers and is higher in healthy blacks than in whites. Fractal analysis provides a quantitative measure of trabeculation and has high reproducibility and accuracy for LVNC diagnosis when compared to current CMR criteria.
157 citations
TL;DR: A new convexity measure for planar regions bounded by polygons is defined and evaluated and it is found that it is more sensitive to measured boundary defects than the so called "area-based" conveXity measures.
Abstract: Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1], 2) the estimated convexity is I if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.
156 citations
Cites background or methods from "Image Processing"
...concerned with the measurement of the convexity of polygons, which can be considered as one of the basic descriptors of shape [20] (alongside others such as compactness, circularity, and rectangularity) and has received some attention over the years [3, 21]....
[...]
...As a small scale classification task we have taken the drawings of the Micrasterias taxon from West (1)The additional shape measures used were: circularity, ellipticity, rectangularity, triangularity [19] aspect ratio, compactness, convexity, eccentricity, the first four rotation, translation, and scale moment invariants, four rotation, translation, and scale moment invariants [20], the first three affine moment invariants [8]....
[...]
...In practice, the convexity measure given by Definition 2 is the one that is mostly used, and appears in textbooks [20]....
[...]
TL;DR: The experimental results show that the proposed operator for color image compression can have output picture quality acceptable to human eyes, and the proposed edge operator can detect the color edge at the subpixel level.
Abstract: This paper presents a new moment-preserving thresholding technique, called the binary quaternion-moment-preserving (BQMP) thresholding, for color image data. Based on representing color data by the quaternions, the statistical parameters of color data can be expressed through the definition of quaternion moments. Analytical formulas of the BQMP thresholding can thus be determined by using the algebra of the quaternions. The computation time for the BQMP thresholding is of order of the data size. By using the BQMP thresholding, quaternion-moment-based operators are designed for the application of color image processing, such as color image compression, multiclass clustering of color data, and subpixel color edge detection. The experimental results show that the proposed operator for color image compression can have output picture quality acceptable to human eyes. In addition, the proposed edge operator can detect the color edge at the subpixel level. Therefore, the proposed BQMP thresholding can be used as a tool for color image processing.
155 citations
Cites background from "Image Processing"
...8 shows the simulation results where the performance measure is Pratt’s figure of merit (FOM) [21]: with are the number of ideal edge points and the number of detected points, respectively. is a calibration constant with value 1/14 in our working examples, and is the deviation from the ideal edge for theth detected edge point....
[...]
...8 shows the simulation results where the performance measure is Pratt’s figure of merit (FOM) [21]: with are the number of ideal edge points and the number of detected points, respectively....
[...]
TL;DR: Findings reveal how different organisms rearrange a regulatory system to result in opposite outcomes using similar phosphorylation-dependent endocytosis mechanisms.
Abstract: Signal transduction typically begins by ligand-dependent activation of a concomitant partner that is otherwise in its resting state. However, in cases where signal activation is constitutive by default, the mechanism of regulation is unknown. The Arabidopsis thaliana heterotrimeric Gα protein self-activates without accessory proteins, and is kept in its resting state by the negative regulator, AtRGS1 (regulator of G-protein signalling 1), which is the prototype of a seven-transmembrane receptor fused with an RGS domain. Endocytosis of AtRGS1 by ligand-dependent endocytosis physically uncouples the GTPase-accelerating activity of AtRGS1 from the Gα protein, permitting sustained activation. Phosphorylation of AtRGS1 by AtWNK8 kinase causes AtRGS1 endocytosis, required for both G-protein-mediated sugar signalling and cell proliferation. In animals, receptor endocytosis results in signal desensitization, whereas in plants, endocytosis results in signal activation. These findings reveal how different organisms rearrange a regulatory system to result in opposite outcomes using similar phosphorylation-dependent endocytosis mechanisms.
154 citations
TL;DR: In this article, an airborne laser scanner was used to detect changes of buildings by acquiring a digital surface model (DSM) data of urban areas, and simple comparison between DSM data sets acquired at different occasions successfully detected building changes without omission errors.
Abstract: This study employed an airborne laser scanner to detect changes of buildings by acquiring a digital surface model (DSM) data of urban areas. Simple comparison between DSM data sets acquired at different occasions successfully detected building changes without omission errors. A CCD array image simultaneously acquired with the DSM data was also automatically orthorectified with the DSM data and indicated to help revise the building database efficiently.
152 citations
References
More filters
01 Nov 1973
TL;DR: These results indicate that the easily computable textural features based on gray-tone spatial dependancies probably have a general applicability for a wide variety of image-classification applications.
Abstract: Texture is one of the important characteristics used in identifying objects or regions of interest in an image, whether the image be a photomicrograph, an aerial photograph, or a satellite image. This paper describes some easily computable textural features based on gray-tone spatial dependancies, and illustrates their application in category-identification tasks of three different kinds of image data: photomicrographs of five kinds of sandstones, 1:20 000 panchromatic aerial photographs of eight land-use categories, and Earth Resources Technology Satellite (ERTS) multispecial imagery containing seven land-use categories. We use two kinds of decision rules: one for which the decision regions are convex polyhedra (a piecewise linear decision rule), and one for which the decision regions are rectangular parallelpipeds (a min-max decision rule). In each experiment the data set was divided into two parts, a training set and a test set. Test set identification accuracy is 89 percent for the photomicrographs, 82 percent for the aerial photographic imagery, and 83 percent for the satellite imagery. These results indicate that the easily computable textural features probably have a general applicability for a wide variety of image-classification applications.
20,442 citations
Book•
03 Oct 1988TL;DR: This chapter discusses two Dimensional Systems and Mathematical Preliminaries and their applications in Image Analysis and Computer Vision, as well as image reconstruction from Projections and image enhancement.
Abstract: Introduction. 1. Two Dimensional Systems and Mathematical Preliminaries. 2. Image Perception. 3. Image Sampling and Quantization. 4. Image Transforms. 5. Image Representation by Stochastic Models. 6. Image Enhancement. 7. Image Filtering and Restoration. 8. Image Analysis and Computer Vision. 9. Image Reconstruction From Projections. 10. Image Data Compression.
8,504 citations
TL;DR: The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods.
Abstract: Embedded zerotree wavelet (EZW) coding, introduced by Shapiro (see IEEE Trans. Signal Processing, vol.41, no.12, p.3445, 1993), is a very effective and computationally simple technique for image compression. We offer an alternative explanation of the principles of its operation, so that the reasons for its excellent performance can be better understood. These principles are partial ordering by magnitude with a set partitioning sorting algorithm, ordered bit plane transmission, and exploitation of self-similarity across different scales of an image wavelet transform. Moreover, we present a new and different implementation based on set partitioning in hierarchical trees (SPIHT), which provides even better performance than our previously reported extension of EZW that surpassed the performance of the original EZW. The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods. In addition, the new coding and decoding procedures are extremely fast, and they can be made even faster, with only small loss in performance, by omitting entropy coding of the bit stream by the arithmetic code.
5,890 citations
TL;DR: Eight constructs decellularized hearts by coronary perfusion with detergents, preserved the underlying extracellular matrix, and produced an acellular, perfusable vascular architecture, competent a cellular valves and intact chamber geometry that could generate pump function in a modified working heart preparation.
Abstract: About 3,000 individuals in the United States are awaiting a donor heart; worldwide, 22 million individuals are living with heart failure. A bioartificial heart is a theoretical alternative to transplantation or mechanical left ventricular support. Generating a bioartificial heart requires engineering of cardiac architecture, appropriate cellular constituents and pump function. We decellularized hearts by coronary perfusion with detergents, preserved the underlying extracellular matrix, and produced an acellular, perfusable vascular architecture, competent acellular valves and intact chamber geometry. To mimic cardiac cell composition, we reseeded these constructs with cardiac or endothelial cells. To establish function, we maintained eight constructs for up to 28 d by coronary perfusion in a bioreactor that simulated cardiac physiology. By day 4, we observed macroscopic contractions. By day 8, under physiological load and electrical stimulation, constructs could generate pump function (equivalent to about 2% of adult or 25% of 16-week fetal heart function) in a modified working heart preparation.
2,454 citations
01 Sep 1997
TL;DR: This paper examines automated iris recognition as a biometrically based technology for personal identification and verification from the observation that the human iris provides a particularly interesting structure on which to base a technology for noninvasive biometric assessment.
Abstract: This paper examines automated iris recognition as a biometrically based technology for personal identification and verification. The motivation for this endeavor stems from the observation that the human iris provides a particularly interesting structure on which to base a technology for noninvasive biometric assessment. In particular the biomedical literature suggests that irises are as distinct as fingerprints or patterns of retinal blood vessels. Further, since the iris is an overt body, its appearance is amenable to remote examination with the aid of a machine vision system. The body of this paper details issues in the design and operation of such systems. For the sake of illustration, extant systems are described in some amount of detail.
2,046 citations