The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The skeleton is an efficient and complete shape descriptor often used for matching. However, existing skeleton-based shape matching methods are computationally intensive. To reduce the algorithmic complexity, we propose to exploit the natural hierarchy of the skeleton. The aim is to quantify the importance of skeleton branches to guide the shape matching algorithm, in order to match branches having...
Progress in shape based object recognition methods involving either the boundary based or region based methods and their relative popularity is presented. Prevalence of boundary in almost of types and their shapes discriminating features are discussed. Limitations to boundary based methods viz. sensitivity to noise and variations are detailed. The present paper proposes to overcome these limitations...
As an increasing number of digital images are generated, a demand for an efficient and effective image retrieval mechanisms grows. In this work, we present a new skeleton-based shape retrieval algorithm, which starts by drawing circles of increasing radius around skeleton points. Since each skeleton corresponds to the center of a maximally inscribed circle, this process results in circles that are...
Effective information retrieval on handwritten document images has always been a challenging task, especially historical ones. In the paper, we propose a coarse-to-fine handwritten word spotting approach based on graph representation. The presented model comprises both the topological and morphological signatures of the handwriting. Skeleton-based graphs with the Shape Context labelled vertexes are...
As an increasing number of digital images are generated, a demand for an efficient and effective image retrieval mechanisms grows. In this work, we present a new skeleton-based shape retrieval algorithm, which starts by drawing circles of increasing radius around skeleton points. Since each skeleton corresponds to the center of a maximally inscribed circle, this process results in circles that are...
One of the fundamental issues of human and computational cognitive psychology is pattern or shape recognition. Various applications in image processing and computer vision rely on skeleton-like shape features A possible technique for extracting these feautures is thinning. Although the majority of 2D thinning algorithms work on digital pictures sampled on the conventional square grid, the role of...
With specific flora and fauna, regional landscapes and forests constitute an important part of the cultural heritage. Several natural environments have already been classified as national or regional parks. The UNESCO World Heritage covers 13% of the protected forests in the world. Thus, preserving those sites represents a crucial issue. Such a safeguarding involves a detailed knowledge of the sites...
While the skeleton of a 2D shape corresponds to a planar graph, its encoding by usual graph data structures does not allow to capture its planar properties. Graph kernels may be defined on graph's encoding of the skeleton in order to define a similarity measure between shapes. Such graph kernels are usually based on a decomposition of graphs into bags of walks or trails. These linear patterns do not...
Thinning is a process of reducing an object in a digital image to the minimum size necessary for machine recognition of that object. Efficient and reliable thinning of image patterns is essential to a variety of applications in the field of image analysis and recognition system. In this paper we propose two new iterative algorithms for thinning binary images. In the first algorithm, thinning is accomplished...
Basically, detecting convex and concave points on the boundary of an object plays an important role in computer vision, object recognition and image understanding. In this paper a method that combines boundary and skeleton information for detecting these critical points is proposed. Specifically, the method is developed with the aim of obtaining high performance and efficiency, and producing a more...
Weighted Graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only defined for real or multivalued functions hereby restricting the regularization framework to numerical data. On the other hand, several kernels have been defined on structured objects such as strings or graphs. Using definite...
A method to decompose a complex 3D object into simpler parts is presented, based on a suitable partition of the curvilinear skeleton of the object. The curvilinear skeleton is divided into subsets, by taking into account the regions of influence that can be associated with its branch points. The obtained subsets are then used to recover the parts into which the object can be decomposed.
In this paper, we proposed a novel approach to shape classification. A new shape tree based on junction nodes can represent the global structure in a simple way. The statistic distribution of junctions can be learned by merging the shape trees. In the process of learning, context of a junction node is obtained to improve the rate of classification. We illustrate the utility of the proposed method...
Graph matching algorithms have proven to be useful in many applications, such as character recognition, shape analysis and image analysis. As the graph matching problem is one of exponential computational complexity, various heuristics and estimations have been proposed. While many of these algorithms succeed in improving the time taken to perform a match, most do not guarantee that an optimal solution...
One essential challenge for some skeletonization methods are the skeletons are broken on the intersection regions or by noise. In order to connect the broken skeletons more reasonable and obtain good skeleton performance, we propose a method to repair the primary skeletons extracted by some recently methods. The primary skeletons are repaired using high-level Markov Random field (HLMRF) whose fetures...
An image is digitized to convert it to a form which can be stored in a computer's memory or on some form of storage media such as a hard disk or CD-ROM. Once the image has been digitized, it can be operated upon by various image processing operations like enhancement, restoration, reconstruction, compression. An image defined in the "real world" is considered to be a function of two real...
This paper deals with the recognition of handwritten Malayalam characters using discrete features. The features are extracted from skeletonizsed images. But the presence of parasitic components in the image will degrade the performance of the pattern recognition system. So there arise needs for a pruning method to produce skeletons that are in accordance with human visual perception. The skeleton...
Shape skeleton extraction is a fundamental pre-processing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic skeletons of 3D dynamic surface meshes. Unlike previous approaches, surface motions are characterized by the mesh edge-length deviation induced by its transformation through time. Then a static skeleton extraction algorithm...
The conversion of two-dimensional objects into a skeletal representation is a fundamental calculation in image processing and pattern recognition, because topological structures of objects can be preserved in the skeleton. For the purpose of shaped fiber recognition, the number of shaped fiberpsilas branches is necessary to be calculated. In this paper, a skeletonization algorithm is proposed, in...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.