• Title/Summary/Keyword: K-means++ algorithm

Search Result 1,363, Processing Time 0.027 seconds

Weather Classification and Fog Detection using Hierarchical Image Tree Model and k-mean Segmentation in Single Outdoor Image (싱글 야외 영상에서 계층적 이미지 트리 모델과 k-평균 세분화를 이용한 날씨 분류와 안개 검출)

  • Park, Ki-Hong
    • Journal of Digital Contents Society
    • /
    • v.18 no.8
    • /
    • pp.1635-1640
    • /
    • 2017
  • In this paper, a hierarchical image tree model for weather classification is defined in a single outdoor image, and a weather classification algorithm using image intensity and k-mean segmentation image is proposed. In the first level of the hierarchical image tree model, the indoor and outdoor images are distinguished. Whether the outdoor image is daytime, night, or sunrise/sunset image is judged using the intensity and the k-means segmentation image at the second level. In the last level, if it is classified as daytime image at the second level, it is finally estimated whether it is sunny or foggy image based on edge map and fog rate. Some experiments are conducted so as to verify the weather classification, and as a result, the proposed method shows that weather features are effectively detected in a given image.

The BIOWAY System: A Data Warehouse for Generalized Representation & Visualization of Bio-Pathways

  • Kim, Min Kyung;Seo, Young Joo;Lee, Sang Ho;Song, Eun Ha;Lee, Ho Il;Ahn, Chang Shin;Choi, Eun Chung;Park, Hyun Seok
    • Genomics & Informatics
    • /
    • v.2 no.4
    • /
    • pp.191-194
    • /
    • 2004
  • Exponentially increasing biopathway data in recent years provide us with means to elucidate the large-scale modular organization of the cell. Given the existing information on metabolic and regulatory networks, inferring biopathway information through scientific reasoning or data mining of large scale array data or proteomics data get great attention. Naturally, there is a need for a user-friendly system allowing the user to combine large and diverse pathway data sets from different resources. We built a data warehouse - BIOWAY - for analyzing and visualizing biological pathways, by integrating and customizing resources. We have collected many different types of data in regards to pathway information, including metabolic pathway data from KEGG/LIGAND, signaling pathway data from BIND, and protein information data from SWISS-PROT. In addition to providing general data retrieval mechanism, a successful user interface should provide convenient visualization mechanism since biological pathway data is difficult to conceptualize without graphical representations. Still, the visual interface in the previous systems, at best, uses static images only for the specific categorized pathways. Thus, it is difficult to cope with more complex pathways. In the BIOWAY system, all the pathway data can be displayed in computer generated graphical networks, rather than manually drawn image data. Furthermore, it is designed in such a way that all the pathway maps can be expanded or shrinked, by introducing the concept of super node. A subtle graphic layout algorithm has been applied to best display the pathway data.

Comparison of Newton's and Euler's Algorithm in a Compound Pendulum (복합진자 모형의 뉴튼.오일러 알고리즘 비교)

  • Hah, Chong-Ku
    • Korean Journal of Applied Biomechanics
    • /
    • v.16 no.3
    • /
    • pp.1-7
    • /
    • 2006
  • The Primary type of swinging motion in human movement is that which is characteristic of a pendulum. The two types of pendulums are identified as simple and compound. A simple pendulum consist of a small body suspended by a relatively long cord. Its total mass is contained within the bob. The cord is not considered to have mass. A compound pendulum, on the other hand, is any pendulum such as the human body swinging by hands from a horizontal bar. Therefore a compound pendulum depicts important motions that are harmonic, periodic, and oscillatory. In this paper one discusses and compares two algorithms of Newton's method(F = m a) and Euler's method (M = $I{\times}{\alpha}$) in compound pendulum. Through exercise model such as human body with weight(m = 50 kg), body length(L = 1.5m), and center of gravity ($L_c$ = 0.4119L) from proximal end swinging by hands from a horizontal bar, one finds kinematic variables(angle displacement / velocity / acceleration), and simulates kinematic variables by changing body lengths and body mass. BSP by Clauser et al.(1969) & Chandler et al.(1975) is used to find moment of inertia of the compound pendulum. The radius of gyration about center of gravity (CoG) is $k_c\;=\;K_c{\times}L$ (단, k= radius of gyration, K= radius of gyration /segment length), and then moment of inertia about center of gravity(CoG) becomes $I_c\;=\;m\;k_c^2$. Finally, moment of inertia about Z-axis by parallel theorem becomes $I_o\;=\;I_c\;+\;m\;k^2$. The two-order ordinary differential equations of models are solved by ND function of numeric analysis method in Mathematica5.1. The results are as follows; First, The complexity of Newton's method is much more complex than that of Euler's method Second, one could be find kinematic variables according to changing body lengths(L = 1.3 / 1.7 m) and periods are increased by body length increment(L = 1.3 / 1.5 / 1.7 m). Third, one could be find that periods are not changing by means of changing mass(m = 50 / 55 / 60 kg). Conclusively, one is intended to meditate the possibility of applying a compound pendulum to sports(balling, golf, gymnastics and so on) necessary swinging motions. Further improvements to the study could be to apply Euler's method to real motions and one would be able to develop the simulator.

Influence of Groove Location on Lubrication Characteristics of the Piston and Cylinder in a Linear Compressor (그루브 위치가 리니어 압축기용 피스톤과 실린더의 윤활특성에 미치는 영향)

  • Jeon, W.J.;Son, S.I.;Lee, H.;Kim, J.W.;Kim, K.W.
    • Tribology and Lubricants
    • /
    • v.32 no.1
    • /
    • pp.24-31
    • /
    • 2016
  • In this paper hydrodynamic lubrication analysis is carried out to investigate the effects of groove location on the lubrication performance of a piston and cylinder system in a linear compressor. The rectangle shaped grooves having a constant groove depth and width are applied on the lubrication area of the piston. The Universal Reynolds equation is used to calculate the oil film pressure, and the Elrod algorithm with the finite different method is used to solve the governing equation. The JFO boundary condition is applied to predict cavitation regions. Transient analysis for different locations of the grooves on the piston is carried out using the typical operating condition of the linear compressor in order to estimate the variations of frictional power losses and minimum film thicknesses. When the grooves are applied on the lubrication area, both the frictional power loss and the minimum film thickness decrease. The frictional power loss can be reduced effectively, while maintaining a minimum film thickness to enable the piston operation without direct contact with the cylinder surface, by means of choosing a proper location of the grooves. The optimum location of the grooves to improve a lubrication performance depends on the operation condition or the system requirements specification.

Real-Time Lane Detection Based on Inverse Perspective Transform and Search Range Prediction (역 원근 변환과 검색 영역 예측에 의한 실시간 차선 인식)

  • Jeong, Seung-Gweon;Kim, In-Soo;Kim, Sung-Han;Lee, Dong-Hwoal;Yun, Kang-Sup;Lee, Man-Hyung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.3
    • /
    • pp.68-74
    • /
    • 2001
  • A lane detection based on a road model or feature all needs correct acquirement of information on the lane in an image. It is inefficient to implement a lane detection algorithm through the full range of an image when it is applied to a real road in real time because of the calculating time. This paper defines two (other proper terms including"modes") for detecting lanes on a road. First is searching mode that is searching the lane without any prior information of a road. Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It allows to extract accurately and efficiently the edge candidate points of a lane without any unnecessary searching. By means of inverse perspective transform which removes the perspective effect on the edge candidate points, we transform the edge candidate information in the Image Coordinate System(ICS) into the plan-view image in the World Coordinate System(WCS). We define a linear approximation filter and remove faulty edge candidate points by using it. This paper aims at approximating more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.e fitting.

  • PDF

A Study on Human Autonomic Nervous System Activities by Far-Infrared Ray Hyperthermia (원적외선 온열이 인체 자율신경기능에 미치는 영향에 관한 연구)

  • Park Chan-Ouk;Jang Yun-Ho;Min Se-Dong;Kang Se-Gu;Lee Chung-Keun;Lee Myoungho
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.623-628
    • /
    • 2004
  • This paper describes autonomic nervous system activities caused by hyperthermia of far-infrared ray on human body. Designed protocol and analysis algorithm were evaluated by experiments on 20 subjects to analyze the characteristic of heart rate variability(HRV) signals which could be analyzed by FFT power spectrum and time-frequency analysis. Using Poincare' plot analysis, LF and HF were compared with SD1 and SD2. During the experiment, subject was exposed to hyperthermic effects of far-infrared radiation. We could confirm that far-infrared ray, which was known to improve the blood circulation, stress state and enhancing thermal effect into human body, had an effect on human nervous system. As the hyperthermic temperature of far-infrared ray increased, the activity of cardiovascular system to sustain the homeostasis was observed by means of investigating the increase of the sympathetic activity.

Determination of Tumor Boundaries on CT Images Using Unsupervised Clustering Algorithm (비교사적 군집화 알고리즘을 이용한 전산화 단층영상의 병소부위 결정에 관한 연구)

  • Lee, Kyung-Hoo;Ji, Young-Hoon;Lee, Dong-Han;Yoo, Seoung-Yul;Cho, Chul-Koo;Kim, Mi-Sook;Yoo, Hyung-Jun;Kwon, Soo-Il;Chun, Jun-Chul
    • Journal of Radiation Protection and Research
    • /
    • v.26 no.2
    • /
    • pp.59-66
    • /
    • 2001
  • It is a hot issue to determine the spatial location and shape of tumor boundary in fractionated stereotactic radiotherapy (FSRT). We could get consecutive transaxial plane images from the phantom (paraffin) and 4 patients with brain tumor using helical computed tomography(HCT). K-means classification algorithm was adjusted to change raw data pixel value in CT images into classified average pixel value. The classified images consists of 5 regions that ate tumor region (TR), normal region (NR), combination region (CR), uncommitted region (UR) and artifact region (AR). The major concern was how to separate the normal region from tumor region in the combination area. Relative average deviation analysis was adjusted to alter average pixel values of 5 regions into 2 regions of normal and tumor region to define maximum point among average deviation pixel values. And then we drawn gross tumor volume (GTV) boundary by connecting maximum points in images using semi-automatic contour method by IDL(Interactive Data Language) program. The error limit of the ROI boundary in homogeneous phantom is estimated within ${\pm}1%$. In case of 4 patients, we could confirm that the tumor lesions described by physician and the lesions described automatically by the K-mean classification algorithm and relative average deviation analyses were similar. These methods can make uncertain boundary between normal and tumor region into clear boundary. Therefore it will be useful in the CT images-based treatment planning especially to use above procedure apply prescribed method when CT images intermittently fail to visualize tumor volume comparing to MRI images.

  • PDF

Update of Digital Map by using The Terrestrial LiDAR Data and Modified RANSAC (수정된 RANSAC 알고리즘과 지상라이다 데이터를 이용한 수치지도 건물레이어 갱신)

  • Kim, Sang Min;Jung, Jae Hoon;Lee, Jae Bin;Heo, Joon;Hong, Sung Chul;Cho, Hyoung Sig
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.4
    • /
    • pp.3-11
    • /
    • 2014
  • Recently, rapid urbanization has necessitated continuous updates in digital map to provide the latest and accurate information for users. However, conventional aerial photogrammetry has some restrictions on periodic updates of small areas due to high cost, and as-built drawing also brings some problems with maintaining quality. Alternatively, this paper proposes a scheme for efficient and accurate update of digital map using point cloud data acquired by Terrestrial Laser Scanner (TLS). Initially, from the whole point cloud data, the building sides are extracted and projected onto a 2D image to trace out the 2D building footprints. In order to register the footprint extractions on the digital map, 2D Affine model is used. For Affine parameter estimation, the centroids of each footprint groups are randomly chosen and matched by means of a modified RANSAC algorithm. Based on proposed algorithm, the experimental results showed that it is possible to renew digital map using building footprint extracted from TLS data.

A New Upper Layer Decoding Algorithm for a Hybrid Satellite and Terrestrial Delivery System (혼합된 위성 및 지상 전송 시스템에서 새로운 상위 계층 복호 알고리즘)

  • Kim, Min-Hyuk;Park, Tae-Doo;Kim, Nam-Soo;Kim, Chul-Seung;Jung, Ji-Won;Chun, Seung-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.9
    • /
    • pp.835-842
    • /
    • 2009
  • DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. However, a critical factor must be considered in upper layer decoding which including erasure Reed-Solomon error correction combined with cyclic redundancy check. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. IF, for example, there is one real byte error, in an If packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed two kinds of upper layer decoding methods; LLR-based decoding and hybrid decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

A Statistical Approach for Improving the Embedding Capacity of Block Matching based Image Steganography (블록 매칭 기반 영상 스테가노그래피의 삽입 용량 개선을 위한 통계적 접근 방법)

  • Kim, Jaeyoung;Park, Hanhoon;Park, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.22 no.5
    • /
    • pp.643-651
    • /
    • 2017
  • Steganography is one of information hiding technologies and discriminated from cryptography in that it focuses on avoiding the existence the hidden information from being detected by third parties, rather than protecting it from being decoded. In this paper, as an image steganography method which uses images as media, we propose a new block matching method that embeds information into the discrete wavelet transform (DWT) domain. The proposed method, based on a statistical analysis, reduces loss of embedding capacity due to inequable use of candidate blocks. It works in such a way that computes the variance of each candidate block, preserves candidate blocks with high frequency components while reducing candidate blocks with low frequency components by compressing them exploiting the k-means clustering algorithm. Compared with the previous block matching method, the proposed method can reconstruct secret images with similar PSNRs while embedding higher-capacity information.