Constructing Cylindrical Coordinate Colour Spaces
|
|
- Erin Ramsey
- 5 years ago
- Views:
Transcription
1 Constructing Cylindrical Coordinate Colour Spaces Allan Hanbury Pattern Recognition and Image Processing Group (PRIP), Institute of Computer-Aided Automation, Vienna University of Technology, Favoritenstraße 9/182, A-1040 Vienna, Austria Abstract A cylindrical coordinate colour space (lightness, saturation/chroma, hue) is derived from an opponent colour space in the RGB space. It is shown how cylindrical coordinate colour models widely used in the literature are related to or can be reduced to the derived model, thereby contributing to creating a unified cylindrical coordinate colour model. In particular, the widely used saturation expression max(r, G, B) min(r, G, B) is derived from the proposed model. Properties of the derived chroma and saturation expressions are examined. Finally, some applications of cylindrical coordinate colour spaces are briefly reviewed. Key words: hue, saturation, chroma, lightness, colour, cylindrical coordinates 1 Introduction The representation of the colour coordinates of images in cylindrical coordinates (hue, saturation/chroma, lightness), is widely used in the image analysis and computer vision community. There are however two main difficulties associated with its use: (1) the large choice of available transformations from an RGB space, e.g. HSV (Smith, 1978), HSL, HMMD (Manjunath et al., 2002), HSB and HSI (Gonzalez and Woods, 1992). (2) the fact that some of these transformations have their saturation normalised by the lightness, making them unsuitable for some tasks. The latter concern can be understood by looking at the saturation images shown for three colour models in Figure 1. The saturation for the HSV and HSL models represent percentages of the maximum saturation obtainable for Preprint submitted to Elsevier 24 July 2007
2 (a) original (b) HSV (c) HSL (d) max min Fig. 1. (a) Original image. (b) HSV, (c) HSL and (d) max min saturation. a given lightness. This implies that in the lightness ranges where the saturation range is small, there is a large variation in the percentages. This can be seen by the noisy appearance of the dark image regions (e.g. shadows) for the HSV colour space and the dark and light image regions (e.g. reflections on the arm) for the HSL colour space. Furthermore, because the majority of RGB coordinates of the inside of the white bowl are (255, 255, 254), the saturation percentage for the bowl is high for the HSL saturation and low for the HSV saturation. Removing the saturation normalisation by lightness results in the saturation image shown in Figure 1d, which is more useful for many applications. In this paper, we derive a cylindrical coordinate colour space from basic principles. We also show how existing colour spaces are related to or can be reduced to the derived colour space, thereby contributing to a unification of these colour spaces. The derivation follows that of the cylindrical coordinate version of the CIELAB colour space (Fairchild, 1997). For the CIELAB colour space, an opponent colour space (OCS) is created in the XYZ colour space. The axes represent lightness (L ), and the red-green (a ) and blue-yellow (b ) opponent colours modelled on the human visual system. A non-linear transform and weighting on these coordinates is used to impose the approximate perceptual uniformity property on the CIELAB space. A chromaticity coordinate (a, b ) is represented in polar coordinates by the chroma C ab (the Euclidean distance from the lightness axis) and the hue angle h ab expressed in degrees starting from the positive a axis (red) and turning in an anti-clockwise direction. In order to be able to convert from the RGB space to the CIELAB space, one needs the colour coordinates of the primary colours of the image sensor (for the RGB to XYZ conversion), as well as the coordinates of the scene illuminant (for XYZ to CIELAB). This information is often not available for images that are analysed, for example arbitrary images obtained from the internet. While it 2
3 is possible to estimate these values, one adds extra uncertainty to the analysis process by doing this. This shows that building a cylindrical coordinate colour system directly in the RGB space is often desireable, as one has access to polar chromaticity coordinates through a simpler transform requiring no estimated values. We follow a similar process to the CIELAB transformation: (1) Creation of an OCS in the RGB space, (2) Conversion to cylindrical coordinates. We do not attempt to impose any type of perceptual uniformity on the space. While this leads to a completely usable colour space, it does not account for the sqturation expression max(r, G, B) min(r, G, B) that is often used. We therefore additionally demonstrate how this saturation expression can be derived from this space. The main contributions of the paper are: (1) a sound derivation of a cylindrical coordinate colour space within the RGB space. (2) the unification of several existing cylindrical coordinate colour spaces by demonstrating how they reduce to or are related to the derived space. The paper is organised as follows. Section 2 presents the derivation of the cylindrical coordinate colour space from an opponent colour space. Section concentrates on the chroma and saturation terms. A summary of the transform and inverse transform between the RGB and cylindrical coordinate spaces is given in Section 4. A short review of aome applications is given in Section 5. Section 6 concludes. 2 Derivation based on an Opponent Colour Space One performs this transformation by first building an OCS in the RGB space and then representing it in cylindrical coordinates. We do not specify if the RGB coordinates used in this paper are gamma corrected or not. More on the effect of gamma correction can be found in Angulo and Serra (2007) and Serra (2005). 2.1 Opponent Colour Space We take an RGB space with coordinates R [0, 1], G [0, 1], B [0, 1]. To convert to an OCS, a new axis is placed in the RGB space. This axis is usually between the black (0, 0, 0) and white (1, 1, 1) corners of the RGB cube, and hence contains all colours for which R = G = B. The coordinate on this axis
4 gives a measure of the lightness I, and we therefore refer to it as the lightness axis. A plane perpendicular to this axis and with origin at the intersection with the lightness axis is chosen and all RGB coordinates are projected onto this plane. The position on the plane gives information about the chromaticity of a pixel, and it is therefore referred to as the chromatic plane. A simple OCS is given by Plataniotis and Venetsanopoulos (2000): I = R + G + B (1) c 1 = 2B R G (2) c 2 = R G () This OCS has the disadvantage that the red, green and blue corners of the RGB cube have different Euclidean distances from the origin of the chromatic plane than the cyan, magenta and yellow corners. This leads to a non hexagonally-shaped area of valid RGB coordinates in the chromatic plane. The opponent colour space used by Lambert and Carron (1999) is normalised so that the six abovementioned corners of the RGB cube projected onto the chromatic plane all have unit Euclidean distance from its origin. The projection of the RGB cube onto the chromatic plane therefore has the shape of a hexagon. This transformation is defined as 1 : I = 1 (R + G + B) (4) c 1 = R 1 2 G 1 2 B (5) c 2 = (G B) (6) 2 The area of the chromatic plane containing c 1 and c 2 coordinates corresponding to colours in the RGB unit cube is shown by the hexagon in Figure 2a. The circle circumscribing the hexagon has a radius of 1. We adopt the notation in which RGB vectors projected onto the chromatic plane take a subscript p. Hence, for example, r p = (1, 0) and g p = ( 1 /2, /2) represent respectively the coordinates of the projections onto the chromatic plane of pure red r = (1, 0, 0) and pure green g = (0, 1, 0). The RGB unit cube is shown in Figure. It is divided into six sectors which 1 In Lambert and Carron (1999), the hue angle turns in an unconventional way, with green at 4π/ and blue at 2π/. We have modified the transformation by exchanging the signs in Equation 6 so that the hue angle turns anti-clockwise, as for the polar CIELAB transform. 4
5 c 2 g p 2 y p c p 1 cy p o h r p c 1 H (0,0) 4 6 c r c p b p 5 ma p r p 60 c max 120 H (a) (b) Fig. 2. (a) Chromatic plane. (b) Red-yellow sector of the hexagon on the chromatic plane. The lower vertices correspond to the colours red (at the left) and yellow. The angle H takes values between 0 and 60. are projected onto the six sectors of the hexagon on the chromatic plane. The following equation gives the sector of a colour with coordinates c = (R, G, B) based on the order of magnitude of its coordinates 0 if R > G B 1 if G R > B 2 if G > B R λ (c) = (7) if B G > R 4 if B > R G 5 if R B > G yp The cube edge corresponding to each sector and its corresponding hexagon edge on the chromatic plane are indicated by the italic numbers in Figures and 2a. In sector 1, the line between r and y in the RGB cube is projected onto the hexagon edge between r p and y p on the chromatic plane. It is therefore clear that this edge corresponds to a line of RGB coordinates having R and B constant and only G varying. The same holds for all lines in the chromatic plane parallel to the r p y p edge and lying within the first hexagon sector. This can be generalised to all sectors of the hexagon as follows: for a given sector of the hexagon, lines parallel to the hexagon edge of the sector and included in the sector correspond to lines in the RGB space for which the coordinates 5
6 B b 4 cy 5 ma w =(1,1,1) 6 o =(0,0,0) g G 2 r 1 y R Fig.. The RGB unit cube. The italic numbers indicate the edges corresponding to the six sectors into which the RGB cube is divided. with greatest and least magnitude for the sector (see Equation 7) are constant and only the coordinate of intermediate magnitude varies. An opponent colour space is also used by van de Weijer et al. (2005), with the refinement that the lightness axis is between (0, 0, 0) and the coordinate of the colour of the illuminant in RGB space c i = (α, β, γ) T. Using c i = (1, 1, 1) produces an OCS similar to Equations 4 to 6, but with rotated chromaticity axes and different normalisation. 2.2 Polar representation A D-polar representation of an OCS is obtained by keeping the ligtness I and expressing c 1 and c 2 in polar coordinates: ( c2 ) h = arctan (8) c 1 c = c c 2 2 (9) When substituting the OCS in Equations 5 to 6 into the above equations, pure red has hue h = 0 (similar to the CIELAB space). Furthermore, the chroma c = 1 for the six corners of the hexagon on the chromatic plane. Substituting Equations 4 6 into Equation 9, one obtains c = R 2 + G 2 + B 2 RG RB GB (10) 6
7 and into Equation 8, one obtains h = arctan ( ) (G B) 2R G B (11) Using the alternative definition from Lambert and Carron (1999) arccos ( ) c 1c if c 2 0 h = 60 arccos ( ) c 1c if c2 < 0 where c ( 1 c = R 1G 1B ) 2 2 R2 + G 2 + B 2 RG RB GB (12) (1) one obtains the hue expression derived in a more geometrical way for the HSI model presented in Gonzalez and Woods (1992). Pratt (1991) presents a similar transformation with the hue origin at blue and a different normalisation that he calls the IHS colour coordinate system. With the OCS defined in van de Weijer et al. (2005), h = 60 for pure red. As it is clear that the lightness I is independent of the chromaticity coordinates c 1 and c 2, one may replace Equation 4 by any measure of lightness. Derivation of a saturation term The chroma (Equation 9) is the Euclidean distance (L 2 norm) of a colour projected onto the chromatic plane from the origin. It assumes its maximum value at the six corners of the hexagon projected onto the chromatic plane. Colours with hues which are not multiples of 60 have smaller maximum chroma values limited by the hexagon edges in Figure 2a. We use the term saturation to describe chroma normalised so that the maximum value is 1 for all hue values 2. In other words, the hexagon projected onto the chromatic plane is slightly deformed into a circle of unit radius by a normalisation factor, so that the saturation assumes its maximum value for all points with projections on the edges of the hexagon. 2 This is an abuse of the term saturation as defined in Fairchild (1997), but it is used to be compatible with the image analysis literature. 7
8 .1 Derivation of saturation expressions Two equivalent saturation expressions can be derived in the chromatic plane. The saturation definition above implies that one obtains the saturation by dividing the the chroma c by the length of the line with the same hue extended to the edge of the hexagon, or s = c/c max. The red-yellow sector of the hexagon in the chromatic plane is reproduced in Figure 2b, in which the upper vertex is at the origin (0, 0), the lower left vertex is the projected red vector r p, and the third vertex the projected yellow vector y p. It is simple to show using Figure 2b that c max = 2 sin (120 H) (14) for 0 H < 60. To make this equation valid for the values of H [0, 60 ), it is sufficient to replace the H in the equation by H = H k 60 where k {0, 1, 2,, 4, 5} so that 0 H 60 (15) The value of the saturation s [0, 1] is then s = 2c sin (120 H ) (16) This definition is particularly useful for obtaining an efficient inverse transformation. The alternative definition is obtained through the use of similar triangles. Using Figure 2b, we project point c p onto the or p axis along the line parallel to r p y p, giving the point c r. By similar triangles: s = c p c max = c r, where 1 denotes the L 2 norm on the chromatic plane. On the line or p, one has G = B. Substituting this into Equation 10, one obtains either s = R G or s = R B. Along the lines parallel to r p y p, only the G coordinate varies (see Section 2.1). Hence only the value of R B is the same at both points c p and c r. This is the same as max(r, G, B) min(r, G, B) for sector 1. The derivations for the other five sectors are done similarly. This leads to the general expression for the saturation s = max (R, G, B) min (R, G, B) (17) It can easily be shown that this expression is a norm in the chromatic plane. 8
9 .2 Relation to existing cylindrical coordinate colour spaces The Generalised LHS (GLHS) model by Levkowitz and Herman (199) calculates the lightness-normalised saturation for a lightness of the form L = w min min(r, G, B)+w mid mid(r, G, B)+w max max(r, G, B), where w min +w mid + w max = 1. The HSL and HSV models are obtained from the GLHS model for specific values of these weights. By changing the definition of the saturation to remove the lightness normalisation in the derivation of this model, one obtains the above unique saturation expression (Equation 17) for all possible lightness expressions (Hanbury, 200). This saturation is called Diff in the HMMD colour space (Manjunath et al., 2002). An alternative chroma based on the L 1 norm is derived and used in Hanbury and Serra (200), Serra (2005) and Angulo and Serra (2007). For completeness, we present it here. The lightness I is defined by Equation 4. The chroma is then: c L1 = (max I) if I med 2 (18) (I min) if I med 2 where max = max(r, G, B), min = min(r, G, B) and med = median(r, G, B).. Comparison of the saturation and chroma formulations We compare the distributions of the saturation and chroma formulations discussed: the max min saturation expression (equation 17), the L 2 norm chroma (equation 10), and the L 1 norm chroma (equation 18). To calculate the distributions, we start with a RGB cube with a point at each set of integer-valued coordinates. The saturation (chroma) values of each point are calculated (as floating point values), and then rounded to the nearest integer (only necessary for the L 2 norm chroma). Histograms showing the distribution of these integer values over 256 levels are shown in Figure 4. The max min saturation distribution is regular and symmetric around the central histogram bin because of the normalisation coefficient which deforms the hexagonally shaped sub-region of the chromatic plane into a circle. Conversely, the L 2 chroma has a rather irregular distribution due to the rounding of it floating point values. It also decreases very rapidly as one approaches higher chroma values because it is calculated in the hexagonally shaped subregion of the chromatic plane. The L 1 norm chroma approximates the L 2 chroma well and the histogram is more regular. 9
10 max - min L2 L count bin (saturation or chroma value) Fig. 4. The saturation and chroma histograms. 4 Transformations to and from the cylindrical coordinate space As a summary, efficient algorithms to calculate the lightness, hue and saturation from RGB coordinates are given here. The inverse transformation is also derived. Matlab routines implementing the transformations are available on RGB to cylindrical coordinates One calculates a lightness measure, a saturation or chroma measure and a hue. Due to the independence of the lightness and the saturation, one is free to choose any lightness measure, e.g. different coefficients in the sum in Equation 4, such as those for the luminance measure in Poynton (1997). Saturation using Equation 17 or chroma using Equation 10 or 18 may be used. The hue may be equivalently calculated using Equation 11 or Equations 12 and 1. Alternatively, one may use the hue measure based on the L1 norm and avoiding trigonometric functions described in Angulo and Serra (2007). For example, using Equations 4, 17 and 11 gives i = 1 (R + G + B) (19) s = max (R, G, B) min (R, G, B) (20) 10
11 ( ) (G B) h = arctan 2R G B (21) 4.2 Cylindrical coordinates to RGB One possible inverse transformation is given here. One first calculates the chroma values from the saturation values (using Equation 16) c = s 2 sin (120 H ) (22) where H is given by Equation 15. From the chroma, one calculates c 1 = c cos (h) (2) c 2 = c sin (h) (24) For the case where the hue is undefined: c 1 = c 2 = 0. To get the R, G and B values, the following are used (derived from Equations 4 to 6): R = I + 2 c 1 (25) G = I 1 c c 2 (26) B = I 1 c 1 1 c 2 (27) 5 Applications Because the saturation or chroma terms are not percentages, it is possible to directly compare them. This allows them to be used directly in colour morphology. Colour morphology using lexicographical cascades with the max min saturation is discussed in Hanbury and Serra (2001a), while lexicographical cascades in the L1 norm colour space are discussed in Angulo (2007). More information on colour morphology can be found in a recent comparative study by Aptoula and Lefèvre (2007). The saturation or chroma measurements in this colour space have been used as a weight differentiating between achromatic and chromatic pixels. The 11
12 saturation-weighing based colour gradient (Angulo and Serra, 200), defined as f(x) = s(x) c h(x) + [1 s(x)] i(x) (28) gives a higher weight to the hue gradient c h(x) if the saturation is high and a higher weight to the lightness gradient i(x) if the saturation is low. The notation c represents a circular centred gradient which takes the angular nature of the hue component into account (Hanbury and Serra, 2001b). This type of saturation-weighting has also been useful in the calculation of hue statistics. As the hue is an angular value this should be done using circular statistics (Fisher, 199). The mean direction of a set of angular values is calculated as follows: given a set of n angular values {a 1, a 2,..., a n }, one takes for each value a i a unit vector â i in the 2D plane with direction a i. The mean direction is the direction of the vector resulting from taking the vector sum i â i. While this can be directly applied to calculating a mean hue, hues associated with low saturations should contribute less to the mean hue. This is done by using a weighted vector sum as follows: given n hue/saturation pairs {(h 1, s 1 ), (h 2, s 2 ),..., (h n, s n )}, the mean hue direction is the direction of the vector resulting from taking the weighted vector sum i s i ĥ i, where ĥi is the unit vector with direction h i. These weighted hue statistics have been successfully used in maintaining a background model for video surveillance (Blauensteiner et al., 2006). Angulo and Serra (2007) have made extensive use of the L 1 norm chroma in the creation of 2D lightness/chroma histograms. Alignments in these histograms have been shown to correspond to interesting regions of an image, such as highlights. The saturation measures normalised by lightness, as found in the standard HSV and HSL models, also have their uses. One example is in a visualisation application where one wishes to replace the lightness or saturation of an image by another function in order to enhance a certain aspect of the image. Changing the lightness or chroma/saturation in the space derived in this paper leads to the possibility that a colour may be moved out of the valid colour gamut. An inverse transform to RGB could then lead to invalid RGB coordinates (i.e. outside the RGB cube). An application example is setting all pixels in an image with saturation above a threshold to have maximum saturation (Demarty and Beucher, 1998). While the saturation thresholding should be done using one of the saturation/chroma expressions presented in this paper, it is easier to transform the pixel colours in the HSL or HSV space. Because the saturation is expressed as a percentage in these spaces, one simply sets the saturation of the relevant pixels to the maximum possible value without the possibility of moving the colour outside the gamut. Another application is replacing the lightness band of a colour image of a painting by a greyscale 12
13 image of the same painting captured in the infrared band, thereby making the relation of the underdrawing to the colours more visible (Kammerer et al., 2004). 6 Conclusion We have derived a cylindrical coordinate colour representation based on an opponent colour space in the RGB colour space. While a number of opponent colour spaces are available in the literature, there is no standardised axis orientation, leading to a large variability in the colour represented by the hue origin. Furthermore, the proposed spaces tend to have different normalisations leading to differently shaped regions obtained by projecting the RGB cube onto the chromatic plane. We have proposed using an OCS which has it axes oriented so that a hue of zero corresponds to red, as for the CIELAB space and the spaces based on the GLHS model (Levkowitz and Herman, 199). Furthermore, the proposed OCS is normalised so that the area projected onto the chromatic plane is in the form of a hexagon with each corner at a unit Euclidean distance from the centre. On the chromatic plane, we have shown how, in addition to using the distance from the centre as a measure of chroma, one can derive the expression for saturation s = max(r, G, B) min(r, G, B). While the chroma can only assume a maximum value of 1 for hue values which are multiples of 60, saturation can assume a maximum value of 1 for all hue values. We have also shown how the saturation of the GLHS model reduces to this saturation if the normalisation by lightness is removed. From the discussion of applications, it is clear that both models without saturation normalisation by lightness (such as the proposed model), as well as models with lightness-normalised saturation (such as the GLHS model) have appropriate application areas. References Angulo, J., Morphological colour operators in totally ordered lattices based on distances: Application to image filtering, enhancement and analysis. Computer Vision and Image Understanding 107, Angulo, J., Serra, J., 200. Color segmentation by ordered mergings. In: Proc. of the Int. Conf. on Image Processing. Vol. II. pp The underdrawing is a preliminary sketch made by an artist when planning a painting. It can often be made visible by infrared reflectography. 1
14 Angulo, J., Serra, J., Modelling and segmentation of colour images in polar representations. Image and Vision Computing 25 (4), Aptoula, E., Lefèvre, S., A comparative study on multivariate mathematical morphology. Pattern Recognition 40, Blauensteiner, P., Wildenauer, H., Hanbury, A., Kampel, M., Motion and shadow detection with an improved colour model. In: Proceedings of the IEEE Int. Conf. on Signal and Image Processing (ICSIP). pp Demarty, C.-H., Beucher, S., Color segmentation algorithm using an HLS transformation. In: Proceedings of the International Symposium on Mathematical Morphology (ISMM 98). pp Fairchild, M. D., Color Appearance Models. Addison-Wesley. Fisher, N. I., 199. Statistical Analysis of Circular Data. Cambridge University Press. Gonzalez, R. C., Woods, R. E., Digital Image Processing. Prentice Hall. Hanbury, A., 200. A D-polar coordinate colour representation well adapted to image analysis. In: Proceedings of the Scandinavian Conference on Image Analysis (SCIA). pp Hanbury, A., Serra, J., 2001a. Mathematical morphology in the HLS colour space. In: Proc. of the British Machine Vision Conference pp Hanbury, A., Serra, J., December 2001b. Morphological operators on the unit circle. IEEE Transactions on Image Processing 10 (12), Hanbury, A., Serra, J., 200. Colour image analysis in D-polar coordinates. In: Proc. of the DAGM 0 conference. pp Kammerer, P., Hanbury, A., Zolda, E., A visualisation tool for comparing paintings and their underdrawings. In: Proc. of the EVA. pp Lambert, P., Carron, T., Symbolic fusion of luminance-hue-chroma features for region segmentation. Pattern Recognition 2, Levkowitz, H., Herman, G. T., 199. GLHS: A generalised lightness, hue and saturation color model. CVGIP: Graphical Models and Image Processing 55 (4), Manjunath, B., Salembier, P., Sikora, T. (Eds.), Introduction to MPEG- 7: Multimedia Content Description Interface. Wiley. Plataniotis, K. N., Venetsanopoulos, A. N., Color Image Processing and Applications. Springer. Poynton, C., Frequently asked questions about color. URL: Pratt, W. K., Digital Image Processing, 2nd Edition. Wiley. Serra, J., Morphological segmentations of colour images. In: Mathematical Morphology: 40 years on Proceedings of the 7th International Symposium on Mathematical Morphology. pp Smith, A. R., Color gamut transform pairs. Computer Graphics 12 (), van de Weijer, J., Gevers, T., Geusebroek, J.-M., Edge and corner detection by photometric quasi-invariants. IEEE Trans. Pattern Analysis and Machine Intelligence 27 (4),
A 3D-polar Coordinate Colour Representation Suitable for Image Analysis
Technical Report Pattern Recognition and Image Processing Group Institute of Computer Aided Automation Vienna University of Technology Favoritenstr. 9/32 A-00 Vienna AUSTRIA Phone: +3 () 50-35 Fax: +3
More informationAutomatic detection of specular reflectance in colour images using the MS diagram
Automatic detection of specular reflectance in colour images using the MS diagram Fernando Torres 1, Jesús Angulo 2, Francisco Ortiz 1 1 Automatics, Robotics and Computer Vision Group. Dept. Physics, Systems
More informationColor and Shading. Color. Shapiro and Stockman, Chapter 6. Color and Machine Vision. Color and Perception
Color and Shading Color Shapiro and Stockman, Chapter 6 Color is an important factor for for human perception for object and material identification, even time of day. Color perception depends upon both
More informationColor, Edge and Texture
EECS 432-Advanced Computer Vision Notes Series 4 Color, Edge and Texture Ying Wu Electrical Engineering & Computer Science Northwestern University Evanston, IL 628 yingwu@ece.northwestern.edu Contents
More informationThe Elements of Colour
Color science 1 The Elements of Colour Perceived light of different wavelengths is in approximately equal weights achromatic.
More informationMotion Detection Using an Improved Colour Model
Motion Detection Using an Improved Colour Model Horst Wildenauer, Philipp Blauensteiner, Allan Hanbury, and Martin Kampel Pattern Recognition and Image Processing Group TU Vienna Favoritenstr 9-11, 1040
More informationColor Image Enhancement Using Optimal Linear Transform with Hue Preserving and Saturation Scaling
International Journal of Intelligent Engineering & Systems http://www.inass.org/ Color Image Enhancement Using Optimal Linear Transform with Hue Preserving and Saturation Scaling Xiaohua Zhang 1, Yuelan
More informationColor Content Based Image Classification
Color Content Based Image Classification Szabolcs Sergyán Budapest Tech sergyan.szabolcs@nik.bmf.hu Abstract: In content based image retrieval systems the most efficient and simple searches are the color
More informationDigital Image Processing. Introduction
Digital Image Processing Introduction Digital Image Definition An image can be defined as a twodimensional function f(x,y) x,y: Spatial coordinate F: the amplitude of any pair of coordinate x,y, which
More informationVisible Color. 700 (red) 580 (yellow) 520 (green)
Color Theory Physical Color Visible energy - small portion of the electro-magnetic spectrum Pure monochromatic colors are found at wavelengths between 380nm (violet) and 780nm (red) 380 780 Color Theory
More informationRobust color segmentation algorithms in illumination variation conditions
286 CHINESE OPTICS LETTERS / Vol. 8, No. / March 10, 2010 Robust color segmentation algorithms in illumination variation conditions Jinhui Lan ( ) and Kai Shen ( Department of Measurement and Control Technologies,
More informationChapter 4. Clustering Core Atoms by Location
Chapter 4. Clustering Core Atoms by Location In this chapter, a process for sampling core atoms in space is developed, so that the analytic techniques in section 3C can be applied to local collections
More information[2006] IEEE. Reprinted, with permission, from [Wenjing Jia, Huaifeng Zhang, Xiangjian He, and Qiang Wu, A Comparison on Histogram Based Image
[6] IEEE. Reprinted, with permission, from [Wenjing Jia, Huaifeng Zhang, Xiangjian He, and Qiang Wu, A Comparison on Histogram Based Image Matching Methods, Video and Signal Based Surveillance, 6. AVSS
More informationMultimedia Information Retrieval
Multimedia Information Retrieval Prof Stefan Rüger Multimedia and Information Systems Knowledge Media Institute The Open University http://kmi.open.ac.uk/mmis Why content-based? Actually, what is content-based
More informationCOLOR IMAGE SEGMENTATION IN RGB USING VECTOR ANGLE AND ABSOLUTE DIFFERENCE MEASURES
COLOR IMAGE SEGMENTATION IN RGB USING VECTOR ANGLE AND ABSOLUTE DIFFERENCE MEASURES Sanmati S. Kamath and Joel R. Jackson Georgia Institute of Technology 85, 5th Street NW, Technology Square Research Building,
More informationSpecifying color differences in a linear color space (LEF)
Specifying color differences in a linear color space () N. udaz,. D. Hersch, V. Ostromoukhov cole Polytechnique édérale, ausanne Switzerland rudaz@di.epfl.ch Abstract This work presents a novel way of
More informationPhysical Color. Color Theory - Center for Graphics and Geometric Computing, Technion 2
Color Theory Physical Color Visible energy - small portion of the electro-magnetic spectrum Pure monochromatic colors are found at wavelengths between 380nm (violet) and 780nm (red) 380 780 Color Theory
More informationFall 2015 Dr. Michael J. Reale
CS 490: Computer Vision Color Theory: Color Models Fall 2015 Dr. Michael J. Reale Color Models Different ways to model color: XYZ CIE standard RB Additive Primaries Monitors, video cameras, etc. CMY/CMYK
More informationBlack generation using lightness scaling
Black generation using lightness scaling Tomasz J. Cholewo Software Research, Lexmark International, Inc. 740 New Circle Rd NW, Lexington, KY 40511 e-mail: cholewo@lexmark.com ABSTRACT This paper describes
More informationColor. making some recognition problems easy. is 400nm (blue) to 700 nm (red) more; ex. X-rays, infrared, radio waves. n Used heavily in human vision
Color n Used heavily in human vision n Color is a pixel property, making some recognition problems easy n Visible spectrum for humans is 400nm (blue) to 700 nm (red) n Machines can see much more; ex. X-rays,
More informationA Fuzzy Colour Image Segmentation Applied to Robot Vision
1 A Fuzzy Colour Image Segmentation Applied to Robot Vision J. Chamorro-Martínez, D. Sánchez and B. Prados-Suárez Department of Computer Science and Artificial Intelligence, University of Granada C/ Periodista
More informationExtraction of Scene Text in HSI Color Space using K-means Clustering with Chromatic and Intensity Distance
Extraction of Scene Text in HSI Color Space using K-means Clustering with Chromatic and Intensity Distance MATKO SARIC, MAJA STELLA, PETAR SOLIC Faculty of electrical engineering, mechanical engineering
More informationImproved motion segmentation based on shadow detection
Electronic Letters on Computer Vision and Image Analysis 6(3):1-12, 2007 Improved motion segmentation based on shadow detection M. Kampel and H. Wildenauer + and P. Blauensteiner and A. Hanbury Pattern
More informationColor Local Texture Features Based Face Recognition
Color Local Texture Features Based Face Recognition Priyanka V. Bankar Department of Electronics and Communication Engineering SKN Sinhgad College of Engineering, Korti, Pandharpur, Maharashtra, India
More informationCharacterization of the anisotropy in color textures
Characterization of the anisotropy in color textures B. Jacquin A. Smolarz ISTIT Laboratory FRE CNRS 2732 BP 2060 F10010 TROYES CEDEX, FRANCE benjamin.jacquin@utt.fr Abstract Our approach deals with a
More informationTexture Analysis of Painted Strokes 1) Martin Lettner, Paul Kammerer, Robert Sablatnig
Texture Analysis of Painted Strokes 1) Martin Lettner, Paul Kammerer, Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image Processing
More informationCS635 Spring Department of Computer Science Purdue University
Color and Perception CS635 Spring 2010 Daniel G Aliaga Daniel G. Aliaga Department of Computer Science Purdue University Elements of Color Perception 2 Elements of Color Physics: Illumination Electromagnetic
More informationHue, Saturation & Intensity
Spectral Colours Spectral colours are pure unmixed colours, related to the wavelength of the light. F r o m : h tt p :/ / w w w 2. n c s u.e d u / s c i v is/lessons/colormodels/color_models2.html Hue,
More informationCHAPTER 1 Introduction 1. CHAPTER 2 Images, Sampling and Frequency Domain Processing 37
Extended Contents List Preface... xi About the authors... xvii CHAPTER 1 Introduction 1 1.1 Overview... 1 1.2 Human and Computer Vision... 2 1.3 The Human Vision System... 4 1.3.1 The Eye... 5 1.3.2 The
More informationQuaternion colour representations and derived total orderings for morphological operators
Quaternion colour representations and derived total orderings for morphological operators Jesús Angulo; Centre de Morphologie Mathématique - Ecole des Mines de Paris; 35, rue Saint-Honoré, 77305 Fontainebleau
More informationRemoving Shadows from Images
Removing Shadows from Images Zeinab Sadeghipour Kermani School of Computing Science Simon Fraser University Burnaby, BC, V5A 1S6 Mark S. Drew School of Computing Science Simon Fraser University Burnaby,
More informationCS 445 HW#6 Solutions
CS 445 HW#6 Solutions Text problem 6.1 From the figure, x = 0.43 and y = 0.4. Since x + y + z = 1, it follows that z = 0.17. These are the trichromatic coefficients. We are interested in tristimulus values
More informationA Comparison of Color Models for Color Face Segmentation
Available online at www.sciencedirect.com Procedia Technology 7 ( 2013 ) 134 141 A Comparison of Color Models for Color Face Segmentation Manuel C. Sanchez-Cuevas, Ruth M. Aguilar-Ponce, J. Luis Tecpanecatl-Xihuitl
More informationCSE 167: Lecture #7: Color and Shading. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011
CSE 167: Introduction to Computer Graphics Lecture #7: Color and Shading Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #3 due this Friday,
More informationVisual Hulls from Single Uncalibrated Snapshots Using Two Planar Mirrors
Visual Hulls from Single Uncalibrated Snapshots Using Two Planar Mirrors Keith Forbes 1 Anthon Voigt 2 Ndimi Bodika 2 1 Digital Image Processing Group 2 Automation and Informatics Group Department of Electrical
More informationEllipse fitting using orthogonal hyperbolae and Stirling s oval
Ellipse fitting using orthogonal hyperbolae and Stirling s oval Paul L. Rosin Abstract Two methods for approximating the normal distance to an ellipse using a) its orthogonal hyperbolae, and b) Stirling
More informationColor in Image & Video Processing Applications
Color in Image & Video Processing Applications DAGM 2010 Darmstadt Joost van de Weijer Universitat Autonoma de Barcelona Computer Vision Center Why use Color? photometric invariance discriminative power
More informationP1 REVISION EXERCISE: 1
P1 REVISION EXERCISE: 1 1. Solve the simultaneous equations: x + y = x +y = 11. For what values of p does the equation px +4x +(p 3) = 0 have equal roots? 3. Solve the equation 3 x 1 =7. Give your answer
More informationParallel and perspective projections such as used in representing 3d images.
Chapter 5 Rotations and projections In this chapter we discuss Rotations Parallel and perspective projections such as used in representing 3d images. Using coordinates and matrices, parallel projections
More informationEXAMINATIONS 2016 TRIMESTER 2
EXAMINATIONS 2016 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
More informationA NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM INTRODUCTION
A NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM Karthik Krish Stuart Heinrich Wesley E. Snyder Halil Cakir Siamak Khorram North Carolina State University Raleigh, 27695 kkrish@ncsu.edu sbheinri@ncsu.edu
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationB.Stat / B.Math. Entrance Examination 2017
B.Stat / B.Math. Entrance Examination 017 BOOKLET NO. TEST CODE : UGA Forenoon Questions : 0 Time : hours Write your Name, Registration Number, Test Centre, Test Code and the Number of this Booklet in
More informationEstimating the wavelength composition of scene illumination from image data is an
Chapter 3 The Principle and Improvement for AWB in DSC 3.1 Introduction Estimating the wavelength composition of scene illumination from image data is an important topics in color engineering. Solutions
More informationHOW USEFUL ARE COLOUR INVARIANTS FOR IMAGE RETRIEVAL?
HOW USEFUL ARE COLOUR INVARIANTS FOR IMAGE RETRIEVAL? Gerald Schaefer School of Computing and Technology Nottingham Trent University Nottingham, U.K. Gerald.Schaefer@ntu.ac.uk Abstract Keywords: The images
More informationStructure from Motion. Prof. Marco Marcon
Structure from Motion Prof. Marco Marcon Summing-up 2 Stereo is the most powerful clue for determining the structure of a scene Another important clue is the relative motion between the scene and (mono)
More informationImage Analysis and Formation (Formation et Analyse d'images)
Image Analysis and Formation (Formation et Analyse d'images) James L. Crowley ENSIMAG 3 - MMIS Option MIRV First Semester 2010/2011 Lesson 4 19 Oct 2010 Lesson Outline: 1 The Physics of Light...2 1.1 Photons
More informationCHAPTER 3 FACE DETECTION AND PRE-PROCESSING
59 CHAPTER 3 FACE DETECTION AND PRE-PROCESSING 3.1 INTRODUCTION Detecting human faces automatically is becoming a very important task in many applications, such as security access control systems or contentbased
More informationSNAP Centre Workshop. Introduction to Trigonometry
SNAP Centre Workshop Introduction to Trigonometry 62 Right Triangle Review A right triangle is any triangle that contains a 90 degree angle. There are six pieces of information we can know about a given
More informationCvision 3 Color and Noise
Cvision 3 Color and Noise António J. R. Neves (an@ua.pt) & João Paulo Cunha IEETA / Universidade de Aveiro Outline Color spaces Color processing Noise Acknowledgements: Most of this course is based on
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationColor Space Invariance for Various Edge Types in Simple Images. Geoffrey Hollinger and Dr. Bruce Maxwell Swarthmore College Summer 2003
Color Space Invariance for Various Edge Types in Simple Images Geoffrey Hollinger and Dr. Bruce Maxwell Swarthmore College Summer 2003 Abstract This paper describes a study done to determine the color
More informationSPECIAL TECHNIQUES-II
SPECIAL TECHNIQUES-II Lecture 19: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay Method of Images for a spherical conductor Example :A dipole near aconducting sphere The
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Dynamic Range and Weber s Law HVS is capable of operating over an enormous dynamic range, However, sensitivity is far from uniform over this range Example:
More informationEXAMINATIONS 2017 TRIMESTER 2
EXAMINATIONS 2017 TRIMESTER 2 CGRA 151 INTRODUCTION TO COMPUTER GRAPHICS Time Allowed: TWO HOURS CLOSED BOOK Permitted materials: Silent non-programmable calculators or silent programmable calculators
More informationIllumination and Shading
Illumination and Shading Light sources emit intensity: assigns intensity to each wavelength of light Humans perceive as a colour - navy blue, light green, etc. Exeriments show that there are distinct I
More informationDigital Image Processing
Digital Image Processing 7. Color Transforms 15110191 Keuyhong Cho Non-linear Color Space Reflect human eye s characters 1) Use uniform color space 2) Set distance of color space has same ratio difference
More informationYear 9: Long term plan
Year 9: Long term plan Year 9: Long term plan Unit Hours Powerful procedures 7 Round and round 4 How to become an expert equation solver 6 Why scatter? 6 The construction site 7 Thinking proportionally
More informationFall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics
Fall 2016 Semester METR 3113 Atmospheric Dynamics I: Introduction to Atmospheric Kinematics and Dynamics Lecture 5 August 31 2016 Topics: Polar coordinate system Conversion of polar coordinates to 2-D
More informationCONSISTENT COLOR RESAMPLE IN DIGITAL ORTHOPHOTO PRODUCTION INTRODUCTION
CONSISTENT COLOR RESAMPLE IN DIGITAL ORTHOPHOTO PRODUCTION Yaron Katzil 1, Yerach Doytsher 2 Mapping and Geo-Information Engineering Faculty of Civil and Environmental Engineering Technion - Israel Institute
More informationNonlinear Operations for Colour Images Based on Pairwise Vector Ordering
Nonlinear Operations for Colour Images Based on Pairwise Vector Ordering Adrian N. Evans Department of Electronic and Electrical Engineering University of Bath Bath, BA2 7AY United Kingdom A.N.Evans@bath.ac.uk
More informationAnalysis of Planar Anisotropy of Fibre Systems by Using 2D Fourier Transform
Maroš Tunák, Aleš Linka Technical University in Liberec Faculty of Textile Engineering Department of Textile Materials Studentská 2, 461 17 Liberec 1, Czech Republic E-mail: maros.tunak@tul.cz ales.linka@tul.cz
More informationExperimentation on the use of Chromaticity Features, Local Binary Pattern and Discrete Cosine Transform in Colour Texture Analysis
Experimentation on the use of Chromaticity Features, Local Binary Pattern and Discrete Cosine Transform in Colour Texture Analysis N.Padmapriya, Ovidiu Ghita, and Paul.F.Whelan Vision Systems Laboratory,
More informationLecture #13. Point (pixel) transformations. Neighborhood processing. Color segmentation
Lecture #13 Point (pixel) transformations Color modification Color slicing Device independent color Color balancing Neighborhood processing Smoothing Sharpening Color segmentation Color Transformations
More informationDoyle Spiral Circle Packings Animated
Doyle Spiral Circle Packings Animated Alan Sutcliffe 4 Binfield Road Wokingham RG40 1SL, UK E-mail: nsutcliffe@ntlworld.com Abstract Doyle spiral circle packings are described. Two such packings illustrate
More informationEvaluation of Different Metrics for Shape Based Image Retrieval Using a New Contour Points Descriptor
Evaluation of Different Metrics for Shape Based Image Retrieval Using a New Contour Points Descriptor María-Teresa García Ordás, Enrique Alegre, Oscar García-Olalla, Diego García-Ordás University of León.
More information2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
6 IEEE Personal use of this material is permitted Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising
More informationGray-World assumption on perceptual color spaces. Universidad de Guanajuato División de Ingenierías Campus Irapuato-Salamanca
Gray-World assumption on perceptual color spaces Jonathan Cepeda-Negrete jonathancn@laviria.org Raul E. Sanchez-Yanez sanchezy@ugto.mx Universidad de Guanajuato División de Ingenierías Campus Irapuato-Salamanca
More informationCS452/552; EE465/505. Color Display Issues
CS452/552; EE465/505 Color Display Issues 4-16 15 2 Outline! Color Display Issues Color Systems Dithering and Halftoning! Splines Hermite Splines Bezier Splines Catmull-Rom Splines Read: Angel, Chapter
More informationHISTOGRAMS OF ORIENTATIO N GRADIENTS
HISTOGRAMS OF ORIENTATIO N GRADIENTS Histograms of Orientation Gradients Objective: object recognition Basic idea Local shape information often well described by the distribution of intensity gradients
More information[2006] IEEE. Reprinted, with permission, from [Wenjing Jia, Gaussian Weighted Histogram Intersection for License Plate Classification, Pattern
[6] IEEE. Reprinted, with permission, from [Wening Jia, Gaussian Weighted Histogram Intersection for License Plate Classification, Pattern Recognition, 6. ICPR 6. 8th International Conference on (Volume:3
More informationIMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib
IMAGE PROCESSING AND IMAGE REGISTRATION ON SPIRAL ARCHITECTURE WITH salib Stefan Bobe 1 and Gerald Schaefer 2,* 1 University of Applied Sciences, Bielefeld, Germany. 2 School of Computing and Informatics,
More informationInvestigation of Directional Filter on Kube-Pentland s 3D Surface Reflectance Model using Photometric Stereo
Investigation of Directional Filter on Kube-Pentland s 3D Surface Reflectance Model using Photometric Stereo Jiahua Wu Silsoe Research Institute Wrest Park, Silsoe Beds, MK45 4HS United Kingdom jerry.wu@bbsrc.ac.uk
More informationConics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved.
10 Conics, Parametric Equations, and Polar Coordinates Copyright Cengage Learning. All rights reserved. 10.5 Area and Arc Length in Polar Coordinates Copyright Cengage Learning. All rights reserved. Objectives
More informationNoise Model. Important Noise Probability Density Functions (Cont.) Important Noise Probability Density Functions
Others -- Noise Removal Techniques -- Edge Detection Techniques -- Geometric Operations -- Color Image Processing -- Color Spaces Xiaojun Qi Noise Model The principal sources of noise in digital images
More informationLecture 11. Color. UW CSE vision faculty
Lecture 11 Color UW CSE vision faculty Starting Point: What is light? Electromagnetic radiation (EMR) moving along rays in space R(λ) is EMR, measured in units of power (watts) λ is wavelength Perceiving
More informationA GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS
A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory
More information8.B. The result of Regiomontanus on tetrahedra
8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the
More informationOBJECT TRACKING AND RECOGNITION BY EDGE MOTOCOMPENSATION *
OBJECT TRACKING AND RECOGNITION BY EDGE MOTOCOMPENSATION * L. CAPODIFERRO, M. GRILLI, F. IACOLUCCI Fondazione Ugo Bordoni Via B. Castiglione 59, 00142 Rome, Italy E-mail: licia@fub.it A. LAURENTI, G. JACOVITTI
More informationEE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm
EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant
More informationColour computer vision: fundamentals, applications and challenges. Dr. Ignacio Molina-Conde Depto. Tecnología Electrónica Univ.
Colour computer vision: fundamentals, applications and challenges Dr. Ignacio Molina-Conde Depto. Tecnología Electrónica Univ. of Málaga (Spain) Outline Part 1: colorimetry and colour perception: What
More informationCorner Detection using Difference Chain Code as Curvature
Third International IEEE Conference on Signal-Image Technologies technologies and Internet-Based System Corner Detection using Difference Chain Code as Curvature Neeta Nain Vijay Laxmi Bhavitavya Bhadviya
More informationCOLOR FIDELITY OF CHROMATIC DISTRIBUTIONS BY TRIAD ILLUMINANT COMPARISON. Marcel P. Lucassen, Theo Gevers, Arjan Gijsenij
COLOR FIDELITY OF CHROMATIC DISTRIBUTIONS BY TRIAD ILLUMINANT COMPARISON Marcel P. Lucassen, Theo Gevers, Arjan Gijsenij Intelligent Systems Lab Amsterdam, University of Amsterdam ABSTRACT Performance
More informationA Survey of Light Source Detection Methods
A Survey of Light Source Detection Methods Nathan Funk University of Alberta Mini-Project for CMPUT 603 November 30, 2003 Abstract This paper provides an overview of the most prominent techniques for light
More informationarxiv: v1 [cs.cv] 2 May 2016
16-811 Math Fundamentals for Robotics Comparison of Optimization Methods in Optical Flow Estimation Final Report, Fall 2015 arxiv:1605.00572v1 [cs.cv] 2 May 2016 Contents Noranart Vesdapunt Master of Computer
More informationComputer Graphics. Bing-Yu Chen National Taiwan University The University of Tokyo
Computer Graphics Bing-Yu Chen National Taiwan University The University of Tokyo Introduction The Graphics Process Color Models Triangle Meshes The Rendering Pipeline 1 What is Computer Graphics? modeling
More informationAnswers to practice questions for Midterm 1
Answers to practice questions for Midterm Paul Hacking /5/9 (a The RREF (reduced row echelon form of the augmented matrix is So the system of linear equations has exactly one solution given by x =, y =,
More informationLast update: May 4, Vision. CMSC 421: Chapter 24. CMSC 421: Chapter 24 1
Last update: May 4, 200 Vision CMSC 42: Chapter 24 CMSC 42: Chapter 24 Outline Perception generally Image formation Early vision 2D D Object recognition CMSC 42: Chapter 24 2 Perception generally Stimulus
More informationDetecting motion by means of 2D and 3D information
Detecting motion by means of 2D and 3D information Federico Tombari Stefano Mattoccia Luigi Di Stefano Fabio Tonelli Department of Electronics Computer Science and Systems (DEIS) Viale Risorgimento 2,
More informationAltering Height Data by Using Natural Logarithm as 3D Modelling Function for Reverse Engineering Application
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Altering Height Data by Using Natural Logarithm as 3D Modelling Function for Reverse Engineering Application To cite this article:
More informationLight-Dependent Texture Mapping
Light-Dependent Texture Mapping Dan Gelb, Tom Malzbender, Kevin Wu Client and Media Systems Laboratory HP Laboratories Palo Alto HPL-98-131 (R.1) April 26 th, 2001* E-mail: malzbend@hpl.hp.com texture
More informationMorphological Operators on the Unit Circle
1842 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 10, NO. 12, DECEMBER 2001 Morphological Operators on the Unit Circle Allan G. Hanbury and Jean Serra Abstract Images encoding angular information are common
More informationLocal Image Registration: An Adaptive Filtering Framework
Local Image Registration: An Adaptive Filtering Framework Gulcin Caner a,a.murattekalp a,b, Gaurav Sharma a and Wendi Heinzelman a a Electrical and Computer Engineering Dept.,University of Rochester, Rochester,
More informationCamera Calibration Using Line Correspondences
Camera Calibration Using Line Correspondences Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Ph: (518)-387-7333 Fax: (518)-387-6845 Email : hartley@crd.ge.com Abstract In this paper, a method of
More informationMathematics (JUN11MPC201) General Certificate of Education Advanced Subsidiary Examination June Unit Pure Core TOTAL
Centre Number Candidate Number For Examiner s Use Surname Other Names Candidate Signature Examiner s Initials Mathematics Unit Pure Core 2 Wednesday 18 May 2011 General Certificate of Education Advanced
More informationComputer Graphics : Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling
Computer Graphics : Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling Downloaded from :www.comp.dit.ie/bmacnamee/materials/graphics/006- Contents In today s lecture we ll have a loo at:
More informationLOCALIZATION OF FACIAL REGIONS AND FEATURES IN COLOR IMAGES. Karin Sobottka Ioannis Pitas
LOCALIZATION OF FACIAL REGIONS AND FEATURES IN COLOR IMAGES Karin Sobottka Ioannis Pitas Department of Informatics, University of Thessaloniki 540 06, Greece e-mail:fsobottka, pitasg@zeus.csd.auth.gr Index
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Review of Motion Modelling and Estimation Introduction to Motion Modelling & Estimation Forward Motion Backward Motion Block Motion Estimation Motion
More informationMETRIC PLANE RECTIFICATION USING SYMMETRIC VANISHING POINTS
METRIC PLANE RECTIFICATION USING SYMMETRIC VANISHING POINTS M. Lefler, H. Hel-Or Dept. of CS, University of Haifa, Israel Y. Hel-Or School of CS, IDC, Herzliya, Israel ABSTRACT Video analysis often requires
More informationMonocular Vision Based Autonomous Navigation for Arbitrarily Shaped Urban Roads
Proceedings of the International Conference on Machine Vision and Machine Learning Prague, Czech Republic, August 14-15, 2014 Paper No. 127 Monocular Vision Based Autonomous Navigation for Arbitrarily
More information