Article

A Picture-Drawing Robotic System Using Line Contours and Curve Interpolation

December 2018
Journal of Institute of Control 24(12):1177-1186

DOI:10.5302/J.ICROS.2018.18.0091

Authors:

It is a challenging issue to design picture-drawing robots. It needs to handle how to control robot motions properly and efficiently. We propose an efficient method of how to transform a given image into a set of robot motions. Initially it extracts the edges of a target image and builds a set of line contours for drawing. It involves with the curve interpolation to match the image as well as lead to smooth transition of robot motions. We also compute the effective path of robot motions to draw a picture. Thus, the suggested method can reduce the moving cost and time and improve the accuracy of motion to complete drawing a target image.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Use of speed differences for detection of moving objects by moving observers

August 2010 · Journal of Vision

A person moving through the world must be able to detect moving objects to avoid collisions. In previous studies, we examined human ability to find an object moving at a different angle from the radial optic flow field generated by observer motion. In this study, we examined whether differences in image speed could be used to detect moving objects within a radial flow field. Observers viewed a ... [Show full abstract] radial flow field simulating observer motion of 200 cm/sec in a straight line toward a set of 25 circular objects initially at a distance of 800 cm from the observer. In half the trials a randomly chosen target circle moved at an increased or decreased image speed. The target speed was computed by multiplying the image speed calculated for an object at the target's image position by a given factor. Each trial lasted 1 sec. In every trial, observers pressed a key to indicate whether or not the target circle was present. We measured the percentage of correct responses for speed factors of 0.3 to 0.9 for slower moving objects and 1.1 to 1.5 for faster moving objects. Thresholds were computed by fitting the data with a sigmoidal curve and determining the speed factor at which the observers performed with 75% accuracy. The results for 10 observers show that for slower moving objects (speed factor 1), accuracy increased with increasing speed factor, with an average threshold factor of 1.4. Thus, observers can detect a moving object within a radial flow field based on its image speed if its speed is sufficiently slower or faster than the image speeds of objects that are part of the stationary scene.

Article

The use of beam-like model data for stiffness profile estimation by the EBS method. II - Completion...

January 1992

In a recent publication (Vest et al., 1989), the authors presented the equivalent beam stiffness method, a direct procedure of determining the effective bending stiffness profile for beam-like structures using measured modal data and assumed correct mass and transverse inertia distributions. This paper details the further development of the method, in preparation for its application to ... [Show full abstract] experimental data obtained from large scale turbine rotors. By using a consistent polynomial basis for all quantities during the required integration and differentation, the improved accuracy of the method is demonstrated, as well as the ability for it to extract accurate profiles from computed modal results for complex stepped shaft designs. The effects of input noise are examined, and it is shown that the integrity of the method is not severely diminished even in the presence of noise levels above that to be expected in the experimental work to follow. Topics such as measurement point density requirements and the importance of the initial mode shape interpolation are discussed, as well as the relationship to other techniques available today.

Article

Full-text available

Bit-inverted gray coded bit-plane matching for low complexity motion estimation

January 2015

In this paper, a bit-inverted Gray coded bit-plane matching algorithm is proposed for low complexity motion estimation. Unlike the typical Gray coded bit-plane matching algorithms, the proposed algorithm uses bit-inverted Gray codes for transforming image frames and a corresponding extended matching criterion to enhance the motion estimation accuracy. Experimental results show that the proposed ... [Show full abstract] algorithm outperforms other bit-plane matching based motion estimation algorithms while preserving the binary matching characteristic.

Conference Paper

Phase-based image motion estimation and registration

April 1999 · Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conventional gradient methods (optical flow), for motion estimation assume intensity conservation between frames. This assumption is often violated in real applications. The remedy is a novel method that computes constraints on the local motion. These constraint are given on the same form as in conventional methods. Thus, it can directly substitute the gradient method in most applications. ... [Show full abstract] Experiments indicate a superior accuracy, even on synthetic images where the intensity conservation assumption is valid. The conventional gradient methods seem obsolete

Article

Remote sensing image matching based on contourlet-domain Krawtchouk moments and improved particle sw...

February 2010 · Yuhang Xuebao/Journal of Astronautics

To further improve the accuracy and efficiency of remote sensing image matching, an algorithm based on contourlet transform, Krawrchouk moments and improved particle swarm optimization was proposed in this paper. Firstly, the reference image and target image were decomposed to the low resolution image using contourlet transform. Then, the Krawtchouk moments were employed to extract local features ... [Show full abstract] of the images. Meanwhile, the extremum disturbed and simple particle swarm optimization was used to match the lowest resolution images. Based on the preliminary result, the matching between the higher resolution images could be implemented stepwise up to the full resolution images. The experimental results show that, compared with those of other existing sensing image matching methods, the proposed algorithm has the high accuracy, efficiency and strong robustness.

Article

Full-text available

SEGMENTATION AND QUALITY ANALYSIS OF LONG RANGE CAPTURED IRIS IMAGE

June 2016 · ICTACT Journal on Image and Video Processing

The iris segmentation plays a major role in an iris recognition system to increase the performance of the system. This paper proposes a novel method for segmentation of iris images to extract the iris part of long range captured eye image and an approach to select best iris frame from the iris polar image sequences by analyzing the quality of iris polar images. The quality of iris image is ... [Show full abstract] determined by the frequency components present in the iris polar images. The experiments are carried out on CASIA-long range captured iris image sequences. The proposed segmentation method is compared with Hough transform based segmentation and it has been determined that the proposed method gives higher accuracy for segmentation than Hough transform.

Article

Full-text available

Super-Resolution Algorithm by Motion Estimation with Sub-Pixel Accuracy using 6-Tap FIR Filter

June 2012 · The Journal of Korean Institute of Communications and Information Sciences

In this paper, we propose a new super-resolution algorithm that uses successive frames by applying the block matching motion estimation algorithm. Usually, single frame super-resolution algorithms are based on probability or discrete wavelet transform (DWT) approach to extract high-frequency components of the input image, but only limited information is available for these algorithms. To solve ... [Show full abstract] this problem, various multiple-frame based super-resolution algorithms are proposed. The accuracy of registration between frames is a very important factor for the good performance of an algorithm. We therefore propose an algorithm using 6-Tap FIR filter to increase the accuracy of the image registration with sub-pixel unit. Proposed algorithm shows better performance than other conventional interpolation based algorithms such as nearest neighborhood, bi-linear and bi-cubic methods and results in about the same image quality as DWT based super-resolution algorithm.

Article

Full-text available

Compression of line drawing images using Hough transform for exploiting global dependencies

February 2002

A two-stage method is proposed for compressing bi-level line drawing images. In the first stage line elements are extracted from the image using the Hough transform. In the second stage the original image is compressed by apixelwise context model. The compressed file consists of the extracted line elements and the compressed raster image. Pixels in the reconstructed feature image are utilized in ... [Show full abstract] the local context model in the form of improved prediction accuracy. Better compression performance is achieved if the improvement outweighs the overhead required by the line elements.

Conference Paper

Fast sub-pixel accuracy stereo image matching based on disparity plane

August 2015

To avoid “stair-casing effect” in the disparity map when dealing with slant plane, curved surface and weak texture region, an improved fast dense stereo matching algorithm based on disparity plane estimation is proposed. First, a set of support points are extracted from the edge of the original matching images and the description images. Second, Delaunay triangulation disparity planes are ... [Show full abstract] calculated using all the support points. Third, the sub-pixel disparity map is computed from the best support points and parameters of the Delaunay triangulation disparity planes. Finally, experimental results show that the “stair-casing effect” caused by slant plane, curved surface and weak texture region is eliminated by using the presented method. In addition, the proposed method spends less than 600ms on a one-megapixel image averagely.

Article

A linear-time approximate convex envelope algorithm using the double Legendre–Fenchel transform with...

January 2014 · Computational Optimization and Applications

We study the double discrete Legendre–Fenchel transform (LFT) to approximate the convex envelope of a given function. We analyze the convergence of the double discrete LFT in the multivariate case based on previous convergence results for the discrete LFT. We focus our attention on the grid on which the second discrete LFT is computed (dual grid); its choice has great impact on the accuracy of ... [Show full abstract] the resulting approximation of the convex envelope. Then, we present an improvement (both in time and accuracy) to the standard algorithm based on a change in the factorization order for the second discrete LFT. This modification is particularly beneficial for bivariate functions. Moreover, we introduce a method for handling functions that are unbounded outside sets of general shape. We also present some situations in which the selection of the dual grid is crucial, and show that it is possible to choose a dual grid of arbitrary size without increasing the memory requirements of the algorithm. Finally, we apply our algorithm to the study of phase separation in non-ideal ionic solutions.

Article

Nanoscale measurement of MEMS in-plane motion based on block matching

March 2008

In order to provide a reference for Micro-electro-mechanical System (MEMS), a measuring method insensitive to frame-to-frame intensity variations was designed based on block matching and the subpixel motion was measured through bilinear interpolation technology. The contrast and brightness parameters were introduced into the method to decrease the errors caused by the changes of image gray scale. ... [Show full abstract] With the least square method, a nanoscale measuring accuracy was obtained. The experimental results show that the measuring resolution is superior to 0.01 pixel and the measuring repetition is 5.5 nm. The offered solution indicate that proposed measuring method can decrease the influence of intensity variations between frames on measurement error, and can improve measurement repetition.

Chapter

Improved Depth Map Generation Using Motion Vector and the Vanishing Point from a Moving Camera Monoc...

January 2014

As a clue often used to acquire 3D information from a monocular image, there is a vanishing point. This article compares the inclines among valid straight lines at searching for the vanishing point of a monocular image and calculates the proximity degree and eliminates unnecessary information in generating a node so as to elevate accuracy to estimate the vanishing point of Hough Transform and ... [Show full abstract] draw an initial depth-map through the vanishing point calculated. Moreover, to obtain a more accurate depth of the initial depth-map, the study uses the difference of vector values according to the distance between the camera and the object based on the motion vector information within the monocular image with a camera moving and suggests a method to calculate a more accurate depth of the monocular image.