Now showing items 1-2 of 2
| Abstract: | Grey Level Co-occurrence Matrices (GLCM) are one of the earliest techniques used for image texture analysis. In this paper we defined a new feature called trace extracted from the GLCM and its implications in texture analysis are discussed in the context of Content Based Image Retrieval (CBIR). The theoretical extension of GLCM to n-dimensional gray scale images are also discussed. The results indicate that trace features outperform Haralick features when applied to CBIR. |
| Description: | International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.2, April 2012 |
| URI: | http://dyuthi.cusat.ac.in/purl/4199 |
| Files | Size |
|---|---|
| Grey Level Co-O ... And Some New Features.pdf | (379.3Kb) |
| Abstract: | The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H, by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of H. Afterward, we propose several new openings, closings, granulometries and alternate sequential filters acting (i) on the subsets of the vertex and hyperedge set of H and (ii) on the subhypergraphs of a hypergraph |
| Description: | arXiv preprint arXiv:1402.4258 |
| URI: | http://dyuthi.cusat.ac.in/purl/4225 |
| Files | Size |
|---|---|
| Morphological filtering on hypergraphs.pdf | (203.1Kb) |
Now showing items 1-2 of 2
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.