• Title/Summary/Keyword: Splitting Algorithm

Search Result 240, Processing Time 0.024 seconds

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space (한정된 저장 공간상에서 이동 객체 궤적들에 대한 개선된 분할 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2057-2064
    • /
    • 2010
  • With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

An Algorithm for Splitting a Box by a Loop and Its Applications in Manufacturing

  • Kheerwal, Anoop;Shanmuganathan, Vivekananda;Shringi, Rohitashwa;Karunakaran, Karuna P.
    • International Journal of CAD/CAM
    • /
    • v.3 no.1_2
    • /
    • pp.85-95
    • /
    • 2003
  • During the design of dies and molds, the cavity of the object is obtained by subtracting it from a surrounding rectangular block. This box is subsequently split into two halves by the parting surface. Similar problems also occur in some RP processes such as LOM, SGC, SLS and 3DP where the machine produces a block inside which the prototype is buried. Determining the orientation of the object inside the box and the corresponding parting surface taking appropriate constraints into account have been addressed by several researchers. However, given the parting surface, the problem of splitting the box development of a software package called OptiLOM (now a module of an RP software Magics 8.0), the authors realized non-triviality of this problem since the loop can spread over as many as 5 faces of the box. In this paper, the authors have tried to bring out the importance of this problem and have presented their algorithm to solve it.

Regularized Multichannel Blind Deconvolution Using Alternating Minimization

  • James, Soniya;Maik, Vivek;Karibassappa, K.;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.413-421
    • /
    • 2015
  • Regularized Blind Deconvolution is a problem applicable in degraded images in order to bring the original image out of blur. Multichannel blind Deconvolution considered as an optimization problem. Each step in the optimization is considered as variable splitting problem using an algorithm called Alternating Minimization Algorithm. Each Step in the Variable splitting undergoes Augmented Lagrangian method (ALM) / Bregman Iterative method. Regularization is used where an ill posed problem converted into a well posed problem. Two well known regularizers are Tikhonov class and Total Variation (TV) / L2 model. TV can be isotropic and anisotropic, where isotropic for L2 norm and anisotropic for L1 norm. Based on many probabilistic model and Fourier Transforms Image deblurring can be solved. Here in this paper to improve the performance, we have used an adaptive regularization filtering and isotropic TV model Lp norm. Image deblurring is applicable in the areas such as medical image sensing, astrophotography, traffic signal monitoring, remote sensors, case investigation and even images that are taken using a digital camera / mobile cameras.

A Study on Efficient Split Algorithm for Minimum Bounding Box of Moving Object Trajectoty (이동 객체 궤적의 최소경계사각형 영역을 효율적으로 분할하는 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.110-116
    • /
    • 2013
  • With the recent development of wireless network technologies, there have been increasing usage of variouse position base servies. Position based services basically collect position information of moving object for the utilization of them in real life. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. In the paper, we consider volume of Extended Minimum Bounding Rectangles(EMBR) to be determined by average size of range queries. We proposed the methode that split efficiently moving object with long distance between location, and split moving object for decrease searching space an Estimated-Split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

Design of Equal-Cost Bifurcated Routing Algorithm : A Case Study Using Closure Approximation (클로즈 근사화를 이용한 등가 라우팅 알고리즘의 설계)

  • Lee, Bong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.380-390
    • /
    • 1994
  • In this paper, we propose an equal-cost bifurcated routing algorithm which may be useful in practical computer network design problem. The performance of the routing algorithm is evaluated using the conventional Monte Carlo simulation and a transient queueing approximation. The relative errors between the closure approximation and the Monte Carlo simulation was fairly small. The closure approximation may be used to evaluate the performance of the load splitting algorithms, which results in considerable execution time reduction. The performance of the proposed algorithm is compared to that of the known algorithms based on average packet delay. For networks that have many non-disjoint equal-paths, the proposed algorithm performed better than other algorithms.

  • PDF

Energy-Aware Traffic Engineering in Hybrid SDN/IP Backbone Networks

  • Wei, Yunkai;Zhang, Xiaoning;Xie, Lei;Leng, Supeng
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.559-566
    • /
    • 2016
  • Software defined network (SDN) can effectively improve the performance of traffic engineering and will be widely used in backbone networks. Therefore, new energy-saving schemes must take SDN into consideration; this action is extremely important owing to the rapidly increasing energy consumption in telecom and Internet service provider (ISP) networks. Meanwhile, the introduction of SDN in current networks must be incremental in most cases, for technical and economic reasons. During this period, operators must manage hybrid networks in which SDN and traditional protocols coexist. In this study, we investigate the energy-efficient traffic engineering problem in hybrid SDN/Internet protocol (IP) networks. First, we formulate the mathematical optimization model considering the SDN/IP hybrid routing mode. The problem is NP-hard; therefore, we propose a fast heuristic algorithm named hybrid energy-aware traffic engineering (HEATE) as a solution. In our proposed HEATE algorithm, the IP routers perform shortest-path routing by using distributed open shortest path first (OSPF) link weight optimization. The SDNs perform multipath routing with traffic-flow splitting managed by the global SDN controller. The HEATE algorithm determines the optimal setting for the OSPF link weight and the splitting ratio of SDNs. Thus, the traffic flow is aggregated onto partial links, and the underutilized links can be turned off to save energy. Based on computer simulation results, we demonstrate that our algorithm achieves a significant improvement in energy efficiency in hybrid SDN/IP networks.

Performance Improvement of Continuous Digits Speech Recognition Using the Transformed Successive State Splitting and Demi-syllable Pair (반음절쌍과 변형된 연쇄 상태 분할을 이용한 연속 숫자 음 인식의 성능 향상)

  • Seo Eun-Kyoung;Choi Gab-Keun;Kim Soon-Hyob;Lee Soo-Jeong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.23-32
    • /
    • 2006
  • This paper describes the optimization of a language model and an acoustic model to improve speech recognition using Korean unit digits. Since the model is composed of a finite state network (FSN) with a disyllable, recognition errors of the language model were reduced by analyzing the grammatical features of Korean unit digits. Acoustic models utilize a demisyllable pair to decrease recognition errors caused by inaccurate division of a phone or monosyllable due to short pronunciation time and articulation. We have used the K-means clustering algorithm with the transformed successive state splitting in the feature level for the efficient modelling of feature of the recognition unit. As a result of experiments, 10.5% recognition rate is raised in the case of the proposed language model. The demi-syllable fair with an acoustic model increased 12.5% recognition rate and 1.5% recognition rate is improved in transformed successive state splitting.

  • PDF

Row-splitting Algorithm for Low Density Parity Check Codes (LDPC 부호를 위한 행 분할 알고리즘)

  • Jung, Man-Ho;Lee, Jong-Hoon;Kim, Soo-Young;Song, Sang-Seob
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.92-96
    • /
    • 2008
  • Practical communication systems need to operate at various different rates. This paper describes and analyzes low-density parity check codes for various different rates. From a specific mother code, it allows LDPC codes for different rate. The advantage of this technique is that each different rate LDPC codes have a same block length as mother code though the rate changes so it can make up for the weak points of puncturing and shortening which reduce their block length as the rate changes. Row-splitting method is to split the row, so that the rate changes from a higher rate to lower rate and cause of its own property, it can overcome the defect of row-combining method.

Computational Fluid Dynamics Applied to Hypersonic Blunt Body Flows (Hypersonic 뭉뚝 물체 흐름에 적용된 CFD)

  • Baik, Doo-Sung;Han, Young-Chaol;Ha, Young-Min;Kim, Duk-Sang
    • Proceedings of the KSME Conference
    • /
    • 2001.06e
    • /
    • pp.311-316
    • /
    • 2001
  • The thin-layer Navier-Stokes equations are solved for the hypersonic flow over blunt cone configurations with applications to laminar as well as turbulent flows. The equations are expressed in the forms of flux-vector splitting and explicit algorithm. The upwind schemes of Steger-Warming and van Leer are investigated in their ability to accurately predict the heating loads along the surface of the body. A comparison with the second order extensions of these schemes is made and a hybrid scheme incorporating a combination of central differencing and flux-vector-splitting is presented. This scheme is also investigated in its ability to accurately predict heat transfer distributions.

  • PDF

An improved RDO algorithm for the HEVC intra encoder (HEVC 인트라 인코더를 위한 RDO 알고리듬의 개선)

  • Won, Eui-Yeon;Chae, Soo-Ik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.123-126
    • /
    • 2013
  • High Efficiency Video Coding 비디오 표준은 다양한 분할방식 및 35가지 예측모드를 허용하기 때문에 최적의 분할 및 예측모드를 결정하기 위한 연산량이 많다. 이를 줄이기 위하여 본 논문에서는 CU분할의 결정에 있어 가설검정을 이용하여 early splitting 및 early pruning을 위한 임계값을 설정하고, early splitting의 경우 연산의 결과값이 임계값보다 클 경우, early pruning의 경우 연산의 결과값보다 임계값보다 작을 경우 CU의 분할을 조기에 결정하는 논문[1]의 방법을 차용하여 CU의 분할을 조기에 결정하며, 추가로 비트율 및 왜곡을 연산하는 예측모드의 개수를 줄임으로써 인코더의 성능을 향상시켰다. 또한 예측모드를 결정할 때 RDOQ를 수행하지 않음으로써 예측모드를 빠르게 결정하며, TU의 분할에 있어서도 CBF의 값 및 임계값을 이용한 early pruning 방법을 수행하여 인코더의 성능을 향상시켰다. 실험결과 5.9%의 luma BDRate의 증가가 있었으나, 63.7%의 인코딩 시간이 절감되었다.

  • PDF