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
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
Cites methods from "Image Processing"
...system makes us of an isotropic bandpass decomposition derived from application of Laplacian of Gaussian filters [25], [29] to the image data....
[...]
...In practice, the filtered image is realized as a Laplacian pyramid [8], [29]....
[...]
TL;DR: This paper identifies some promising techniques for image retrieval according to standard principles and examines implementation procedures for each technique and discusses its advantages and disadvantages.
1,910 citations
Cites background or methods from "Image Processing"
...Structural description of chromosome shape (reprinted from [14])....
[...]
...Common invariants include (i) geometric invariants such as cross-ratio, length ratio, distance ratio, angle, area [69], triangle [70], invariants from coplanar points [14]; (ii) algebraic invariants such as determinant, eigenvalues [71], trace [14]; (iii) di<erential invariants such as curvature, torsion and Gaussian curvature....
[...]
...Designers of shape invariants argue that although most of other shape representation techniques are invariant under similarity transformations (rotation, translation and scaling), they depend on viewpoint [14]....
[...]
...The extracting of the convex hull can use both boundary tracing method [14] and morphological methods [11,15]....
[...]
...Assuming the shape boundary has been represented as a shape signature z(i), the rth moment mr and central moment r can be estimated as [14]...
[...]
References
More filters
TL;DR: This study shows that the proposed technique was efficient in reducing the amount of exposed gum during smile in all patients in this series.
Abstract: Background:Treatment of excessive gingival display usually involves procedures such as Le Fort impaction or maxillary gingivectomies. The authors propose an alternative technique that reduces the muscular function of the elevator of the upper lip muscle and repositioning of the upper lip.Methods:Fou
67 citations
TL;DR: In this article, an interaction network is used to identify high-transverse-momentum Higgs bosons decaying to bottom quark-antiquark pairs and distinguish them from ordinary jets that reflect the configurations of quarks and gluons at short distances.
Abstract: We develop an algorithm based on an interaction network to identify high-transverse-momentum Higgs bosons decaying to bottom quark-antiquark pairs and distinguish them from ordinary jets that reflect the configurations of quarks and gluons at short distances. The algorithm’s inputs are features of the reconstructed charged particles in a jet and the secondary vertices associated with them. Describing the jet shower as a combination of particle-to-particle and particle-to-vertex interactions, the model is trained to learn a jet representation on which the classification problem is optimized. The algorithm is trained on simulated samples of realistic LHC collisions, released by the CMS Collaboration on the CERN Open Data Portal. The interaction network achieves a drastic improvement in the identification performance with respect to state-of-the-art algorithms.
67 citations
TL;DR: A new proof of the rate of convergence of wavelet shrinkage that allows us to estimate rather sharply the best shrinkage parameter needed to recover an image from noise-corrupted data and tomographic reconstruction computations that support the hypothesis that near-optimal shrinkage parameters can be derived.
Abstract: Because the Radon transform is a smoothing transform, any noise in the Radon data becomes magnified when the inverse Radon transform is applied. Among the methods used to deal with this problem is the wavelet-vaguelette decomposition (WVD) coupled with wavelet shrinkage, as introduced by Donoho (1995). We extend several results of Donoho and others here. First, we introduce a new sufficient condition on wavelets to generate a WVD. For a general homogeneous operator, whose class includes the Radon transform, we show that a variant of Donoho's method for solving inverse problems can be derived as the exact minimizer of a variational problem that uses a Besov norm as the smoothing functional. We give a new proof of the rate of convergence of wavelet shrinkage that allows us to estimate rather sharply the best shrinkage parameter needed to recover an image from noise-corrupted data. We conduct tomographic reconstruction computations that support the hypothesis that near-optimal shrinkage parameters can be derived if one can estimate only two Besov-space parameters about an image f. Both theoretical and experimental results indicate that our choice of shrinkage parameters yields uniformly better results than Kolaczyk's (1996) variant of Donoho's method and the classical filtered backprojection method.
67 citations
TL;DR: Experimental results and security analysis show that the improved encryption algorithm can not only resist chosen plain image attacks but also maintain the merits of the original algorithm.
67 citations
TL;DR: The status of computer vision education today is reviewed to see if there is a strong demand for educating students to become knowledgeable in computer imaging and vision.
Abstract: Computer vision is becoming a mainstream subject of study in computer science and engineering. With the rapid explosion of multimedia and the extensive use of video and image-based communications over the World Wide Web, there is a strong demand for educating students to become knowledgeable in computer imaging and vision. The purpose of this paper is to review the status of computer vision education today.
67 citations