Location of polyhedral objects in 3-D space from three unconstrained edge points

1992 ◽  
Author(s):  
Horst Bunke ◽  
Hong-Seh Lim ◽  
Urs Meier
2013 ◽  
Vol 416-417 ◽  
pp. 1210-1213
Author(s):  
Hua Wen Ai ◽  
Ping Feng Liu ◽  
Sheng Cong Dong

In order to resist print and scan attacks, a kind of digital halftone image watermarking algorithm is proposed, which is based on the edge detection and improved error diffusion. The edge of gray image is gotten using canny detection. Calculate the noise visibility function values of the edge points. Then, sort the values in ascending order and select the size that equal to the length of watermark as the location of watermark embedding. While the grayscale image turns to halftone image using the improved error diffusion algorithm, binary watermark is embedded in the edge position. Watermark is pretreated with Arnold before embedding to improve the safety of watermark. Experiment results show that the algorithm is good resistance to print and scan attacks, while resistance to shearing, noise and jpeg compression attacks.


1992 ◽  
Vol 337 (1281) ◽  
pp. 341-350 ◽  

Localized feature points, particularly corners, can be computed rapidly and reliably in images, and they are stable over image sequences. Corner points provide more constraint than edge points, and this additional constraint can be propagated effectively from corners along edges. Implemented algorithms are described to compute optic flow and to determine scene structure for a mobile robot using stereo or structure from motion. It is argued that a mobile robot may not need to compute depth explicitly in order to navigate effectively.


2021 ◽  
Vol 5 (6) ◽  
pp. 1036-1043
Author(s):  
Ardi wijaya ◽  
Puji Rahayu ◽  
Rozali Toyib

Problems in image processing to obtain the best smile are strongly influenced by the quality, background, position, and lighting, so it is very necessary to have an analysis by utilizing existing image processing algorithms to get a system that can make the best smile selection, then the Shi-Tomasi Algorithm is used. the algorithm that is commonly used to detect the corners of the smile region in facial images. The Shi-Tomasi angle calculation processes the image effectively from a target image in the edge detection ballistic test, then a corner point check is carried out on the estimation of translational parameters with a recreation test on the translational component to identify the cause of damage to the image, it is necessary to find the edge points to identify objects with remove noise in the image. The results of the test with the shi-Tomasi algorithm were used to detect a good smile from 20 samples of human facial images with each sample having 5 different smile images, with test data totaling 100 smile images, the success of the Shi-Tomasi Algorithm in detecting a good smile reached an accuracy value of 95% using the Confusion Matrix, Precision, Recall and Accuracy Methods.


Author(s):  
Utpal Roy ◽  
Bing Li

Abstract This paper presents a scheme for establishing geometric tolerance zones for polyhedral objects in solid modelers. The proposed scheme is based on a surface-based variational model. Variations are applied to a part model by varying each surface’s model variables. Those model variables are constrained by some algebraic relations derived from the specified geometric tolerances. For size tolerance, two types of tolerance zones are considered in order to reflect two different types of size tolerances. For any other geometric tolerance (form, orientation or positional), the resultant tolerance zone is defined by the combination of size tolerance and that particular geometric tolerance specifications. Appropriate algebraic constraints (on the model variables) are finally used to establish the tolerance zone boundaries in the surface-based variational model.


1996 ◽  
Vol 18 (3) ◽  
pp. 211-232 ◽  
Author(s):  
Ilan Schreiber ◽  
Moshe Ben-Bassat
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document