Curve matching Research Papers - Academia.edu (original) (raw)
The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple registration problem can be defined as a surface matching task. We treat it as least squares matching of... more
The automatic co-registration of point clouds, representing 3D surfaces, is a relevant problem in 3D modeling. This multiple
registration problem can be defined as a surface matching task. We treat it as least squares matching of overlapping surfaces.
The surface may have been digitized/sampled point by point using a laser scanner device, a photogrammetric method or other
surface measurement techniques. Our proposed method estimates the transformation parameters of one or more 3D search
surfaces with respect to a 3D template surface, using the Generalized Gauss–Markoff model, minimizing the sum of squares of
the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surface
patches. It fully considers 3D geometry. Besides the mathematical model and execution aspects we address the further
extensions of the basic model. We also show how this method can be used for curve matching in 3D space and matching of
curves to surfaces. Some practical examples based on the registration of close-range laser scanner and photogrammetric point
clouds are presented for the demonstration of the method. This surface matching technique is a generalization of the least
squares image matching concept and offers high flexibility for any kind of 3D surface correspondence problem, as well as
statistical tools for the analysis of the quality of final matching results.
We present in this paper an elephant photo identification system based on the shape comparison of the nicks characterizing the elephants’ ears. The method we propose can deal with very cluttered and noisy images as the ones commonly used... more
We present in this paper an elephant photo identification system based on the shape comparison of the nicks characterizing the elephants’ ears. The method we propose can deal with very cluttered and noisy images as the ones commonly used by zoologists for wild elephant photo identification. Difficult segmentation problems are solved using rough position information input by the user. Such
Plant is one of the most important forms of life on earth. Plant recognition is very demanding in biology and agriculture as new plant discovery and the computerization of the management of plant species become more popular. The... more
Plant is one of the most important forms of life on earth. Plant recognition is very demanding in biology and agriculture as new plant discovery and the computerization of the management of plant species
become more popular. The recognition is a process resulting in the assignment of each individual plant to a descending series of related plants in terms of their common characteristics. The process is very timeconsuming as it has been mainly carried out by botanists. Computer-aided plant recognition is still very challenging task in computer vision as the lack of proper models or representation schemes, a large number of variations of the plant species, and imprecise image pre-processing techniques, such as edge
detection and contour extraction. The focus of computerized living plant recognition is on stable feature’s extraction of plants. The information of leaf veins, therefore, play an important role in identifying living
plants. The ultimate goal of this project is to develop a system where a user in the field can take a picture of an unknown plant, feed it to the system carried on a portable computer, and have the system classify the species and display sample images of the closest matches within a couple of seconds.
The paper shows that isoresistivity contours for different depths, drawn from interpreted resistivity values, can indicate the location of underground lineaments. A comparison of the surface lineament map with the maps of isoresistivity... more
The paper shows that isoresistivity contours for different depths, drawn from interpreted resistivity values, can indicate the location of underground lineaments. A comparison of the surface lineament map with the maps of isoresistivity contours for different depths shows that many of the underground lineaments recognised through the resistivity studies have surface expressions as lineaments. The underground lineaments allow large-scale migration of groundwater and can be used as sites for the artificial recharging of aquifers. It is concluded that the maps prepared from interpreted resistivity values derived by curve matching can give a better picture of the underground structures than the conventional maps prepared from apparent resistivity values. L’article montre que des courbes d’isorésistivité établies pour différentes profondeurs à partir de l’analyse de données de résistivité, peuvent indiquer la localisation de linéaments profonds. Une comparaison d’une carte de linéaments de surface avec une carte d’isorésistivité pour différentes profondeurs montre que beaucoup des linéaments profonds reconnus par les études de résistivité correspondent à des linéaments identifiés en surface. Les linéaments profonds sont à l’origine d’écoulements souterrains à grande échelle et peuvent être utilisés comme sites de recharge artificielle des aquifères. On peut conclure que les cartes obtenues après analyse de valeurs de résistivité peuvent donner une meilleure image des structures profondes que les cartes conventionnelles obtenues à partir de valeurs de résistivité apparentes.
An algorithm to assemble large jigsaw puzzles using curve matching and combinatorial optimization techniques is presented. The pieces are photographed one by one and then the assembly algorithm, which uses only the puzzle piece shape... more
An algorithm to assemble large jigsaw puzzles using curve matching and combinatorial optimization techniques is presented. The pieces are photographed one by one and then the assembly algorithm, which uses only the puzzle piece shape information, is applied. The algorithm was experimented successfully in the assembly of 104-piece puzzles with many almost similar pieces. It was also extended to solve an intermixed puzzle assembly problem and has successfully solved a 208-piece puzzle consisting of two intermixed 104-piece puzzles. Previous results solved puzzles with about 10 pieces, which were substantially different in shape.
The premise of geographic object-based image analysis (GEOBIA) is that image objects are composed of aggregates of pixels that correspond to earth surface features of interest. Most commonly, image-derived objects (segments) or objects... more
The premise of geographic object-based image analysis (GEOBIA) is that image objects are composed of aggregates of pixels that correspond to earth surface features of interest. Most commonly, image-derived objects (segments) or objects associated with predefined land units (e.g., agricultural fields) are classified using parametric statistical characteristics (e.g., mean and standard deviation) of the within-object pixels. The objective of this
Interference test has been recognized as a valuable technique for evaluating reservoir properties such as permeability thickness and storativity over an area where active and observation wells are located. Interference test can also... more
Interference test has been recognized as a valuable technique for evaluating reservoir properties such as permeability thickness and storativity over an area where active and observation wells are located. Interference test can also provide qualitative indications of reservoir heterogenities and communication between two or more wells. The availability of sophisticated pressure recorders encourages providing reliable data and improved accuracy. Interference test of Sibayak geothermal field that has been carried out in December 1998 to September 1999 is examined to prove two major fault which are predicted supporting permeability of this area. The presence of linear boundary can be determined by using a new semi-log type curve matching (Sageev et al, 1985). Log-log type curve (Theis Curve) can also be employed to determine the interwell properties i.e. transmisivity and storativity. The first test that conducted by measuring SBY-8 response to SBY-5 discharge, does not reflect present...
... This inspired the authors to do research for the development of a new - quasi-free-form - cutting ... It presents the mathematical tools and the fundamentals of the numerical algorithms applied. ... of a layer can be based either on... more
... This inspired the authors to do research for the development of a new - quasi-free-form - cutting ... It presents the mathematical tools and the fundamentals of the numerical algorithms applied. ... of a layer can be based either on end points contact or on intermediate point contact. ...
In the image plane, a 3 Dimensional movement of planar rigid object can be represented satisfactory by an affine motion of his boundary (the exterior contour) which we assume to be closed. The object movement can be described by a special... more
In the image plane, a 3 Dimensional movement of planar rigid object can be represented satisfactory by an affine motion of his boundary (the exterior contour) which we assume to be closed. The object movement can be described by a special affine transformation of the plane IR2. The extraction of invariant features under affinities is important in such procedure. Recently
In this paper we investigate the relationship between bimanual (two-handed) manipulation and the cognitive aspects of task integration, divided attention and epistemic action. We explore these relationships by means of an empirical study... more
In this paper we investigate the relationship between bimanual (two-handed) manipulation and the cognitive aspects of task integration, divided attention and epistemic action. We explore these relationships by means of an empirical study comparing a bimanual technique versus a unimanual (one-handed) technique for a curve matching task. The bimanual technique was designed on the principle of integrating the visual, conceptual and input device space domain of both hands. We provide evidence that the bimanual technique has better performance than the unimanual technique and, as the task becomes more cognitively demanding, the bimanual technique exhibits even greater performance benefits. We argue that the design principles and performance improvements are applicable to other task domains.
This paper describes a solution to the T-joint problem in matching 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological fragments. Many factors, such as the number of... more
This paper describes a solution to the T-joint problem in matching 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological fragments. Many factors, such as the number of pieces and the complex shapes of pieces make this a difficult problem. Various approaches to this problem exist. This paper presents an approach
The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of... more
The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of `shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces
In this paper, we propose a joint design of serially concatenated source channel coding for binary Markov sources over AWGN channels. To exploit the memory structure inherent within the sequence output from the source, modifications are... more
In this paper, we propose a joint design of serially concatenated source channel coding for binary Markov sources over AWGN channels. To exploit the memory structure inherent within the sequence output from the source, modifications are made on the BCJR algorithm. To decode the outer code, the modified version of the BCJR algorithm is used, while the inner code by the standard version of the algorithm. Since optimal design of serially concatenated convolutional code falls into the problem of curve matching between the extrinsic information transfer (EXIT) curves of the inner and outer codes, we first evaluate the EXIT curve of the outer code decoded by the modified BCJR algorithm. It is then shown that the EXIT curve obtained by the modified BCJR algorithm is better matched with short memory inner convolutional code, which significantly reduces coding/decoding complexity. Numerical results demonstrate significant gains over the systems in which source statistics are not exploited (i.e., the standard BCJR algorithm is used for the both codes), and thereby narrowing the performance gap to the Shannon limit. We also compare in this paper the performance of the proposed design with the algorithm presented in [1], designed also for transmission of binary Markov source using parallel concatenated convolutional code (the authors of Ref. [1] refer the technique as Joint Source Channel Turbo Code (JSCTC)). It is shown that our proposed system is superior in both system complexity and BER performance to the JSCTC technique presented in [1].