• Title/Summary/Keyword: 영상 군집화

Search Result 195, Processing Time 0.028 seconds

MRI Data Segmentation Using Fuzzy C-Mean Algorithm with Intuition (직관적 퍼지 C-평균 모델을 이용한 자기 공명 영상 분할)

  • Kim, Tae-Hyun;Park, Dong-Chul;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.191-197
    • /
    • 2011
  • An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

Car License Plate Extraction Based on Detection of Numeral Regions (숫자 영역 탐색에 기반한 자동차 번호판 추출)

  • Lee, Duk-Ryong;Oh, Il-Seok
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.1
    • /
    • pp.59-67
    • /
    • 2008
  • In this paper we propose an algorithm to extract the license plate regions from Korean car images. The idea of this paper is that we first find the four digits in the input car image and then segment the plate region using the digit information. Out method has advantage of segmenting simultaneously the plate regions and four digits regions. The first step finds and groups the connected components with proper sizes as candidate digits. The second step applies an serial alignment condition to find out probable 4-digits. In the third step, we recognize the candidate digits and assign the confidence values to each of them. The final step extracts the license plate region which has the highest confidence value. We used the Perfect Metrics classification algorithm to estimate the confidence. In our experiment, we got 97.23% and 95.45% correct detection rates, 0.09% and 0.11% false detection rates for 4,600 daytime and 264 nighttime images, respectively.

  • PDF

Extraction of rectangular boundaries from areial image data (위성영상에서의 건물 윤곽선 검출 알고리즘)

  • Huyen, Nguyen Thi Bich;Kim, Tae-Hyun;Kim, Dong-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.1907_1908
    • /
    • 2009
  • 본 논문은 위성사진 데이터에서 경계선 추출에 대한 새로운 알고리즘을 제안한다. 새로운 알고리즘은 조각 선소들을 연결하기 위하여 몇 가지의 Heuristics를 사용하고, CNN(Centroid Neural Network)을 이용해 선소들을 군집화 하는 방법을 제시한다. 제안된 새로운 알고리즘은 실제의 위성영상 데이터에 대한 실험을 통해 그 유용성이 확인 되었다.

  • PDF

Correspondence and clustering using color features (칼라 특징 값을 이용한 correspondence 와 clustering)

  • 김성동;진성아;주문원
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.11a
    • /
    • pp.177-181
    • /
    • 2001
  • 본 논문에서는 칼라차 영상을 이용하여 물체들의 움직임을 분석하고 이동 형태들의 대한 RGB 특징 값을 추출하였으며 그 동안 미해결 과제로 남았던 이동 물체들 사이의 영역정합(matching)과 군집화 (clustering)를 이용하여 대응(Correspondence)관계를 확인하는 문제를 해결하여 이동 물체들을 추구하여 보았다.

  • PDF

An Automatic Object Extraction Method Using Color Features Of Object And Background In Image (영상에서 객체와 배경의 색상 특징을 이용한 자동 객체 추출 기법)

  • Lee, Sung Kap;Park, Young Soo;Lee, Gang Seong;Lee, Jong Yong;Lee, Sang Hun
    • Journal of Digital Convergence
    • /
    • v.11 no.12
    • /
    • pp.459-465
    • /
    • 2013
  • This paper is a study on an object extraction method which using color features of an object and background in the image. A human recognizes an object through the color difference of object and background in the image. So we must to emphasize the color's difference that apply to extraction result in this image. Therefore, we have converted to HSV color images which similar to human visual system from original RGB images, and have created two each other images that applied Median Filter and we merged two Median filtered images. And we have applied the Mean Shift algorithm which a data clustering method for clustering color features. Finally, we have normalized 3 image channels to 1 image channel for binarization process. And we have created object map through the binarization which using average value of whole pixels as a threshold. Then, have extracted major object from original image use that object map.

Proposal of a Monitoring System to Determine the Possibility of Contact with Confirmed Infectious Diseases Using K-means Clustering Algorithm and Deep Learning Based Crowd Counting (K-평균 군집화 알고리즘 및 딥러닝 기반 군중 집계를 이용한 전염병 확진자 접촉 가능성 여부 판단 모니터링 시스템 제안)

  • Lee, Dongsu;ASHIQUZZAMAN, AKM;Kim, Yeonggwang;Sin, Hye-Ju;Kim, Jinsul
    • Smart Media Journal
    • /
    • v.9 no.3
    • /
    • pp.122-129
    • /
    • 2020
  • The possibility that an asymptotic coronavirus-19 infected person around the world is not aware of his infection and can spread it to people around him is still a very important issue in that the public is not free from anxiety and fear over the spread of the epidemic. In this paper, the K-means clustering algorithm and deep learning-based crowd aggregation were proposed to determine the possibility of contact with confirmed cases of infectious diseases. As a result of 300 iterations of all input learning images, the PSNR value was 21.51, and the final MAE value for the entire data set was 67.984. This means the average absolute error between observations and the average absolute error of fewer than 4,000 people in each CCTV scene, including the calculation of the distance and infection rate from the confirmed patient and the surrounding persons, the net group of potential patient movements, and the prediction of the infection rate.

Hierarchical Nearest-Neighbor Method for Decision of Segment Fitness (세그먼트 적합성 판단을 위한 계층적 최근접 검색 기법)

  • Shin, Bok-Suk;Cha, Eui-Young;Lee, Im-Geun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.418-421
    • /
    • 2007
  • In this paper, we proposed a hierarchical nearest-neighbor searching method for deciding fitness of a clustered segment. It is difficult to distinguish the difference between correct spots and atypical noisy spots in footprint patterns. Therefore we could not completely remove unsuitable noisy spots from binarized image in image preprocessing stage or clustering stage. As a preprocessing stage for recognition of insect footprints, this method decides whether a segment is suitable or not, using degree of clustered segment fitness, and then unsuitable segments are eliminated from patterns. Removing unsuitable segments can improve performance of feature extraction for recognition of inset footprints.

  • PDF

Study on the Similarity Functions for Image Compression (영상 압축을 위한 유사성 함수 연구)

  • Joo, Woo-Seok;Kang, Jong-Oh
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2133-2142
    • /
    • 1997
  • Compared with previous compression methods, fractal image compression drastically increases compression rate by using block-based encoding. Although decompression can be done in real time even with softwares, the most serious problem in utilizing the fractal method is the time required for the encoding. In this paper, we propose and verify i) an algorithm that reduces the encoding time by reducing the number of similarity searching on the basis of dimensional informations, and ii) an algorithm that enhances the quality of the restored image on the basis of brightness and contrast information. Finally, a method that enables fast compression with little quality degradation is proposed.

  • PDF

A Study on 3D Visualization for Color Analysis of Multimedia Data (멀티미디어 데이터의 색상분포 분석을 통한 3차원 시각화 연구)

  • Seo, Sanghyun
    • Journal of Digital Contents Society
    • /
    • v.19 no.8
    • /
    • pp.1463-1469
    • /
    • 2018
  • The development of multimedia devices with built-in cameras such as smart devices and various studies using video-related multimedia data such as images and video obtained from the devices have been actively conducted. These studies deal with image data. An image can be defined as a set of color information obtained from a digital sensor called a pixel. Images contain various cognitive information such as color, lighting, objects and so on. In order to extract or process such information, it is necessary to clearly understand the composition of colors. In this paper, we introduce 3-dimensional information visualization method which can effectively express the results of image processing together with color distribution. This study visualizes the characteristics of image related multimedia data as well as the characteristics of various analytical data derived from it, so that researchers can transmit the image information more clearly and effectively.

Moving Data Pictures (움직이는 데이터 그림)

  • Huh, Myung-Hoe
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.6
    • /
    • pp.999-1007
    • /
    • 2013
  • This research shows several types of moving pictures from the data: 1) the word cloud of Korean texts, 2) the heat map of n ${\times}$ p matrices, 3) the moving image of p ${\times}$ p scatterplot matrix, 4) the local projective display of k clusters (Huh and Lee, 2012). Moving pictures may reveal the hidden information and beauty of the datasets and ignite the curiosity of information consumers. Video files are attached.