• Title/Summary/Keyword: Algorithmic

Search Result 383, Processing Time 0.028 seconds

A Beamforming-Based Video-Zoom Driven Audio-Zoom Algorithm for Portable Digital Imaging Devices

  • Park, Nam In;Kim, Seon Man;Kim, Hong Kook;Kim, Myeong Bo;Kim, Sang Ryong
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.1
    • /
    • pp.11-19
    • /
    • 2013
  • A video-zoom driven audio-zoom algorithm is proposed to provide audio zooming effects according to the degree of video-zoom. The proposed algorithm is designed based on a super-directive beamformer operating with a 4-channel microphone array in conjunction with a soft masking process that uses the phase differences between microphones. The audio-zoom processed signal is obtained by multiplying the audio gain derived from the video-zoom level by the masked signal. The proposed algorithm is then implemented on a portable digital imaging device with a clock speed of 600 MHz after different levels of optimization, such as algorithmic level, C-code and memory optimization. As a result, the processing time of the proposed audio-zoom algorithm occupies 14.6% or less of the clock speed of the device. The performance evaluation conducted in a semi-anechoic chamber shows that the signals from the front direction can be amplified by approximately 10 dB compared to the other directions.

  • PDF

Development of P-SURO II Hybrid Autonomous Underwater Vehicle and its Experimental Studies (P-SURO II 하이브리드 자율무인잠수정 기술 개발 및 현장 검증)

  • Li, Ji-Hong;Lee, Mun-Jik;Park, Sang-Heon;Kim, Jung-Tae;Kim, Jong-Geol;Suh, Jin-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.9
    • /
    • pp.813-821
    • /
    • 2013
  • In this paper, we present the development of P-SURO II hybrid AUV (Autonomous Underwater Vehicle) which can be operated in both of AUV and ROV (Remotely Operated Vehicle) modes. In its AUV mode, the vehicle is supposed to carry out some of underwater missions which are difficult to be achieved in ROV mode due to the tether cable. To accomplish its missions such as inspection and maintenance of complex underwater structures in AUV mode, the vehicle is required to have high level of autonomy including environmental recognition, obstacle avoidance, autonomous navigation, and so on. In addition to its systematic development issues, some of algorithmic issues are also discussed in this paper. Various experimental studies are also presented to demonstrate these developed autonomy algorithms.

hp-Version of the Finite Element Analysis for Reissner-Mindlin Plates (Reissner-Mindlin 평판의 hp-Version 유한요소해석)

  • Woo, Kwang Sung;Lee, Gee Doug;Ko, Man Gi
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.13 no.2
    • /
    • pp.151-160
    • /
    • 1993
  • This paper is concerned with formulations of the hierarchical $C^{\circ}$-plate element on the basis of Reissner-Mindlin plate theory. On reason for the development of the aforementioned element based on Integrals of Legendre shape functions is that it is still difficult to construct elements based on h-version concepts which are accurate and stable against the shear locking effects. An adaptive mesh refinement and selective p-distribution of the polynomial degree using hp-version of the finite element method are proposed to verify the superior convergence and algorithmic efficiency with the help of the simply supported L-shaped plate problems.

  • PDF

Development of a Branch-and-Bound Global Optimization Based on B-spline Approximation (비스플라인 분지한계법 기반의 전역최적화 알고리즘 개발)

  • Park, Sang-Kun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.2
    • /
    • pp.191-201
    • /
    • 2010
  • This paper presents a new global optimization algorithm based on the branch-and-bound principle using Bspline approximation techniques. It describes the algorithmic components and details on their implementation. The key components include the subdivision of a design space into mutually disjoint subspaces and the bound calculation of the subspaces, which are all established by a real-valued B-spline volume model. The proposed approach was demonstrated with various test problems to reveal computational performances such as the solution accuracy, number of function evaluations, running time, memory usage, and algorithm convergence. The results showed that the proposed algorithm is complete without using heuristics and has a good possibility for application in large-scale NP-hard optimization.

Optimal synthesis for retrofitting heat exchanger network

  • Lee, In-Beum;Jung, Jae-Hak;Chang, Kun-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.1259-1264
    • /
    • 1990
  • During the past two decades, a lot of researches have been done on the synthesis of grassroot heat exchanger networks(HEN). However, few have been dedicated to retrofit of existing heat exchanger networks, which usually use more amount of utilities (i.e. steam and/or cooling water) than the minimum requirements. This excess gives motivation of trades-off between energy saving and rearranging investment. In this paper, an algorithmic-evolutionary synthesis procedure for retrofitting heat exchanger networks is proposed. It consists of two stages. First, after the amount of maximum energy recovery(MER) is computed, a grass-root network featuring minimum number of units(MNU) is synthesized. In this stage, a systematic procedure of synthesizing MNU networks is presented. It is based upon the concept of pinch, from which networks are synthesized in a logical way by the heuristics verified by the pinch technology. In the second stage, since an initial feasible network is synthesized based on the pre-analysis result of MER and must-matches, an assignment problem between new and existing units is solved to minimize total required additional areas. After the existing units are assigned, the network can be improved by switching some units. For this purpose, an improvement problem is formulated and solved to utilize the areas of existing units as much as possible. An example is used to demonstrate the effectiveness of the proposed method.

  • PDF

An Efficient Algorithm for Rebar Element Generation Using 3D CAD Data (3D CAD 데이터 기반의 효율적 철근 요소 생성 알고리즘)

  • Cho, Kyung-Jin;Lee, Jee-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.5
    • /
    • pp.475-485
    • /
    • 2009
  • In this paper a two-step algorithm is proposed to efficiently generate rebar elements from 3D CAD data in the context of CAD/CAE data transfer. The first step is an algorithm to identify various type rebar objects and their attributes by analyzing 3D CAD data in STEP format, which is one of the international data standards. The second algorithmic step is a procedure to generate one-dimensional rebar elements from the object data made through the first step for finite element analysis or other CAE tasks. Successful rebar element data generation from real 3D CAD data for a reinforced concrete structure shows the efficacy of the proposed algorithm.

Design of Learning Courses of Sorting Algorithms using LAMS

  • Yoo, Jae-Soo;Seong, Dong-Ook;Park, Yong-Hun;Lee, Seok-Jae;Yoo, Kwan-Hee;Cho, Ja-Yeon
    • International Journal of Contents
    • /
    • v.4 no.1
    • /
    • pp.20-25
    • /
    • 2008
  • The development of communication technology and the spread of computers and internet have affected to the field of education. In this paper, we design a learning process with LAMS to make the new education environment which is required in an information age. We made the learning environment with LAMS which develops the learner's algorithmic thinking faculty on some sorting algorithm, especially such as selection sort, bubble sort and insertion sort algorithm. In addition, we analyse the effectiveness of the learning environment. The designed contents were applied to elementary school students' learning and a questionnaire survey was conducted after a learning course. The research of the questionnaire shows that the learning system using LAMS motivates a learner for learning and provides a convenient learning environment.

Development of a CAD-based Utility for Topological Identification and Rasterized Mapping from Polygonal Vector Data (CAD 수단을 이용한 벡터형 공간자료의 위상 검출과 격자도면화를 위한 유틸리티 개발)

  • 조동범;임재현
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.27 no.4
    • /
    • pp.137-142
    • /
    • 1999
  • The purpose of this study is to develope a CAD-based tool for rasterization of polygonal vector map in AutoCAD. To identity the layer property of polygonal entity with user-defined coordinates as topology, algorithm in processing entity data of selection set that intersected with scan line was used, and the layers were extracted sequentially by sorted intersecting points in data-list. In addition to the functions for querying and modifying topology, two options for mapping were set up to construct plan projection type and to change meshes' properties in existing DTM data. In case of plan projection type, user-defined cell size of 3DFACE mesh is available for more detailed edge, and topological draping on landform can be executed in case of referring DTM data as an AutoCAD's drawing. The concept of algorithm was simple and clear, but some unexpectable errors were found in detecting intersected coordinates that were AutoCAD's error, not the utility's. Also, the routines to check these errors were included in algorithmic processing. Developed utility named MESHMAP was written in entity data control functions of AutoLISP language and dialog control language(DCL) for the purpose of user-oriented interactive usage. MESHMAP was proved to be more effective in data handling and time comparing with GRIDMAP module in LANDCADD which has similar function.

  • PDF

An Algorithmic Approach to Total Breast Reconstruction with Free Tissue Transfer

  • Yu, Seong Cheol;Kleiber, Grant M.;Song, David H.
    • Archives of Plastic Surgery
    • /
    • v.40 no.3
    • /
    • pp.173-180
    • /
    • 2013
  • As microvascular techniques continue to improve, perforator flap free tissue transfer is now the gold standard for autologous breast reconstruction. Various options are available for breast reconstruction with autologous tissue. These include the free transverse rectus abdominis myocutaneous (TRAM) flap, deep inferior epigastric perforator flap, superficial inferior epigastric artery flap, superior gluteal artery perforator flap, and transverse/vertical upper gracilis flap. In addition, pedicled flaps can be very successful in the right hands and the right patient, such as the pedicled TRAM flap, latissimus dorsi flap, and thoracodorsal artery perforator. Each flap comes with its own advantages and disadvantages related to tissue properties and donor-site morbidity. Currently, the problem is how to determine the most appropriate flap for a particular patient among those potential candidates. Based on a thorough review of the literature and accumulated experiences in the author's institution, this article provides a logical approach to autologous breast reconstruction. The algorithms presented here can be helpful to customize breast reconstruction to individual patient needs.

A Theoretical Framework for Closeness Centralization Measurements in a Workflow-Supported Organization

  • Kim, Min-Joon;Ahn, Hyun;Park, Min-Jae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3611-3634
    • /
    • 2015
  • In this paper, we build a theoretical framework for quantitatively measuring and graphically representing the degrees of closeness centralization among performers assigned to enact a workflow procedure. The degree of closeness centralization of a workflow-performer reflects how near the performer is to the other performers in enacting a corresponding workflow model designed for workflow-supported organizational operations. The proposed framework comprises three procedural phases and four functional transformations, such as discovery, analysis, and quantitation phases, which carry out ICN-to-WsoN, WsoN-to-SocioMatrix, SocioMatrix-to-DistanceMatrix, and DistanceMatrix-to-CCV transformations. We develop a series of algorithmic formalisms for the procedural phases and their transformative functionalities, and verify the proposed framework through an operational example. Finally, we expatiate on the functional expansion of the closeness centralization formulas so as for the theoretical framework to handle a group of workflow procedures (or a workflow package) with organization-wide workflow-performers.