DMCA
An Image Data Model (2000)
Cached
Download Links
- [www.kettering.edu]
- [www.kettering.edu]
- [paws.kettering.edu]
- [paws.kettering.edu]
- DBLP
Other Repositories/Bibliography
Venue: | in Advances in Visual Information Systems, R. Laurini (edt.), Lecture Notes in Computer Science |
Citations: | 12 - 7 self |
Citations
1790 |
Texture Features for Image Classification
- Haralick, Shanmugam, et al.
- 1973
(Show Context)
Citation Context ...nterrelationships, or arrangement of image pixels, are seen as changes in the intensity patterns, or gray tones”. The most used set of texture features is Haralick’s gray level co-occurrence featu=-=res [11]. Thi-=-s is based on the calculation of the co-occurrence matrix P d ,α(g, g’), which counts the number of pixel pairs in an image that have values g and g’ and are separated by a pixel distance d in a ... |
670 |
Computational geometry in C
- O’Rourke
- 1998
(Show Context)
Citation Context ...e-based spatial arrangements of feature points approach [1]. For the proposed anglogram representation, the global description of the feature maps is obtained by constructing a Delaunay triangulation =-=[22]-=- of all relevant feature points. This feature point histogram is obtained by discretizing the angles produced by this triangulation and counting the number of times each discrete angle occurs in the i... |
484 |
Texture features corresponding to visual perception.
- Tamura, Mori, et al.
- 1978
(Show Context)
Citation Context ...nce, sum entropy, entropy, difference variance, difference entropy, information measures of correlation, maximum correlation coefficient. Other often-used texture measurements are (1) Tamura features =-=[29]. -=-He suggested six basic textural features; namely, coarseness, contrast, directionality, line-likeness, regularity, and roughness; (2) Unser’s sum and difference histogram [33]. He proposed 32 featur... |
442 | Image indexing using color correlograms.
- Huang, Kumar, et al.
- 1997
(Show Context)
Citation Context ... is described in [23] by partitioning histogram bins based on the spatial coherence of pixels. A pixel is coherent if it is a part of some sizable similar-colored region, and incoherent otherwise. In =-=[12]-=- a statistical method is proposed to index an image by color correlograms, which is actually a tablescontaining color pairs, where the k-th entry for <i, j> specifies the probability of locating a pix... |
252 |
Iconic indexing by 2D strings.
- Chang, Shi, et al.
- 1987
(Show Context)
Citation Context ... world directions East, South, West, North; (3) as a metric set of relations based on the distance between the image-objects, containing the relations close, far, very close, very far; (4) 2D-strings =-=[3]-=-. Each image is considered as a matrix of symbols, where each symbol corresponds to an image object. The corresponding 2D-string is obtained by symbolic projection of these symbols along the horizonta... |
210 | Texture classification by wavelet packet signatures
- Laine, Fan
- 1993
(Show Context)
Citation Context ...basic on run-length matrixes; (4) Chen’s geometric features form binary image sequences [4]. He proposed 16 coefficients, based on threshold images; (5) Laine’s texture energy from Daubechies wave=-=let [15]. -=-He suggested 21 features, based on Daubechies wavelet transformed image; (6) Gabor’s filter. Wagner [34] summarized 18 different methods including 318 different features and gave the exact formulas ... |
153 | Efficient and Robust Retrieval by Shape Content through Curvature Scale Space,
- Mokhtarian, Abasi, et al.
- 1996
(Show Context)
Citation Context ... transformation-based methods ranging from functional transformations such as Fourier descriptors [18] to structural transformations such as chain codes [17] and curvature scale space feature vectors =-=[20]-=-. An attempt to compare the various shape representation schemes is made in [18]. Those features, which characterize the shape of any image object, can be classified into the following two categories.... |
127 | Design and evaluation of algorithms for image retrieval by spatial similarity"
- Gudivada, Raghavan
- 1995
(Show Context)
Citation Context ...some 2D-string variants have been proposed, such as the extended 2D-string [14], 2D C-string [16], and 2D C + -string [13]; (5) geometry-based θRstring approach [8]; (6) the spatial orientation graph=-= [7]-=-, (7) the quadtree-based spatial arrangements of feature points approach [1]. For the proposed anglogram representation, the global description of the feature maps is obtained by constructing a Delaun... |
117 | Histogram Refinement for Content-Based Image Retrieval,”
- Pass, Zabih
- 1996
(Show Context)
Citation Context ... system Color-WISE is described in [24], and it partitions an image into 8*8 blocks with each block indexed by its dominant hue and saturation values. A histogram refinement technique is described in =-=[23]-=- by partitioning histogram bins based on the spatial coherence of pixels. A pixel is coherent if it is a part of some sizable similar-colored region, and incoherent otherwise. In [12] a statistical me... |
116 |
Texture analysis using gray level run length,
- Galloway
- 1975
(Show Context)
Citation Context ...ess; (2) Unser’s sum and difference histogram [33]. He proposed 32 features based on calculations over different sums and histograms of the pixel gray levels; (3) Galloway’s run-length based featu=-=res [5]. He-=- calculated 20 coefficients on the basic on run-length matrixes; (4) Chen’s geometric features form binary image sequences [4]. He proposed 16 coefficients, based on threshold images; (5) Laine’s ... |
105 |
Textural features corresponding to textural properties.
- Amadasun, King
- 1989
(Show Context)
Citation Context ...e note that the size of our image indices depends only on the quantization of color components, and is independent of the image-partitioning scheme. Texture attributes. According to Amadasun and King =-=[2]: -=-“Literally, texture refers to the arrangement of the basic constituents of a material. In the digital image, texture is depicted by the spatial interrelationships between, and/or spatial arrangement... |
85 | Shape measures for content based image retrieval: a comparison,”
- Mehtre, Kankanhalli, et al.
- 1997
(Show Context)
Citation Context ...esented in two distinct categories: measurement-based methods ranging from simple, primitive measures such as area andscircularity [21] to the more sophisticated measures of various moment invariants =-=[19]-=-; and transformation-based methods ranging from functional transformations such as Fourier descriptors [18] to structural transformations such as chain codes [17] and curvature scale space feature vec... |
75 |
Sum and difference histogram for texture classification,
- Unser
- 1986
(Show Context)
Citation Context ...re (1) Tamura features [29]. He suggested six basic textural features; namely, coarseness, contrast, directionality, line-likeness, regularity, and roughness; (2) Unser’s sum and difference histogra=-=m [33]. -=-He proposed 32 features based on calculations over different sums and histograms of the pixel gray levels; (3) Galloway’s run-length based features [5]. He calculated 20 coefficients on the basic on... |
67 | Semantic Queries with Pictures: The VIMSYS Model
- Gupta, Weymouth, et al.
- 1991
(Show Context)
Citation Context ...d based on the views of image data that the specific model supports. Some valuable proposals for image data models are: VIMSYS image data model, model, where images are presented as four plane layers =-=[10]-=-; EMIR 2 - an extended model for image representation and retrieval [18]; and AIR - an adaptive image retrieval model [9]. The AIR (Adaptive Image Retrieval) model claims that it is the first comprehe... |
52 |
the QBIC Project: Querying Images by Content Using
- Niblack, Barber, et al.
- 1993
(Show Context)
Citation Context ... These values are normalized. Shape attributes techniques can be represented in two distinct categories: measurement-based methods ranging from simple, primitive measures such as area andscircularity =-=[21]-=- to the more sophisticated measures of various moment invariants [19]; and transformation-based methods ranging from functional transformations such as Fourier descriptors [18] to structural transform... |
48 |
2D C-string: A new spatial knowledge representation for image database systems.
- Lee, Hsu
- 1990
(Show Context)
Citation Context ...erving the relative positions of the image objects. In order to improve the performance of this technique, some 2D-string variants have been proposed, such as the extended 2D-string [14], 2D C-string =-=[16],-=- and 2D C + -string [13]; (5) geometry-based θRstring approach [8]; (6) the spatial orientation graph [7], (7) the quadtree-based spatial arrangements of feature points approach [1]. For the proposed... |
40 |
Statistical geometrical features for texture classification,
- Chen, Nixon, et al.
- 1995
(Show Context)
Citation Context ...ms of the pixel gray levels; (3) Galloway’s run-length based features [5]. He calculated 20 coefficients on the basic on run-length matrixes; (4) Chen’s geometric features form binary image sequen=-=ces [4]. He-=- proposed 16 coefficients, based on threshold images; (5) Laine’s texture energy from Daubechies wavelet [15]. He suggested 21 features, based on Daubechies wavelet transformed image; (6) Gabor’s ... |
28 |
EMIR2. An Extended Model for Image Representation and Retrieval
- Mechkour
- 1995
(Show Context)
Citation Context ...as area andscircularity [21] to the more sophisticated measures of various moment invariants [19]; and transformation-based methods ranging from functional transformations such as Fourier descriptors =-=[18]-=- to structural transformations such as chain codes [17] and curvature scale space feature vectors [20]. An attempt to compare the various shape representation schemes is made in [18]. Those features, ... |
22 |
Color-WISE: A system for image similarity retrieval using color.
- IK, Coman, et al.
- 1998
(Show Context)
Citation Context ...on of the image, an image could be indexed by the color of the whole image and a set of inter-hierarchical distances, which encode the spatial color information. The system Color-WISE is described in =-=[24]-=-, and it partitions an image into 8*8 blocks with each block indexed by its dominant hue and saturation values. A histogram refinement technique is described in [23] by partitioning histogram bins bas... |
21 |
Using 2D C ‡ -strings as spatial knowledge representation for image database systems
- Huang, Jean
- 1994
(Show Context)
Citation Context ...ions of the image objects. In order to improve the performance of this technique, some 2D-string variants have been proposed, such as the extended 2D-string [14], 2D C-string [16], and 2D C + -string =-=[13];-=- (5) geometry-based θRstring approach [8]; (6) the spatial orientation graph [7], (7) the quadtree-based spatial arrangements of feature points approach [1]. For the proposed anglogram representation... |
19 |
Using Metadata for the Intelligent Browsing of Structured Media Objects
- Grosky, Fotouhi, et al.
- 1998
(Show Context)
Citation Context ...ix contains the image data. 2.2 Logical Image Representation An image object is a meaningful portion (consisting of a union of one or more disjoint regions) of an image, which we have called a semcon =-=[6]-=-. The image description includes meta, semantic, color, texture, shape, and spatial attributes. In the proposed image representation we use the concept of object-based point feature maps [31]. In 2-D ... |
18 |
OR-String : A geometrybased representation for efficient and effective retrieval of images by spatial similarity
- Gudivada
(Show Context)
Citation Context ...ove the performance of this technique, some 2D-string variants have been proposed, such as the extended 2D-string [14], 2D C-string [16], and 2D C + -string [13]; (5) geometry-based θRstring approach=-= [8]-=-; (6) the spatial orientation graph [7], (7) the quadtree-based spatial arrangements of feature points approach [1]. For the proposed anglogram representation, the global description of the feature ma... |
17 |
GRIM-DBMS: a graphical image database management system
- E, Stanchev
- 1989
(Show Context)
Citation Context ... be viewed as a multiple level abstraction of the physical image view. The model is based on the analysis of different image application domains such as: medical images, house furnishing design plans =-=[27]-=-, electronic schema catalogues, and geographical information systems [28]. The proposed model could be used as a frame for designing and building a wide range of image database systems and could be pr... |
16 |
A Unified Approach to Data Modeling and Retrieval for a Class of Image Database Applications
- Gudivada, Raghavan, et al.
- 1996
(Show Context)
Citation Context ...MSYS image data model, model, where images are presented as four plane layers [10]; EMIR 2 - an extended model for image representation and retrieval [18]; and AIR - an adaptive image retrieval model =-=[9]-=-. The AIR (Adaptive Image Retrieval) model claims that it is the first comprehensive and generic data model for a class of image application areas that coherently integrates logical image representati... |
16 |
An algebra for symbolic image manipulation and transformation. Visual Database Systems.
- Jungert, Chang
- 1989
(Show Context)
Citation Context ...ertical axes, preserving the relative positions of the image objects. In order to improve the performance of this technique, some 2D-string variants have been proposed, such as the extended 2D-string =-=[14],-=- 2D C-string [16], and 2D C + -string [13]; (5) geometry-based θRstring approach [8]; (6) the spatial orientation graph [7], (7) the quadtree-based spatial arrangements of feature points approach [1]... |
13 |
An approach to image indexing of documents
- Stanchev, Smeulders, et al.
- 1992
(Show Context)
Citation Context ...e model is based on the analysis of different image application domains such as: medical images, house furnishing design plans [27], electronic schema catalogues, and geographical information systems =-=[28]-=-. The proposed model could be used as a frame for designing and building a wide range of image database systems and could be proposed as a standard to the MPEG committee. It can be treated as an exten... |
12 | Spatial Similarity-based Retrievals and Image Indexing By Hierarchical Decomposition
- Ahmad, Grosky
- 1997
(Show Context)
Citation Context ...s around the boundary of the corresponding image region are examples of such features. For the proposed representation, an object shape is represented by the spatial distribution of its corner points =-=[1]-=-, again using our anglogram data structure [30]. Spatial attributes could be presented in different ways: (1) as a topological set of relations between two image-objects, containing the relations in, ... |
9 |
An approach to image retrieval based on shape.
- Lu
- 1997
(Show Context)
Citation Context ...measures of various moment invariants [19]; and transformation-based methods ranging from functional transformations such as Fourier descriptors [18] to structural transformations such as chain codes =-=[17]-=- and curvature scale space feature vectors [20]. An attempt to compare the various shape representation schemes is made in [18]. Those features, which characterize the shape of any image object, can b... |
8 |
Grosky “Spatial Color Indexing Using Rotation, Translation
- Tao, I
- 2001
(Show Context)
Citation Context ...the representation captures the spatial distribution of the dominant hue and saturation values for each block. This spatial distribution is captured by our previously devised anglogram data structure =-=[32]-=-. In more detail, the hue component of each pixel is quantized to 24 values, the saturation component of each pixel is quantized to 12 values, and the feature point anglogram is computed with a bin si... |
6 |
Image Database Model, Visual Information and Information Systems
- Stanchev, General
- 1999
(Show Context)
Citation Context ...rame for designing and building a wide range of image database systems and could be proposed as a standard to the MPEG committee. It can be treated as an extension of the general image database model =-=[25, 26]-=-. A particular representation based on this model is also discussed.s2 Image Data Before we analyze the various existing approaches to image data modeling and the proposed tools, we introduce some of ... |
2 |
Image Retrieval Model
- Stanchev, ‘General
- 1998
(Show Context)
Citation Context ...rame for designing and building a wide range of image database systems and could be proposed as a standard to the MPEG committee. It can be treated as an extension of the general image database model =-=[25, 26]-=-. A particular representation based on this model is also discussed.s2 Image Data Before we analyze the various existing approaches to image data modeling and the proposed tools, we introduce some of ... |
2 |
Image Indexing and Retrieval Using Object-based Point Feature Maps
- Tao, Grosky
- 2000
(Show Context)
Citation Context ...ge region are examples of such features. For the proposed representation, an object shape is represented by the spatial distribution of its corner points [1], again using our anglogram data structure =-=[30]-=-. Spatial attributes could be presented in different ways: (1) as a topological set of relations between two image-objects, containing the relations in, disjoint, touch, and cross; (2) as a vector set... |
1 |
Shape Anglograms for Image Object Representation: A Computational Geometry. Submit
- Tao, Grosky
(Show Context)
Citation Context ... a semcon [6]. The image description includes meta, semantic, color, texture, shape, and spatial attributes. In the proposed image representation we use the concept of object-based point feature maps =-=[31]-=-. In 2-D space, many of the image features can be represented as sets of points. These points can be tagged with labels to capture any necessary semantics. Each of the individual points representing s... |