Preview

Template Matching

Powerful Essays
Open Document
Open Document
1267 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Template Matching
248

CHAPTER 7 Image Enhancement and Analysis

FIGURE 7.3–21 Region grown from seed location (328, 341) with threshold 0.2.

out the flower. (Performed using MATLAB Central routine regiongrowing.m provided by Dirk-Jan Kroon.)

Several seeds can be used in region growing to segment multiple objects or parts of one object. Significant interaction may be required to get the desired results. As with clustering using K-means, pixel values can be replaced by textures on small blocks to get a segmentation based on local texture in addition to pixel values. Similarly, RGB color images can be treated using a distance in the relevant color space. If segmenting for human viewing, then the more perceptually uniform color space CIELAB may be used.

7.4 OBJECT DETECTION
We now briefly look at two techniques for finding objects in images. First, we look at segmentation of a given image into a small number of regions based on a distance threshold. Then we look at a matched filtering approach to detecting objects, called template matching.

Object Segmentation
We can extend the region-growing algorithm to detect objects in color images. The basic algorithm must be modified to compute distance on the YUV or Lab coordinates. In addition, a raster scan of the pixels can detect undefined pixels in an outer loop added around the preceding algorithm. Each pass through this outer loop will define a separate region, and the threshold T will determine the number of regions

7.4 Object Detection

249

found. Additionally, some small regions are formed due to noise in the image. These must be merged into their nearest neighbors, in a YUV distance-defined region. Example 7.4–1: Object Segmentation5
In this example, an object detection strategy was applied to a frame from the Miss America color video test clip of size 360 × 288 luma or Y pixels, with the U and V pixels subsampled by 2 × 2. An appropriate Euclidean distance was formed based on the YUV pixel values. The threshold was

You May Also Find These Documents Helpful

  • Good Essays

    In 1992, Dallmeier presented the world’s first video sensor with digital image storage. At this time, the idea of using digital image storage in video surveillance wasn’t taken seriously but Dallmeier saw its benefits and potential. In retrospect, this idea has proved to be a groundbreaking development, one that has revolutionized video surveillance. Today we cannot imagine the security field without the use of digital technology.Panomera® is a completely novel camera technology, which was specially developed for the all-encompassing video surveillance of expansive areas. With Panomera®, huge widths, as well as areas with large distances can be displayed with a completely new resolution quality, in real time and at high frame rates of up to 30 fps.While other video analysis systems are limited to pure motion detection, Dallmeier uses SEDOR® – an abbreviation for “Self Learning Event Detector” – a self-learning analysis system. Using intelligent picture analysis algorithms and self-learning detection systems a variety of different situations can be automatically recognised even in complex scenes. For example, object sizes, directions of movement and speeds can be analysed. Environmental influences like rain, snow or branches blowing in the wind are filtered out using special algorithms.…

    • 471 Words
    • 2 Pages
    Good Essays
  • Best Essays

    Mgt 501 Case 1

    • 1731 Words
    • 7 Pages

    According to an article from the University of Southern California on segmentation, targeting and positioning,…

    • 1731 Words
    • 7 Pages
    Best Essays
  • Good Essays

    Spatial Analysis

    • 453 Words
    • 2 Pages

    This step is a small variation of the method; we have only included more configurations (fig. 20). Some of these configurations contain small loops; they are recognized by taking as first candidates, among the detected loops, those whose area is smaller than a given threshold, and by matching these candidates with the models. The other configurations are searched for by looking for a single line aligned with the contours of a room loop.…

    • 453 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    | |Cheapest because of easy implementation and |Compared to the 2007 numbers this segmentation |Compared to the 2007 numbers this |…

    • 683 Words
    • 3 Pages
    Powerful Essays
  • Powerful Essays

    DATA CLUSTERING

    • 1179 Words
    • 8 Pages

    Clustering is in the eye of the beholder.in the other word there is not accurately correct…

    • 1179 Words
    • 8 Pages
    Powerful Essays
  • Good Essays

    Detection – Detection of a crime or otherwise unauthorised activity whether early detection or during the fact is most effectively achieved through the use of CCTV and Manned Guarding where keen observation skills are paramount.…

    • 1031 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Pre-operational 2 – 7 classifies objects by a single feature, for example groups together the same colour building blocks.…

    • 336 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    This experiment required chicken egg image are taken using egg candling box by smartphone camera. To identify chicken egg image some image processing method are used, which are GrabCut, convert RGB image to grayscale 8-bit, median filter, P-Tile segmentation, and morphology. Chicken egg image are classified by measuring digital image and feature extraction…

    • 815 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Web Analytics

    • 1128 Words
    • 5 Pages

    Advanced Segmentation: You can trim and compile your data in the way you want. This helps you to visualize data the way you want. In our case we might want to see which…

    • 1128 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    References: 1. Andrienko, G., and Andrienko, N.: Intelligent Visualization and Dynamic Manipulation: Two Complementary Instruments to Support Data Exploration with GIS. In: Proceedings of AVI’98: Advanced Visual Interfaces Int. Working Conference (L’Aquila Italy, May 24-27, 1998), ACM Press (1998) 66-75 2. Brodley, C.: Addressing the Selective Superiority Problem: Automatic Algorithm / Model Class Selection. In: Machine Learning: Proceedings of the 10th International Conference, University of Massachusetts, Amherst, June 27-29, 1993. San Mateo, Calif.: Morgan Kaufmann (1993) 17-24 3. Cook, D., Symanzik, J., Majure, J.J., and Cressie, N.: Dynamic Graphics in a GIS: More Examples Using Linked Software. Computers and Geosciences, 23 (1997) 371-385 4. Gama, J. and Brazdil, P.: Characterization of Classification Algorithms. In: Progress in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Vol.990. Springer-Verlag: Berlin (1995) 189-200 5. Gebhardt, F.: Finding Spatial Clusters. In: Principles of Data Mining and Knowledge Discovery PKDD97, Lecture Notes in Computer Science, Vol.1263. SpringerVerlag: Berlin (1997) 277-287 6. Fayyad, U., Piatetsky-Shapiro, G., and Smyth, P.: The KDD Process for Extracting Useful Knowledge from Volumes of Data. Communications of the ACM, 39 (1996), 27-34 7. John, G.H.: Enhancements to the Data Mining Process. PhD dissertation, Stanford University. Available at the URL http://robotics.stanford.edu/∼gjohn/ (1997) 8. Kodratoff, Y.: From the art of KDD to the science of KDD. Research report 1096, Universite de Paris-sud (1997) 9. Koperski, K., Han, J., and Stefanovic, N.: An Efficient Two-Step Method for Classification of Spatial Data. In: Proceedings SDH98, Vancouver, Canada: International Geographical Union (1998) 45-54 10. MacDougall, E.B.: Exploratory Analysis, Dynamic Statistical Visualization, and Geographic Information Systems. Cartography and Geographic Information Systems, 19 (1992) 237-246 11. Wrobel, S., Wettschereck, D., Sommer, E., and Emde, W.: Extensibility in Data Mining Systems. In Proceedings of KDD96 2nd International Conference on Knowledge Discovery and Data Mining. AAAI Press (1996) 214-219…

    • 3691 Words
    • 15 Pages
    Powerful Essays
  • Powerful Essays

    Network Architecture

    • 2272 Words
    • 10 Pages

    [3] Knorr and Ng, Extraction of Spatial Proximity Patterns by Concept Generalization, proceedings second international conference of KDD, pp. 347 – 350, aug 1996.…

    • 2272 Words
    • 10 Pages
    Powerful Essays
  • Powerful Essays

    In medical imaging, segmentation of images plays a vital role in stages which occur before implementing object recognition. The critical problem is finding the tumor location automatically and later finding its boundary precisely. An important factor in detecting tumor from healthy tissues is the difference in intensity level. However, relying only on the intensity level is usually not enough. The spatial information available in clusters of pixels that form a tumor should also be used in the detection process.…

    • 7723 Words
    • 31 Pages
    Powerful Essays
  • Good Essays

    Brain Tumar Detection

    • 5492 Words
    • 36 Pages

    In this project our main objective is to detect the tumor and calculate its area based on…

    • 5492 Words
    • 36 Pages
    Good Essays
  • Good Essays

    Mathematical morphology (MM) is a theory and technique for the analysis and processing of geometrical structures, based on set theory, lattice theory, topology, and random functions. MM is most commonly applied to digital images, but it can be employed as well on graphs, surface meshes, solids, and many other spatial structures. Topological and geometrical continuous-space concepts such as size, shape, convexity, connectivity, and geodesic distance, were introduced by MM on both continuous and discrete spaces. MM is also the foundation of morphological image processing, which consists of a set of operators that transform images according to the above characterizations. MM was originally developed for binary images, and was later extended to grayscale functions and images. The subsequent generalization to complete lattices is widely accepted today as MM's theoretical foundation.…

    • 566 Words
    • 3 Pages
    Good Essays

Related Topics