• Title/Summary/Keyword: Cross-Points

Search Result 755, Processing Time 0.03 seconds

A Robust Watermarking Technique Using Affine Transform and Cross-Reference Points (어파인 변형과 교차참조점을 이용한 강인한 워터마킹 기법)

  • Lee, Hang-Chan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.3
    • /
    • pp.615-622
    • /
    • 2007
  • In general, Harris detector is commonly used for finding salient points in watermarking systems using feature points. Harris detector is a kind of combined comer and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. In this paper, we have used cross reference points which use not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we find cross reference points and take inverse normalization of these points. Next, we construct a group of triangles using tessellation with inversely normalized cross reference points. The watermarks are affine transformed and transformed-watermarks are embedded into not normalized image but original one. Only locations of watermarks are determined on the normalized image. Therefore, we can reduce data loss of watermark which is caused by inverse normalization. As a result, we can detect watermarks with high correlation after several digital attacks.

EVM Based SNR Estimation Performance in Cross QAM Using Selected Constellation Points (Cross QAM의 선택적 성좌점을 사용하는 EVM 기반 SNR 추정 성능)

  • Kwak, Jae-Min
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.3
    • /
    • pp.426-432
    • /
    • 2012
  • In this paper, we investigate the signal to noise ratio (SNR) estimation performance of Cross quadrature amplitude modulation (QAM), which is being used for asymmetric digital subscriber line (ADSL), very high bit rate digital subscriber line (VDSL), and digital video broadcasting - cable (DVB-C), and has been found to be useful in adaptive modulation and blind equalization. At first, the symbol error rate (SER) performance of Cross QAM is analyzed in Rayleigh fading channel. Then we suggest error vector magnitude (EVM) based SNR estimation utilizing the selected constellation points having different types of decision region from one another, and verify that SNR estimation performance of each points have different performance pattern through simulation. From the simulation results, it has been found that when suggested selected constellation points are used for SNR estimation in Cross QAM, estimation performance is enhanced in additive white Gaussian noise (AWGN) channel or Ricean fading channel.

A SURFACE RECONSTRUCTION METHOD FOR SCATTERED POINTS ON PARALLEL CROSS SECTIONS

  • Kim, Phil-Su
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.9 no.2
    • /
    • pp.29-43
    • /
    • 2005
  • We consider a surface reconstruction problem from geometrical points (i.e., points given without any order) distributed on a series of smooth parallel cross sections in ${\mathbb{R}}^3$. To solve the problem, we utilize the natural points ordering method in ${\mathbb{R}}^2$, described in [18], which is a method of reconstructing a curve from a set of sample points and is based on the concept of diffusion motions of a small object from one point to the other point. With only the information of the positions of these geometrical points, we construct an acceptable surface consisting of triangular facets using a heuristic algorithm to link a pair of parallel cross-sections constructed via the natural points ordering method. We show numerical simulations for the proposed algorithm with some sets of sample points.

  • PDF

A Watermark Embedding Technique for Still Images Using Cross-Reference Points (교차 참조 점을 이용한 정지영상의 워터마크 삽입기법)

  • Lee, Hang-Chan
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.4
    • /
    • pp.165-172
    • /
    • 2006
  • In this paper we present a technique for detecting cross-reference points that allows improving watermark detect-ability. In general, Harris detector is commonly used for finding salient points. Harris detector is a kind of combined corner and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. The new method proposed in this paper used not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we constructed pre-specified number of virtual lines from top to bottom and left to right, and several of cross points were selected by a random key. These selected points specify almost same positions with the accuracy more than that of Harris detector after digital attacks. These points were arranged by a random key, and blocks centered in these points were formed. A reference watermark is formed by a block and embedded in the next block. Because same alteration is applied to the watermark generated and embedded blocks. the detect-ability of watermark is improved even after digital attacks.

The clustering of critical points in the evolving cosmic web

  • Shim, Junsup;Codis, Sandrine;Pichon, Christophe;Pogosyan, Dmitri;Cadiou, Corentin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.47.2-47.2
    • /
    • 2021
  • Focusing on both small separations and baryonic acoustic oscillation scales, the cosmic evolution of the clustering properties of peak, void, wall, and filament-type critical points is measured using two-point correlation functions in ΛCDM dark matter simulations as a function of their relative rarity. A qualitative comparison to the corresponding theory for Gaussian random fields allows us to understand the following observed features: (i) the appearance of an exclusion zone at small separation, whose size depends both on rarity and signature (i.e. the number of negative eigenvalues) of the critical points involved; (ii) the amplification of the baryonic acoustic oscillation bump with rarity and its reversal for cross-correlations involving negatively biased critical points; (iii) the orientation-dependent small-separation divergence of the cross-correlations of peaks and filaments (respectively voids and walls) that reflects the relative loci of such points in the filament's (respectively wall's) eigenframe. The (cross-) correlations involving the most non-linear critical points (peaks, voids) display significant variation with redshift, while those involving less non-linear critical points seem mostly insensitive to redshift evolution, which should prove advantageous to model. The ratios of distances to the maxima of the peak-to-wall and peak-to-void over that of the peak-to-filament cross-correlation are ~2-√~2 and ~3-√~3WJ, respectively, which could be interpreted as the cosmic crystal being on average close to a cubic lattice. The insensitivity to redshift evolution suggests that the absolute and relative clustering of critical points could become a topologically robust alternative to standard clustering techniques when analysing upcoming surveys such as Euclid or Large Synoptic Survey Telescope (LSST).

  • PDF

Feature Template-Based Sweeping Shape Reverse Engineering Algorithm using a 3D Point Cloud

  • Kang, Tae Wook;Kim, Ji Eun;Hong, Chang Hee;Hwa, Cho Gun
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.680-681
    • /
    • 2015
  • This study develops an algorithm that automatically performs reverse engineering on three-dimensional (3D) sweeping shapes using a user's pre-defined feature templates and 3D point cloud data (PCD) of sweeping shapes. Existing methods extract 3D sweeping shapes by extracting points on a PCD cross section together with the center point in order to perform curve fitting and connect the center points. However, a drawback of existing methods is the difficulty of creating a 3D sweeping shape in which the user's preferred feature center points and parameters are applied. This study extracts shape features from cross-sectional points extracted automatically from the PCD and compared with pre-defined feature templates for similarities, thereby acquiring the most similar template cross-section. Fitting the most similar template cross-section to sweeping shape modeling makes the reverse engineering process automatic.

  • PDF

REA를 고려한 Lineament density map의 작성 방안 연구

  • 김규범;조민조;이강근
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2003.04a
    • /
    • pp.97-99
    • /
    • 2003
  • Lineament density maps can be used for the quantitative evaluation of relationship between lineaments and groundwater occurrence. There are several kinds of lineament density maps including lineament length density, lineament cross-points density, and lineament counts density maps. This paper reports the usefulness of the representative elementary area (REA) concept for lineament analysis. This concept refers to the area size of the unit circle to calculate the lineament density factors distributed within the circle: length, counts and cross-points counts. The circle is a unit circle that calculates the sum of the lineament length, lineament counts and the number of cross-points within it. The REA is needed to obtain the best representative lineament density map prior to the analysis of relation between lineaments and groundwater well yield or other groundwater characteristics. A basic lineament map for the Yongsangang-Seomjingang watershed of Korea, drawn from aerial black-and-white photographs of 1/20, 000 scale was used for demonstrating the concept. From this study, the conclusions were as follows: (1) the REA concept can be efficiently applied to the lineament density analysis and mapping, (2) for whole Yongsangang-Seomjingang watershed which has 6, 502 lineaments with an average lineament length of 3.3 km, the lower limits of each REA used for drawing the three density maps were about 1.77 $\textrm{km}^2$ (r=750 m) for lineament length density, 7.07 $\textrm{km}^2$ (r=1, 500 m) for lineament counts density, and 4.91 $\textrm{km}^2$ (r=1, 250 m) for lineament cross-points density, respectively, (3) the lineament densities are inversely proportional to the size of REA, and the REA can be calculated with this inversely linear regression model, (4) if the average lineament density values for the whole study area are known, the most accurate density maps can be drawn using the REAs obtained from each linear regression model, and (5) but critical attention should be paid to draw lineament counts density and lineament cross-points density maps because.

  • PDF

이동로봇주행을 위한 영상처리 기술

  • 허경식;김동수
    • The Magazine of the IEIE
    • /
    • v.23 no.12
    • /
    • pp.115-125
    • /
    • 1996
  • This paper presents a new algorithm for the self-localization of a mobile robot using one degree perspective Invariant(Cross Ratio). Most of conventional model-based self-localization methods have some problems that data structure building, map updating and matching processes are very complex. Use of a simple cross ratio can be effective to the above problems. The algorithm is based on two basic assumptions that the ground plane is flat and two locally parallel sloe-lines are available. Also it is assumed that an environmental map is available for matching between the scene and the model. To extract an accurate steering angle for a mobile robot, we take advantage of geometric features such as vanishing points. Feature points for cross ratio are extracted robustly using a vanishing point and intersection points between two locally parallel side-lines and vertical lines. Also the local position estimation problem has been treated when feature points exist less than 4points in the viewed scene. The robustness and feasibility of our algorithms have been demonstrated through real world experiments In Indoor environments using an indoor mobile robot, KASIRI-II(KAist Simple Roving Intelligence).

  • PDF

Studies on the HACCP Model of Steak-Set Menu in Hotel (HACCP 모델 적용시 호텔 .레스토랑의 세트 메뉴 중 스테이크에 관한 연구)

  • 양신철
    • Journal of Applied Tourism Food and Beverage Management and Research
    • /
    • v.12 no.1
    • /
    • pp.5-24
    • /
    • 2001
  • This study was focused on the sanitary analysis of hazard factors and the establishment of critical control points on steak-set menu In hotel by the documents and microbiological investigation. The hazard factors of shrimp cocktail were microbial contamination, residual pesticides, unsuitable healing and cross contamination. The hazard factors of potato soap were residual pesticides, microorganisms contamination, unsuitable heating and solanine in potato. The hazard factors of simple salad were microorganisms contamination, unsuitable heating and cross contamination by inappropriate package. The hazard factors of steal were residual antimicrobial drugs, microorganisms contamination, unsuitable heating and cross contamination. The critical control points of shrimp cocktail were temperature control , number of washing and center temperature control of heating step. The critical control points of potato soup were stock temperature control , number of washing and center temperature control of Heating step. The critical control points of simple salad were number of washing and dryness of utensil. The critical control points of steak were stock temperature control , number of washing, center temperature and time control of heating step.

  • PDF

CROSS-INTERCALATES AND GEOMETRY OF SHORT EXTREME POINTS IN THE LATIN POLYTOPE OF DEGREE 3

  • Bokhee Im;Jonathan D. H. Smith
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.1
    • /
    • pp.91-113
    • /
    • 2023
  • The polytope of tristochastic tensors of degree three, the Latin polytope, has two kinds of extreme points. Those that are at a maximum distance from the barycenter of the polytope correspond to Latin squares. The remaining extreme points are said to be short. The aim of the paper is to determine the geometry of these short extreme points, as they relate to the Latin squares. The paper adapts the Latin square notion of an intercalate to yield the new concept of a cross-intercalate between two Latin squares. Cross-intercalates of pairs of orthogonal Latin squares of degree three are used to produce the short extreme points of the degree three Latin polytope. The pairs of orthogonal Latin squares fall into two classes, described as parallel and reversed, each forming an orbit under the isotopy group. In the inverse direction, we show that each short extreme point of the Latin polytope determines four pairs of orthogonal Latin squares, two parallel and two reversed.