• Title/Summary/Keyword: Object Recognition Algorithm

Search Result 515, Processing Time 0.03 seconds

(Algorithm for Recognizing Bulb in Cluster) (계기판 벌브 인식 알고리즘)

  • 이철헌;설성욱;김효성
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.1
    • /
    • pp.37-45
    • /
    • 2002
  • This paper proposes new features for recognizing telltale bulb in a cluster. A typical feature employed in model-based pattern recognition is polygonal approximation points of object. But recognition using these dominant points has many mismatching counts in small model such as telltale bulb. To reduce mismatching counts, proposed features are the circle distribution of object pixel and the ratio of distance from center to boundary in object. This Paper also proposes new decision function using three features. In simulation result, we make a comparison mismatching counts between recognition using dominant points and the new recognition algorithm using three features.

Matching Algorithm using Histogram and Block Segmentation (히스토그램과 블록분할을 이용한 매칭 알고리즘)

  • Park, Sung-Gon;Choi, Youn-Ho;Cho, Nae-Su;Im, Sung-Woon;Kwon, Woo-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.231-233
    • /
    • 2009
  • The object recognition is one of the major computer vision fields. The object recognition using features(SIFT) is finding common features in input images and query images. But the object recognition using feature methods has suffered of difficulties due to heavy calculations when resizing input images and query images. In this paper, we focused on speed up finding features in the images. we proposed method using block segmentation and histogram. Block segmentation used diving input image and than histogram decided correlation between each 1]lock and query image. This paper has confirmed that tile matching time reduced for object recognition since reducing block.

  • PDF

Improve object recognition using UWB SAR imaging with compressed sensing

  • Pham, The Hien;Hong, Ic-Pyo
    • Journal of IKEEE
    • /
    • v.25 no.1
    • /
    • pp.76-82
    • /
    • 2021
  • In this paper, the compressed sensing basic pursuit denoise algorithm adopted to synthetic aperture radar imaging is investigated to improve the object recognition. From the incomplete data sets for image processing, the compressed sensing algorithm had been integrated to recover the data before the conventional back- projection algorithm was involved to obtain the synthetic aperture radar images. This method can lead to the reduction of measurement events while scanning the objects. An ultra-wideband radar scheme using a stripmap synthetic aperture radar algorithm was utilized to detect objects hidden behind the box. The Ultra-Wideband radar system with 3.1~4.8 GHz broadband and UWB antenna were implemented to transmit and receive signal data of two conductive cylinders located inside the paper box. The results confirmed that the images can be reconstructed by using a 30% randomly selected dataset without noticeable distortion compared to the images generated by full data using the conventional back-projection algorithm.

Real-time Recognition and Tracking System of Multiple Moving Objects (다중 이동 객체의 실시간 인식 및 추적 시스템)

  • Park, Ho-Sik;Bae, Cheol-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7C
    • /
    • pp.421-427
    • /
    • 2011
  • The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.

Shape-based object recognition using Multiple distance images (다중의 거리영상을 이용한 형태 인식 기법)

  • 신기선;최해철
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.17-20
    • /
    • 2000
  • This paper describes a shape-based object recognition algorithm using multiple distance images. For the images containing dense edge points and noise, previous Hausdorff distance (HD) measures yield a high ms error for object position and many false matchings for recognition. Extended version of HD measure considering edge position and orientation simultaneously is proposed for accurate matching. Multiple distance images are used to calculate proposed matching measure efficiently. Results are presented for visual images and infrared images.

  • PDF

A design and implementation of Intelligent object recognition system in urban railway (도시철도내 지능형 객체인식 시스템 구성 및 설계)

  • Park, Ho-Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.2
    • /
    • pp.209-214
    • /
    • 2018
  • The subway, which is an urban railway, is the core of public transportation. Urban railways are always exposed to serious problems such as theft, crime and terrorism, as many passengers use them. Especially, due to the nature of urban railway environment, the scope of surveillance is widely dispersed and the range of surveillance target is rapidly increasing. Therefore, it is difficult to perform comprehensive management by passive surveillance like existing CCTV. In this paper, we propose the implementation, design method and object recognition algorithm for intelligent object recognition system in urban railway. The object recognition system that we propose is to analyze the camera images in the history and to recognize the situations where there are objects in the landing area and the waiting area that are not moving for more than a certain time. The proposed algorithm proved its effectiveness by showing detection rate of 100% for Selected area detection, 82% for detection in neglected object, and 94% for motionless object detection, compared with 84.62% object recognition rate using existing Kalman filter.

Recognition and Tracking of Moving Objects Using Label-merge Method Based on Fuzzy Clustering Algorithm (퍼지 클러스터링 알고리즘 기반의 라벨 병합을 이용한 이동물체 인식 및 추적)

  • Lee, Seong Min;Seong, Il;Joo, Young Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.2
    • /
    • pp.293-300
    • /
    • 2018
  • We propose a moving object extraction and tracking method for improvement of animal identification and tracking technology. First, we propose a method of merging separated moving objects into a moving object by using FCM (Fuzzy C-Means) clustering algorithm to solve the problem of moving object loss caused by moving object extraction process. In addition, we propose a method of extracting data from a moving object and a method of counting moving objects to determine the number of clusters in order to satisfy the conditions for performing FCM clustering algorithm. Then, we propose a method to continuously track merged moving objects. In the proposed method, color histograms are extracted from feature information of each moving object, and the histograms are continuously accumulated so as not to react sensitively to noise or changes, and the average is obtained and stored. Thereafter, when a plurality of moving objects are overlapped and separated, the stored color histogram is compared with each other to correctly recognize each moving object. Finally, we demonstrate the feasibility and applicability of the proposed algorithms through some experiments.

Dynamic Object Detection Architecture for LiDAR Embedded Processors (라이다 임베디드 프로세서를 위한 동적 객체인식 아키텍처 구현)

  • Jung, Minwoo;Lee, Sanghoon;Kim, Dae-Young
    • Journal of Platform Technology
    • /
    • v.8 no.4
    • /
    • pp.11-19
    • /
    • 2020
  • In an autonomous driving environment, dynamic recognition of objects is essential as the situation changes in real time. In addition, as the number of sensors and control modules built into an autonomous vehicle increases, the amount of data the central control unit has to process also rapidly increases. By minimizing the output data from the sensor, the load on the central control unit can be reduced. This study proposes a dynamic object recognition algorithm solely using the embedded processor on a LiDAR sensor. While there are open source algorithms to process the point cloud output from LiDAR sensors, most require a separate high-performance processor. Since the embedded processors installed in LiDAR sensors often have resource constraints, it is essential to optimize the algorithm for efficiency. In this study, an embedded processor based object recognition algorithm was developed for autonomous vehicles, and the correlation between the size of the point clouds and processing time was analyzed. The proposed object recognition algorithm evaluated that the processing time directly increased with the size of the point cloud, with the processor stalling at a specific point if the point cloud size is beyond the threshold

  • PDF

An Object Recognition Method Based on Depth Information for an Indoor Mobile Robot (실내 이동로봇을 위한 거리 정보 기반 물체 인식 방법)

  • Park, Jungkil;Park, Jaebyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.958-964
    • /
    • 2015
  • In this paper, an object recognition method based on the depth information from the RGB-D camera, Xtion, is proposed for an indoor mobile robot. First, the RANdom SAmple Consensus (RANSAC) algorithm is applied to the point cloud obtained from the RGB-D camera to detect and remove the floor points. Next, the removed point cloud is classified by the k-means clustering method as each object's point cloud, and the normal vector of each point is obtained by using the k-d tree search. The obtained normal vectors are classified by the trained multi-layer perceptron as 18 classes and used as features for object recognition. To distinguish an object from another object, the similarity between them is measured by using Levenshtein distance. To verify the effectiveness and feasibility of the proposed object recognition method, the experiments are carried out with several similar boxes.

Model-Based Object Recognition using PCA & Improved k-Nearest Neighbor (PCA와 개선된 k-Nearest Neighbor를 이용한 모델 기반형 물체 인식)

  • Jung Byeong-Soo;Kim Byung-Gi
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.53-62
    • /
    • 2006
  • Object recognition techniques using principal component analysis are disposed to be decreased recognition rate when lighting change of image happens. The purpose of this thesis is to propose an object recognition technique using new PCA analysis method that discriminates an object in database even in the case that the variation of illumination in training images exists. And the object recognition algorithm proposed here represents more enhanced recognition rate using improved k-Nearest Neighbor. In this thesis, we proposed an object recognition algorithm which creates object space by pre-processing and being learned image using histogram equalization and median filter. By spreading histogram of test image using histogram equalization, the effect to change of illumination is reduced. This method is stronger to change of illumination than basic PCA method and normalization, and almost removes effect of illumination, therefore almost maintains constant good recognition rate. And, it compares ingredient projected test image into object space with distance of representative value and recognizes after representative value of each object in model image is made. Each model images is used in recognition unit about some continual input image using improved k-Nearest Neighbor in this thesis because existing method have many errors about distance calculation.