• Title/Summary/Keyword: Collinear points

Search Result 12, Processing Time 0.031 seconds

Digital Watermarking Technique for Images with Perspective Distortion

  • Chotikakamthorn, Nopporn;Yawai, Wiyada
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1090-1093
    • /
    • 2004
  • In this paper, a problem of geometrically distorted images is considered. In particular, the paper discusses the detection of a watermark from a photographed image of the watermarked picture. The image is possibly obtained by using a digital camera. This watermark detection problem is made difficult by various geometric distortions added to the original picture through the printing and photographing processes. In particular, the paper focuses on the geometric distortion due to a projective transformation, as part of a camera 3D-to-2D imaging process. It is well-known that a cross ratio of collinear points is invariant under a perspective projection. By exploiting this fact, a projective-invariant digital watermarking technique is developed. By detecting the picture's corners, and the image center point at the intersection of two main diagonal lines, predefined cross ratios are used to compute the watermark embedded locations. From those identified embedding pixel locations, a watermark can be detected by performing a correlation between a watermark pattern and the image over those pixels. The proposed method does not require an inverse transformation on the distorted image, thus simplifying the detection process. Performance of the proposed method has been analyzed through computer experiments

  • PDF

Template Recovery of DWT-DFT Composite Watermarking Scheme Using Collinear Cross-Ratio

  • Sepsirisuk, Kasemsuk;Atsuta, Kiyoaki;Kondo, Shozo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.225-228
    • /
    • 2005
  • According to a popularization of the Internet and digital lifestyle, digital watermarks have been proposed for protection of copyrighted multimedia content. In blind watermark detection, which an original image is not provided, robustness against geometric distortion and compression remains challenging. In this paper, we propose a new perceptual blind discrete wavelet transform - discrete Fourier transform (DWT-DFT) composite watermarking scheme that is robust against both general linear transform and JPEG compression. This algorithm constructs an image-dependent watermark in the most significant DWT coefficients, which is determined by using a hierarchical tree structure. Strength of watermark is determined from a just-noticeable difference (JND) profile of a perceptual model. Furthermore, a desired template is inserted into DFT domain of the watermarked image. In new manner, a cross-ratio of four collinear points is used for detecting the template. Experimental results have showed that the proposed scheme is robust against general linear distortion, JPEG compression and various general kinds of attacks in the Stirmark 3.1 watermark evaluation tool.

  • PDF

The Application of Delaunay Triangulation on RP (Delaunay 삼각형 분합법의 RP에의 응용)

  • 김대원
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1998.03a
    • /
    • pp.129-134
    • /
    • 1998
  • STL which is used in Rapid Prototyping is composed of a lot of triangular facets. The number of triangles and the shapes of these triangles determine the quality of STL. Therefore, proper algorithm is necessary to enhance the quality of triangular patch. In this paper we used the Delaunay triangulation method to apply to following processes. 1) On processing for reducing sharp triangles which cause errors on intersection. 2) On processing for connecting two or more collinear edges. 3) On processing for deleting unnecessarily inserted points in coplanar polygon.

  • PDF

Application of Delaunay Triangulation on RP (Delaunay삼각형 분할법의 RP에의 응용)

  • 명태식;채희창;김옥현
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.8 no.3
    • /
    • pp.35-41
    • /
    • 1999
  • STL which is used in Rapid Prototyping is composed of a lot of triangular facets. The number of triangles and the shapes of these triangles determine the quality of STL. Therefore, proper algorithm is necessary to enhance the quality of triangular patch. In this paper we used the Delaunay triangulation method to apply to following processes. 1) On processing for reducing sharp triangles which cause errors on intersection. 2) On processing for connecting two or more collinear edges. 3) On processing for deleting unnecessarily inserted points in coplanar polygon.

  • PDF

Design and Control of a Wire-driven Haptic Device;HapticPen

  • Farahani, Hossein S.;Ryu, Je-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1662-1667
    • /
    • 2005
  • In this paper, analysis, design, control and prototype construction of a wearable wire-driven haptic interface called HapticPen is discussed. This device can be considered as a wire driven parallel mechanism which three wires are attached to a pen-tip. Wire tensions are provided utilizing three DC servo motors which are attached to a solid frame on the user's body. This device is designed as input as well as output device for a wearable PC. User can write letters or figures on a virtual plate in space. Pen-tip trajectory in space is calculated using motor encoders and force feedback resulting from contact between pen and virtual plate is provided for constraining the pen-tip motion onto the virtual plane that can be easily setup by arbitrary non-collinear three points in space. In this paper kinematic model, workspace analysis, application analysis, control and prototype construction of this device are presented. Preliminary experiments on handwriting in space show feasibility of the proposed device in wearable environments.

  • PDF

Isotomic and Isogonal Conjugates Tangent Lines of Lines at Vertices of Triangle

  • Seo, Min Young;Ahn, Young Joon
    • Journal of Integrative Natural Science
    • /
    • v.10 no.1
    • /
    • pp.27-32
    • /
    • 2017
  • In this paper we consider the two tangent lines of isogonal and isotomic conjugates of the line at both vertices of a given triangle. We find the necessary and sufficient condition for the two tangent lines of isogonal or isotomic conjugates of the line at both vertices and the median line to be concurrent. We also prove that every line whose isogonal conjugate tangent lines at both vertices are concurrent with the median line intersects at a unique point. Moreover, we show that the three intersection points correspond to the vertices of triangle are collinear.

ON THE SINGULAR LOCUS OF FOLIATIONS OVER ℙ2

  • Shi Xu
    • Bulletin of the Korean Mathematical Society
    • /
    • v.61 no.4
    • /
    • pp.1067-1086
    • /
    • 2024
  • For a foliation 𝓕 of degree r over ℙ2, we can regard it as a maximal invertible sheaf N𝓕 of Ω2, which is represented by a section s ∈ H0(Ω2 (r+2)). The singular locus Sing𝓕 of 𝓕 is the zero dimensional subscheme Z(s) of ℙ2 defined by s. Campillo and Olivares have given some characterizations of the singular locus by using some cohomology groups. In this paper, we will give some different characterizations. For example, the singular locus of a foliation over ℙ2 can be characterized as the residual subscheme of r collinear points in a complete intersection of two curves of degree r + 1.

Map Labeling for Collinear Sites (동일선상 위치들에 대한 지도 레이블링)

  • Kim, Jae-hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.10
    • /
    • pp.1355-1360
    • /
    • 2020
  • In a map, placing the labels, corresponding to names or explanations of specific features, is called map labeling. In this paper, n points on a line are given, and placing rectangular labels for the points is considered. Particularly, the labels have a same height and their lower sides lie on a straight line in the upper of the line on which the given points are. The points and the labels are connected by polygonal lines, which are called leader lines. The leader lines are classified into straight leader lines and bended leader lines, where the straight leader line consists of only the vertical line and the bended leader line consists of vertical, horizontal, vertical lines. The problem is placing the labels to minimize the number of bended leader lines, and we propose an O(nlogn)-time algorithm, which improves the O(n2)-time algorithm previously provided in [13].

A New Algorithm for the Interpretation of Joint Orientation Using Multistage Convergent Photographing Technique (수렴다중촬영기법을 이용한 새로운 절리방향 해석방법)

  • 김재동;김종훈
    • Tunnel and Underground Space
    • /
    • v.13 no.6
    • /
    • pp.486-494
    • /
    • 2003
  • When the orientations of joints are measured on a rock exposure, there are frequent cases that are difficult to approach by the surveyor to the target joints or to set up scanlines on the slope. In this study, to complement such limit and weak points, a new algorithm was developed to interpret joint orientation from analyzing the images of rock slope. As a method of arranging the multiple images of a rock slope, the multistage convergent photographing system was introduced to overcome the limitation of photographing direction which existing method such as parallel stereophotogrammetric system has and to cover the range of image measurement, which is the overlapping area between the image pair, to a maximum extent. To determine camera parameters in the perspective projection equation that are the main elements of the analysis method, a new method was developed introducing three ground control points and single ground guide point. This method could be considered to be very simple compared with other existing methods using a number of ground control points and complicated analysis process. So the global coordinates of a specific point on a rock slope could be analyzed with this new method. The orientation of a joint could be calculated using the normal vector of the joint surface which can be derived from the global coordinates of several points on the joint surface analyzed from the images.

Stereo cameras calibration bases on Epipolar Rectification and its Application

  • Chaewieang, Pipat;Thepmanee, Teerawat;Kummool, Sart;Jaruvanawat, Anuchit;Sirisantisamrid, Kaset
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.246-249
    • /
    • 2003
  • The constraints necessary guarantee using the comparison of these extrinsic parameters, which each Rotation matrix and Translation Vector must be equal to the either, except the X-axis Translation Vector. Thus, we can not yet calculate the 3D-range measurement in the end of camera calibration. To minimize this disadvantage, the Epipolar Rectification has been proposed in the literature. This paper aims to present the development of Epipolar Rectification to calibrate Stereo cameras. The required computation of the transformation mapping between points in 3D-space is based on calculating the image point that appears on new image plane by using calibrated parameters. This computation is assumed from the rotating the old ones around their optical center until focal planes becomes coplanar, thereby containing the baseline, and the Z-axis of both camera coordinate to be parallel together. The optical center positions of the new extrinsic parameters are the same as the old camera, whereas the new orientation differs from the old ones by the suitable rotations. The intrinsic parameters are the same for both cameras. So that, after completed calibration process, immediately can calculate the 3D-range measurement. And the rectification determines a transformation of each image plane such that pairs of conjugate Epipolar lines become collinear and parallel to one of the image axis. From the experimental results verify the proposed technique are agreed with the expected specifications.

  • PDF