• Title/Summary/Keyword: extreme point

Search Result 268, Processing Time 0.027 seconds

A Novel Implementation of Rotation Detection Algorithm using a Polar Representation of Extreme Contour Point based on Sobel Edge

  • Han, Dong-Seok;Kim, Hi-Seok
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.800-807
    • /
    • 2016
  • We propose a fast algorithm using Extreme Contour Point (ECP) to detect the angle of rotated images, is implemented by rotation feature of one covered frame image that can be applied to correct the rotated images like in image processing for real time applications, while CORDIC is inefficient to calculate various points like high definition image since it is only possible to detect rotated angle between one point and the other point. The two advantages of this algorithm, namely compatibility to images in preprocessing by using Sobel edge process for pattern recognition. While the other one is its simplicity for rotated angle detection with cyclic shift of two $1{\times}n$ matrix set without complexity in calculation compared with CORDIC algorithm. In ECP, the edge features of the sample image of gray scale were determined using the Sobel Edge Process. Then, it was subjected to binary code conversion of 0 or 1 with circular boundary to constitute the rotation in invariant conditions. The results were extracted to extreme points of the binary image. Its components expressed not just only the features of angle ${\theta}$ but also the square of radius $r^2$ from the origin of the image. The detected angle of this algorithm is limited only to an angle below 10 degrees but it is appropriate for real time application because it can process a 200 degree with an assumption 20 frames per second. ECP algorithm has an O ($n^2$) in Big O notation that improves the execution time about 7 times the performance if CORDIC algorithm is used.

Static and dynamic mooring analysis - Stability of floating production storage and offloading (FPSO) risers for extreme environmental conditions

  • Rho, Yu-Ho;Kim, Kookhyun;Jo, Chul-Hee;Kim, Do-Youb
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.5 no.2
    • /
    • pp.179-187
    • /
    • 2013
  • Floating production storage and offloading (FPSO) facilities are used at most of the offshore oil fields worldwide. FPSO usage is expected to grow as oil fields move to deeper water, thus requiring the reliability and stability of mooring wires and risers in extreme environmental conditions. Except for the case of predictable attack angles of external loadings, FPSO facilities with turret single point mooring (SPM) systems are in general use. There are two types of turret systems: permanent systems and disconnectable turret mooring systems. Extreme environment criteria for permanent moorings are usually based on a 100-year return period event. It is common to use two or three environments including the 100-year wave with associated wind and current, and the 100-year wind with associated waves and current. When fitted with a disconnectable turret mooring system, FPSOs can be used in areas where it is desirable to remove the production unit from the field temporarily to prevent exposure to extreme events such as cyclones or large icebergs. Static and dynamic mooring analyses were performed to evaluate the stability of a spider buoy after disconnection from a turret during cyclone environmental conditions.

An Improved Convex Hull Algorithm Considering Sort in Plane Point Set (평면 점집합에서 정렬을 고려한 개선된 컨벡스 헐 알고리즘)

  • Park, Byeong-Ju;Lee, Jae-Heung
    • Journal of IKEEE
    • /
    • v.17 no.1
    • /
    • pp.29-35
    • /
    • 2013
  • In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

Univalent Holomorphic Functions with Negative and Fixed Finitely Many Coefficients in terms of Generalized Fractional Derivative

  • Ebadian, Ali;Aghalary, Rasoul;Najafzadeh, Shahram
    • Kyungpook Mathematical Journal
    • /
    • v.50 no.4
    • /
    • pp.499-507
    • /
    • 2010
  • A new class of univalent holomorphic functions with fixed finitely many coefficients based on Generalized fractional derivative are introduced. Also some important properties of this class such as coefficient bounds, convex combination, extreme points, Radii of starlikeness and convexity are investigated.

On the Negative Quadrant Dependence in Three Dimensions

  • Ko, Mi-Hwa;Kim, Tae-Sung
    • Honam Mathematical Journal
    • /
    • v.25 no.1
    • /
    • pp.117-127
    • /
    • 2003
  • In this note we perform an extreme point analysis on two natural definitions of negative quadrant dependence of three random variables and examine how different these two notions of dependence. We also characterize some special distributions which are both negatively lower orthant dependent and negatively upper orthant dependent.

  • PDF

ON DIAMETER PRESERVING LINEAR MAPS

  • Aizpuru, Antonio;Tamayo, Montserrat
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.1
    • /
    • pp.197-204
    • /
    • 2008
  • We study diameter preserving linear maps from C(X) into C(Y) where X and Y are compact Hausdorff spaces. By using the extreme points of $C(X)^*\;and\;C(Y)^*$ and a linear condition on them, we obtain that there exists a diameter preserving linear map from C(X) into C(Y) if and only if X is homeomorphic to a subspace of Y. We also consider the case when X and Y are noncompact but locally compact spaces.

The effect of anchor extremity and question difficulty on anchoring effect (기준점의 극단성과 문항 난이도가 기준점 효과에 미치는 영향)

  • Lee, Myoungjin;Lee, Yoonhyoung;Kim, Kyungil
    • Korean Journal of Cognitive Science
    • /
    • v.33 no.1
    • /
    • pp.77-93
    • /
    • 2022
  • Previous studies have reported that a plausible reference point has a greater anchoring effect than an extreme reference point. It is also known that the anchoring effect decreases when the individual's level of knowledge related to a given item is high. However, there has been no study examining the interaction of the plausibility of the reference point and the difficulty of the given question. Therefore, in this study, the effect of the reference plausibility and the difficulty of the questions on the anchoring effect were examined. The relationship between the response confidence and the anchoring effect was also examined. To do so, easy and difficult questions, plausible and extreme reference points were selected through preliminary research. The experiment was conducted following the 'standard anchoring task procedure'. As results, the extremity of the reference point and the difficulty of the question affected the size of the anchoring effect respectively. The difficulty of the question also affected the confidence of the response. Specifically, when a plausible reference point was presented and when a difficult question was presented, the anchoring effects were increased. In addition, the lower the confidence in one's performances, the greater the influence of the reference point when an extreme reference point was presented. These results show that the plausibility of the given reference point and the difficulty of the item have different effects on the magnitude of the anchoring effect and the degree of confidence. The results of this study support the attitude change perspective regarding the anchoring effect, which suggests that the anchoring effect varies depending on the characteristics of the reference point and the individual's knowledge.

Weighing adjustment avoiding extreme weights (이상적(異常的) 가중치를 줄이는 가중치 조정 방법 연구)

  • 김재광
    • Proceedings of the Korean Association for Survey Research Conference
    • /
    • 2003.06a
    • /
    • pp.19-28
    • /
    • 2003
  • Weighting adjustment is a method of improving the efficiency of the estimator by incorporating auxiliary variables at the estimation stage. One commonly used method of weighting adjustment is the poststratification, which is a special case of regression estimation but is relatively feasible in terms of actual implementation. If too many auxiliary variables are used in the poststratification, the bias of the resulting point estimator is no longer negligible and the final weights may have extreme weights. In this study, we propose a method of weight ing adjustment that compromises the efficiency and the bias of the point estimator. A limited simulation study is also presented.

  • PDF

Asymptotic Capacity Analysis in Multipoint-to-Point Cognitive Radio Networks with an Arbitrary Peak Power

  • Ji, Jianbo;Chen, Wen;Sun, Shanlin
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.576-580
    • /
    • 2013
  • In this paper, we investigate the capacity of a multipoint-to-point cognitive radio network. In existing works, the asymptotic capacity is only obtained in the high peak power region at secondary transmitter (ST) or obtained without considering the interference from primary transmitter (PT) for easy analysis. Here, we analyze the asymptotic capacity by considering an arbitrary peak power at the ST and the interference from the PT based on extreme value theory. Simulation results show that our approximated capacity is well-matched to the exact capacity. Furthermore, the scaling law of our capacity is found to be double logarithm of the number of secondary users.