Embed Doc
Copy Link
Readcast
Collections

CommentGo Back

DATA RETRIEVAL USING HAND DRAWN QUERIES

A.D.M. Kushwaha

A. Bhaskar

M. Jain

N. Gupta

S. Datta

Lecturer, Department of Electronics and Communication EngineeringBirla Institute of Technology, Jaipur (India)

Student, B.E. VIII Semester

Department of Electronics and Communication EngineeringBirla Institute of Technology, Jaipur (India)

ABSTRACT

The storage and retrieval of drawings either technical or free hand sketches, hand written notes, maps and texts is pretty cumbersome as the database could be very largeand remembering the name of every file is close toimpossible. In this paper we propose a method to retrievesketches stored in the form of multiple strokes, byextracting the shape information for each stroke and byconsidering the spatial relation between the strokes. Thespatial relation between the strokes can be used todetermine the stroke correspondence between the querysketch and the database sketch with matching score.Important features are extracted by Edge detectionalgorithm and hierarchically matched to the files in thedatabase.

1. INTRODUCTION

Pen-based devices such as Personal Digital Assistants(PDA) and electronic whiteboards have become moreand more common to the general public. The captureddatabase is stored in the form of sketch which consists of strokes that are sequences of coordinates of the pointssampled by the pen-based device. It is necessary to havean efficient sketch retrieval scheme in order to allowusers to search for relevant information from thedatabase. Retrieval in the sketch database is equivalent tofinding a stroke or multiple strokes from the databasethat are a good match to the query stroke(s). Sketchretrieval can be applied to various applications such asfree-form hand-drawings, hand-written or printed textand trademarks. Searching through a collection of free-form hand-drawings [1] provides a good motivation for sketch retrieval. The students can retrieve relevant lecturematerials from the hand-drawn sketch database bysketching a query drawing.

2. SYSTEM DESCRIPTIONFigure 1

: System diagram

2.1 Stroke Merging

A single stroke may sometimes be drawn as smaller broken strokes. In order to account for these differentstyles, stroke merging is performed to merge brokenstrokes based on the proximity of the end points. A strokeis first checked whether its two end points are close. If they are not close, then that stroke is considered as openstroke and it may be merged with another open stroke if the end point of one stroke is close to the end point of theother. For example, in Figure-2 (a), the two end points of one of the strokes are very close thus it is not an openstroke and the two strokes will not be

merged. On theother hand, in Figure-2 (b), the four strokes are openstrokes and the end point of one stroke is close to the end

point of another stroke, therefore these four strokes will be merged to become one stroke.

Figure2

: Stroke merging

2.2 Hierarchy Construction

This module is responsible for building a strokehierarchical representation for a sketch. The strokehierarchy describes the structural relationship betweenthe strokes in a sketch.

2.3 Sketch Simplification

The process of detecting and representing the shaded areaas a single unit is called sketch simplification [2,3]. Aregion consisting of a stroke with all its descendentstrokes is more likely to be a shaded region if the ink density in that area is high. A second order function ischosen as the decision boundary because the training datacannot be well separated by a linear function.After a region is decided as a shaded region, all thosestrokes forming this region will be replaced by a singlehyper-stroke keeping only features about that region inthe stroke hierarchy.

2.4 Feature Extraction

Three kinds of features are extracted from a sketch. The purpose of matching in three different feature spaces is toconsider various aspects of similarity including overallregion similarity, stroke similarity and spatial relationsimilarity [4]. Figure-3 shows the different features.

2.4.1

Hyper-Stroke Features

A hyper-stroke consists of a parent stroke with all itsdescendent strokes.

4.2

Stroke Features

Stroke features are geometric features extracted fromeach stroke. Different features are used to determine thelikelihood that each stroke falls in each basic shape: line,circle and polygon.

4.3

Bi-Stroke Features

A bi-stroke feature consists of stroke features of a pair of strokes within the same level together with the spatialrelation between them.

Figure 3

: Example features

2.5Hierarchical Matching

The similarity is evaluated in a top to bottom hierarchicalmanner i.e. the similarity scores are computed for thehyper-stroke features, stroke features and the bi-strokefeatures at each level of the query stroke hierarchy. Thefinal similarity score is computed as the weighted sum of the scores from the three feature spaces and the similarityscore from the stroke hierarchical structures [2].

3. CONCLUSION

This paper discusses a method for simplifying andretrieving hand-drawn sketches in a hierarchical manner.Sketch simplification allows the shaded region to berepresented by a single hyper-stroke. Experiments showthat the hierarchical matching outperforms some existingmethods in terms of the retrieval performance. The processing time can be improved by exploring other possibilities of evaluating the similarity of the strokehierarchy structures and algorithms.

REFERENCES

[1] Wing Ho Leung and Tsuhan Chen. User-IndependentRetrieval of Free-Form Hand-Drawn Sketches. In

Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP 2002)

,volume 2, pages 2029–2032, Orlando, Florida, USA,May 2002. IEEE Press.[2] Wing Ho Leung and Tsuhan Chen. Retrieval of Sketches Based on Spatial Relation Between Strokes. In

Proceedings of the IEEE International Conference on Image Processing (ICIP 2002)

, volume 1, pages 908– 911, Rochester, New York, USA, September 2002. IEEEPress.[3] D. and Tomkins A. “Temporal domain matching of hand-drawn pictorial queries”. In

Proc. of the SeventhConf. of The Intl. Graphonomics Society

, pp. 98-99.August 1995.