• Title/Summary/Keyword: Spherical Algorithm

Search Result 154, Processing Time 0.021 seconds

Process of pulsations of the spherical cavity in a liquid under the influence of ultrasonic vibrations

  • Kuznetsova, Elena L.;Starovoitov, Eduard I.;Vakhneev, Sergey;Kutina, Elena V.
    • Advances in aircraft and spacecraft science
    • /
    • v.9 no.2
    • /
    • pp.95-102
    • /
    • 2022
  • The paper investigates the process of pulsation of a spherical cavity (bubble) in a liquid under the influence of a source of ultrasonic vibrations. The process of pulsation of a cavitation pocket in liquid is investigated. The Kirkwood-Bethe model was used to describe the motion. A numerical solution algorithm based on the Runge-Kutta-Felberg method of 4-5th order with adaptive selection of the integration step has been developed and implemented. It was revealed that if the initial bubble radius exceeds a certain value, then the bubble will perform several pulsations until the moment of collapse. The same applies to the case of exceeding the amplitude of ultrasonic vibrations of a certain value. The proposed algorithm makes it possible to fully describe the process of cavitation pulsations, to carry out comprehensive parametric studies and to evaluate the influence of various process parameters on the intensity of cavitation.

Spherical Panorama Image Generation Method using Homography and Tracking Algorithm (호모그래피와 추적 알고리즘을 이용한 구면 파노라마 영상 생성 방법)

  • Munkhjargal, Anar;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.42-52
    • /
    • 2017
  • Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

Performance Improvement of RRT* Family Algorithms by Limiting Sampling Range in Circular and Spherical Obstacle Environments (샘플링 범위 제한을 이용한 원 및 구 장애물 환경에서의 RRT* 계열 알고리즘 성능 개량)

  • Lee, Sangil;Park, Jongho;Lim, Jaesung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.11
    • /
    • pp.809-817
    • /
    • 2022
  • The development of unmanned robots and UAVs has increased the need for path planning methods such as RRT* algorithm. It mostly works well in various environments and is utilized in many fields. A lot of research has been conducted to obtain a better path in terms of efficiency through various modifications to the RRT* algorithm, and the performance of the algorithm is continuously improved thanks to these efforts. In this study, a method using the limitation of sampling range is proposed as an extension of these efforts. Based on the idea that a path passing close to obstacles is similar to the optimal path in obstacle environments, nodes are produced around the obstacle. Also, rewiring algorithm is modified to quickly obtain the path. The performance of the proposed algorithm is validated by comparative analysis of the previous basic algorithm and the generated path is tracked by a UAV's kinematic model for further verification.

Study on 3D Sound Source Visualization Using Frequency Domain Beamforming Method (주파수영역 빔형성 기법을 이용한 3차원 소음원 가시화)

  • Hwang, Eun-Sue;Lee, Jae-Hyung;Rhee, Wook;Choi, Jong-Soo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2009.04a
    • /
    • pp.490-495
    • /
    • 2009
  • An approach to 3D visualization of multiple sound sources has been developed with the application of a moving array technique. Frequency-domain beamforming algorithm is used to generate a beam power map and the sound source is modeled as a point source. When a conventional delay and sum beamformer is used, it is considered that 2D distribution of sensors leads to have deficiency in spatial resolution along a measurement distance. The goal of moving an array in this study is to form 3D array aperture surrounding multiple sound sources so that the improved spatial resolution in a virtual space can be expected. Numerical simulation was made to examine source localization capabilities of various shapes of array. The 3D beam power maps of hemispherical and spherical distribution are found to have very sharp resolution. For experiments, two sound sources were placed in the middle of defined virtual space and arc-shaped line array was rotated around the sources. It is observed that spherical array show the most accurate determination of multiple sources' positions.

  • PDF

Study on 3D Sound Source Visualization Using Frequency Domain Beamforming Method (주파수영역 빔형성 기법을 이용한 3차원 소음원 가시화)

  • Hwang, Eun-Sue;Lee, Jae-Hyung;Rhee, Wook;Choi, Jong-Soo
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.19 no.9
    • /
    • pp.907-914
    • /
    • 2009
  • An approach to 3D visualization of multiple sound sources has been developed with the application of a moving array technique. Frequency domain beamforming algorithm is used to generate a beam power map and the sound source is modeled as a point source. When a conventional delay and sum beamformer is used, it is considered that 2D distribution of sensors leads to have deficiency in spatial resolution along a measurement distance. The goal of moving an array in this study is to form 3D array aperture surrounding multiple sound sources so that the improved spatial resolution in a virtual space can be expected. Numerical simulation was made to examine source localization capabilities of various shapes of array. The 3D beam power maps of hemispherical and spherical distribution are found to have very sharp resolution. For experiments, several sound sources were placed in the middle of defined virtual space and arc-shaped line array was rotated around the sources. It is observed that spherical array shows the most accurate determination of multiple sources' positions.

Comparison of Target Approximation Techniques for Stereotactic Radiosurgical Plan

  • Choi, Kyoung-Sik;Oh, Seong-Jong;Lee, Jeong-Woo;Choe, Bo-Young;Kim, Moon-Chan;Chung, Hyun-Tai;Suh, Tae-Su
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2005.04a
    • /
    • pp.47-50
    • /
    • 2005
  • The aim of radiosurgery cures a patient to deliver the lower dose at the normal organ and the higher dose at the tumor. Therefore accuracy of the dose is required to gain effect of radiosurgery in surgical planning. In this paper, we developed the methods of target approximation for a fast treatment planning. Nominally, the stereotactic radiosurgery(SRS) using Linac and Gamma knife produces spherical dose distribution through circular collimators using multiple arcs and 201 holes on semi-spherical helmet by $^{60}Co$. We developed an automatic radiosurgical plan about spherical packing arrangement. To automatically plan the SRS, new planning methods based on cylinder and cube structure for target shaping was developed. This approach using heuristic and stochastic algorithm is a useful radiosurgical plan without restrictions in the various tumor shapes and the different modalities.

  • PDF

Rheology and pipeline transportation of dense fly ash-water slurry

  • Usui, Hiromoto;Li, Lei;Suzuki, Hiroshi
    • Korea-Australia Rheology Journal
    • /
    • v.13 no.1
    • /
    • pp.47-54
    • /
    • 2001
  • Prediction of the maximum packing volume fraction with non-spherical particles has been one of the important problems in powder technology. The sphericity of fly ash particles depending on the particle diameter was measured by means of a CCD image processing instrument. An algorithm to predict the maximum packing volume fraction with non-spherical particles is proposed. The maximum packing volume fraction is used to predict the slurry viscosity under well dispersed conditions. For this purpose, Simha's cell model is applied for concentrated slurry with wide particle size distribution. Also, Usui's model developed for aggregative slurries is applied to predict the non-Newtonian viscosity of dense fly ash - water slurry. It is certified that the maximum packing volume fraction for non-spherical particles can be successfully used to predict slurry viscosity. The pressure drop in a pipe flow is predicted by using the non-Newtonian viscosity of dense fly ash-water slurry obtained by the present model. The predicted relationship between pressure drop and flow rate results in a good agreement with the experimented data obtained for a test rig with 50 mm inner diameter tube. Base on the design procedure proposed in this study, a feasibility study of fly ash hydraulic transportation system from a coal-fired power station to a controlled deposit site is carried out to give a future prospect of inexpensive fly ash transportation technology.

  • PDF

Modelling the shapes of the largest gravitationally bound objects

  • Rossi, Graziano;Sheth, Ravi K.;Tormen, Giuseppe
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.2
    • /
    • pp.53.2-53.2
    • /
    • 2011
  • We combine the physics of the ellipsoidal collapse model with the excursion set theory to study the shapes of dark matter halos. In particular, we develop an analytic approximation to the nonlinear evolution that is more accurate than the Zeldovich approximation; we introduce a planar representation of halo axis ratios, which allows a concise and intuitive description of the dynamics of collapsing regions and allows one to relate the final shape of a halo to its initial shape; we provide simple physical explanations for some empirical fitting formulae obtained from numerical studies. Comparison with simulations is challenging, as there is no agreement about how to define a non-spherical gravitationally bound object. Nevertheless, we find that our model matches the conditional minor-to-intermediate axis ratio distribution rather well, although it disagrees with the numerical results in reproducing the minor-to-major axis ratio distribution. In particular, the mass dependence of the minor-to-major axis distribution appears to be the opposite to what is found in many previous numerical studies, where low-mass halos are preferentially more spherical than high-mass halos. In our model, the high-mass halos are predicted to be more spherical, consistent with results based on a more recent and elaborate halo finding algorithm, and with observations of the mass dependence of the shapes of early-type galaxies. We suggest that some of the disagreement with some previous numerical studies may be alleviated if we consider only isolated halos.

  • PDF

RANSAC-based Or thogonal Vanishing Point Estimation in the Equirectangular Images

  • Oh, Seon Ho;Jung, Soon Ki
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.12
    • /
    • pp.1430-1441
    • /
    • 2012
  • In this paper, we present an algorithm that quickly and effectively estimates orthogonal vanishing points in equirectangular images of urban environment. Our algorithm is based on the RANSAC (RANdom SAmple Consensus) algorithm and on the characteristics of the line segment in the spherical panorama image of the $360^{\circ}$ longitude and $180^{\circ}$ latitude field of view. These characteristics can be used to reduce the geometric ambiguity in the line segment classification as well as to improve the robustness of vanishing point estimation. The proposed algorithm is validated experimentally on a wide set of images. The results show that our algorithm provides excellent levels of accuracy for the vanishing point estimation as well as line segment classification.

An Improved Guidance Algorithm for Smooth Transition at Way-Points in 3D Space for Autonomous Underwater Vehicles

  • Subramanian, Saravanakumar;Thondiyath, Asokan
    • International Journal of Ocean System Engineering
    • /
    • v.2 no.3
    • /
    • pp.139-150
    • /
    • 2012
  • This paper presents an improved guidance algorithm for autonomous underwater vehicles (AUV) in 3D space for generating smoother vehicle turn during the course change at the way-points. The way-point guidance by the line-of-sight (LOS) method has been modified for correcting the reference angles to achieve minimal calculation and smoother transition at the way-points. The algorithm has two phases in which the first phase brings the vehicle to converge to a distance threshold point on the line segment connecting the first two way-points and the next phase generates an angular path with smoother transition at the way-points. Then the desired angles are calculated from the reference and correction angles. The path points are regularly parameterized in the spherical coordinates and mapped to the Cartesian coordinates. The proposed algorithm is found to be simple and can be used for real time implementation. The details of the algorithm and simulation results are presented.