• Title/Summary/Keyword: The image of variable time

Search Result 169, Processing Time 0.025 seconds

Panoramic Image Stitching using SURF

  • You, Meng;Lim, Jong-Seok;Kim, Wook-Hyun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.1
    • /
    • pp.26-32
    • /
    • 2011
  • This paper proposes a new method to process panoramic image stitching using SURF(Speeded Up Robust Features). Panoramic image stitching is considered a problem of the correspondence matching. In computer vision, it is difficult to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. However, SURF algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform). In this work, we also describe an efficient approach to decreasing computation time through the homography estimation using RANSAC(random sample consensus). RANSAC is a robust estimation procedure that uses a minimal set of randomly sampled correspondences to estimate image transformation parameters. Experimental results show that our method is robust to rotation, zoom, Gaussian noise and illumination change of the input images and computation time is greatly reduced.

Adaptive Image Segmentation Based on Histogram Transition Zone Analysis

  • Acuna, Rafael Guillermo Gonzalez;Mery, Domingo;Klette, Reinhard
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.299-307
    • /
    • 2016
  • While segmenting "complex" images (with multiple objects, many details, etc.) we experienced a need to explore new ways for time-efficient and meaningful image segmentation. In this paper we propose a new technique for image segmentation which has only one variable for controlling the expected number of segments. The algorithm focuses on the treatment of pixels in transition zones between various label distributions. Results of the proposed algorithm (e.g. on the Berkeley image segmentation dataset) are comparable to those of GMM or HMM-EM segmentation, but are achieved with significantly reduced computation time.

The Content-based Image Retrieval by Using Variable Block Size and Block Matching Algorithm (가변 블록 크기와 블록 매칭 알고리즘의 조합에 의한 내용기반 화상 검색)

  • Kang, Hyun-Inn;Baek, Kwang-Ryul
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.8
    • /
    • pp.47-54
    • /
    • 1998
  • With the increasing popularity of the use of large-volume image database in various application, it becomes imperative to build an efficient and fast retrieval system to browse through the entire database. We present a new method for a content-based image retrieval by using a variable block size and block matching algorithm. Proposed approach is reflecting image features that exploit visual cues such as color and space allocation of image and is getting the fast retrieval time by automatical convergence of retrieval times which adapt to wanting similarity value. We have implemented this technique and tested it for a database of approximately 150 images. The test shows that a 1.9 times fast retrieval time compare to J & V algorithm at the image retrieval efficiency 0.65 and that a 1.83 times fast retrieval time compare to predefined fixed block size.

  • PDF

A Study on the Learning Efficiency of Multilayered Neural Networks using Variable Slope (기울기 조정에 의한 다층 신경회로망의 학습효율 개선방법에 대한 연구)

  • 이형일;남재현;지선수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.42
    • /
    • pp.161-169
    • /
    • 1997
  • A variety of learning methods are used for neural networks. Among them, the backpropagation algorithm is most widely used in such image processing, speech recognition, and pattern recognition. Despite its popularity for these application, its main problem is associated with the running time, namely, too much time is spent for the learning. This paper suggests a method which maximize the convergence speed of the learning. Such reduction in e learning time of the backpropagation algorithm is possible through an adaptive adjusting of the slope of the activation function depending on total errors, which is named as the variable slope algorithm. Moreover experimental results using this variable slope algorithm is compared against conventional backpropagation algorithm and other variations; which shows an improvement in the performance over pervious algorithms.

  • PDF

STABLE AUTONOMOUS DRIVING METHOD USING MODIFIED OTSU ALGORITHM

  • Lee, D.E.;Yoo, S.H.;Kim, Y.B.
    • International Journal of Automotive Technology
    • /
    • v.7 no.2
    • /
    • pp.227-235
    • /
    • 2006
  • In this paper a robust image processing method with modified Otsu algorithm to recognize the road lane for a real-time controlled autonomous vehicle is presented. The main objective of a proposed method is to drive an autonomous vehicle safely irrespective of road image qualities. For the steering of real-time controlled autonomous vehicle, a detection area is predefined by lane segment, with previously obtained frame data, and the edges are detected on the basis of a lane width. For stable as well as psudo-robust autonomous driving with "good", "shady" or even "bad" road profiles, the variable threshold with modified Otsu algorithm in the image histogram, is utilized to obtain a binary image from each frame. Also Hough transform is utilized to extract the lane segment. Whether the image is "good", "shady" or "bad", always robust and reliable edges are obtained from the algorithms applied in this paper in a real-time basis. For verifying the adaptability of the proposed algorithm, a miniature vehicle with a camera is constructed and tested with various road conditions. Also, various highway road images are analyzed with proposed algorithm to prove its usefulness.

A Study on Variable Block Matching Algorithm Using Edge Information of Differential Image (차영상의 윤곽정보를 이용한 가변 블록 정합 알고리즘에 관한 연구)

  • 권병헌;안정길;황병원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.639-648
    • /
    • 1994
  • This paper presents a new block matching algorithm in estimation of motion information that is important technology in compressing interframe. In estimation of motion information, we find differential image using two successive frame image in order to find required real time processing and accurate moving vector, the binary image is made of edge and find more accurate moving vectors by application quadtree method to parts including many moving according to this activity. The computer simulation results show that increased PSNR and reduced computation time.

  • PDF

Image Pre-Processing Method and its Hardware Implementation for Real-Time Image Processing (실시간 영상처리를 위한 영상 전처리 방법 및 하드웨어 구현)

  • Kwak, Seong-in;Park, Jong-sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.999-1002
    • /
    • 2013
  • There are numerous image processing systems these are usually depend on high performance processors. However, systems using high performance processors might not be proper to mobile applications or low-power systems. Therefore, more efficient methodology for image processing is required for variable applications. This paper proposed pre-processing method using intra prediction concept in order to reduce processing range in a image picture(frame) and entire processing time. Also, the system configuration based on intra prediction hardware core and implementation result of the hardware core are presented in this paper.

  • PDF

Development of Real Time and Robust Feature Extraction Algorithm of Watermelon for Tele-robotic Operation (원격 로봇작업을 위한 실시간 수박 형상 추출 알고리즘)

  • Kim, S.C.;Hwang, H.
    • Journal of Biosystems Engineering
    • /
    • v.29 no.1
    • /
    • pp.71-78
    • /
    • 2004
  • Real time and robust algorithm to extract the features of watermelon was developed from the remotely transmitted image of the watermelon. Features of the watermelon at the cultivation site such as size and shape including position are crucial to the successful tole-robotic operation and development of the cultivation data base. Algorithm was developed based on the concept of task sharing between the computer and the operator utilizing man-computer interface. Task sharing was performed based on the functional characteristics of human and computer. Identifying watermelon from the image transmitted from the cultivation site is very difficult because of the variable light condition and the complex image contents such as soil, mulching vinyl, straws on the ground, irregular leaves and stems. Utilizing operator's teaching through the touch screen mounted on the image monitor, the complex time consuming image processing process and instability of processing results in the watermelon identification has been avoided. Color and brightness characteristics were analyzed from the image area specified by the operator's teaching. Watermelon segmentation was performed using the brightness and color distribution of the specified imae processing area. Modified general Hough transform was developed to extract the shape, major and minor axes, and the position, of the watermelon. It took less than 100 msec of the image processing time, and was a lot faster than conventional approach. The proposed method showed the robustness and practicability in identifying watermelon from the wireless transmitted color image of the cultivation site.

High accuracy measurement of the position and orientation of SMD VR by Computer Vision (비젼을 이용한 SMD 부품의 위치 및 자세 계측)

  • 김병엽;송재용;한창수;박종현;이영민
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.04b
    • /
    • pp.371-376
    • /
    • 1995
  • Computer vision is applicated to measure the position and orientation of the SMD on 8mm Camcoder PCB and advanced image processing algorithms for high accuracy and real time processing are proposed. Illumination conditions are optimized for the best image formation and a set of LEDs is used as economic illuminator, which is regarded as a summation of many point sources. Conctete optical system is constructed and the performance of the proposed algorithm is verified by several experiments.

  • PDF

A FAST AND ACCURATE NUMERICAL METHOD FOR MEDICAL IMAGE SEGMENTATION

  • Li, Yibao;Kim, Jun-Seok
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.14 no.4
    • /
    • pp.201-210
    • /
    • 2010
  • We propose a new robust and accurate method for the numerical solution of medical image segmentation. The modified Allen-Cahn equation is used to model the boundaries of the image regions. Its numerical algorithm is based on operator splitting techniques. In the first step of the splitting scheme, we implicitly solve the heat equation with the variable diffusive coefficient and a source term. Then, in the second step, using a closed-form solution for the nonlinear equation, we get an analytic solution. We overcome the time step constraint associated with most numerical implementations of geometric active contours. We demonstrate performance of the proposed image segmentation algorithm on several artificial as well as real image examples.