Lecture 6: Multimedia Information Retrieval Dr. Jian Zhang
|
|
- Dwain Chase
- 5 years ago
- Views:
Transcription
1 Lecture 6: Multimedia Information Retrieval Dr. Jian Zhang NICTA & CSE UNSW COMP9314 Advanced Database S
2 Reference Papers and Resources Papers: Colour spaces-perceptual, historical and applicational background: An overview of colour spaces used in image processing. Colour indexing: using Histogram Intersection for object identification and Histogram Backprojection for object location. Comparing Images Using Color Coherence Vectors: The original paper for CCV. Using Perceptually Weighted Histograms for Colour-based Image Retrieval: The original paper for PWH. The QBIC Project-Querying Images By Content Using Color, Texture, and Shape: The original paper for IBM QBIC project. Useful resources MPEG-7 homepage: IBM QBIC system homepage: UIUC CBIR system homepage: COMP9314 Advanced Database Systems Lecture 6 Slide 2 J Zhang
3 6.1 Image Retrieval based on Texture Texture Introduction to texture feature The concept of texture is intuitively obvious but has no precise definition Texture can be described by its tone and structure Tone based on pixel intensity properties Structure describes spatial relationships of primitives COMP9314 Advanced Database Systems Lecture 6 Slide 3 J Zhang
4 6.1 Image Retrieval based on Texture Texture MPEG-7 standard The homogeneous texture descriptor (HTD). Two components of the HTD will be performed in the whole extraction procedure Mean energy Energy deviation The 2-D frequency plane is partitioned into 30 frequency channels The syntax of HTD = [fdc, fsd, e1,e2, e30,d1,d2,,d30]. where fdc and fsd are the mean and standard deviation of the image respectively, Where ei and di are the mean energy and energy deviation that nonlinearly scaled and quantized of the ith channel COMP9314 Advanced Database Systems Lecture 6 Slide 4 J Zhang
5 6.1 Image Retrieval based on Texture Texture The frequency plane partitioning is uniform along the angular direction but not uniform along the radial direction. COMP9314 Advanced Database Systems Lecture 6 Slide 5 J Zhang
6 6.1 Image Retrieval based on Texture Texture Each channel is modeled using Gabor function: If a channel indexed by (s,r) where s is the radial index and r is the angular index. Then the (s,r)-channel in the freq. domain G s,r ( ω, θ ) 2 ( ω ω ) ( θ θ s r = exp 2 exp 2 2σ 2τ s r ) 2 σ τ Where and are the standard deviation of the Gaussian in the s r radial direction and the angular direction, respectively COMP9314 Advanced Database Systems Lecture 6 Slide 6 J Zhang
7 6.2 Image Retrieval based on Texture Texture The energy of each channel is defined as the log-scaled sum of the square of the Gabor-filtered Fourier transform coefficients of an image e i = log 10 [1 + p i ] where p i = [ Gs, r ( ω, θ ) ω P( ω, θ )] + + ω= 0 θ= (0 ) 2 COMP9314 Advanced Database Systems Lecture 6 Slide 7 J Zhang
8 6.2 Image Retrieval based on Texture Texture P( ω, θ ) P( ω, θ ) = F( ω cosθ, ω sinθ ) F( u,v ) the Fourier transform of an image represent in the polar freq. domain where is the Fourier transform in the Cartesian coordinate system F( u, v) = 1 MN M 1N 1 f ( x, y) e x = 0 y = 0 j2π ( ux/ M + vy / N) The energy deviation of each feature channel is defined as the log-scaled standard deviation of the square of the Gabor-filtered Fourier transform coefficients of an image d = log [ 1+ i 10 q i ] where q { [ Gs, r ( ω, θ ) ω P( ω, θ )] pi} + + ω= 0 θ= (0 ) The HTD consists of the mean and standard deviation of the image intensity, the energy and energy deviation for each feature channel e i i d i = COMP9314 Advanced Database Systems Lecture 6 Slide 8 J Zhang
9 6.2 Image Retrieval based on Texture Texture Texture [4] can also be defined as a function of the spatial variation in pixel intensities. One example is to use statistical properties of the spatial distribution of gray-levels of an image. Two types of statistical properties can be used, i.e. (1) first-order statistics and (2) second-order statistics. The first-order statistics measures only depend on the individual pixel gray-levels. Define L-- the number of distinct grey levels Define z the random variable denoting the grey-level Define p( z i ) -- the probability of a grey level occurring in the image COMP9314 Advanced Database Systems Lecture 6 Slide 9 J Zhang
10 6.2 Image Retrieval based on Texture Texture The first-order statistics measures only depend on the individual pixel gray-levels. Define L-- the number of distinct grey levels Define z the random variable denoting the grey-level Define p( z i ) -- the probability of a grey level occurring in the image Overall mean Overall standard deviation m L = 1 i = 0 z p( z ) i i σ = Skewness R-Inverse variance L 1 3 3( ) 1 μ z = ( zi m) p( z i ). R = 1 i= 0 1+ σ 2 ( z) Overall Uniformity Overall Entropy L 1 i = 0 2 U = p ( z i ) e = i= L 1 i= 0 m) 2 i z i COMP9314 Advanced Database Systems Lecture 6 Slide 10 J Zhang L 1 0 ( z p( z p( ) i ) log 10 p( z i )
11 6.2 Image Retrieval based on Texture The second-order statistics take into account the relationship between the pixel and its neighbors The Grey-level Co-occurrence Matrix (GLCM) is used to calculate the second-order statistics. Suppose the following 4x4 pixel image with 3 distinct greylevels: And d = (dx, dy) = (1,0) means that compute the cooccurrences of the pixels to the left of the current one COMP9314 Advanced Database Systems Lecture 6 Slide 11 J Zhang
12 6.2 Image Retrieval based on Texture The 3x3 co-occurrence matrix is defined as follows. From the table, the element [0,0] in the GLCM matrix is 4. That is the number of counts of pixels with grey-level 0 that have a unit with a gray-level of 0 in the left COMP9314 Advanced Database Systems Lecture 6 Slide 12 J Zhang
13 6.2 Image Retrieval based on Texture The Symmetrical GLCM can be computed by adding it to its transpose such as with the position operator (-1,0). A GLCM will be then normalized by dividing each individual element by the total count in the matrix giving the co-occurrence probabilities. Computing the GLCM over the full 256 gray-level is very expensive and it will also not achieve a good statistical approximation due to a lot of cells with zero values A 16 linearly scaled grey-levels is commonly used in CBIR application. The position operation in a CBIR system can be: (1,0), (0,1), (1,1) and (-1,0). COMP9314 Advanced Database Systems Lecture 6 Slide 13 J Zhang
14 6.2 Image Retrieval based on Texture Based on GLCM, the second-order statistics are then computed as follows: Angular Second Moment (Energy) measures the homogeneity of the image A = i j Entropy has the same meaning with one of the first-order statistics but using GLCM instead: δ = i j Inverse Difference Moment (Homogeneity) I is another measure of homogeneity which is sometimes called local homogeneity cij I = 2 1+ ( i j) i j 2 c ij cij log 2 c ij A COMP9314 Advanced Database Systems Lecture 6 Slide 14 J Zhang
15 6.2 Image Retrieval based on Texture Contrast (Inertia) measures how inhomogeneous the image is C = ( i i j 2 c ij Correlation cor measures the linear dependency on the pairs of pixels: cor = i j x x y j) ( i μ )( j μ ) c σ σ y ij Where μ = [i ] x c ij i j μ = [ j ] y c ij j i 2 2 σ = [( i μ ) c ] σ y = [( j μ y ) cij ] x i x j ij j i COMP9314 Advanced Database Systems Lecture 6 Slide 15 J Zhang
16 6.2 Image Retrieval based on Texture Local Edge Histograms The edge histogram descriptor (EHD) defined in MPEG- 7 represents local edge distribution in the image Specifically, the image is first divided into sub-images. The local-edge distribution for each sub-image can be represented by a histogram. To generate the histogram, edges in the sub-images are categorized into five types: vertical, horizontal, 45 degree diagonal, 135 degree diagonal, nondirectional edges and then computed for each sub-images Since there are 16 sub-images, totally 5x16=80 histogram bins are required COMP9314 Advanced Database Systems Lecture 6 Slide 16 J Zhang
17 6.2 Image Retrieval based on Texture Local Edge Histograms (0,0) (0,1) (0,2) (0,3) 256 (1,0) (2,0) (1,1) (2,1) (1,2) (2,2) (1,3) (2,3) (3,0) (3,1) (3,2) (3,3) 64 Image Sub-Image 4 4 a 0 a Image Block 4 a 2 a 3 An example for dividing an image into sub-images and 8x8 image blocks COMP9314 Advanced Database Systems Lecture 6 Slide 17 J Zhang
18 6.2 Image Retrieval based on Texture Local Edge Histograms EHD extraction: Each sub-image is first converted to grey-scale levels. The EHD calculation is based on image blocks such as 8x8 pixels. For a 384x256 size of image, 16 sub-images is divided and each sub-image is further divided into 8x8 blocks, the average intensities in the image block are defined as a0, a1, a2 and a3 respectively. The edge direction of a block is determined by calculating the edge magnitudes. COMP9314 Advanced Database Systems Lecture 6 Slide 18 J Zhang
19 6.2 Image Retrieval based on Texture EHD extraction The largest edge magnitude is chosen as the edge direction if the magnitude is larger than the threshold If the magnitude is smaller than the threshold, the block will be decided as containing no-edge and its counts are discarded and not used in computing histograms. The direction of the edge is shown below m 90 (Vertical) 135 o 45 o m 45 m 0 (Horizontal) The direction of the edge COMP9314 Advanced Database Systems Lecture 6 Slide 19 J Zhang
20 6.2 Image Retrieval based on Texture EHD extraction The edge magnitude can be calculated (digital filtering) as follows m = a a + a a m = a + a a a m = 2a 2a m = 2a 2a m = a 2a 2a + 2 non directional a 3 After calculating the edge magnitude for each image block, 5 histogram columns for this sub-image will be calculated COMP9314 Advanced Database Systems Lecture 6 Slide 20 J Zhang
21 6.3 Image Indexing and Retrieval based on Shape Shape Basic concept on shape The shape of an object or region reflects to its profile and physical structure. A low-level feature shape of objects within the images For retrieval based on shapes, image must be segmented into individual objects Due to the difficulty of robust and accurate image segmentation, the use of shape features for image retrieval has been limited to special applications where objects or regions are readily available COMP9314 Advanced Database Systems Lecture 6 Slide 21 J Zhang
22 6.3 Image Indexing and Retrieval based on Shape Shape Basic concept on shape A good shape representation and similarity measurement for recognition and retrieval purposes should have the following two important properties: Each shape should have a unique representation, invariant to translation, rotation and scale; Similar shapes should have similar representations so that retrieval can be based on distance among shape representation COMP9314 Advanced Database Systems Lecture 6 Slide 22 J Zhang
23 6.3 Image Indexing and Retrieval based on Shape Shape Representation Boundary-based methods Chain Codes, fitting line segmentation, Fourier description Region-based methods Moments, orientation Geometry-based methods Perimeter measurement, area attribute Structure-based methods Medial axis transform (MAT) Skeleton and thinning algorithm COMP9314 Advanced Database Systems Lecture 6 Slide 23 J Zhang
24 6.3 Image Indexing and Retrieval based on Shape Boundary-based methods -- Chain Code Chain codes are used to represent a boundary by a connected sequence of straight-line segments of special length and direction Typically, this representation is based on 4- or 8-connectivity of the segments. The direction of each segment is coded by using a numbering scheme Direction numbers for 4-directional chain code Direction numbers for 8-directional chain code COMP9314 Advanced Database Systems Lecture 6 Slide 24 J Zhang
25 6.3 Image Indexing and Retrieval based on Shape Boundary-based methods -- Chain Code COMP9314 Advanced Database Systems Lecture 6 Slide 25 J Zhang
26 6.3 Image Indexing and Retrieval based on Shape Boundary-based methods -- Fourier Descriptors (FDs) A shape is first represented by a feature function called a shape signature. A discrete Fourier Transform (in frequency domain) is applied to the signature to obtain FD of the shape. F n = 1 N 1 N i= 0 f () i exp j2πui N For u=0 to N-1, Where N is the number of samples of f(i). Three commonly used signature: curvature based radius based boundary coordinator based COMP9314 Advanced Database Systems Lecture 6 Slide 26 J Zhang
27 6.3 Image Indexing and Retrieval based on Shape Boundary-based methods -- Fourier Descriptors (FDs) The Radius-based signature consists of a number of ordered distance from the shape centroid to boundary points (called radii). The radii are defined as ( ) r i = ( x ) 2 ( ) 2 c xi + y y c i ( ) Where x, y are the coordinates of the centroid and x i, y c c i for i=0 to 63 are the coordinates of the 64 sample points along the shape boundary and the number of pixels between each two neighboring points is the same A feature vector which is invariant to start point (p), rotation (r) and scale (s) should be calculated. x = F F 1 0,... F F 63 0 COMP9314 Advanced Database Systems Lecture 6 Slide 27 J Zhang
28 6.3 Image Indexing and Retrieval based on Shape Boundary-based methods -- Fourier Descriptors (FDs) The distance between shapes is calculated as the Euclidean distance between their feature vectors. Using FDs is to convert the sensitive radius lengths into the frequency domain where the data is more robust to small changes and noise. The FDs capture the general features and form of the shape instead of each individual detail COMP9314 Advanced Database Systems Lecture 6 Slide 28 J Zhang
29 6.3 Image Indexing and Retrieval based on Shape Region-based shape representation and similarity measure The shape similarity measurements based on shape representations, in general, do not conform to human perception. The following similarity measurements do not match well with human similarity judgment. They are: Algebraic Spline curve distance Cumulative turning angle Sign of curvature and, Hausdorff-distance COMP9314 Advanced Database Systems Lecture 6 Slide 29 J Zhang
30 6.3 Image Indexing and Retrieval based on Shape Region-based shape representation and similarity measure Basic idea of region-based shape representation As shown in the figure below, if 1 is assigned to the cell with at least 15% of pixels covered by the shape, and a 0 to each of the other cells. The more grids, the more accurate the shape Rep. A binary sequence is created by scanning from left to right and top to bottom , , , Generation of binary sequence for a shape COMP9314 Advanced Database Systems Lecture 6 Slide 30 J Zhang
31 6.3 Image Indexing and Retrieval based on Shape Rotation normalization Rotate the shape so that its major axis is parallel with the x- axis including two possibilities: Two possible orientations with the major axis along the x direction Only one of the binary sequences is saved while two orientations are accounted for during retrieval time by representing the query shape using two binary sequences COMP9314 Advanced Database Systems Lecture 6 Slide 31 J Zhang
32 6.3 Image Indexing and Retrieval based on Shape Scale normalization All shapes are scaled so that their major axes have the same fixed length. Unique shape representation shape index After rotation and scale normalization and selection of a grid cell size, a unique binary sequence for each shape based on a unique major axis. This binary sequence is used as a index of the shape When the cell size is decided, the number of grid cells in the x direction is fixed (i.e 8), The number of cells in the y direction depends on the eccentricity of the shape. The cell number for Y can range from 1 to 8. COMP9314 Advanced Database Systems Lecture 6 Slide 32 J Zhang
33 6.3 Image Indexing and Retrieval based on Shape Similarity measure between two shapes based on their indexes Based on the shape eccentricities, there are three cases for similarity measurement Same basic rectangle of two normalized shapes: bitwise compare and distance calculation between the shape point position values, For example: A and B have the same eccentricity of 4 A = and B= , then the distance value between A and B is 3 If two normalized shape have very different basic rectangles, we can assume these two shapes are quite different (i.e. different on Minor Axis) COMP9314 Advanced Database Systems Lecture 6 Slide 33 J Zhang
34 6.3 Image Indexing and Retrieval based on Shape If two normalized shapes have slightly different basic rectangles, the perceptual similarity is still possible. Add the 0s at the end of the index of the shape with shorter minor axis to extend the index to the same length as the other shape Example: A = (2, ),and B = (3, ), then the shape A binary number is extended to the same length of B. Hence A = (3, ). The distance of A and B is 4 COMP9314 Advanced Database Systems Lecture 6 Slide 34 J Zhang
35 6.4 Data Structure for Efficient Multimedia Similarity Search Introduction The retrieval is based on the similarity between the query vector and the feature vector If the feature dimensions high and the number of stored objects are huge, it will be too slow to do the linearly search for all features vectors Techniques and data structures are required to re-organize feature vectors and develop fast search method to locate the relevant features quickly The main idea is to divide the high dimension feature vector space into many sub-space and focus on one or a few subspaces for effective search COMP9314 Advanced Database Systems Lecture 6 Slide 35 J Zhang
36 6.4 Data Structure for Efficient Multimedia Similarity Search Three common queries: Point query users query is represented as a vector Feature vectors exactly match Range query users query is represented as a feature vector and distance range The distance metrics i.e. L1 and L2 (Euclidean distance) The k nearest neighbours query users query is specified by a vector and a integer k. The k objects whose distances from the query are the smallest are retrieved. COMP9314 Advanced Database Systems Lecture 6 Slide 36 J Zhang
37 6.4 Data Structure for Efficient Multimedia Similarity Search -- Filtering Process Query methods based on color-histogram Use histograms with very few bins to select potential retrieval candidates Then use the full histograms to calculate the distance For a special case, calculate the average of RGB value T such as x R G, B ) = (, avg avg avg A avg p A( p) p = =1 p where A = {R,G, B} Given the average color vectors and y of two images. 3 The Euclidean distance: 2 davg ( x, y) = ( xi yi ) x i= 1 COMP9314 Advanced Database Systems Lecture 6 Slide 37 J Zhang
38 6.5 Data Structure for Efficient Multimedia Similarity Search B+ Tree To achieve an efficient way for query process The weakness of traditional similarity calculation on feature vectors within search space is sequential A B+ tree is a hierarchical structure with a number of nodes to store the feature vectors to record 60 to record 20 to record 10 COMP9314 Advanced Database Systems Lecture 6 Slide 38 J Zhang
39 6.5 Data Structure for Efficient Multimedia Similarity Search B+ Tree Multidimensional B+ Tree Each feature vector has two dimensions. The entire feature space is formed as a large rectangle identified by its lower left and top right corners. Replace each key value with a rectangular region The pointers of leaf nodes point to lists of feature vectors within corresponding rectangular regions. D 1,2 0 D 1,0 0 D 2,1 0 D 0,0 D 0,1 D 1,0 D 1,1 D 1,2 D 2,0 D 2,1 D 3,0 0 to L 0,0 to L 0,1 to L 1,0 to L 1,1 to L 1,2 to L 2,0 to L 2,1 to L 3,0 COMP9314 Advanced Database Systems Lecture 6 Slide 39 J Zhang
40 6.6 Similarity Comparison Given two feature vectors, I, J, the distance is defined as D(I,J) = f(i,j) Typical similarity metrics Lp (Minkowski distance) Χ2 metric KL (Kullback-Leibler Divergence) JD (Jeffrey Divergence) QF (Quadratic Form) EMD (Earth Mover s Distance) COMP9314 Advanced Database Systems Lecture 6 Slide 40 J Zhang
Lecture 8: Multimedia Information Retrieval (I)
Lecture 8: Multimedia Information Retrieval (I) A/Prof. Jian Zhang NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2010 jzhang@cse.unsw.edu.au Announcement!!! Lecture 10 swaps with Lecture 11 Lecture 10
More informationChapter 11 Representation & Description
Chain Codes Chain codes are used to represent a boundary by a connected sequence of straight-line segments of specified length and direction. The direction of each segment is coded by using a numbering
More informationCoE4TN4 Image Processing
CoE4TN4 Image Processing Chapter 11 Image Representation & Description Image Representation & Description After an image is segmented into regions, the regions are represented and described in a form suitable
More informationDigital Image Processing
Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents
More informationPractical Image and Video Processing Using MATLAB
Practical Image and Video Processing Using MATLAB Chapter 18 Feature extraction and representation What will we learn? What is feature extraction and why is it a critical step in most computer vision and
More informationBoundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking
Representation REPRESENTATION & DESCRIPTION After image segmentation the resulting collection of regions is usually represented and described in a form suitable for higher level processing. Most important
More informationAn Introduction to Content Based Image Retrieval
CHAPTER -1 An Introduction to Content Based Image Retrieval 1.1 Introduction With the advancement in internet and multimedia technologies, a huge amount of multimedia data in the form of audio, video and
More informationLecture 10: Tutorial Sakrapee (Paul) Paisitkriangkrai Evan Tan A/Prof. Jian Zhang
Lecture : Tutorial Sakrapee (Paul) Paisitkriangkrai Evan Tan A/Prof. Jian Zhang NICTA & CSE UNSW COMP959 Multimedia Systems S 9 jzhang@cse.unsw.edu.au Part I: Media Streaming Evan Tan Acknowledgement:
More informationTopic 6 Representation and Description
Topic 6 Representation and Description Background Segmentation divides the image into regions Each region should be represented and described in a form suitable for further processing/decision-making Representation
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationChapter 11 Representation & Description
Chapter 11 Representation & Description The results of segmentation is a set of regions. Regions have then to be represented and described. Two main ways of representing a region: - external characteristics
More informationEE 584 MACHINE VISION
EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency
More informationCHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT
CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT 2.1 BRIEF OUTLINE The classification of digital imagery is to extract useful thematic information which is one
More informationLecture 10: Image Descriptors and Representation
I2200: Digital Image processing Lecture 10: Image Descriptors and Representation Prof. YingLi Tian Nov. 15, 2017 Department of Electrical Engineering The City College of New York The City University of
More informationTEXTURE. Plan for today. Segmentation problems. What is segmentation? INF 4300 Digital Image Analysis. Why texture, and what is it?
INF 43 Digital Image Analysis TEXTURE Plan for today Why texture, and what is it? Statistical descriptors First order Second order Gray level co-occurrence matrices Fritz Albregtsen 8.9.21 Higher order
More information- Low-level image processing Image enhancement, restoration, transformation
() Representation and Description - Low-level image processing enhancement, restoration, transformation Enhancement Enhanced Restoration/ Transformation Restored/ Transformed - Mid-level image processing
More information9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B
8. Boundary Descriptor 8.. Some Simple Descriptors length of contour : simplest descriptor - chain-coded curve 9 length of contour no. of horiontal and vertical components ( no. of diagonal components
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationRegion-based Segmentation
Region-based Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) to obtain a compact representation. Applications: Finding tumors, veins, etc.
More informationMachine vision. Summary # 6: Shape descriptors
Machine vision Summary # : Shape descriptors SHAPE DESCRIPTORS Objects in an image are a collection of pixels. In order to describe an object or distinguish between objects, we need to understand the properties
More informationImage and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Representation and Description 2 Representation and
More informationLecture 18 Representation and description I. 2. Boundary descriptors
Lecture 18 Representation and description I 1. Boundary representation 2. Boundary descriptors What is representation What is representation After segmentation, we obtain binary image with interested regions
More informationVC 11/12 T14 Visual Feature Extraction
VC 11/12 T14 Visual Feature Extraction Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos Miguel Tavares Coimbra Outline Feature Vectors Colour Texture
More informationAutoregressive and Random Field Texture Models
1 Autoregressive and Random Field Texture Models Wei-Ta Chu 2008/11/6 Random Field 2 Think of a textured image as a 2D array of random numbers. The pixel intensity at each location is a random variable.
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationCS4733 Class Notes, Computer Vision
CS4733 Class Notes, Computer Vision Sources for online computer vision tutorials and demos - http://www.dai.ed.ac.uk/hipr and Computer Vision resources online - http://www.dai.ed.ac.uk/cvonline Vision
More informationDigital Image Processing Chapter 11: Image Description and Representation
Digital Image Processing Chapter 11: Image Description and Representation Image Representation and Description? Objective: To represent and describe information embedded in an image in other forms that
More informationImage representation. 1. Introduction
Image representation Introduction Representation schemes Chain codes Polygonal approximations The skeleton of a region Boundary descriptors Some simple descriptors Shape numbers Fourier descriptors Moments
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationChapter 3 Image Registration. Chapter 3 Image Registration
Chapter 3 Image Registration Distributed Algorithms for Introduction (1) Definition: Image Registration Input: 2 images of the same scene but taken from different perspectives Goal: Identify transformation
More informationINTENSITY TRANSFORMATION AND SPATIAL FILTERING
1 INTENSITY TRANSFORMATION AND SPATIAL FILTERING Lecture 3 Image Domains 2 Spatial domain Refers to the image plane itself Image processing methods are based and directly applied to image pixels Transform
More informationPattern recognition. Classification/Clustering GW Chapter 12 (some concepts) Textures
Pattern recognition Classification/Clustering GW Chapter 12 (some concepts) Textures Patterns and pattern classes Pattern: arrangement of descriptors Descriptors: features Patten class: family of patterns
More informationEECS490: Digital Image Processing. Lecture #23
Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)
More informationOne image is worth 1,000 words
Image Databases Prof. Paolo Ciaccia http://www-db. db.deis.unibo.it/courses/si-ls/ 07_ImageDBs.pdf Sistemi Informativi LS One image is worth 1,000 words Undoubtedly, images are the most wide-spread MM
More informationAN EFFICIENT BATIK IMAGE RETRIEVAL SYSTEM BASED ON COLOR AND TEXTURE FEATURES
AN EFFICIENT BATIK IMAGE RETRIEVAL SYSTEM BASED ON COLOR AND TEXTURE FEATURES 1 RIMA TRI WAHYUNINGRUM, 2 INDAH AGUSTIEN SIRADJUDDIN 1, 2 Department of Informatics Engineering, University of Trunojoyo Madura,
More informationFeature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points
Feature extraction Bi-Histogram Binarization Entropy What is texture Texture primitives Filter banks 2D Fourier Transform Wavlet maxima points Edge detection Image gradient Mask operators Feature space
More informationDigital Image Processing Fundamentals
Ioannis Pitas Digital Image Processing Fundamentals Chapter 7 Shape Description Answers to the Chapter Questions Thessaloniki 1998 Chapter 7: Shape description 7.1 Introduction 1. Why is invariance to
More informationUNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences
UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 4300 / INF 9305 Digital image analysis Date: Thursday December 21, 2017 Exam hours: 09.00-13.00 (4 hours) Number of pages: 8 pages
More informationMachine learning Pattern recognition. Classification/Clustering GW Chapter 12 (some concepts) Textures
Machine learning Pattern recognition Classification/Clustering GW Chapter 12 (some concepts) Textures Patterns and pattern classes Pattern: arrangement of descriptors Descriptors: features Patten class:
More informationECEN 447 Digital Image Processing
ECEN 447 Digital Image Processing Lecture 8: Segmentation and Description Ulisses Braga-Neto ECE Department Texas A&M University Image Segmentation and Description Image segmentation and description are
More informationFeature description. IE PŁ M. Strzelecki, P. Strumiłło
Feature description After an image has been segmented the detected region needs to be described (represented) in a form more suitable for further processing. Representation of an image region can be carried
More informationRobust Shape Retrieval Using Maximum Likelihood Theory
Robust Shape Retrieval Using Maximum Likelihood Theory Naif Alajlan 1, Paul Fieguth 2, and Mohamed Kamel 1 1 PAMI Lab, E & CE Dept., UW, Waterloo, ON, N2L 3G1, Canada. naif, mkamel@pami.uwaterloo.ca 2
More informationGEMINI GEneric Multimedia INdexIng
GEMINI GEneric Multimedia INdexIng GEneric Multimedia INdexIng distance measure Sub-pattern Match quick and dirty test Lower bounding lemma 1-D Time Sequences Color histograms Color auto-correlogram Shapes
More informationBasic Algorithms for Digital Image Analysis: a course
Institute of Informatics Eötvös Loránd University Budapest, Hungary Basic Algorithms for Digital Image Analysis: a course Dmitrij Csetverikov with help of Attila Lerch, Judit Verestóy, Zoltán Megyesi,
More informationDigital Image Processing. Lecture # 15 Image Segmentation & Texture
Digital Image Processing Lecture # 15 Image Segmentation & Texture 1 Image Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) Applications:
More informationTEXTURE ANALYSIS USING GABOR FILTERS
TEXTURE ANALYSIS USING GABOR FILTERS Texture Types Definition of Texture Texture types Synthetic Natural Stochastic < Prev Next > Texture Definition Texture: the regular repetition of an element or pattern
More informationChapter 4 - Image. Digital Libraries and Content Management
Prof. Dr.-Ing. Stefan Deßloch AG Heterogene Informationssysteme Geb. 36, Raum 329 Tel. 0631/205 3275 dessloch@informatik.uni-kl.de Chapter 4 - Image Vector Graphics Raw data: set (!) of lines and polygons
More informationTEXTURE ANALYSIS USING GABOR FILTERS FIL
TEXTURE ANALYSIS USING GABOR FILTERS Texture Types Definition of Texture Texture types Synthetic ti Natural Stochastic < Prev Next > Texture Definition Texture: the regular repetition of an element or
More informationECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/05 TEXTURE ANALYSIS
ECE 176 Digital Image Processing Handout #14 Pamela Cosman 4/29/ TEXTURE ANALYSIS Texture analysis is covered very briefly in Gonzalez and Woods, pages 66 671. This handout is intended to supplement that
More informationDigital Image Fundamentals II
Digital Image Fundamentals II 1. Image modeling and representations 2. Pixels and Pixel relations 3. Arithmetic operations of images 4. Image geometry operation 5. Image processing with Matlab - Image
More information2. LITERATURE REVIEW
2. LITERATURE REVIEW CBIR has come long way before 1990 and very little papers have been published at that time, however the number of papers published since 1997 is increasing. There are many CBIR algorithms
More informationLecture 8: Fitting. Tuesday, Sept 25
Lecture 8: Fitting Tuesday, Sept 25 Announcements, schedule Grad student extensions Due end of term Data sets, suggestions Reminder: Midterm Tuesday 10/9 Problem set 2 out Thursday, due 10/11 Outline Review
More informationPattern recognition. Classification/Clustering GW Chapter 12 (some concepts) Textures
Pattern recognition Classification/Clustering GW Chapter 12 (some concepts) Textures Patterns and pattern classes Pattern: arrangement of descriptors Descriptors: features Patten class: family of patterns
More informationEE 701 ROBOT VISION. Segmentation
EE 701 ROBOT VISION Regions and Image Segmentation Histogram-based Segmentation Automatic Thresholding K-means Clustering Spatial Coherence Merging and Splitting Graph Theoretic Segmentation Region Growing
More informationLecture 9: Hough Transform and Thresholding base Segmentation
#1 Lecture 9: Hough Transform and Thresholding base Segmentation Saad Bedros sbedros@umn.edu Hough Transform Robust method to find a shape in an image Shape can be described in parametric form A voting
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 informationTexture Analysis. Selim Aksoy Department of Computer Engineering Bilkent University
Texture Analysis Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Texture An important approach to image description is to quantify its texture content. Texture
More informationUlrik Söderström 21 Feb Representation and description
Ulrik Söderström ulrik.soderstrom@tfe.umu.se 2 Feb 207 Representation and description Representation and description Representation involves making object definitions more suitable for computer interpretations
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationAfdeling Toegepaste Wiskunde/ Division of Applied Mathematics Representation and description(skeletonization, shape numbers) SLIDE 1/16
Representation and description(skeletonization, shape numbers) SLIDE 1/16 Chapter 11: Representation and Description Asegmentedregioncanberepresentedby { boundarypixels internal pixels When shape is important,
More information5. Feature Extraction from Images
5. Feature Extraction from Images Aim of this Chapter: Learn the Basic Feature Extraction Methods for Images Main features: Color Texture Edges Wie funktioniert ein Mustererkennungssystem Test Data x i
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK REVIEW ON CONTENT BASED IMAGE RETRIEVAL BY USING VISUAL SEARCH RANKING MS. PRAGATI
More informationEXAM SOLUTIONS. Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006,
School of Computer Science and Communication, KTH Danica Kragic EXAM SOLUTIONS Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006, 14.00 19.00 Grade table 0-25 U 26-35 3 36-45
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationRobotics Programming Laboratory
Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin Lecture 8: Robot Perception Perception http://pascallin.ecs.soton.ac.uk/challenges/voc/databases.html#caltech car
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 informationGeneric Fourier Descriptor for Shape-based Image Retrieval
1 Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash University Churchill, VIC 3842 Australia dengsheng.zhang@infotech.monash.edu.au
More informationBasic relations between pixels (Chapter 2)
Basic relations between pixels (Chapter 2) Lecture 3 Basic Relationships Between Pixels Definitions: f(x,y): digital image Pixels: q, p (p,q f) A subset of pixels of f(x,y): S A typology of relations:
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 03 Image Processing Basics 13/01/28 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationIN5520 Digital Image Analysis. Two old exams. Practical information for any written exam Exam 4300/9305, Fritz Albregtsen
IN5520 Digital Image Analysis Two old exams Practical information for any written exam Exam 4300/9305, 2016 Exam 4300/9305, 2017 Fritz Albregtsen 27.11.2018 F13 27.11.18 IN 5520 1 Practical information
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spatial Domain Filtering http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background Intensity
More informationAnalysis of Image and Video Using Color, Texture and Shape Features for Object Identification
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 6, Ver. VI (Nov Dec. 2014), PP 29-33 Analysis of Image and Video Using Color, Texture and Shape Features
More informationA Study on Feature Extraction Techniques in Image Processing
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Special Issue-7, Dec 2016 ISSN: 2347-2693 A Study on Feature Extraction Techniques in Image Processing Shrabani
More informationContent Based Image Retrieval Using Combined Color & Texture Features
IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 11, Issue 6 Ver. III (Nov. Dec. 2016), PP 01-05 www.iosrjournals.org Content Based Image Retrieval
More informationContent Based Image Retrieval
Content Based Image Retrieval R. Venkatesh Babu Outline What is CBIR Approaches Features for content based image retrieval Global Local Hybrid Similarity measure Trtaditional Image Retrieval Traditional
More informationFeature Descriptors. CS 510 Lecture #21 April 29 th, 2013
Feature Descriptors CS 510 Lecture #21 April 29 th, 2013 Programming Assignment #4 Due two weeks from today Any questions? How is it going? Where are we? We have two umbrella schemes for object recognition
More informationComputer Vision I - Filtering and Feature detection
Computer Vision I - Filtering and Feature detection Carsten Rother 30/10/2015 Computer Vision I: Basics of Image Processing Roadmap: Basics of Digital Image Processing Computer Vision I: Basics of Image
More informationMatching and Recognition in 3D. Based on slides by Tom Funkhouser and Misha Kazhdan
Matching and Recognition in 3D Based on slides by Tom Funkhouser and Misha Kazhdan From 2D to 3D: Some Things Easier No occlusion (but sometimes missing data instead) Segmenting objects often simpler From
More informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationDTU M.SC. - COURSE EXAM Revised Edition
Written test, 16 th of December 1999. Course name : 04250 - Digital Image Analysis Aids allowed : All usual aids Weighting : All questions are equally weighed. Name :...................................................
More informationBinary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5
Binary Image Processing CSE 152 Lecture 5 Announcements Homework 2 is due Apr 25, 11:59 PM Reading: Szeliski, Chapter 3 Image processing, Section 3.3 More neighborhood operators Binary System Summary 1.
More informationFeature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking
Feature descriptors Alain Pagani Prof. Didier Stricker Computer Vision: Object and People Tracking 1 Overview Previous lectures: Feature extraction Today: Gradiant/edge Points (Kanade-Tomasi + Harris)
More informationMultimedia Computing: Algorithms, Systems, and Applications: Edge Detection
Multimedia Computing: Algorithms, Systems, and Applications: Edge Detection By Dr. Yu Cao Department of Computer Science The University of Massachusetts Lowell Lowell, MA 01854, USA Part of the slides
More informationOBJECT DESCRIPTION - FEATURE EXTRACTION
INF 4300 Digital Image Analysis OBJECT DESCRIPTION - FEATURE EXTRACTION Fritz Albregtsen 1.10.011 F06 1.10.011 INF 4300 1 Today We go through G&W section 11. Boundary Descriptors G&W section 11.3 Regional
More informationCSI 4107 Image Information Retrieval
CSI 4107 Image Information Retrieval This slides are inspired by a tutorial on Medical Image Retrieval by Henning Müller and Thomas Deselaers, 2005-2006 1 Outline Introduction Content-based image retrieval
More informationTexture. Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image.
Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach: a set of texels in some regular or repeated pattern
More informationShort Run length Descriptor for Image Retrieval
CHAPTER -6 Short Run length Descriptor for Image Retrieval 6.1 Introduction In the recent years, growth of multimedia information from various sources has increased many folds. This has created the demand
More informationCHAPTER 4 TEXTURE FEATURE EXTRACTION
83 CHAPTER 4 TEXTURE FEATURE EXTRACTION This chapter deals with various feature extraction technique based on spatial, transform, edge and boundary, color, shape and texture features. A brief introduction
More informationTextural Features for Image Database Retrieval
Textural Features for Image Database Retrieval Selim Aksoy and Robert M. Haralick Intelligent Systems Laboratory Department of Electrical Engineering University of Washington Seattle, WA 98195-2500 {aksoy,haralick}@@isl.ee.washington.edu
More informationLecture 7: Most Common Edge Detectors
#1 Lecture 7: Most Common Edge Detectors Saad Bedros sbedros@umn.edu Edge Detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the
More informationAnno accademico 2006/2007. Davide Migliore
Robotica Anno accademico 6/7 Davide Migliore migliore@elet.polimi.it Today What is a feature? Some useful information The world of features: Detectors Edges detection Corners/Points detection Descriptors?!?!?
More informationImage Segmentation and Registration
Image Segmentation and Registration Dr. Christine Tanner (tanner@vision.ee.ethz.ch) Computer Vision Laboratory, ETH Zürich Dr. Verena Kaynig, Machine Learning Laboratory, ETH Zürich Outline Segmentation
More informationImage retrieval based on region shape similarity
Image retrieval based on region shape similarity Cheng Chang Liu Wenyin Hongjiang Zhang Microsoft Research China, 49 Zhichun Road, Beijing 8, China {wyliu, hjzhang}@microsoft.com ABSTRACT This paper presents
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
More informationSUMMARY PART I. What is texture? Uses for texture analysis. Computing texture images. Using variance estimates. INF 4300 Digital Image Analysis
INF 4 Digital Image Analysis SUMMARY PART I Fritz Albregtsen 4.. F 4.. INF 4 What is texture? Intuitively obvious, but no precise definition exists fine, coarse, grained, smooth etc Texture consists of
More informationFundamentals of Digital Image Processing
\L\.6 Gw.i Fundamentals of Digital Image Processing A Practical Approach with Examples in Matlab Chris Solomon School of Physical Sciences, University of Kent, Canterbury, UK Toby Breckon School of Engineering,
More informationCOLOR HISTOGRAM BASED MEDICAL IMAGE RETRIEVAL SYSTEM
COLOR HISTOGRAM BASED MEDICAL IMAGE RETRIEVAL SYSTEM A. S. JADHAV 1 & RASHMI V. PAWAR 2 1 ECE department, BLDEA s, Dr. P. G. Halakatti College of Engineering and Technology Bijapur, Karnataka, INDIA. 2
More informationSUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.
SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS. 1. 3D AIRWAY TUBE RECONSTRUCTION. RELATED TO FIGURE 1 AND STAR METHODS
More informationUNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences
UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 43 / INF 935 Digital image analysis Date: Thursday December 4, 4 Exam hours: 4.3-8.3 (4 hours) Number of pages: 6 pages Enclosures:
More information