• Title/Summary/Keyword: minimum order

Search Result 2,748, Processing Time 0.026 seconds

The Image Segmentation Method using Adaptive Watershed Algorithm for Region Boundary Preservation

  • Kwon, Dong-Jin
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.39-46
    • /
    • 2019
  • This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

Stability of superconductor by integration formula

  • Seol, S.Y.
    • Progress in Superconductivity and Cryogenics
    • /
    • v.21 no.3
    • /
    • pp.1-5
    • /
    • 2019
  • The superconductor stability theories are consistently described by the integral formula. If the defined stability function is a simple decreasing function, it becomes a cryogenic stability condition. If the stability function has a maximum value and a minimum value, and the maximum value is less than 0, then it is a cold-end recovery condition. If the maximum value is more than 0, it can be shown that the unstable equilibrium temperature, that is, the MPZ (minimum propagation zone) temperature distribution can exist. The MPZ region is divided into two regions according to the current ratio. At the low current ratio, the maximum dimensionless temperature is greater than 1, and at the relatively high current ratio, the maximum dimensionless temperature is less than 1. In order to predict the minimum quench energy, the dimensionless energy was obtained for the MPZ temperature distribution. In particular, it was shown that the dimensionless energy can be obtained even when the MPZ maximum temperature is 1 or more.

Robust Near Time-optimal Controller Design for a Driving System Using Lyapunov Stability (Lyapunov 안정성을 이용한 구동장치의 강인 최단시간 제어기 설계)

  • Lee, Seong-Woo;Song, Oh-Seop
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.22 no.7
    • /
    • pp.650-658
    • /
    • 2012
  • This paper proposes a high performance position controller for a driving system using a time optimal controller which has been widely used to control driving systems to achieve desired reference position or velocity in a minimum response time. The main purpose of this research lies in an improvement of transient response performance rather than that of steady-state response in comparison with other control strategies. In order to refine the scheme of time optimal control, Lyapunov stability proofs are incorporated in a controller of standard second order system model. This scheme is applied to the control of a driving system. In view of the simulation and experiment results, the standard second order system model exhibits better minimum-time control performance and robustness than double integral system model does.

Improving the Performance of Document Clustering with Distributional Similarities (분포유사도를 이용한 문헌클러스터링의 성능향상에 대한 연구)

  • Lee, Jae-Yun
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.4
    • /
    • pp.267-283
    • /
    • 2007
  • In this study, measures of distributional similarity such as KL-divergence are applied to cluster documents instead of traditional cosine measure, which is the most prevalent vector similarity measure for document clustering. Three variations of KL-divergence are investigated; Jansen-Shannon divergence, symmetric skew divergence, and minimum skew divergence. In order to verify the contribution of distributional similarities to document clustering, two experiments are designed and carried out on three test collections. In the first experiment the clustering performances of the three divergence measures are compared to that of cosine measure. The result showed that minimum skew divergence outperformed the other divergence measures as well as cosine measure. In the second experiment second-order distributional similarities are calculated with Pearson correlation coefficient from the first-order similarity matrixes. From the result of the second experiment, secondorder distributional similarities were found to improve the overall performance of document clustering. These results suggest that minimum skew divergence must be selected as document vector similarity measure when considering both time and accuracy, and second-order similarity is a good choice for considering clustering accuracy only.

An Algorithm for Minimum Feedback Edge Set Problem (최소 되먹임 간선 집합 문제 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.3
    • /
    • pp.107-113
    • /
    • 2015
  • This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

Superposition Coding Multiplexing for Fading Broadcast Channels with Rate Constraints (전송률 제한을 둔 페이딩 방송채널을 위한 중첩코딩 다중화)

  • Lee, Min;Oh, Seong-Keun;Jeong, Byung-Jang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1072-1078
    • /
    • 2008
  • In this paper, we propose an efficient superposition coding multiplexing(SCM) method based on power allocation in descending order for fading broadcast channels in which per-user minimum and maximum rate constraints are considered in order to maximize the transmission effectiveness. It consists of three steps as follows. In the first step, a user group is selected to maximize the number of users with whom a transmitter can communicate instantaneously. In the second step, per-user power allocation for each user is done in descending order of transmit power by determining a maximum allowable interference power from all subsequent interfering users in order to guarantee its corresponding minimum rate, and then a residual power is calculated. The final step is performed if some power remains even after the second step. In this step, additional power allocation is performed up to the maximum transmit power to provide the maximum rate to the corresponding user, again in ascending order, starting from the last user in descending order. But, this method does not require power reallocation to subsequent users because tentative power allocation in the second step has been performed in descending order to guarantee the minimum rate for each user, taking into account the maximum allowable interference power from all the subsequent users. Therefore, the proposed method gets more efficient in term of computational complexity when per-user minimum as well as maximum rate constraints exist, especially as the number of users increases.

Minimum Energy-per-Bit Wireless Multi-Hop Networks with Spatial Reuse

  • Bae, Chang-Hun;Stark, Wayne E.
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.103-113
    • /
    • 2010
  • In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

Minimum Number of Input Ground-motions to Assess Seismic Performance of Nuclear Facilities (원전시설의 내진성능평가를 위한 입력지반운동의 최소개수)

  • Hong, Kee-Jeung;Choi, Ji-Hae;Kim, Hyun-Uk;Joo, Kwang-Ho
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.20 no.5
    • /
    • pp.341-349
    • /
    • 2016
  • Currently, researches are being actively conducted in assessing seismic performance of nuclear facilities in USA and Europe. In particular, applying this technique of assessing seismic performance to design of isolation systems in nuclear power plants is being performed and then ASCE 4 Draft (2013) is being revised accordingly in the United States. In order to satisfy the probabilistic performance objectives described by seismic responses with certain confidence levels (ASCE 43, 2005), the probability distributions of these responses have to be defined. What is the minimum number of input ground-motions to obtain the probability distribution precise enough to represent the unknown actual distribution? Theoretical basis, for how to determine the minimum number of input ground-motions for given a logarithmic standard deviation to approximate the unknown actual median of the log-normal distribution within a range of error at a certain level of confidence, is introduced by Huang et al. (2008). However, the relationship between the level of confidence and the range of error is not stated in the previous study. In this paper, based on careful reviews on the previous work, the relationship between the level of confidence and the range of error is logically and explicitly stated. Furthermore, this relationship is also applied to derive the minimum number of input ground-motions in order to approximate the unknown actual logarithmic standard deviation. Several recommendations are made for determining the minimum number of input ground-motions in probabilistic assessment on seismic performance of facilities in nuclear power plants.

THREE DIMENSIONAL FINITE ELEMENT ANALYSIS ON THE MINIMUM CONTACT FRACTION OF BONE-IMPLANT INTERFACE (골조직과 임플랜트 계면의 최소접촉분율에 관한 삼차원 유한요소분석적 연구)

  • Jang, Kyoung-Soo;Kim, Yung-Soo;Kim, Chang-Whe
    • The Journal of Korean Academy of Prosthodontics
    • /
    • v.35 no.4
    • /
    • pp.627-646
    • /
    • 1997
  • In order to find the degree of osseointegration at bone-implant interface of clinically successful implants, models including the 3.75mm wide, 10mm long screw type $Br{\aa}nemark$ implant as a standard and cylinder, 15mm long, 5.0mm wide, two splinted implants, and implants installed in various cancellous bone density were designed. Also, the amount of load and material of prostheses were changed. The stress and minimum contact fraction were analyzed on each model using three-dimensional finite element method(I-DEAS and ABAQUS version 5.5). The results of this study were as follows. 1. 10mm long, 3.75mm diameter-screw type implant had $36.5{\sim}43.7%$ of minimum contact fraction. 2. Cylinder type implant showed inferior stress distribution and higher minimum contact fraction than screw type. 3. As implant length was increased, minimum contact fraction was increased a little, however, maximum principal stress was decreased. 4. Implants with a large diameter had lower stress value with slightly higher minimum contact fraction than standard screw type. 5. Two splinted implants showed no change of minimum contact fraction. 6. The higher bone density, the lower stress value. 7. The material of occlusal surface had no effect on the stress of the bone-implant interface.

  • PDF

Global Minimum-Jerk Trajectory Planning of Space Manipulator

  • Huang Panfeng;Xu Yangsheng;Liang Bin
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.4
    • /
    • pp.405-413
    • /
    • 2006
  • A novel approach based on genetic algorithms (GA) is developed to find a global minimum-jerk trajectory of a space robotic manipulator in joint space. The jerk, the third derivative of position of desired joint trajectory, adversely affects the efficiency of the control algorithms and stabilization of whole space robot system and therefore should be minimized. On the other hand, the importance of minimizing the jerk is to reduce the vibrations of manipulator. In this formulation, a global genetic-approach determines the trajectory by minimizing the maximum jerk in joint space. The planning procedure is performed with respect to all constraints, such as joint angle constraints, joint velocity constraints, joint angular acceleration and torque constraints, and so on. We use an genetic algorithm to search the optimal joint inter-knot parameters in order to realize the minimum jerk. These joint inter-knot parameters mainly include joint angle and joint angular velocities. The simulation result shows that GA-based minimum-jerk trajectory planning method has satisfactory performance and real significance in engineering.