ART Extension for Description, Indexing and Retrieval of 3D Objects
|
|
|
- Aleesha Horton
- 9 years ago
- Views:
Transcription
1 ART Extension for Description, Indexing and Retrieval of 3D Objects Julien Ricard, David Coeurjolly, Atilla Baskurt LIRIS, FRE 2672 CNRS, Bat. Nautibus, 43 bd du novembre 98, Villeurbanne cedex, France Abstract This paper presents a new three-dimensional shape descriptor, called 3D angular radial transform. This descriptor is an extension of the 2D region base shape descriptor proposed by MPEG-7, the Angular Radial Transform (ART). We propose to generalize the ART in threedimensional to index 3D models.. Introduction The technical 3D model databases always grow up since a score of years and the start of the computed-aided design. The engineering laboratories and the design offices always increase the number of 3D solid objects and the current industrial estimates point to the existence of over 3 billion of CAD models [7]. The number of models requires a content-based mining with indexing and retrieval processes. The communities have made great strides in image management, but few works exist on 3D data. In the framework of a partnership with the car manufacturer, Renault, we investigate the possibilities to make a fast 3D descriptor to index a great technical database. The indexing of a huge 3D object database requires a small descriptor size and a small indexing and retrieval cost, to guarantee fast answers. To index 3D objects, 3D moment approaches exist and the spherical harmonic representation can be cited [3, 5]. On the 2D images, the MPEG-7 standard proposes to index images using a region based shape descriptor, the Angular Radial Transform (ART) [4, 6]. This shape descriptor has many properties: compact size, robust to noise and scaling, invariant to rotation, ability to describe complex objects. This paper presents a new 3D shape descriptor, the 3D Angular Radial Transform (3D ART). This descriptor is a generalization of the ART to 3D objects and we would like to save the 2D ART properties. The rest of the paper will be organized as follows: first, a survey on 3D shape matching is made, then, we present the 3D ART descriptor, finally, experiments and results are presented. 2. Survey of recent methods The moment approaches can be defined as projections of the function defining the object onto a set of characteristic functions to the given moment. These approaches are used in 2D pattern recognition with several 2D moments: geometrical, Legendre, Fourier-Mellin, Zernike, pseudo-zernike moments []. Some of these moments have been extending in 3D: 3D Fourier [2], 3D Wavelet [8], 3D Zernike [] and a spherical harmonic decomposition was used by Vranic and Saupe []. The spherical harmonic descriptor (SH) is an efficient method and is used in last section to estimate the proposed method. The SH descriptors were introduced by Funkhouser et al. [3]. After a centering step, the spherical harmonic descriptors decompose 3D shapes into irreducible set of rotation independent components by sample the three dimensional space as concentric shells, where the shells are defined by equal radial intervals. The spherical functions are decomposed as a sum of its first 6 harmonic components [5], analogous to a Fourier decomposition into different frequencies. Using the fact that rotations do not change the norm of the harmonic components, the signature of each spherical function is defined as a list of these 6 norms. Finally, these different signatures are combined to obtain a 32 6 signature for the 3D model. During the search of a database, the similarity of objects is calculated as the Euclidean distance between these vectors. 3. 3D Angular radial transform In this section, we generalize the MPEG-7 s angular radial transform to 3D space D ART definition To apply the 3D ART, the objects are represented in spherical coordinates where φ is the azimuthal angle in the xy-plane from the x-axis, θ is the polar angle from the z- axis and ρ is the radius from a point to the origin. The 3D
2 ART is a complex-orthogonal unitary transform defined on a unit sphere. The 3D ART coefficients are defined by: Z 2π Z π Z Vnm (ρ, θ, φ)f (ρ, θ, φ)ρdρdθdφ Fnmθ mφ = θ mφ () where Fnmθ mφ is an ART coefficient of order n, mθ and mφ, f (p, θ, φ) is a 3D object function in spherical coordinates and Vnmθ mφ (ρ, θ, φ) is a 3D ART basis function (BF). The 3D BF are separable along the angular and the two radial directions: Vnmθ mφ (ρ, θ, φ) = Amθ (θ)amφ (φ)rn (ρ) (2) As in 2D, the radial basis function is defined by a cosine function: n= Rn (ρ) = (3) 2 cos(πnρ) n 6= The angular basis functions are defined by exponential functions to achieve rotation invariance: Amθ (θ) Amφ (φ) = = 2π exp (2jmθ θ) 2π exp (jmφ φ) (4) Two angular basis functions are defined to keep the basis functions continuity along both θ and φ values. The values of the parameters n, mθ and mφ are trade-offs between efficiency and accuracy. The choice of the values of 3D ART parameters, n, mθ and mφ, is made by the compute of the Recall values for some different value of this parameters. On the technical database presented in section 4, we finally choose n = 3, mθ = 5 and mφ = 5. The real parts of the 3D ART BF are shown in figures and 2. Figure 2. Real parts of 3D ART BF. The similarity measure is computed using a L norm between two shapes described by the 3D ART descriptor: n mθ mφ d(q, I) = X kart 3DQ [i] ARRT 3DI [i]k (5) i= where Q and I represent a query object and object of the database and ART 3D is the array of 3D ART descriptor values Indexing process An important property of the 2D ART is the rotational invariance. The rotation representation in polar coordinates can be express as the sum of angular components: Rot (ρ, θ) α (ρ, θ + α) (6) Thus, that does not modify the function norm An (θ) and the ART descriptor. In 3D, unspecified rotations can not be expressed as the sum of constant values on the angular components. The exponential functions of Ami functions and the object descriptor are changed. The only rotations that are invariant by this description are the rotations around the z axis. These rotations do not modify the θ-components Figure. Real parts of 3D ART BF. 2
3 of the object points. Hence, the rotations can be expressed as a linear sum on the φ-components that is invariant. To solve that problem, we align the objects according to their principal axis. A Principal Components Analysis (PCA) is applied to obtain the principal directions of the objects and we align the objects along the z-axis. The alignment is made only along the z-axis. The Fig. 3 shows the indexation process. Hence, before we project the 3D image onto a BF, the objects are pre-processed as follows: first, the objects are discritized in a grid such that the voxels are separated into interior and exterior elements of the object. The discretization is used to compute the parameters of centering, scaling and alignment to the z-axis. Then, the discretized object is aligned according to these parameters: the 3D object is centered onto the center of gravity and scale up the object such that the object boundary touches the grid boundary. The pre-processing step makes the 3D ART be robust to translation and to scaling. Finally, the discretization is projected to the 3D ART BF to obtain the 3D ART coefficients. These coefficients are normalized and define the 3D shape descriptor. 4. Experiments Figure 3. Indexing process. Two set of experiments are made. First, we have to fix the parameter values: the number and the size of the discretization. Then, we evaluate the robustness of the method. Finally, the 3D ART is compared to the Spherical Harmonic descriptor (SH) [3, 5]. The tests are made on two 3D model databases: the Princeton Shape Benchmark [9] and a Renault database (Fig. 4 shows examples of 3D models). The Renault database is a technical database which contains mechanical models. Hence the shapes of difference models in a given class are similar. The Princeton database contains high level semantic classes where the objects in a same class are more heterogeneous. Figure 4. Example of 3D models: first row: Renault database, second row: Princeton Shape Benchmark. To fix the parameter values, the recall values are compared. Twelve values of the parameters n, m θ and m φ were evaluated. The Fig. 5.a shows that the better results are obtained for n = 3 and m θ = m φ = 5. The Fig. 5.b shows the same experiment with different values of the size of the discretization S. The better result are obtained on the technical database with the parameter value S = 64. We use this value in the rest of this work. This values is also suggested in [5] for the SH computation. To evaluate the robustness of the process, we distort a 3D object according to scaling, rotation, translation and noise. The table shows the maximum and the mean distance obtained for these four distortions. For each distortion, we create a set of 3D objects and for all the objects we computed the distance with the original objects. The translation has no effect on the distance, because the pre-processing centers and scales the objects. For the same reasons, the scale distortion has small effects due to digit artifacts, the maximum distance between the scaled objects are.6 when a mean distance between two objects of the same class is around 3. The obtained distances are smaller than intra-class distances and the classification will be the same one. The rotation distortion test is a set of rotations around the three axes with random angles and gives a maximum distance of.272 and a mean distance of.75. The noise distortion is a random move of vertices of the object; each vertex is moved of a random Gaussian vector. This distance is a percentage of the object size. If this distance is higher than % the surface of the object is very distort but the similarity measure is.6 and the object are still well classified. The Fig. 6 shows distorted objects by the noise distortions. 3
4 Distort Translation Scale Rotation Noise Max dist Mean dist Table. Distance obtained for several distortions. Figure 5. Recall values to set up parameters. Figure 6. Example of noise distortions for three distance values: %, 5% and % Figure 7. Recall values on Princeton and Renault databases. 5. Conclusion A second experiment is set up to compare the 3D ART to the Spherical Harmonic descriptor (SH). This experiment was made on the two models database. The figures 7.a and 7.b show the recall values for SH and 3D ART descriptors on the two databases. On the Princeton database (Fig. 7.a), the SH method gives a better description than the ART method. The results on the Renault database are better with ART (Fig. 7.b). This shows that description ART gives better results when the objects of a same class are similar. The cost of computation and the size of the descriptor are also significant to compare the methods (Table 2). The 3D ART indexing computation time is 2.5 times less than a SH indexing and the descriptor size and the cost of the similarity measure is approximately 7.8 times less. These differences are due to the fact that the ART does not make a frequency transformation and stays in a real space whereas the spherical harmonic descriptor makes a frequency transformation. This paper proposes a new 3D shape descriptor, the 3D ART. This 3D transformation and the indexing process make robust 3D shape descriptors. The 3D shape descriptor is robust to translation, scaling, multi representation (remeshing, weak distortions), noise and 3D rotation. The proposed shape descriptor fulfills the requirements induced by technical model database analysis: robustness and accuracy of the indexing and retrieval processes and fast similarity computation. As future work, we plan to investigate the possibilities to make a 2D/3D retrieval with the 3D ART. References [] M. Elad, A. Tal, and S. Ar. 3d zemike moments and zernike affine invariants for 3d image analysis. In IIth Scandinavian Conf. on Image Analysis, 999. [2] M. Elad, A. Tal, and S. Ar. Content based retrieval of vrml objects - an iterative and interactive approach. In The 4
5 Indexing time Descriptor size SH l 544 3D ART 4 74 Table 2. Size (in floating numbers) and indexing time (in seconds) comparison between 3D ART and spherical harmonic representation. Sixth Eurographics Workshop in Multimedia, pages 97 8, 2. [3] T. Funkhouser, P. Min, M. Kazhdan, J. Chen, A. Halderman, D. Dobkin, and D. Jacobs. A search engine for 3d models. ACM Transactions on Graphics, 22():83 5, Jan. 23. [4] S. Jeannin. Mpeg-7 Visual part of experimentation Model Version 9.. In ISO/IEC JTC/SC29/WG/N394, 55th Mpeg Meeting, Pisa, Jan. 2. [5] M. Kazhdan, T. Funkhouser, and S. Rusinkiewicz. Rotation invariant spherical harmonic representation of 3d shape descriptors. Symposium on Geometry Processing, June 23. [6] W.-Y. Kim and Y.-S. Kim. A new region-based shape descriptor. In TR 5-, Pisa, Dec [7] D. McWherter, M. Peabody, and W. C. Regli. Clustering techniques for databases of CAD models. Technical report, Drexel University, Sept. 2. [8] E. Paquet and M. Rioux. Influence of pose on 3-d shape classification. In SAE International Conference on Digital Human Modeling for Design and Engineering, Dearborn, MI, USA, June 2. [9] Princeton shape benchmark. benchmark/index.cgi. [] C.-H. Teh and R. T. Chin. On image analysis by the methods of moments. IEEE Trans. on Pattern Analysis and Machine Intelligence, (4):496 53, 988. [] D. V. Vranic and D. Saupe. Description of 3d-shape using a complex function on the sphere. In Proceedings of the IEEE International Conference on Multimedia and Expo (ICME 22), Lausanne, Switzerland, August 22. 5
TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS
TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS D.V. Vranić, D. Saupe, and J. Richter Department of Computer Science, University of Leipzig, Leipzig, Germany phone +49 (341)
Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches
Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches PhD Thesis by Payam Birjandi Director: Prof. Mihai Datcu Problematic
11.1. Objectives. Component Form of a Vector. Component Form of a Vector. Component Form of a Vector. Vectors and the Geometry of Space
11 Vectors and the Geometry of Space 11.1 Vectors in the Plane Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. 2 Objectives! Write the component form of
Classifying Manipulation Primitives from Visual Data
Classifying Manipulation Primitives from Visual Data Sandy Huang and Dylan Hadfield-Menell Abstract One approach to learning from demonstrations in robotics is to make use of a classifier to predict if
Recovering Primitives in 3D CAD meshes
Recovering Primitives in 3D CAD meshes Roseline Bénière a,c, Gérard Subsol a, Gilles Gesquière b, François Le Breton c and William Puech a a LIRMM, Univ. Montpellier 2, CNRS, 161 rue Ada, 34392, France;
Point Cloud Encoding for 3D Building Model Retrieval
1 Point Cloud Encoding for 3D Building Model Retrieval Jyun-Yuan Chen, Chao-Hung Lin, Po-Chi Hsu, Chung-Hao Chen Abstract An increasing number of three-dimensional (3D) building models are being made available
CS 534: Computer Vision 3D Model-based recognition
CS 534: Computer Vision 3D Model-based recognition Ahmed Elgammal Dept of Computer Science CS 534 3D Model-based Vision - 1 High Level Vision Object Recognition: What it means? Two main recognition tasks:!
Heat Kernel Signature
INTODUCTION Heat Kernel Signature Thomas Hörmann Informatics - Technische Universität ünchen Abstract Due to the increasing computational power and new low cost depth cameras the analysis of 3D shapes
Categorical Data Visualization and Clustering Using Subjective Factors
Categorical Data Visualization and Clustering Using Subjective Factors Chia-Hui Chang and Zhi-Kai Ding Department of Computer Science and Information Engineering, National Central University, Chung-Li,
Model Repair. Leif Kobbelt RWTH Aachen University )NPUT $ATA 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS !NALYSIS OF SURFACE QUALITY
)NPUT $ATA 2ANGE 3CAN #!$ 4OMOGRAPHY 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS!NALYSIS OF SURFACE QUALITY 3URFACE SMOOTHING FOR NOISE REMOVAL 0ARAMETERIZATION 3IMPLIFICATION FOR COMPLEXITY REDUCTION
Visualization of Large Font Databases
Visualization of Large Font Databases Martin Solli and Reiner Lenz Linköping University, Sweden ITN, Campus Norrköping, Linköping University, 60174 Norrköping, Sweden [email protected], [email protected]
APPLYING COMPUTER VISION TECHNIQUES TO TOPOGRAPHIC OBJECTS
APPLYING COMPUTER VISION TECHNIQUES TO TOPOGRAPHIC OBJECTS Laura Keyes, Adam Winstanley Department of Computer Science National University of Ireland Maynooth Co. Kildare, Ireland [email protected], [email protected]
Notes on the representational possibilities of projective quadrics in four dimensions
bacso 2006/6/22 18:13 page 167 #1 4/1 (2006), 167 177 [email protected] http://tmcs.math.klte.hu Notes on the representational possibilities of projective quadrics in four dimensions Sándor Bácsó and
Towards Online Recognition of Handwritten Mathematics
Towards Online Recognition of Handwritten Mathematics Vadim Mazalov, joint work with Oleg Golubitsky and Stephen M. Watt Ontario Research Centre for Computer Algebra Department of Computer Science Western
Support Vector Machines with Clustering for Training with Very Large Datasets
Support Vector Machines with Clustering for Training with Very Large Datasets Theodoros Evgeniou Technology Management INSEAD Bd de Constance, Fontainebleau 77300, France [email protected] Massimiliano
Metrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS
DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS 1 AND ALGORITHMS Chiara Renso KDD-LAB ISTI- CNR, Pisa, Italy WHAT IS CLUSTER ANALYSIS? Finding groups of objects such that the objects in a group will be similar
Expression Invariant 3D Face Recognition with a Morphable Model
Expression Invariant 3D Face Recognition with a Morphable Model Brian Amberg [email protected] Reinhard Knothe [email protected] Thomas Vetter [email protected] Abstract We present an
The Scientific Data Mining Process
Chapter 4 The Scientific Data Mining Process When I use a word, Humpty Dumpty said, in rather a scornful tone, it means just what I choose it to mean neither more nor less. Lewis Carroll [87, p. 214] In
Part-Based Recognition
Part-Based Recognition Benedict Brown CS597D, Fall 2003 Princeton University CS 597D, Part-Based Recognition p. 1/32 Introduction Many objects are made up of parts It s presumably easier to identify simple
521493S Computer Graphics. Exercise 2 & course schedule change
521493S Computer Graphics Exercise 2 & course schedule change Course Schedule Change Lecture from Wednesday 31th of March is moved to Tuesday 30th of March at 16-18 in TS128 Question 2.1 Given two nonparallel,
3D Human Face Recognition Using Point Signature
3D Human Face Recognition Using Point Signature Chin-Seng Chua, Feng Han, Yeong-Khing Ho School of Electrical and Electronic Engineering Nanyang Technological University, Singapore 639798 [email protected]
Simultaneous Gamma Correction and Registration in the Frequency Domain
Simultaneous Gamma Correction and Registration in the Frequency Domain Alexander Wong [email protected] William Bishop [email protected] Department of Electrical and Computer Engineering University
College of Engineering
College of Engineering Drexel E-Repository and Archive (idea) http://idea.library.drexel.edu/ Drexel University Libraries www.library.drexel.edu The following item is made available as a courtesy to scholars
SIGNATURE VERIFICATION
SIGNATURE VERIFICATION Dr. H.B.Kekre, Dr. Dhirendra Mishra, Ms. Shilpa Buddhadev, Ms. Bhagyashree Mall, Mr. Gaurav Jangid, Ms. Nikita Lakhotia Computer engineering Department, MPSTME, NMIMS University
Fast and Robust Normal Estimation for Point Clouds with Sharp Features
1/37 Fast and Robust Normal Estimation for Point Clouds with Sharp Features Alexandre Boulch & Renaud Marlet University Paris-Est, LIGM (UMR CNRS), Ecole des Ponts ParisTech Symposium on Geometry Processing
Object Recognition and Template Matching
Object Recognition and Template Matching Template Matching A template is a small image (sub-image) The goal is to find occurrences of this template in a larger image That is, you want to find matches of
Class-specific Sparse Coding for Learning of Object Representations
Class-specific Sparse Coding for Learning of Object Representations Stephan Hasler, Heiko Wersing, and Edgar Körner Honda Research Institute Europe GmbH Carl-Legien-Str. 30, 63073 Offenbach am Main, Germany
A Genetic Algorithm-Evolved 3D Point Cloud Descriptor
A Genetic Algorithm-Evolved 3D Point Cloud Descriptor Dominik Wȩgrzyn and Luís A. Alexandre IT - Instituto de Telecomunicações Dept. of Computer Science, Univ. Beira Interior, 6200-001 Covilhã, Portugal
EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set
EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set Amhmed A. Bhih School of Electrical and Electronic Engineering Princy Johnson School of Electrical and Electronic Engineering Martin
Prentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
HAND GESTURE BASEDOPERATINGSYSTEM CONTROL
HAND GESTURE BASEDOPERATINGSYSTEM CONTROL Garkal Bramhraj 1, palve Atul 2, Ghule Supriya 3, Misal sonali 4 1 Garkal Bramhraj mahadeo, 2 Palve Atule Vasant, 3 Ghule Supriya Shivram, 4 Misal Sonali Babasaheb,
Projection Center Calibration for a Co-located Projector Camera System
Projection Center Calibration for a Co-located Camera System Toshiyuki Amano Department of Computer and Communication Science Faculty of Systems Engineering, Wakayama University Sakaedani 930, Wakayama,
Medical Information Management & Mining. You Chen Jan,15, 2013 [email protected]
Medical Information Management & Mining You Chen Jan,15, 2013 [email protected] 1 Trees Building Materials Trees cannot be used to build a house directly. How can we transform trees to building materials?
Geometric Camera Parameters
Geometric Camera Parameters What assumptions have we made so far? -All equations we have derived for far are written in the camera reference frames. -These equations are valid only when: () all distances
Normalisation of 3D Face Data
Normalisation of 3D Face Data Chris McCool, George Mamic, Clinton Fookes and Sridha Sridharan Image and Video Research Laboratory Queensland University of Technology, 2 George Street, Brisbane, Australia,
Document Image Retrieval using Signatures as Queries
Document Image Retrieval using Signatures as Queries Sargur N. Srihari, Shravya Shetty, Siyuan Chen, Harish Srinivasan, Chen Huang CEDAR, University at Buffalo(SUNY) Amherst, New York 14228 Gady Agam and
Solving Geometric Problems with the Rotating Calipers *
Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of
Center of Gravity. We touched on this briefly in chapter 7! x 2
Center of Gravity We touched on this briefly in chapter 7! x 1 x 2 cm m 1 m 2 This was for what is known as discrete objects. Discrete refers to the fact that the two objects separated and individual.
Two vectors are equal if they have the same length and direction. They do not
Vectors define vectors Some physical quantities, such as temperature, length, and mass, can be specified by a single number called a scalar. Other physical quantities, such as force and velocity, must
Active Learning SVM for Blogs recommendation
Active Learning SVM for Blogs recommendation Xin Guan Computer Science, George Mason University Ⅰ.Introduction In the DH Now website, they try to review a big amount of blogs and articles and find the
Robust Blind Watermarking Mechanism For Point Sampled Geometry
Robust Blind Watermarking Mechanism For Point Sampled Geometry Parag Agarwal Balakrishnan Prabhakaran Department of Computer Science, University of Texas at Dallas MS EC 31, PO Box 830688, Richardson,
TWO-DIMENSIONAL TRANSFORMATION
CHAPTER 2 TWO-DIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization
Module II: Multimedia Data Mining
ALMA MATER STUDIORUM - UNIVERSITÀ DI BOLOGNA Module II: Multimedia Data Mining Laurea Magistrale in Ingegneria Informatica University of Bologna Multimedia Data Retrieval Home page: http://www-db.disi.unibo.it/courses/dm/
Euler Vector: A Combinatorial Signature for Gray-Tone Images
Euler Vector: A Combinatorial Signature for Gray-Tone Images Arijit Bishnu, Bhargab B. Bhattacharya y, Malay K. Kundu, C. A. Murthy fbishnu t, bhargab, malay, [email protected] Indian Statistical Institute,
Data Exploration and Preprocessing. Data Mining and Text Mining (UIC 583 @ Politecnico di Milano)
Data Exploration and Preprocessing Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", The Morgan Kaufmann
Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.
Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 14 Previous Lecture 13 Indexes for Multimedia Data 13.1
Solutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
Classification of Fingerprints. Sarat C. Dass Department of Statistics & Probability
Classification of Fingerprints Sarat C. Dass Department of Statistics & Probability Fingerprint Classification Fingerprint classification is a coarse level partitioning of a fingerprint database into smaller
Open issues and research trends in Content-based Image Retrieval
Open issues and research trends in Content-based Image Retrieval Raimondo Schettini DISCo Universita di Milano Bicocca [email protected] www.disco.unimib.it/schettini/ IEEE Signal Processing Society
Linear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
ScienceDirect. Brain Image Classification using Learning Machine Approach and Brain Structure Analysis
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 50 (2015 ) 388 394 2nd International Symposium on Big Data and Cloud Computing (ISBCC 15) Brain Image Classification using
ECE 533 Project Report Ashish Dhawan Aditi R. Ganesan
Handwritten Signature Verification ECE 533 Project Report by Ashish Dhawan Aditi R. Ganesan Contents 1. Abstract 3. 2. Introduction 4. 3. Approach 6. 4. Pre-processing 8. 5. Feature Extraction 9. 6. Verification
Algebra 1 2008. Academic Content Standards Grade Eight and Grade Nine Ohio. Grade Eight. Number, Number Sense and Operations Standard
Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express
Java Modules for Time Series Analysis
Java Modules for Time Series Analysis Agenda Clustering Non-normal distributions Multifactor modeling Implied ratings Time series prediction 1. Clustering + Cluster 1 Synthetic Clustering + Time series
Local features and matching. Image classification & object localization
Overview Instance level search Local features and matching Efficient visual recognition Image classification & object localization Category recognition Image classification: assigning a class label to
5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal
GPR Polarization Simulation with 3D HO FDTD
Progress In Electromagnetics Research Symposium Proceedings, Xi an, China, March 6, 00 999 GPR Polarization Simulation with 3D HO FDTD Jing Li, Zhao-Fa Zeng,, Ling Huang, and Fengshan Liu College of Geoexploration
Modeling by Example. Abstract. 1 Introduction. 2 Related Work
Modeling by Example Thomas Funkhouser, 1 Michael Kazhdan, 1 Philip Shilane, 1 Patrick Min, 2 William Kiefer, 1 Ayellet Tal, 3 Szymon Rusinkiewicz, 1 and David Dobkin 1 1 Princeton University 2 Utrecht
How To Fix Out Of Focus And Blur Images With A Dynamic Template Matching Algorithm
IJSTE - International Journal of Science Technology & Engineering Volume 1 Issue 10 April 2015 ISSN (online): 2349-784X Image Estimation Algorithm for Out of Focus and Blur Images to Retrieve the Barcode
Resolution Enhancement of Photogrammetric Digital Images
DICTA2002: Digital Image Computing Techniques and Applications, 21--22 January 2002, Melbourne, Australia 1 Resolution Enhancement of Photogrammetric Digital Images John G. FRYER and Gabriele SCARMANA
Lecture 3: Coordinate Systems and Transformations
Lecture 3: Coordinate Systems and Transformations Topics: 1. Coordinate systems and frames 2. Change of frames 3. Affine transformations 4. Rotation, translation, scaling, and shear 5. Rotation about an
2.1 Three Dimensional Curves and Surfaces
. Three Dimensional Curves and Surfaces.. Parametric Equation of a Line An line in two- or three-dimensional space can be uniquel specified b a point on the line and a vector parallel to the line. The
Big Data: Image & Video Analytics
Big Data: Image & Video Analytics How it could support Archiving & Indexing & Searching Dieter Haas, IBM Deutschland GmbH The Big Data Wave 60% of internet traffic is multimedia content (images and videos)
So which is the best?
Manifold Learning Techniques: So which is the best? Todd Wittman Math 8600: Geometric Data Analysis Instructor: Gilad Lerman Spring 2005 Note: This presentation does not contain information on LTSA, which
Section 11.1: Vectors in the Plane. Suggested Problems: 1, 5, 9, 17, 23, 25-37, 40, 42, 44, 45, 47, 50
Section 11.1: Vectors in the Plane Page 779 Suggested Problems: 1, 5, 9, 17, 3, 5-37, 40, 4, 44, 45, 47, 50 Determine whether the following vectors a and b are perpendicular. 5) a = 6, 0, b = 0, 7 Recall
BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES
BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 123 CHAPTER 7 BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES 7.1 Introduction Even though using SVM presents
Biometric Authentication using Online Signatures
Biometric Authentication using Online Signatures Alisher Kholmatov and Berrin Yanikoglu [email protected], [email protected] http://fens.sabanciuniv.edu Sabanci University, Tuzla, Istanbul,
11. Rotation Translational Motion: Rotational Motion:
11. Rotation Translational Motion: Motion of the center of mass of an object from one position to another. All the motion discussed so far belongs to this category, except uniform circular motion. Rotational
New Hash Function Construction for Textual and Geometric Data Retrieval
Latest Trends on Computers, Vol., pp.483-489, ISBN 978-96-474-3-4, ISSN 79-45, CSCC conference, Corfu, Greece, New Hash Function Construction for Textual and Geometric Data Retrieval Václav Skala, Jan
Lecture L22-2D Rigid Body Dynamics: Work and Energy
J. Peraire, S. Widnall 6.07 Dynamics Fall 008 Version.0 Lecture L - D Rigid Body Dynamics: Work and Energy In this lecture, we will revisit the principle of work and energy introduced in lecture L-3 for
CITY UNIVERSITY OF HONG KONG 香 港 城 市 大 學. Self-Organizing Map: Visualization and Data Handling 自 組 織 神 經 網 絡 : 可 視 化 和 數 據 處 理
CITY UNIVERSITY OF HONG KONG 香 港 城 市 大 學 Self-Organizing Map: Visualization and Data Handling 自 組 織 神 經 網 絡 : 可 視 化 和 數 據 處 理 Submitted to Department of Electronic Engineering 電 子 工 程 學 系 in Partial Fulfillment
Face detection is a process of localizing and extracting the face region from the
Chapter 4 FACE NORMALIZATION 4.1 INTRODUCTION Face detection is a process of localizing and extracting the face region from the background. The detected face varies in rotation, brightness, size, etc.
Probabilistic Latent Semantic Analysis (plsa)
Probabilistic Latent Semantic Analysis (plsa) SS 2008 Bayesian Networks Multimedia Computing, Universität Augsburg [email protected] www.multimedia-computing.{de,org} References
Computational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,
PASSIVE DRIVER GAZE TRACKING WITH ACTIVE APPEARANCE MODELS
PASSIVE DRIVER GAZE TRACKING WITH ACTIVE APPEARANCE MODELS Takahiro Ishikawa Research Laboratories, DENSO CORPORATION Nisshin, Aichi, Japan Tel: +81 (561) 75-1616, Fax: +81 (561) 75-1193 Email: [email protected]
Interactive person re-identification in TV series
Interactive person re-identification in TV series Mika Fischer Hazım Kemal Ekenel Rainer Stiefelhagen CV:HCI lab, Karlsruhe Institute of Technology Adenauerring 2, 76131 Karlsruhe, Germany E-mail: {mika.fischer,ekenel,rainer.stiefelhagen}@kit.edu
Opto-Mechanical I/F for ANSYS
Abstract Opto-Mechanical I/F for ANSYS Victor Genberg, Keith Doyle, Gregory Michels Sigmadyne, Inc., 803 West Ave, Rochester, NY 14611 [email protected] Thermal and structural output from ANSYS is
Component Ordering in Independent Component Analysis Based on Data Power
Component Ordering in Independent Component Analysis Based on Data Power Anne Hendrikse Raymond Veldhuis University of Twente University of Twente Fac. EEMCS, Signals and Systems Group Fac. EEMCS, Signals
VRSPATIAL: DESIGNING SPATIAL MECHANISMS USING VIRTUAL REALITY
Proceedings of DETC 02 ASME 2002 Design Technical Conferences and Computers and Information in Conference Montreal, Canada, September 29-October 2, 2002 DETC2002/ MECH-34377 VRSPATIAL: DESIGNING SPATIAL
Volumes of Revolution
Mathematics Volumes of Revolution About this Lesson This lesson provides students with a physical method to visualize -dimensional solids and a specific procedure to sketch a solid of revolution. Students
Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 269 Class Project Report
Automatic 3D Reconstruction via Object Detection and 3D Transformable Model Matching CS 69 Class Project Report Junhua Mao and Lunbo Xu University of California, Los Angeles [email protected] and lunbo
A STUDY REGARDING INTER DOMAIN LINKED DOCUMENTS SIMILARITY AND THEIR CONSEQUENT BOUNCE RATE
STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LIX, Number 1, 2014 A STUDY REGARDING INTER DOMAIN LINKED DOCUMENTS SIMILARITY AND THEIR CONSEQUENT BOUNCE RATE DIANA HALIŢĂ AND DARIUS BUFNEA Abstract. Then
We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
Impact of Boolean factorization as preprocessing methods for classification of Boolean data
Impact of Boolean factorization as preprocessing methods for classification of Boolean data Radim Belohlavek, Jan Outrata, Martin Trnecka Data Analysis and Modeling Lab (DAMOL) Dept. Computer Science,
