• Title/Summary/Keyword: image clustering

Search Result 599, Processing Time 0.021 seconds

Design and Implementation of Algorithms for the Motion Detection of Vehicles using Hierarchical Motion Estimation and Parallel Processing (계층화 모션 추정법과 병렬처리를 이용한 차량 움직임 측정 알고리즘 개발 및 구현)

  • 강경훈;정성태;이상설;남궁문
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1189-1199
    • /
    • 2003
  • This paper presents a new method for the motion detection of vehicles using hierarchical motion estimation and parallel processing. It captures the road image by using a CMOS sensor. It divides the captured image into small blocks and detects the motion of each block by using a block-matching method which is based on a hierarchical motion estimation and parallel processing for the real-time processing. The parallelism is achieved by using tile pipeline and the data flow technique. The proposed method has been implemented by using an embedded system. The proposed block matching algorithm has been implemented on PLDs(Programmable Logic Device) and clustering algorithm has been implemented by ARM processor. Experimental results show that the proposed system detects the motion of vehicles in real-time.

  • PDF

Detecting Faces on Still Images using Sub-block Processing (서브블록 프로세싱을 이용한 정지영상에서의 얼굴 검출 기법)

  • Yoo Chae-Gon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.417-420
    • /
    • 2006
  • Detection of faces on still color images with arbitrary backgrounds is attempted in this paper. The newly proposed method is invariant to arbitrary background, number of faces, scale, orientation, skin color, and illumination through the steps of color clustering, cluster scanning, sub-block processing, face area detection, and face verification. The sub-block method makes the proposed method invariant to the size and the number of faces in the image. The proposed method does not need any pre-training steps or a preliminary face database. The proposed method may be applied to areas such as security control, video and photo indexing, and other automatic computer vision-related fields.

Recognition of Lanes, Stop Lines and Speed Bumps using Top-view Images (탑뷰 영상을 이용한 차선, 정지선 및 과속방지턱 인식)

  • Ahn, Young-Sun;Kwak, Seong Woo;Yang, Jung-Min
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.11
    • /
    • pp.1879-1886
    • /
    • 2016
  • In this paper, we propose a real-time recognition algorithm of lanes, stop lines and speed bumps on roads for autonomous vehicles. First, we generate a top-view using the image transmitted from a camera that is installed to see the front of a vehicle. To speed up the processing, we simplify the mapping algorithm in constructing a top-view wherein the region of interest (ROI) is concerned. The features of lanes, stop lines and speed bumps, which are composed of lines, are searched in the edge image of the top-view, then followed by labeling and clustering specialized to detect straight lines. The width of lines, distances from the center of a vehicle, and curvature of each cluster are considered to select final candidates. We verify the proposed algorithm on real roads using the commercial car (KIA K7) which is converted into an autonomous vehicle.

M-tree based Indexing Method for Effective Image Browsing (효과적인 이미지 브라우징을 위한 M-트리 기반의 인덱싱 방법)

  • Yu, Jeong-Soo;Nang, Jong-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.442-446
    • /
    • 2010
  • In this paper we propose an indexing method supporting the browsing scheme for effective image search on large photo database. The proposed method is based on M-tree, a representative indexing scheme on matrix space. While M-tree focuses on the searching efficiency by pruning, it did not consider browsing efficiency directly. This paper proposes node selection method, node splitting method and node splitting conditions for browsing efficiency. According to test results, node cohesion and clustering precision improved 1.5 and twice the original respectively and searching speed also increased twice the original speed.

Super-Pixel-Based Segmentation and Classification for UAV Image (슈퍼 픽셀기반 무인항공 영상 영역분할 및 분류)

  • Kim, In-Kyu;Hwang, Seung-Jun;Na, Jong-Pil;Park, Seung-Je;Baek, Joong-Hwan
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.2
    • /
    • pp.151-157
    • /
    • 2014
  • Recently UAV(unmanned aerial vehicle) is frequently used not only for military purpose but also for civil purpose. UAV automatically navigates following the coordinates input in advance using GPS information. However it is impossible when GPS cannot be received because of jamming or external interference. In order to solve this problem, we propose a real-time segmentation and classification algorithm for the specific regions from UAV image in this paper. We use the super-pixels algorithm using graph-based image segmentation as a pre-processing stage for the feature extraction. We choose the most ideal model by analyzing various color models and mixture color models. Also, we use support vector machine for classification, which is one of the machine learning algorithms and can use small quantity of training data. 18 color and texture feature vectors are extracted from the UAV image, then 3 classes of regions; river, vinyl house, rice filed are classified in real-time through training and prediction processes.

A Post-Verification Method of Near-Duplicate Image Detection using SIFT Descriptor Binarization (SIFT 기술자 이진화를 이용한 근-복사 이미지 검출 후-검증 방법)

  • Lee, Yu Jin;Nang, Jongho
    • Journal of KIISE
    • /
    • v.42 no.6
    • /
    • pp.699-706
    • /
    • 2015
  • In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.

Establishment Moving Picture & Recover of Image Eliminated Overlap Pixel using Picture Resemblance pattern (닮은패턴을 이용한 중첩영상 소거 동영상 화면복원법)

  • Jin, Hyun-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.29-35
    • /
    • 2012
  • In this paper, it is presented the method of image recovering which existing is only pixel processing, but suggesting method is concluding image clustering overlap degree after classfying around unit fixel to crowd pixel. Concluding overlap degree threshold value is after identifying pattern pixel and grasping geometry structure of sample pattern and deduction of deciding function. distinguishing feature space is above four dimension is reason of not visual observation of pattern structure. consideration of distribution structure is distance of center of crowd pixel, the number of each crowd pattern pixel and standard deviation. The over threshold value elimate the overlap image and the downward is recovered and established dynamic image. memory storage deduction of 20% and elevation of 15% performance is estimated in recovery of image.

Representative Feature Extraction of Objects using VQ and Its Application to Content-based Image Retrieval (VQ를 이용한 영상의 객체 특징 추출과 이를 이용한 내용 기반 영상 검색)

  • Jang, Dong-Sik;Jung, Seh-Hwan;Yoo, Hun-Woo;Sohn, Yong--Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.724-732
    • /
    • 2001
  • In this paper, a new method of feature extraction of major objects to represent an image using Vector Quantization(VQ) is proposed. The principal features of the image, which are used in a content-based image retrieval system, are color, texture, shape and spatial positions of objects. The representative color and texture features are extracted from the given image using VQ(Vector Quantization) clustering algorithm with a general feature extraction method of color and texture. Since these are used for content-based image retrieval and searched by objects, it is possible to search and retrieve some desirable images regardless of the position, rotation and size of objects. The experimental results show that the representative feature extraction time is much reduced by using VQ, and the highest retrieval rate is given as the weighted values of color and texture are set to 0.5 and 0.5, respectively, and the proposed method provides up to 90% precision and recall rate for 'person'query images.

  • PDF

Leukocyte Segmentation using Saliency Map and Stepwise Region-merging (중요도 맵과 단계적 영역병합을 이용한 백혈구 분할)

  • Gim, Ja-Won;Ko, Byoung-Chul;Nam, Jae-Yeal
    • The KIPS Transactions:PartB
    • /
    • v.17B no.3
    • /
    • pp.239-248
    • /
    • 2010
  • Leukocyte in blood smear image provides significant information to doctors for diagnosis of patient health status. Therefore, it is necessary step to separate leukocyte from blood smear image among various blood cells for early disease prediction. In this paper, we present a saliency map and stepwise region merging based leukocyte segmentation method. Since leukocyte region has salient color and texture, we create a saliency map using these feature map. Saliency map is used for sub-image separation. Then, clustering is performed on each sub-image using mean-shift. After mean-shift is applied, stepwise region-merging is applied to particle clusters to obtain final leukocyte nucleus. The experimental results show that our system can indeed improve segmentation performance compared to previous researches with average accuracy rate of 71%.

Efficient graph-based two-stage superpixel generation method (효율적인 그래프 기반 2단계 슈퍼픽셀 생성 방법)

  • Park, Sanghyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.12
    • /
    • pp.1520-1527
    • /
    • 2019
  • Superpixel methods are widely used in the preprocessing stage as a method to reduce computational complexity by simplifying images while maintaining the characteristics of images in the field of computer vision. It is common to generate superpixels with a regular size and form based on the pixel values rather than considering the characteristics of the image. In this paper, we propose a method to generate superpixels considering the characteristics of an image according to the application. The proposed method consists of two steps, and the first step is to oversegment an image so that the boundary information of the image is well preserved. In the second step, superpixels are merged based on similarity to produce the desired number of superpixels, where the form of superpixels are controlled by limiting the maximum size of superpixels. Experimental results show that the proposed method preserves the boundaries of an image more accurately than the existing method.