• Title/Summary/Keyword: Edge Feature Image

Search Result 323, Processing Time 0.025 seconds

Image Analysis for Discrimination of Neoplastic Cellis in Spatial Frequency Domain (종양세포식별을 위한 공간주파수영역에서의 화상해석)

  • 나철훈;김창원;김현재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.3
    • /
    • pp.385-396
    • /
    • 1993
  • In this paper, a improved method of digital image analysis required in basic medical science for diagnosis of cells was proposed. The object image was the thyroid gland cell image, and the purpose was automatic discrimination of three classes cells(normal cell, follicular neoplastic cells, and papillary neoplastic cells) by difference of chromatin patterns. To segment the cell nucleus from background, the region segmentation algorithm by edge tracing was proposed. And feature parameter was obtained from discrete Fourier transformation of image. After construct a feature sample group of each cells, experiment of discrimination was executed with any verification cells. As a consequency of using features proposed in this paper, get a better recognition rate(70-90%) than previously reported papers, and this method give shape to get objectivity and fixed quantity in diagnosis of cells, The methods described in this paper be used immediately for discrimination of neoplastic cells.

  • PDF

Fuzzy Scheme for Extracting Linear Features (선형적 특징을 추출하기 위한 퍼지 후프 방법)

  • 주문원;최영미
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.129-136
    • /
    • 1999
  • A linear feature often provide sufficient information for image understanding and coding. An objective of the research reported in this paper is to develop and analyze the reliable methods of extracting lines in gray scale images. The Hough Transform is known as one of the optimal paradigms to detect or identify the linear features by transforming edges in images into peaks in parameter space. The scheme proposed here uses the fuzzy gradient direction model and weights the gradient magnitudes for deciding the voting values to be accumulated in parameter space. This leads to significant computational savings by restricting the transform to within some support region of the observed gradient direction which can be considered as a fuzzy variable and produces robust results.

  • PDF

A Study on the Color Edge Detection (컬러 에지 검출에 관한 연구)

  • 김동현;이소행;정진용;양현호;최우진
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.8-12
    • /
    • 1999
  • Edge detection is a key component for many modern computer vision applications. While it is certainly not the only way to identify an object, or track a feature, it can be one of the most convenient if it is done quickly and consistently. Many algorithms proposed is applied to gray level images. But. there are limits in method using only intensity information, so, many researchers has try to done research about using color information. In this paper, we propose the new edge detection method usign color information, implement the widely used algorithms and compared with them in performance. In result of experiment, we show that the proposed algorithm have better result in fine detail and shaded region of image.

Person Identification based on Clothing Feature (의상 특징 기반의 동일인 식별)

  • Choi, Yoo-Joo;Park, Sun-Mi;Cho, We-Duke;Kim, Ku-Jin
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • With the widespread use of vision-based surveillance systems, the capability for person identification is now an essential component. However, the CCTV cameras used in surveillance systems tend to produce relatively low-resolution images, making it difficult to use face recognition techniques for person identification. Therefore, an algorithm is proposed for person identification in CCTV camera images based on the clothing. Whenever a person is authenticated at the main entrance of a building, the clothing feature of that person is extracted and added to the database. Using a given image, the clothing area is detected using background subtraction and skin color detection techniques. The clothing feature vector is then composed of textural and color features of the clothing region, where the textural feature is extracted based on a local edge histogram, while the color feature is extracted using octree-based quantization of a color map. When given a query image, the person can then be identified by finding the most similar clothing feature from the database, where the Euclidean distance is used as the similarity measure. Experimental results show an 80% success rate for person identification with the proposed algorithm, and only a 43% success rate when using face recognition.

Lane Detection in Complex Environment Using Grid-Based Morphology and Directional Edge-link Pairs (복잡한 환경에서 Grid기반 모폴리지와 방향성 에지 연결을 이용한 차선 검출 기법)

  • Lin, Qing;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.786-792
    • /
    • 2010
  • This paper presents a real-time lane detection method which can accurately find the lane-mark boundaries in complex road environment. Unlike many existing methods that pay much attention on the post-processing stage to fit lane-mark position among a great deal of outliers, the proposed method aims at removing those outliers as much as possible at feature extraction stage, so that the searching space at post-processing stage can be greatly reduced. To achieve this goal, a grid-based morphology operation is firstly used to generate the regions of interest (ROI) dynamically, in which a directional edge-linking algorithm with directional edge-gap closing is proposed to link edge-pixels into edge-links which lie in the valid directions, these directional edge-links are then grouped into pairs by checking the valid lane-mark width at certain height of the image. Finally, lane-mark colors are checked inside edge-link pairs in the YUV color space, and lane-mark types are estimated employing a Bayesian probability model. Experimental results show that the proposed method is effective in identifying lane-mark edges among heavy clutter edges in complex road environment, and the whole algorithm can achieve an accuracy rate around 92% at an average speed of 10ms/frame at the image size of $320{\times}240$.

Design and Implementation of the Stop line and Crosswalk Recognition Algorithm for Autonomous UGV (자율 주행 UGV를 위한 정지선과 횡단보도 인식 알고리즘 설계 및 구현)

  • Lee, Jae Hwan;Yoon, Heebyung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.3
    • /
    • pp.271-278
    • /
    • 2014
  • In spite of that stop line and crosswalk should be aware of the most basic objects in transportation system, its features extracted are very limited. In addition to image-based recognition technology, laser and RF, GPS/INS recognition technology, it is difficult to recognize. For this reason, the limited research in this area has been done. In this paper, the algorithm to recognize the stop line and crosswalk is designed and implemented using image-based recognition technology with the images input through a vision sensor. This algorithm consists of three functions.; One is to select the area, in advance, needed for feature extraction in order to speed up the data processing, 'Region of Interest', another is to process the images only that white color is detected more than a certain proportion in order to remove the unnecessary operation, 'Color Pattern Inspection', the other is 'Feature Extraction and Recognition', which is to extract the edge features and compare this to the previously-modeled one to identify the stop line and crosswalk. For this, especially by using case based feature comparison algorithm, it can identify either both stop line and crosswalk exist or just one exists. Also the proposed algorithm is to develop existing researches by comparing and analysing effect of in-vehicle camera installation and changes in recognition rate of distance estimation and various constraints such as backlight and shadow.

An Implementation of Pipelined Prallel Processing System for Multi-Access Memory System

  • Lee, Hyung;Cho, Hyeon-Koo;You, Dae-Sang;Park, Jong-Won
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.149-151
    • /
    • 2002
  • We had been developing the variety of parallel processing systems in order to improve the processing speed of visual media applications. These systems were using multi-access memory system(MAMS) as a parallel memory system, which provides the capability of the simultaneous accesses of image points in a line-segment with an arbitrary degree, which is required in many low-level image processing operations such as edge or line detection in a particular direction, and so on. But, the performance of these systems did not give a faithful speed because of asynchronous feature between MAMS and processing elements. To improve the processing speed of these systems, we have been investigated a pipelined parallel processing system using MAMS. Although the system is considered as being the single instruction multiple data(SIMD) type like the early developed systems, the performance of the system yielded about 2.5 times faster speed.

  • PDF

An Efficient Clustering Based Image Retrieval using Color and Shape features (색상 및 형태 정보를 이용한 클러스터링 기반의 효과적인 이미지 검색 기법)

  • 이근섭;조정원;최병욱
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.363-366
    • /
    • 2000
  • 이미지의 한가지 특징(feature)만을 고려한 내용 기반 이미지 검색(content-based image retrieval)은 두가지 이상의 특징 정보를 사용했을 경우와 비교하여 정확도(precision)가 떨어져 성능을 저하시킬 수 있다 따라서 대부분의 검색 시스템에서는 색상(color)이나 형태(shape), 질감(texture) 등과 같은 이미지의 다양한 특징들을 결합하여 검색에 이용하고 있다. 본 논문에서는 이미지의 색상 및 형태 정보를 이용하여 사용자의 질의와 유사한 이미지를 제공하고, 고 차원화된 이미지의 특징들을 클러스터링(clustering) 방법을 이용하여 빠르게 검색할 수 있도록 하였으며, 또한 검색시 그룹 경계 보정 방법을 이용하여 전체 검색을 하지 않고도 전체검색 결과와 동일한 결과를 얻을 수 있는 시스템을 설계 및 구현하였다. 실험에 사용된 데이터는 2022개의 자연 영상이였으며, HSI 색상 정보와 이미지의 에지(edge) 정보를 특징 벡터로 삼았다. 실험 결과, 색상 정보 하나만을 사용한 경우보다 정확도와 재현율면에서 사용자가 원하는 이미지와 보다 유사한 결과를 검출할 수 있었을 뿐만 아니라 클러스터링을 사용함으로써 보다 빠르고, 전체검색 결과와 동일한 검색이 가능하다는 것을 입증하였다.

  • PDF

Moving object Tracking Using U and FI

  • Song, Hag-hyun;Kwak, Yoon-shik;Kim, Yoon-ho;Ryu, Kwang-Ryol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.7
    • /
    • pp.1126-1132
    • /
    • 2002
  • In this paper, we propose a new scheme of motion tracking based on fuzzy inference (Fl) and wavelet transform (WT) from image sequences. First, we present a WT to segment a feature extraction of dynamic image . The coefficient matrix for 2-level DWT tent to be clustered around the location of Important features in the images, such as edge discontinuities, peaks, and corners. But these features are time varying owing to the environment conditions. Second, to reduce the spatio-temperal error, We develop a fuzzy inference algorithm. Some experiments are performed 0 testify the validity and applicability of the proposed system As a result, proposed method is relatively simple compared with the traditional space domain method. It is also well suited for motion tracking under the conditions of variation of illumination.

The Study on Removing Random-valued Impulse Noise

  • Yinyu, Gao;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.333-335
    • /
    • 2011
  • In the transmitting process of image processing system, images always be corrupted by impulse noise, especially random-valued impulse noise. So removing the random-valued impulse noise is very important, but it is also one of the most difficult case in image processing. The most famous method is the standard median filter, but at edge, the filter has a special feature which has a tendency to decrease the preserve. As a result, we proposed a filter that detection random-valued impulse noise firstly, next to use efficient method to remove the noise and preserve the details. And through the simulation, we compared with the algorithms and indicated that proposed method significant improvement over many other existing algorithms.

  • PDF