Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
interimage:attributes_description [2010/06/23 17:14] hermann |
interimage:attributes_description [2012/07/17 20:47] (current) rsilva |
||
|---|---|---|---|
| Line 30: | Line 30: | ||
| * **yGeoCenter** - y geo-coordinate of the object centroid. | * **yGeoCenter** - y geo-coordinate of the object centroid. | ||
| * **membership** or **p** - confidence in the object with regard to its classification. | * **membership** or **p** - confidence in the object with regard to its classification. | ||
| + | |||
| + | |||
| + | |||
| ===== Shape Attributes ===== | ===== Shape Attributes ===== | ||
| - | * **area**: Returns the area of the given polygon, in number of pixels. | + | * **area** - Returns the real area of the given polygon. |
| - | * **bBoxArea**: Returns the bounding box area of the given polygon, in number of pixels. | + | * **bBoxArea** - Returns the real bounding box area of the given polygon. |
| - | * **perimeter**: Returns the perimeter of the polygon, considering the amount of pixels in its border. | + | * **perimeter** - Returns the real perimeter of the given polygon. |
| - | * **fractalDimension**: Returns the fractal dimension of a given polygon, which is calculated by the following equation: | + | * **fractalDimension** - Returns the fractal dimension of a given polygon, which is calculated by the following equation: |
| {{ :interimage:fractal.png }} | {{ :interimage:fractal.png }} | ||
| Where P is the polygon perimeter and A is the area. | Where P is the polygon perimeter and A is the area. | ||
| - | * **perimeterAreaRatio**: Calculates the ratio between the perimeter and the area of a polygon. | + | * **perimeterAreaRatio** - Calculates the ratio between the perimeter and the area of a polygon. |
| - | * **compacity**: Returns the compacity of a given polygon, which is calculated by the following equation: | + | * **compacity** - Returns the compacity of a given polygon, which is calculated by the following equation: |
| {{ :interimage:compacity.png }} | {{ :interimage:compacity.png }} | ||
| Where P is the polygon perimeter and A is the area. | Where P is the polygon perimeter and A is the area. | ||
| - | * **density**: The density of a polygon is calculated by the ratio between its area and its Radius (the maximum distance between the polygon centroid and all its vertices). | + | * **density** - The density of a polygon is calculated by the ratio between its area and its Radius (the maximum distance between the polygon centroid and all its vertices). |
| - | * **length**: The Length of a polygon is the height of its bounding box. | + | * **length** - The Length of a polygon is the height of its bounding box. |
| - | * **width**: The Width of a polygon is calculated by the width of its bounding box. | + | * **width** - The Width of a polygon is calculated by the width of its bounding box. |
| - | * **contiguity**: Contiguity index assesses the spatial connectedness of pixels within a polygon to provide an index of boundary configuration. | + | * **contiguity** - Contiguity index assesses the spatial connectedness of pixels within a polygon to provide an index of boundary configuration. |
| - | * **gyrationRadius**: This attribute equals the mean distance between each pixel in the polygon and the polygon centroid. | + | * **gyrationRadius** - This attribute equals the mean distance between each pixel in the polygon and the polygon centroid. |
| - | * **angle**: The main angle of a polygon. It is obtained by calculating the best elliptic fit, and the angle of the biggest radius of the ellipse corresponds to the polygon angle. | + | * **angle** - The main angle of a polygon. It is obtained by calculating the best elliptic fit, and the angle of the biggest radius of the ellipse corresponds to the polygon angle. |
| - | * **ellipticFit**: Finds the best ellipse which fits outside the polygon and returns the ratio between the polygon area and the ellipse area. | + | * **ellipticFit** - Finds the best ellipse which fits outside the polygon and returns the ratio between the polygon area and the ellipse area. |
| - | * **squareness**: This attribute fits the minimum rectangle outside the polygon and calculates the ratio between the polygon area and the area of this rectangle. The t closest to 1 is this attribute, the most similar to a rectangle the polygon is. | + | * **squareness** - This attribute fits the minimum rectangle outside the polygon and calculates the ratio between the polygon area and the area of this rectangle. The t closest to 1 is this attribute, the most similar to a rectangle the polygon is. |
| - | * **circleness**: It is calculated by the following equation: | + | * **circleness** - It is calculated by the following equation: |
| {{ :interimage:circle.png }} | {{ :interimage:circle.png }} | ||
| Where A is the polygon area and R is the maximum distance between the polygon centroid and all its vertices. | Where A is the polygon area and R is the maximum distance between the polygon centroid and all its vertices. | ||
| - | * **shapeIndex**: Returns the shape index of a given polygon, which is calculated by the following equation: | + | * **shapeIndex** - Returns the shape index of a given polygon, which is calculated by the following equation: |
| {{ :interimage:shapeindex.png }} | {{ :interimage:shapeindex.png }} | ||
| Where P is the polygon perimeter and A is the area. | Where P is the polygon perimeter and A is the area. | ||
| - | |||
| - | |||
| Line 67: | Line 68: | ||
| ===== Spectral Statistical Attributes ===== | ===== Spectral Statistical Attributes ===== | ||
| - | * **Amplitude** - represents the difference between the maximum and minimum pixel values of a region for the given image band/channel. | + | * **Amplitude** - represents the difference between the maximum and minimum pixel values of an object for the given image layer **L**. |
| - | * **Brightness** - | + | * **Brightness** - represents the brightness of an image object. |
| * **Correlation** - Correlation is a similarity measure between two data sets under an absolute scale between [-1,1]. It is calculated as shown by the next formula: | * **Correlation** - Correlation is a similarity measure between two data sets under an absolute scale between [-1,1]. It is calculated as shown by the next formula: | ||
| Line 93: | Line 94: | ||
| - | * **Ratio** - | + | * **Ratio** - represents the amount that layer **L** contributes to the total brightness of an image object. |
| * **StdDeviation** - The standard deviation represents the numerical data dispersion degree surrounding the mean. It is defined by: | * **StdDeviation** - The standard deviation represents the numerical data dispersion degree surrounding the mean. It is defined by: | ||
| Line 100: | Line 101: | ||
| * **SumPixelsValues** - Represents the sum of all element values inside an area for one given image band/channel. | * **SumPixelsValues** - Represents the sum of all element values inside an area for one given image band/channel. | ||
| - | a * **Variance** - Like the standard deviation, the variance also represents the numerical data dispersion degree surrounding the mean but in the original data value scale. It is defined by: | + | * **Variance** - Like the standard deviation, the variance also represents the numerical data dispersion degree surrounding the mean but in the original data value scale. It is defined by: |
| {{ interimage:att_variance.gif }} | {{ interimage:att_variance.gif }} | ||
| Line 114: | Line 115: | ||
| ===== Texture Attributes ===== | ===== Texture Attributes ===== | ||
| - | The texture attributes are based on the co-occurence gray scale matrix (GLCM) described by the following references: | + | The texture attributes are based on the co-occurrence gray scale matrix (GLCM) described in the following references: |
| - | * Textural Features for Image Classification - Robert M. Haralick, K. Shanmugam, Its'hak Dinstein. Systems, Man and Cybernetics, IEEE Transactions on In Systems, Man and Cybernetics, IEEE Transactions on, Vol. 3, No. 6. (1973), pp. 610-621. | + | * Textural Features for Image Classification - Robert M. Haralick, K. Shanmugam, Its'hak Dinstein. Systems, Man and Cybernetics, IEEE Transactions on Systems, Man and Cybernetics, IEEE Transactions on, Vol. 3, No. 6. (1973), pp. 610-621. |
| * Computer and Robot Vision - Robert M. Haralick - Addison-Wesley Publishing Company. | * Computer and Robot Vision - Robert M. Haralick - Addison-Wesley Publishing Company. | ||
| \\ | \\ | ||
| - | * **Angular2ndMomentGLCM (a.k.a. EnergyGLCM)** - Returns the square sum of image points pairs occurrences under one pre-defined direction. The returned values range is between [0,1]. For those images without variations the value will be 1. The calculus is showed on the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **Angular2ndMomentGLCM (a.k.a. EnergyGLCM)** - Returns the square sum of image point pairs occurrences under one pre-defined direction. The returned value range is between [0,1]. For those images without variations the value will be 1. The calculus is shown on the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-occurrence over the image. |
| {{ interimage:att_angular2ndmomentglcm.gif }} | {{ interimage:att_angular2ndmomentglcm.gif }} | ||
| - | * **ContrastGLCM** - Returns a contrast intensity measure between one image point and its neighborhood. For those images without variations the contrast value will be zero. The calculus is showed on the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **ContrastGLCM** - Returns a contrast intensity measure between one image point and its neighborhood. For those images without variations the contrast value will be zero. The calculus is shown on the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_contrastglcm.gif }} | {{ interimage:att_contrastglcm.gif }} | ||
| - | * **DissimilarityGLCM** - Returns one intensity measure quite similar to contrast between one point and its neighborhood. But the difference it that this measure has linear increments. The calculus is showed on the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **DissimilarityGLCM** - Returns one intensity measure quite similar to contrast between one point and its neighborhood. But the difference it that this measure has linear increments. The calculus is shown on the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_dissimilarityglcm.gif }} | {{ interimage:att_dissimilarityglcm.gif }} | ||
| - | * **EntropyGLCM** - Like the simple statistical entropy the GLCM entropy also is a statistical measure of image data randomness. The difference is that it uses frequencies of gray levels co-ocurrences instead of using point values frequencies. The co-ocurrences matrix is used and the calculus is showed by the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **EntropyGLCM** - Like the simple statistical entropy the GLCM entropy also is a statistical measure of image data randomness. The difference is that it uses frequencies of gray level co-ocurrences instead of using point value frequencies. The co-ocurrence matrix is used and the calculus is shown by the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_entropyglcm.gif }} | {{ interimage:att_entropyglcm.gif }} | ||
| - | * **HomogeneityGLCM** - Returns a value representing the distance between the distribuition of co-ocurrence matrix elements and those diagonal elements. The returned values range is between [0,1]. For images with low values variation the returned value will be near to zero. The calculus is showed by the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **HomogeneityGLCM** - Returns a value representing the distance between the distribution of co-ocurrence matrix elements and those diagonal elements. The returned value range is between [0,1]. For images with low value, variation the returned value will be near zero. The calculus is shown by the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_homogeneityglcm.gif }} | {{ interimage:att_homogeneityglcm.gif }} | ||
| - | * **MeanGLCM** - The GLCM mean value is expressed in function of the frequency of co-ocorrence of image elements related to their neighborhood under one pre-defined direction. The calculus is showed by the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **MeanGLCM** - The GLCM mean value is expressed in function of the frequency of co-occurrence of image elements related to their neighborhood under one pre-defined direction. The calculus is showed by the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_meanglcm.gif }} | {{ interimage:att_meanglcm.gif }} | ||
| - | * **QuiSquareGLCM** - This metric can be understood as a form of energy normalization expressed in function of the linear dependency gray levels for image elements. The calculus is showed by the next formulas where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. Pj is the marginal probability for that co-ocurrence. | + | * **QuiSquareGLCM** - This metric can be understood as a form of energy normalization expressed in function of the linear dependency gray levels for image elements. The calculus is shown by the next formulas where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. Pj is the marginal probability for that co-ocurrence. |
| {{ interimage:att_quisquareglcm_1.gif }} | {{ interimage:att_quisquareglcm_1.gif }} | ||
| {{ interimage:att_quisquareglcm_2.gif }} | {{ interimage:att_quisquareglcm_2.gif }} | ||
| Line 143: | Line 144: | ||
| - | * **StdDeviationGLCM** - The standart deviation is a measure that represents the values dispersion around a GLCM mean value. The GLCM standart deviation calcule differs from the simple standart deviation because the use of co-ocurrence frequencies. The calculus is showed by the next formula where "i" and "j" are adjacent image points values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. | + | * **StdDeviationGLCM** - The standard deviation is a measure that represents the value dispersion around a GLCM mean value. The GLCM standard deviation calculus differs from the simple standard deviation because the use of co-occurrence frequencies. The calculus is shown by the next formula where "i" and "j" are adjacent image point values under one pre-defined direction. p(i,j) is the probability of that co-ocurrence over the image. |
| {{ interimage:att_stddeviationglcm.gif }} | {{ interimage:att_stddeviationglcm.gif }} | ||
| ===== Neighborhood Attributes ===== | ===== Neighborhood Attributes ===== | ||
| - | * **existenceOf** - existence of an neighbor object belonging to the selected class **C** in a certain range **R** (in pixels) around the image object. If at least one object is found the value is 1 (true), othewise it would be 0 (false). The distance between the image object and its neighbors is calculated considering their centroids. If (**R**=0) only direct neighbors will be considered. | + | * **existenceOf** - existence of an neighbor object belonging to the selected class **C** in a certain range **R** (in pixels) around the image object. If at least one object is found the value is 1 (true), otherwise it would be 0 (false). The distance between the image object and its neighbors is calculated considering their centroids. If (**R**=0) only direct neighbors will be considered. |
| * **numberOf** - number of neighbor objects belonging to the selected class **C** in a certain range **R** (in pixels) around the image object. The distance between the image object and its neighbors is calculated considering their centroids. If (**R**=0) only direct neighbors will be considered. | * **numberOf** - number of neighbor objects belonging to the selected class **C** in a certain range **R** (in pixels) around the image object. The distance between the image object and its neighbors is calculated considering their centroids. If (**R**=0) only direct neighbors will be considered. | ||
