• Title/Summary/Keyword: subdivision algorithm

Search Result 71, Processing Time 0.025 seconds

A Domain-Partition Algorithm for the Large-Scale TSP (Large-Scale TSP 근사해법에 관한 연구)

  • Yoo, Hyeong-Seon;Kim, Hyun-Sng
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.9 no.3
    • /
    • pp.122-131
    • /
    • 1992
  • In this paper an approximate solution method for the large-scale Traveling Salesman Problem (TSP) is presented. The method starts with the subdivision of the problem domain into a number of cluster by considering their geometric characteristic. Each cluster has a limited number of nodes so as to get a local solution. They are linked go give the least pathe which covers the whole domain and become TSPs solution with start-and end-node. The approximate local solution in each cluster are obtained based on geometrical properties of the cluster, and combined to give an overall approximate solution for the larte-scale TSP.

  • PDF

Efficient Calculation of Distance Fields Using Cell Subdivision (셀 분할을 이용한 거리장의 효율적 계산)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.3
    • /
    • pp.147-156
    • /
    • 2008
  • A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

A Study on the Position and Speed Control of PM Step Motor Using Micro-Step Control Drive (미세스텝 제어 방식에 의한 PM 스텝 모터의 위치 및 속도 제어에 관한 연구)

  • 김동현;한권상
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.6
    • /
    • pp.871-878
    • /
    • 1990
  • The control method which electrically subdivides 1 step(1.8\ulcornerstep) of a PM step motor into 64 micro-step (0.028\ulcornerstep) is realized using micro-step algorithm on the basis of the look up table method and the position and velocity control using Z-80 microprocessor is also realized. With micro-stepping. The resolution of the system is improved, also by micro-step control of driving-current of the step motro, which is followed by the increase of micro-step subdivision-coefficient, the precise position and velocity control of step-motor can be realized and the stabilization of the system is improved.

  • PDF

Multi-Symbol Binary Arithmetic Coding Algorithm for Improving Throughput in Hardware Implementation

  • Kim, Jin-Sung;Kim, Eung Sup;Lee, Kyujoong
    • Journal of Multimedia Information System
    • /
    • v.5 no.4
    • /
    • pp.273-276
    • /
    • 2018
  • In video compression standards, the entropy coding is essential to the high performance compression because redundancy of data symbols is removed. Binary arithmetic coding is one of high performance entropy coding methods. However, the dependency between consecutive binary symbols prevents improving the throughput. For the throughput enhancement, a new probability model is proposed for encoding multi-symbols at one time. In the proposed method, multi-symbol encoder is implemented with only adders and shifters, and the multiplication table for interval subdivision of binary arithmetic coding is removed. Compared to the compression ratio of CABAC of H.264/AVC, the performance degradation on average is only 1.4% which is negligible.

Term Frequency-Inverse Document Frequency (TF-IDF) Technique Using Principal Component Analysis (PCA) with Naive Bayes Classification

  • J.Uma;K.Prabha
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.113-118
    • /
    • 2024
  • Pursuance Sentiment Analysis on Twitter is difficult then performance it's used for great review. The present be for the reason to the tweet is extremely small with mostly contain slang, emoticon, and hash tag with other tweet words. A feature extraction stands every technique concerning structure and aspect point beginning particular tweets. The subdivision in a aspect vector is an integer that has a commitment on ascribing a supposition class to a tweet. The cycle of feature extraction is to eradicate the exact quality to get better the accurateness of the classifications models. In this manuscript we proposed Term Frequency-Inverse Document Frequency (TF-IDF) method is to secure Principal Component Analysis (PCA) with Naïve Bayes Classifiers. As the classifications process, the work proposed can produce different aspects from wildly valued feature commencing a Twitter dataset.

A Watermarking Algorithm of 3D Mesh Model Using Spherical Parameterization (구면 파라미터기법을 이용한 3차원 메쉬 모델의 워더마킹 알고리즘)

  • Cui, Ji-Zhe;Kim, Jong-Weon;Choi, Jong-Uk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.1
    • /
    • pp.149-159
    • /
    • 2008
  • In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

Efficient RMESH Algorithms for Computing the Intersection and the Union of Two Visibility Polygons (두 가시성 다각형의 교집합과 합집합을 구하는 효율적인 RMESH 알고리즘)

  • Kim, Soo-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.401-407
    • /
    • 2016
  • We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).

An Algorithm for Measurement of Pack Ice Concentration Using Localized Binarization of Quadtree-Subdivided Image (쿼드트리 분할영상의 국부이진화를 통한 팩아이스 집적도 측정 알고리즘)

  • Lee, Jeong-Hoon;Byun, Seok-Ho;Nam, Jong-Ho;Cho, Seong-Rak
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.54 no.1
    • /
    • pp.49-56
    • /
    • 2017
  • Recently, many research works on the icebreaking vessels have been published as the possibility of passing Arctic routes has been increasing. The model ship test on the pack ice model in the ice basin is actively carried out as a way to investigate the performance of icebreaking vessels. In this test, the concentration of pack ice is important since it directly affects the performance. However, it is difficult to measure the concentration because not only the pack ice has uneven shape but also it keeps floating around in the basin. In this paper, an algorithm to identify the concentration of pack ice is introduced. From a digital image of pack ice obtained in the ice basin, the goal is to measure the area of pack ice using an image processing technique. Instead of the general global binarization that yields numerical errors in this problem, a local binarization technique, coupled with image subdivision based on the quadtree structure, is developed. The concentration results obtained by the developed algorithm are compared with the manually measured data to prove its accuracy.

Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm (계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성)

  • Choi, Young-Kyu;Park, Eun-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.511-520
    • /
    • 2009
  • In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

Teaching and Learning Irrational Number with Its Conceptual Aspects Stressed : Consideration of Irrational Number through the Conception of 'Incommensurability' (무리수의 개념적 측면을 강조한 교육방안: '통약불가능성'을 통한 무리수 고찰)

  • 변희현;박선용
    • School Mathematics
    • /
    • v.4 no.4
    • /
    • pp.643-655
    • /
    • 2002
  • In this paper we emphasize the introduction of ‘incommensurability’ on the teaching and learning the irrational number because we think of the origin of number as ‘ratio’. According to Greek classification of continuity as a ‘never ending’ divisibility, discrete number and continuous magnitude belong to another classes. That is, those components were dealt with respectively in category of arithmetic and that of geometry. But the comparison between magnitudes in terms of their ratios took the opportunity to relate ratios of magnitudes with numerical ratios. And at last Stevin coped with discrete and continuous quantity at the same time, using his instrumental decimal notation. We pay attention to the fact that Stevin constructed his number conception in reflecting the practice of measurement : He substituted ‘subdivision of units’ for ‘divisibility of quantities’. Number was the result of such a reflective abstraction. In other words, number was invented by regulation of measurement. Therefore, we suggest decimal representation from the point of measurement, considering the foregoing historical development of number. From the perspective that the conception of real number originated from measurement of ‘continuum’ and infinite decimals played a significant role in the ‘representation’ of measurement, decimal expression of real number should be introduced through contexts of measurement instead of being introduced as a result of algorithm.

  • PDF