• Title/Summary/Keyword: subdivision algorithm

Search Result 69, Processing Time 0.03 seconds

A study on a ballast optimization algorithm for onboard decision support system (선내탑재 의사결정지원 시스템을 위한 발라스트 최적화 알고리즘에 관한 연구)

  • Shin Sung-Chul
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2005.10a
    • /
    • pp.75-80
    • /
    • 2005
  • Because there are only a limited number of means of action that are available for the master to pursue in the event of flooding, onboard decision support system has been required The majority of systems activated during a flooding emergency (such as watertight and semi-watertight doors, bulkhead valves, dewatering pumps etc.) almost exclusively aim to restore a sufficiently high level of subdivision to prevent flooding from spreading through the ship. Even though assuming the flooding scenario is not catastrophic, the use of ballast tanks can be an additional and very effective tool to ensure both prevention of flooding spreading and also improve ship stability. This paper describes an optimization algorithm devised to choose the set of ballast tanks that should be filled in order to achieve an optimal response to a flooding accident.

  • PDF

Image Segmentation of Lung Parenchyma using Improved Deformable Model on Chest Computed Tomography (개선된 가변형 능동모델을 이용한 흉부 컴퓨터단층영상에서 폐 실질의 분할)

  • Kim, Chang-Soo;Choi, Seok-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2163-2170
    • /
    • 2009
  • We present an automated, energy minimized-based method for Lung parenchyma segmenting Chest Computed Tomography(CT) datasets. Deformable model is used for energy minimized segmentation. Quantitative knowledge including expected volume, shape of Chest CT provides more feature constrain to diagnosis or surgery operation planning. Segmentation subdivides an lung image into its consistent regions or objects. Depends on energy-minimizing, the level detail image of subdivision is carried. Segmentation should stop when the objects or region of interest in an application have been detected. The deformable model that has attracted the most attention to date is popularly known as snakes. Snakes or deformable contour models represent a special case of the general multidimensional deformable model theory. This is used extensively in computer vision and image processing applications, particularly to locate object boundaries, in the mean time a new type of external force for deformable models, called gradient vector flow(GVF) was introduced by Xu. Our proposed algorithm of deformable model is new external energy of GVF for exact segmentation. In this paper, Clinical material for experiments shows better results of proposal algorithm in Lung parenchyma segmentation on Chest CT.

A Matrix-Based Graph Matching Algorithm with Application to a Musical Symbol Recognition (행렬기반의 정합 알고리듬에 의한 음악 기호의 인식)

  • Heo, Gyeong-Yong;Jang, Kyung-Sik;Jang, Moon-Ik;Kim, Jai-Hie
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.8
    • /
    • pp.2061-2074
    • /
    • 1998
  • In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

  • PDF

Using a computer color image automatic detection algorithm for gastric cancer (컴퓨터 컬러 영상을 이용한 위암 자동검출 알고리즘)

  • Han, Hyun-Ji;Kim, Young-Mok;Lee, Ki-Young;Lee, Sang-Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.4
    • /
    • pp.250-257
    • /
    • 2011
  • This experiment present the automatic detection algorithm of gastric cancer that take second place among all cancers. If an inflammation and a cancer are not examined carefully, early ones have difficulty in being diagnosed as illnesses than advanced ones. For diagnosis of gastric cancer, and progressing cancer in this study, present 4 algorithm. research team extracted an abnormal part in stomach through the endoscope image. At first, decide to use shading technique or not in each endoscope image for study. it make easy distinguish to whether tumor is existing or not by putting shading technique in or eliminate it by the color. Second. By passing image subjoin shading technique to erosion filter, eliminate noise and make give attention to diagnose. Third. Analyzing out a line and fillet graph from image adding surface shade and detect RED value according to degree of symptoms. Fourth. By suggesting this algorithm, that making each patient's endscope image into subdivision graph including RED graph value, afterward revers the color, revealing the position of tumor, this study desire to help to diagnosing gastric, other cancer and inflammation.

Case Analysis and Applicability Review of Parametric Design in Landscape Architectural Design (조경 설계 분야에서 파라메트릭 디자인의 사례 분석과 활용 가능성)

  • Na, Sungjin
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.49 no.2
    • /
    • pp.1-16
    • /
    • 2021
  • The act of design in landscape architecture consists of a concept within a designer's mind, technical representations, and finally, a process of construction. In the 4th Industrial Revolution, the design process is facing many changes due to the rapid development of computer technology and the IT ecosystem. Computer technology was initially developed for simple functions, such as mathematical calculation and graphic representation. However, after the spread of Personal Computers, starting with IBM and Macintosh, programming languages and hardware rapidly developed, algorithms and applications became specialized, and the purpose of using computers became very diverse. This study diagnoses issues concerning the functions and roles that new design methods, such as computational design, parametric design, and algorithmic design, can play in landscape architecture based on changes in the digital society. The study focused on the design methodology using parametric technology, which has recently received the most attention. First, the basis for discussion was developed by examining the main concepts and characteristics of parametric design in modern landscape architecture. Prior research on the use of parametric design in landscape architecture was analyzed, as were the case studies conducted by landscape design firms. As a result, it was confirmed that parametric design has not been sufficiently discussed in terms of the number and diversity of studies compared to other techniques investigated by landscape design firms. Finally, based on the discussion, the study examined specific cases and future possibilities of the parametric design in landscape architecture.

DThe Effect of Thickness Ratio and Hight Ratio of Inner Beam on Strength and Stiffness of Frame in Shuttle Car for LMTT (Inner Beam의 두께비 및 높이비가 LMTT용 Shuttle Car의 Frame 강도 및 강성에 미치는 영향)

  • Han, GD.S.;Han, G.J.;Lee, K.S.;Shim, J.J.;Kim, T.H.
    • Journal of Navigation and Port Research
    • /
    • v.28 no.3
    • /
    • pp.207-211
    • /
    • 2004
  • The final goal of this research is to establish the relative dangerousness D/B for factors on seakeeping performance. This D/B is essential to develope the seakeeping performance evaluation system built-on-ship. The system is composed of the apparatus for measuring a vertical acceleration to be generated by the ship's motions, computer for calculating the synthetic seakeeping performance index and monitor for displaying the evaluating diagram of navigational safety of ship. In this paper, a methodology on the establishment of the relative dangerousness D/B for factors on seakeeping performance is presented by a numerical simulations, playing an important role on the algorithm of the program for calculating the synthetic seakeeping performance index. Finally, It is investigated whether the relative dangerousness D/B can be realized an accurate values according to the loading conditions, weather conditions, wave directions end present ship's speed of a model ship.

A Hybrid Shadow Testing Scheme During Ray Tracing (광선추적 수행중 혼합 음영검사에 관한 연구)

  • Eo, Kil-Su;Kyung, Chong-Min
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.3
    • /
    • pp.95-104
    • /
    • 1989
  • This paper presents a new shadow testing acceleration scheme for ray tracing called Hybrid Shadow Testing (HST) based on a conditional switching between the conventinal shadow testing method and Crow's shadow volume method, where the shadow polygons as well as the object polygons are registered onto the corresponding cells under the 3-D space subdivision environment. Despite the preprocessing time for the generation and registration of the shadow polygons, the total shadow testing time of the proposed algorithm, HST was approximately 50% of that of the conventional shadow testing method for several examples while the total ray tracing time was typically reduced by 30% from the conventional approach. This due to the selective use of the shadow volume method with a compromise between the maximal utilisation of shadow's spatial coherency and minimising the computational overhead for checking ray intersections with the shadow polygons. A parameter, $N_{th}$ denoting the critical number of shadow polygons between successive reflection points was used as a guideline for switching the shadow testing scheme between the conventional method and shadow volume method. A method for calculating $N_{th}$ from such statistical data as the number of object polygons, average polygon size average peripheral length of the polygons was proposed, resulting in good agreement with the experimental results.

  • PDF

Object-Based Integral Imaging Depth Extraction Using Segmentation (영상 분할을 이용한 객체 기반 집적영상 깊이 추출)

  • Kang, Jin-Mo;Jung, Jae-Hyun;Lee, Byoung-Ho;Park, Jae-Hyeung
    • Korean Journal of Optics and Photonics
    • /
    • v.20 no.2
    • /
    • pp.94-101
    • /
    • 2009
  • A novel method for the reconstruction of 3D shape and texture from elemental images has been proposed. Using this method, we can estimate a full 3D polygonal model of objects with seamless triangulation. But in the triangulation process, all the objects are stitched. This generates phantom surfaces that bridge depth discontinuities between different objects. To solve this problem we need to connect points only within a single object. We adopt a segmentation process to this end. The entire process of the proposed method is as follows. First, the central pixel of each elemental image is computed to extract spatial position of objects by correspondence analysis. Second, the object points of central pixels from neighboring elemental images are projected onto a specific elemental image. Then, the center sub-image is segmented and each object is labeled. We used the normalized cut algorithm for segmentation of the center sub-image. To enhance the speed of segmentation we applied the watershed algorithm before the normalized cut. Using the segmentation results, the subdivision process is applied to pixels only within the same objects. The refined grid is filtered with median and Gaussian filters to improve reconstruction quality. Finally, each vertex is connected and an object-based triangular mesh is formed. We conducted experiments using real objects and verified our proposed method.

A Development of Pre and Post Processor for Design of Surface System of Free Form Building (비정형 건축물의 외피시스템 설계를 위한 전·후처리 모듈 개발)

  • Park, Se-Hee;Jung, Sung-Jin;Lee, Jae-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.9
    • /
    • pp.333-340
    • /
    • 2018
  • Recently, free-form buildings have been designed with complex shapes due to digitization of the construction industry. Exterior and interior components of free-form buildings have free cross sections and curved shapes. Therefore, structural members with curvature are frequently seen. In the modeling and stability evaluation of these structures, commercial programs using classical finite element analysis are not able to perform rapid shape modeling, resulting in a decrease in productivity. Therefore, in this study, pre- and post-processing modules were developed using a prior study to rapidly model the surface of a free-form building and to automatically generate frame structures that make up the cladding. The developed modules use a subdivision algorithm with spline curves. This algorithm is used to automatically generate analytical elements from the configuration information of NURBS curves. In addition, the deformation after analysis can be viewed more realistically. The modules can quickly construct complex curved surfaces. An analysis model of the frame structure was also automatically generated. Therefore, the modules could contribute to the productivity improvement of free-form building design.