• 제목/요약/키워드: image clustering

Search Result 599, Processing Time 0.025 seconds

A High Speed Road Lane Detection based on Optimal Extraction of ROI-LB (관심영역(ROI-LB)의 최적 추출에 의한 차선검출의 고속화)

  • Cheong, Cha-Keon
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.253-264
    • /
    • 2009
  • This paper presents an algorithm, aims at practical applications, for the high speed processing and performance enhancement of lane detection base on vision processing system. As a preprocessing for high speed lane detection, the vanishing line estimation and the optimal extraction of region of interest for lane boundary (ROI-LB) can be processed to reduction of detection region in which high speed processing is enabled. Image feature information is extracted only in the ROI-LB. Road lane is extracted using a non-parametric model fitting and Hough transform within the ROI-LB. With simultaneous processing of noise reduction and edge enhancement using the Laplacian filter, the reliability of feature extraction can be increased for various road lane patterns. Since outliers of edge at each block can be removed with clustering of edge orientation for each block within the ROI-LB, the performance of lane detection can be greatly improved. The various real road experimental results are presented to evaluate the effectiveness of the proposed method.

A Motion Correspondence Algorithm based on Point Series Similarity (점 계열 유사도에 기반한 모션 대응 알고리즘)

  • Eom, Ki-Yeol;Jung, Jae-Young;Kim, Moon-Hyun
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.4
    • /
    • pp.305-310
    • /
    • 2010
  • In this paper, we propose a heuristic algorithm for motion correspondence based on a point series similarity. A point series is a sequence of points which are sorted in the ascending order of their x-coordinate values. The proposed algorithm clusters the points of a previous frame based on their local adjacency. For each group, we construct several potential point series by permuting the points in it, each of which is compared to the point series of the following frame in order to match the set of points through their similarity based on a proximity constraint. The longest common subsequence between two point series is used as global information to resolve the local ambiguity. Experimental results show an accuracy of more than 90% on two image sequences from the PETS 2009 and the CAVIAR data sets.

Automatic Extraction Method for Basic Insect Footprint Segments (곤충 발자국 인식을 위한 자동 영역 추출기법)

  • Shin, Bok-Suk;Woo, Young-Woon;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.275-278
    • /
    • 2007
  • In this paper, we proposed a automatic extraction method as a preprocessing stage for extraction of basic insect footprint segments. In general, sizes and strides of footprints may be different according to type and size of an insect for recognition. Therefore we proposed an improved algorithm for extraction of basic insect footprint segments regardless of size and stride of footprint pattern. In the proposed algorithm, threshold value for clustering is determined automatically using contour shape of the graph created by accumulating distances between all the spots of footprint pattern. In the experimental results applying the proposed method, The basic footprint segments should be extracted from a whole insect footprint image using significant information in order to find out appropriate features for classification.

  • PDF

A Study on the Recognition of Car Plate using an Enhanced Fuzzy ART Algorithm (개선된 퍼지 ART 알고리즘을 이용한 차량 번호판 인식에 관한 연구)

  • 임은경;김광백
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.5
    • /
    • pp.433-444
    • /
    • 2000
  • The recognition of car plate was investigated by means of the enhanced fuzzy ART algorithm. The morphological information of horizontal and vertical edges was used to extract a plate area from a car image. In addition, the contour tracking algorithm by utilizing the SOFM was applied to extract the specific area which includes characters from an extracted plate area. The extracted characteristic area was recognized by using the enhanced fuzzy ART algorithm. In this study we propose the novel fuzzy ART algorithm different from the conventional fuzzy ART algorithm by the dynamical establishment of the vigilance threshold which shows a tolerance limit of unbalance between voluntary and saved patterns for clustering. The extraction rate obtained by using the morphological information of horizontal and vertical edges showed better results than that from the color information of RGB and HSI. Furthermore, the recognition rate of the enhanced fuzzy ART algorithm was improved much more than that of the conventional fuzzy ART and SOFM algorithms.

  • PDF

Automatic Detection of Foreign Body through Template Matching in Industrial CT Volume Data (산업용 CT 볼륨데이터에서 템플릿 매칭을 통한 이물질 자동 검출)

  • Ji, Hye-Rim;Hong, Helen
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.12
    • /
    • pp.1376-1384
    • /
    • 2013
  • In this paper, we propose an automaticdetection method of foreign bodies through template matching in industrial CT volume data. Our method is composed of three main steps. First,Indown-sampling data, the product region is separated from background after noise reduction and initial foreign-body candidates are extracted using mean and standard deviation of the product region. Then foreign-body candidates are extracted using K-means clustering. Second, the foreign body with different intensity of product region is detected using template matching. At this time, the template matching is performed by evaluating SSD orjoint entropy according to the size of detected foreign-body candidates. Third, to improve thedetection rate of foreign body in original volume data, final foreign bodiesare detected using percolation method. For the performance evaluation of our method, industrial CT volume data and simulation data are used. Then visual inspection and accuracy assessment are performed and processing time is measured. For accuracy assessment, density-based detection method is used as comparative method and Dice's coefficient is measured.

Recognition of License Plates Using a Hybrid Statistical Feature Model and Neural Networks (하이브리드 통계적 특징 모델과 신경망을 이용한 자동차 번호판 인식)

  • Lew, Sheen;Jeong, Byeong-Jun;Kang, Hyun-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.12
    • /
    • pp.1016-1023
    • /
    • 2009
  • A license plate recognition system consists of image processing in which characters and features are extracted, and pattern recognition in which extracted characters are classified. Feature extraction plays an important role in not only the level of data reduction but also performance of recognition. Thus, in this paper, we focused on the recognition of numeral characters especially on the feature extraction of numeral characters which has much effect in the result of plate recognition. We suggest a hybrid statistical feature model which assures the best dispersion of input data by reassignment of clustering property of input data. And we verify the effectiveness of suggested model using multi-layer perceptron and learning vector quantization neural networks. The results show that the proposed feature extraction method preserves the information of a license plate well and also is robust and effective for even noisy and external environment.

Backlight Compensation by Using a Novel Region of Interest Extraction Method (새로운 관심영역 추출 방법을 이용한 역광보정)

  • Seong, Joon Mo;Lee, Seong Shin;Lee, Songwook
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.6
    • /
    • pp.321-328
    • /
    • 2017
  • We have implemented a technique to correct the brightness, saturation, and contrast of an image according to the degree of light, and further compensate the backlight. Backlight compensation can be done automatically or manually. For manual backlight compensation, we have to select the region of interest (ROI). ROI can be selected by connecting the outline of the desired object. We make users select the region delicately with the new magnetic lasso tool. The previous lasso tool has a disadvantage that the start point and the end point must be connected. However, the proposed lasso tool has the advantage of selecting the region of interest without connecting the start point and the end point. We can automatically obtain various results of backlight compensation by adjusting the number of k-means clusters for texture extraction and the threshold value for binarization.

A Study on Eigenspace Face Recognition using Wavelet Transform and HMM (웨이블렛 변환과 HMM을 이용한 고유공간 기반 얼굴인식에 관한 연구)

  • Lee, Jung-Jae;Kim, Jong-Min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2121-2128
    • /
    • 2012
  • This paper proposed the real time face area detection using Wavelet transform and the strong detection algorithm that satisfies the efficiency of computation and detection performance at the same time was proposed. The detected face image recognizes the face by configuring the low-dimensional face symbol through the principal component analysis. The proposed method is well suited for real-time system construction because it doesn't require a lot of computation compared to the existing geometric feature-based method or appearance-based method and it can maintain high recognition rate using the minimum amount of information. In addition, in order to reduce the wrong recognition or recognition error occurred during face recognition, the input symbol of Hidden Markov Model is used by configuring the feature values projected to the unique space as a certain symbol through clustering algorithm. By doing so, any input face will be recognized as a face model that has the highest probability. As a result of experiment, when comparing the existing method Euclidean and Mahananobis, the proposed method showed superior recognition performance in incorrect matching or matching error.

A Study on Routing Protocol for Multi-Drone Communication (멀티드론 통신을 위한 라우팅 프로토콜 연구)

  • Kim, Jongkwon;Chung, Yeongjee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.6
    • /
    • pp.41-46
    • /
    • 2019
  • In this paper, it is necessary to study the bandwidth and network system for efficient image transmission in the current era of drone imaging, and to design routing protocols to round out and cluster two or more multi-drones. First, we want to construct an ad hoc network to control the multidrone. Several studies are underway for the clustering of drones. The aircraft ad hoc network (FANET) is an important foundation for this research. A number of routing protocols have been proposed to design a FANET, and these routing protocols show different performances in various situations and environments. The routing protocol used to design the FANET is tested using the routing protocol used in the existing mobile ad hoc network (MANET). Therefore, we will use MANET to simulate the routing protocol to be used in the FANET, helping to select the optimal routing protocol for future FANET design. Finally, this paper describes the routing protocols that are mainly used in MANET and suitable for FANET, and the performance comparison of routing protocols, which are mainly used in FANET design.

A Lane Tracking Algorithm Using IPM and Kalman Filter (역투영 변환과 칼만 필터를 이용한 주행차선 추적)

  • Yeo, Jae-Yun;Koo, Kyung-Mo;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2492-2498
    • /
    • 2013
  • In this paper, A lane tracking algoritm is proposed for lane departure warning system. To eliminate perspective effect, input image is converted into Bird's View by inverse perspective mapping. Next, suitable features are extracted for lane detection. Using clustering and lane similarity function with noise suppression features are extracted. Finally, lane model is calculated using RANSAC and lane model is tracked using Kalman Filter. Experimental results show that the proposed algorithm can be processed within 20ms and its detection rate approximately 90% on the highway in a variety of environments.