• Title/Summary/Keyword: 혼합클러스터링

Search Result 54, Processing Time 0.023 seconds

A Study on the Hybrid Fractal clustering Algorithm with SOFM vector Quantizer (벡터양자화기와 혼합된 프렉탈의 클러스터링 알고리즘에 대한 연구)

  • 김영정;박원우;김상희;임재권
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.195-198
    • /
    • 2000
  • Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

  • PDF

A Process for Transforming Non-component Java Programs into EJB Programs (비 컴포넌트 자바 프로그램에서 EJB 프로그램으로의 변환 프로세스)

  • Lee, Sung-Eun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.173-186
    • /
    • 2006
  • In this paper, we suggest a process that transforms non-component Java programs into EJB component programs. We approach following methods to increase reusability of existing Java-based programs. We extract proper factors from existing non-component Java programs to construct for component model, and we suggest a transformation technique using extracted factors. Extracted factors are transformed into EJB components. With consideration for reusability of existing programs and EJB's characteristic, we suggest a process that mixes class clustering and method oriented class restructuring.

  • PDF

A Web Contents Ranking Algorithm using Bookmarks and Tag Information on Social Bookmarking System (소셜 북마킹 시스템에서의 북마크와 태그 정보를 활용한 웹 콘텐츠 랭킹 알고리즘)

  • Park, Su-Jin;Lee, Si-Hwa;Hwang, Dae-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1245-1255
    • /
    • 2010
  • In current Web 2.0 environment, one of the most core technology is social bookmarking which users put tags and bookmarks to their interesting Web pages. The main purpose of social bookmarking is an effective information service by use of retrieval, grouping and share based on user's bookmark information and tagging result of their interesting Web pages. But, current social bookmarking system uses the number of bookmarks and tag information separately in information retrieval, where the number of bookmarks stand for user's degree of interest on Web contents, information retrieval, and classification serve the purpose of tag information. Because of above reason, social bookmarking system does not utilize effectively the bookmark information and tagging result. This paper proposes a Web contents ranking algorithm combining bookmarks and tag information, based on preceding research on associative tag extraction by tag clustering. Moreover, we conduct a performance evaluation comparing with existing retrieval methodology for efficiency analysis of our proposed algorithm. As the result, social bookmarking system utilizing bookmark with tag, key point of our research, deduces a effective retrieval results compare with existing systems.

An Energy Efficient Hybrid Routing Protocol Based on LEACH and PEGASIS (LEACH와 PEGASIS 기법에 기반한 에너지 효율적 하이브리드 라우팅 규약)

  • Lee, Young-Han;Lee, Hyun-Jun;Lee, Kyung-Oh
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.629-636
    • /
    • 2009
  • Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.

Station Extension Algorithm Considering Destinations to Solve Illegal Parking of E-Scooters

  • Jeongeun, Song;Yoon-Ah, Song;ZoonKy, Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.131-142
    • /
    • 2023
  • In this paper, we propose a new station selection algorithm to solve the illegal parking problem of shared electric scooters and improve the service quality. Recently, as a solution to the urban transportation problem, shared electric scooters are attracting attention as the first and last mile means between public transportation and final destinations. As a result, the shared electric scooter market grew rapidly, problems caused by electric scooters are becoming serious. Therefore, in this study, text data are collected to understand the nature of the problem, and the problems related to shared scooters are viewed from the perspective of pedestrians and users in 'LDA Topic Modeling', and a station extension algorithm is based on this. Some parking lots have already been installed, but the existing parking lot location is different from the actual area of tow. Therefore, in this study, we propose an algorithm that can install stations at high actual tow density using mixed clustering technology using K-means after primary clustering by DBSCAN, reflecting the 'current state of electric scooter tow in Seoul'.

Extracting Patterns of Airport Approach Using Gaussian Mixture Models and Analyzing the Overshoot Probabilities (가우시안 혼합모델을 이용한 공항 접근 패턴 추출 및 패턴 별 과이탈 확률 분석)

  • Jaeyoung Ryu;Seong-Min Han;Hak-Tae Lee
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.6
    • /
    • pp.888-896
    • /
    • 2023
  • When an aircraft is landing, it is expected that the aircraft will follow a specified approach procedure and then land at the airport. However, depending on the airport situation, neighbouring aircraft or the instructions of the air traffic controller, there can be a deviation from the specified approach. Detecting aircraft approach patterns is necessary for traffic flow and flight safety, and this paper suggests clustering techniques to identify aircraft patterns in the approach segment. The Gaussian Mixture Model (GMM), one of the machine learning techniques, is used to cluster the trajectories of aircraft, and ADS-B data from aircraft landing at the Gimhae airport in 2019 are used. The aircraft trajectories are clustered on the plane, and a total of 86 approach trajectory patterns are extracted using the centroid value of each cluster. Considering the correlation between the approach procedure pattern and overshoots, the distribution of overshoots is calculated.

Computer Vision Approach for Phenotypic Characterization of Horticultural Crops (컴퓨터 비전을 활용한 토마토, 파프리카, 멜론 및 오이 작물의 표현형 특성화)

  • Seungri Yoon;Minju Shin;Jin Hyun Kim;Ho Jeong Jeong;Junyoung Park;Tae In Ahn
    • Journal of Bio-Environment Control
    • /
    • v.33 no.1
    • /
    • pp.63-70
    • /
    • 2024
  • This study explored computer vision methods using the OpenCV open-source library to characterize the phenotypes of various horticultural crops. In the case of tomatoes, image color was examined to assess ripeness, while support vector machine (SVM) and histogram of oriented gradients (HOG) methods effectively identified ripe tomatoes. For sweet pepper, we visualized the color distribution and used the Gaussian mixture model for clustering to analyze its post-harvest color characteristics. For the quality assessment of netted melons, the LAB (lightness, a, b) color space, binary images, and depth mapping were used to measure the net patterns of the melon. In addition, a combination of depth and color data proved successful in identifying flowers of different sizes and distances in cucumber greenhouses. This study highlights the effectiveness of these computer vision strategies in monitoring the growth and development, ripening, and quality assessment of fruits and vegetables. For broader applications in agriculture, future researchers and developers should enhance these techniques with plant physiological indicators to promote their adoption in both research and practical agricultural settings.

Underdetermined blind source separation using normalized spatial covariance matrix and multichannel nonnegative matrix factorization (멀티채널 비음수 행렬분해와 정규화된 공간 공분산 행렬을 이용한 미결정 블라인드 소스 분리)

  • Oh, Son-Mook;Kim, Jung-Han
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.2
    • /
    • pp.120-130
    • /
    • 2020
  • This paper solves the problem in underdetermined convolutive mixture by improving the disadvantages of the multichannel nonnegative matrix factorization technique widely used in blind source separation. In conventional researches based on Spatial Covariance Matrix (SCM), each element composed of values such as power gain of single channel and correlation tends to degrade the quality of the separated sources due to high variance. In this paper, level and frequency normalization is performed to effectively cluster the estimated sources. Therefore, we propose a novel SCM and an effective distance function for cluster pairs. In this paper, the proposed SCM is used for the initialization of the spatial model and used for hierarchical agglomerative clustering in the bottom-up approach. The proposed algorithm was experimented using the 'Signal Separation Evaluation Campaign 2008 development dataset'. As a result, the improvement in most of the performance indicators was confirmed by utilizing the 'Blind Source Separation Eval toolbox', an objective source separation quality verification tool, and especially the performance superiority of the typical SDR of 1 dB to 3.5 dB was verified.

A Method of Detecting the Aggressive Driving of Elderly Driver (노인 운전자의 공격적인 운전 상태 검출 기법)

  • Koh, Dong-Woo;Kang, Hang-Bong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.11
    • /
    • pp.537-542
    • /
    • 2017
  • Aggressive driving is a major cause of car accidents. Previous studies have mainly analyzed young driver's aggressive driving tendency, yet they were only done through pure clustering or classification technique of machine learning. However, since elderly people have different driving habits due to their fragile physical conditions, it is necessary to develop a new method such as enhancing the characteristics of driving data to properly analyze aggressive driving of elderly drivers. In this study, acceleration data collected from a smartphone of a driving vehicle is analyzed by a newly proposed ECA(Enhanced Clustering method for Acceleration data) technique, coupled with a conventional clustering technique (K-means Clustering, Expectation-maximization algorithm). ECA selects high-intensity data among the data of the cluster group detected through K-means and EM in all of the subjects' data and models the characteristic data through the scaled value. Using this method, the aggressive driving data of all youth and elderly experiment participants were collected, unlike the pure clustering method. We further found that the K-means clustering has higher detection efficiency than EM method. Also, the results of K-means clustering demonstrate that a young driver has a driving strength 1.29 times higher than that of an elderly driver. In conclusion, the proposed method of our research is able to detect aggressive driving maneuvers from data of the elderly having low operating intensity. The proposed method is able to construct a customized safe driving system for the elderly driver. In the future, it will be possible to detect abnormal driving conditions and to use the collected data for early warning to drivers.

Hybrid Routing protocol for Energy Efficiency in Wireless Sensor Networks (무선센서네트워크에서 에너지 효율을 위한 혼합적 라우팅 프로토콜)

  • Kim, Jin-Su
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.363-368
    • /
    • 2012
  • The Cluster-based routing protocol is consumed the energy consumption efficiently, but there are many isolated nodes while clustering, so these are impeding energy efficiency. Hop-by-hop based routing protocol is suitable large-scaled network or dynamic environment. However, with the periodic flooding signal and rapid energy loss of near sink nodes, the network life time become shorter. In this paper, We propose the hybrid routing protocol that combine the cluster based routing method for energy efficiency of nodes and hop-by-hop method for re-joining the isolated nodes and load balance of nodes in the near cluster using fibonacci sequence. Based on the analysis, it is proved that the hybrid routing protocol provided higher energy efficiency and less the isolated nodes than previous methods.