• Title/Summary/Keyword: k-Means 알고리즘

Search Result 773, Processing Time 0.037 seconds

A Image Contrast Enhancement Using Clustering of Image Histogram (히스토그램 군집화를 이용한 영상 대비 향상)

  • Hong, Seok-Keun;Park, Joon-Woo;Kang, Byeong-Jo;Choi, Yu-Na;Cho, Seok-Je
    • Annual Conference of KIPS
    • /
    • 2009.11a
    • /
    • pp.379-380
    • /
    • 2009
  • 히스토그램 스트레칭이나 히스토그램 균등화 등 기존 대비 향상 기법들과 히스토그램 균등화 기반의 수많은 방법들은 저대비에 소수의 화소들이 넓게 퍼져 있는 영상에 대해서 만족할만한 결과를 내지 못한다. 따라서 본 논문은 군집화 방법을 이용한 새로운 영상 대비 향상 기법을 제안한다. 히스토그램의 군집수는 원영상의 히스토그램을 분석하여 얻을 수 있다. 히스토그램 성분들을 K-means 알고리즘을 이용하여 군집화한다. 그리고 히스토그램 군집 범위와 군집의 화소수 비율을 비교하여 히스토그램 스트레칭과 히스토그램 균등화를 선택적으로 적용한다. 실험 결과로부터 제안한 방법이 기존의 대비 향상 기법들보다 더 효과적임을 확인할 수 있었다.

Visual Information Tactile Transformation Display to Expand the Enjoyment of Art and Culture for the Blind (시각장애인 예술 문화 향유 확장을 위한 시각 정보 촉각 변환 디스플레이)

  • Sang-Don Lee;Ju-Hyeon Lee;Jae-Hyeong Hwang;Hyeon-Jung Hwang;Jae-Hun Lee
    • Annual Conference of KIPS
    • /
    • 2023.11a
    • /
    • pp.996-997
    • /
    • 2023
  • 시각 장애인들의 시각 정보에 대한 낮은 접근성은 문화, 예술 활동에 큰 제약을 가져다 주고 있다. 실제로 시각 장애인 중 약 절반 이상이 문화, 여가생활에 만족하지 못한다고 답하였고 전시회, 미술품 감상 또는 관람 활동은 약 5%만이[1] 참여하고 있는 것으로 나타났다. 이러한 한계를 극복하기 위해 시각이라는 감각의 한계를 뛰어넘어 시각 미디어를 즐길 수 있게 하는 서비스를 제작하였고, 이는 크게 웹서비스인 web view editor와 물리적인 촉각 디스플레이로 구성된다. 시각 미디어인 이미지는 8×8로 나눠 각 영역을 OpenCV 라이브러리와 K-means clustering 알고리즘을 이용하여 9 level로 분류시키고, 구분된 level에 맞게 cell의 높낮이 차이를 두기 위하여 Arduino를 통한 회전-선형 변환기를 제작했다. Arduino의 PWM 기능을 이용해 모터의 속도와 방향을 제어하며, 각 모터의 드라이버는 Arduino와 연결되어 있어 모터의 회전을 제어하게 했다. 결과적으로 본 연구에서는 cell의 높낮이 차이를 9 level로 구분하여 시각 정보를 촉각으로 수용할 수 있는 장치를 제작하였고, 이 장치를 통해 기존의 시각 장애인들이 문화 생활을 쉽게 향유하고 이를 바탕으로 창의성과 상상력을 증대시켜 더욱 밀접하게 사회와 연결되고 소통 할 수 있는 기회의 초석이 되기를 기대하는 바이다.

k-Nearest Neighbor Querv Processing using Approximate Indexing in Road Network Databases (도로 네트워크 데이타베이스에서 근사 색인을 이용한 k-최근접 질의 처리)

  • Lee, Sang-Chul;Kim, Sang-Wook
    • Journal of KIISE:Databases
    • /
    • v.35 no.5
    • /
    • pp.447-458
    • /
    • 2008
  • In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

Application of Off-axis Correction Method for EPID Based IMRT QA (EPID를 사용한 세기조절방사선치료의 정도관리에 있어 축이탈 보정(Off-axis Correction)의 적용)

  • Cho, Ilsung;Kwark, Jungwon;Park, Sung Ho;Ahn, Seung Do;Jeong, Dong Hyeok;Cho, Byungchul
    • Progress in Medical Physics
    • /
    • v.23 no.4
    • /
    • pp.317-325
    • /
    • 2012
  • The Varian PORTALVISION (Varian Medical Systems, US) shows significant overresponses as the off-center distance increases compared to the predicted dose. In order to correct the dose discrepancy, the off-axis correction is applied to VARIAN iX linear accelerators. The portal dose for $38{\times}28cm^2$ open field is acquired for 6 MV, 15 MV photon beams and also are predicted by PDIP algorithm under the same condition of the portal dose acquisition. The off-axis correction is applied by modifying the $40{\times}40cm^2$ diagonal beam profile data which is used for the beam profile calibration. The ratios between predicted dose and measured dose is modeled as a function of off-axis distance with the $4^{th}$ polynomial and is applied to the $40{\times}40cm^2$ diagonal beam profile data as the weight to correct measured dose by EPID detector. The discrepancy between measured dose and predicted dose is reduced from $4.17{\pm}2.76$ CU to $0.18{\pm}0.8$ CU for 6 MV photon beam and from $3.23{\pm}2.59$ CU to $0.04{\pm}0.85$ CU for 15 MV photon beam. The passing rate of gamma analysis for the pyramid fluence patten with the 4%, 4 mm criteria is improved from 98.7% to 99.1% for 6 MV photon beam, from 99.8% to 99.9% for 15 MV photon beam. IMRT QA is also performed for randomly selected Head and Neck and Prostate IMRT plans after applying the off-axis correction. The gamma passing rare is improved by 3% on average, for Head and Neck cases: $94.7{\pm}3.2%$ to $98.2{\pm}1.4%$, for Prostate cases: $95.5{\pm}2.6%$, $98.4{\pm}1.8%$. The gamma analysis criteria is 3%, 3 mm with 10% threshold. It is considered that the off-axis correction might be an effective and easily adaptable means for correcting the discrepancy between measured dose and predicted dose for IMRT QA using EPID in clinic.

Efficient Dummy Generation for Protecting Location Privacy (개인의 위치를 보호하기 위한 효율적인 더미 생성)

  • Cai, Tian-Yuan;Song, Doo-Hee;Youn, Ji-Hye;Lee, Won-Gyu;Kim, Yong-Kab;Park, Kwang-Jin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.526-533
    • /
    • 2016
  • The researches protecting user's location in location-based services(LBS) have received much attention. Especially k-anonymity is the most popular privacy preservation method. k-anonymization means that it selects k-1 other dummies or clients to make the cloaking region. This reduced the probability of the query issuer's location being exposed to untrusted parties to 1/k. But query's location may expose to adversary when k-1 dummies are concentrated in query's location or there is dummy in where query can not exist. Therefore, we proposed the dummy system model and algorithm taking the real environment into account to protect user's location privacy. And we proved the efficiency of our method in terms of experiment result.

Analysis method of patent document to Forecast Patent Registration (특허 등록 예측을 위한 특허 문서 분석 방법)

  • Koo, Jung-Min;Park, Sang-Sung;Shin, Young-Geun;Jung, Won-Kyo;Jang, Dong-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.4
    • /
    • pp.1458-1467
    • /
    • 2010
  • Recently, imitation and infringement rights of an intellectual property are being recognized as impediments to nation's industrial growth. To prevent the huge loss which comes from theses impediments, many researchers are studying protection and efficient management of an intellectual property in various ways. Especially, the prediction of patent registration is very important part to protect and assert intellectual property rights. In this study, we propose the patent document analysis method by using text mining to predict whether the patent is registered or rejected. In the first instance, the proposed method builds the database by using the word frequencies of the rejected patent documents. And comparing the builded database with another patent documents draws the similarity value between each patent document and the database. In this study, we used k-means which is partitioning clustering algorithm to select criteria value of patent rejection. In result, we found conclusion that some patent which similar to rejected patent have strong possibility of rejection. We used U.S.A patent documents about bluetooth technology, solar battery technology and display technology for experiment data.

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

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.

A Performance Improvement of SE-MMA Adaptive Equalization Algorithm using Adaptive Varying Modulus (Adaptive Varying Modulus를 이용한 SE-MMA 적응 등화 알고리즘의 성능 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.79-84
    • /
    • 2018
  • This paper relates with the performance improvement of SE-MMA (Signed Error-Multiple Modulus Algorithm) adaptive equalization algorithm that is used for the reduction of the intersymbol interference due to the distortion which occurs in the communication channel for the transmission of 16-QAM nonconstant modulus signal.. In the conventional MMA, the fixed modulus value that is second order statistics of transmitting signal were used, and the SE-MMA was introduced in order to the simplification of the algorithm's arithmetic operation. The SE-MMA have a fast convergence speed than MMA, but it has a problem of degradation of equalization performance in the steady state due to the arithmetic simplification. In this paper, we propose the new algorithm AV-SE-MMA (Adaptively Varying-SE-MMA) that uses the adaptive varying modulus in order to obtain the error signal for updating the adaptive equalizer coefficient, and its equalization performance were confirmed by simulation. In this paper, the performance of SE-MMA and proposed algorithm were compared, and the equalizer output signal constellation, residual isi, MSE and SER in order to confirm the robustness of noise were used as performace index. As a result of performance comparison, the AV-SE-MMA has better performance in output signal constellation, residual isi and MD compared to the SE-MMA, but it was confirmed that the AV-SE-MMA has similar in the SER performance that means the robustness to the noise.

System Structure and Reliability Optimization of VVVF Urban Transit Brake System Through Cost Function Construction (비용함수를 이용한 VVVF 전동차 제동장치의 시스템 구조 및 신뢰도 최적화)

  • Kim, Se-Hoon;Kim, Hyun-Jung;Bae, Chul-Ho;Lee, Jung-Hwan;Lee, Ho-Yong;Suh, Myung-Won
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.15 no.3
    • /
    • pp.63-71
    • /
    • 2007
  • During the design phase of a product, reliability and design engineers are called upon to evaluate the reliability of the system, The question of how to meet target reliability for the system arises when estimated reliability or cost is inadequate. This then becomes a problem of reliability allocation and system structure design. This study proposes the optimization methodology to achieve target reliability with minimum cost through construction of the cost function of system. In cost function, total cost means the sum of initial cost, repair cost and maintenance cost. This study constructs optimization problem about system structure design and reliability allocation using cost function. This problem constructed is solved by Multi-island Genetic Algorithm(MIGA), and applies to urban transit brake system. Current brake system of the urban transit is series system. Series system is the simplest and perhaps one of the most common system, but it demands high reliability and maintenance cost because all components must be operating to ensure system operation. Thus this study makes a comparative study by applying k-out-of-n system to brake system. This methodology presented can be a great tool for aiding reliability and design engineers in their decision-makings.