• Title/Summary/Keyword: pixel-based processing

Search Result 438, Processing Time 0.022 seconds

Boundary Depth Estimation Using Hough Transform and Focus Measure (허프 변환과 초점정보를 이용한 경계면 깊이 추정)

  • Kwon, Dae-Sun;Lee, Dae-Jong;Chun, Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.1
    • /
    • pp.78-84
    • /
    • 2015
  • Depth estimation is often required for robot vision, 3D modeling, and motion control. Previous method is based on the focus measures which are calculated for a series of image by a single camera at different distance between and object. This method, however, has disadvantage of taking a long time for calculating the focus measure since the mask operation is performed for every pixel in the image. In this paper, we estimates the depth by using the focus measure of the boundary pixels located between the objects in order to minimize the depth estimate time. To detect the boundary of an object consisting of a straight line and a circle, we use the Hough transform and estimate the depth by using the focus measure. We performed various experiments for PCB images and obtained more effective depth estimation results than previous ones.

Color Transfer Method Based on Separation of Saturation (채색 분리 기반의 색 변환 기법)

  • Kwak, Jung-Min;Kim, Jae-Hyup;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.149-159
    • /
    • 2008
  • We present new methods which transfer the color style of a source image into an arbitrary given reference image. Misidentification problem of color cause wrong indexing in low saturation. Therefore, the proposed method do indexing after Image separating chromatic and achromatic color from saturation. The proposed method is composed of the following four steps : In the first step, Image separate chromatic and achromatic color from saturation using threshold. In the second step, image of separation do indexing using cylindrical metric. In the third step, the number and positional dispersion of pixel decide the order of priority for each index color. And average and standard deviation of each index color be calculated. In the final step, color be transferred in Lab color space, and post processing to removal noise and pseudo-contour. Experimental results show that the proposed method is effective on indexing and color transfer.

Efficient Browsing Method based on Metadata of Video Contents (동영상 컨텐츠의 메타데이타에 기반한 효율적인 브라우징 기법)

  • Chun, Soo-Duck;Shin, Jung-Hoon;Lee, Sang-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.513-518
    • /
    • 2010
  • The advancement of information technology along with the proliferation of communication and multimedia has increased the demand of digital contents. Video data of digital contents such as VOD, NOD, Digital Library, IPTV, and UCC are getting more permeated in various application fields. Video data have sequential characteristic besides providing the spatial and temporal information in its 3D format, making searching or browsing ineffective due to long turnaround time. In this paper, we suggest ATVC(Authoring Tool for Video Contents) for solving this issue. ATVC is a video editing tool that detects key frames using visual rhythm and insert metadata such as keywords into key frames via XML tagging. Visual rhythm is applied to map 3D spatial and temporal information to 2D information. Its processing speed is fast because it can get pixel information without IDCT, and it can classify edit-effects such as cut, wipe, and dissolve. Since XML data save key frame information via XML tag and keyword information, it can furnish efficient browsing.

Automatic Detection of Kidney Tumor from Abdominal CT Scans (복부 CT 영상에서 신장암의 자동추출)

  • 김도연;노승무;조준식;김종철;박종원
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.11
    • /
    • pp.803-808
    • /
    • 2002
  • This paper describes automatic methods for detection of kidney and kidney tumor on abdominal CT scans. The abdominal CT images were digitalized using a film digitizer and a gray-level threshold method was used to segment the kidney. Based on texture analysis results, which were perform on sample images of kidney tumors, SEED region of kidney tumor was selected as result of homogeneity test. The average and standard deviation, which are representative statistical moments, were used to as an acceptance criteria for homogeneous test. Region growing method was used to segment the kidney tumor from the center pixel of selected SEED region using a gray-level value as an acceptance criteria for homogeneity test. These method were applied to 113 images of 9 cases, which were scanned by GE Hispeed Advantage CT scanner and digitalized by Lumisvs LS-40 film digitizer. The sensitivity was 85% and there was no false-positive results.

The Performance Improvement of a Linear CCD Sensor Using an Automatic Threshold Control Algorithm for Displacement Measurement

  • Shin, Myung-Kwan;Choi, Kyo-Soon;Park, Kyi-Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1417-1422
    • /
    • 2005
  • Among the sensors mainly used for displacement measurement, there are a linear CCD(Charge Coupled Device) and a PSD(Position Sensitive Detector) as a non-contact type. Their structures are different very much, which means that the signal processing of both sensors should be applied in the different ways. Most of the displacement measurement systems to get the 3-D shape profile of an object using a linear CCD are a computer-based system. It means that all of algorithms and mathematical operations are performed through a computer program to measure the displacement. However, in this paper, the developed system has microprocessor and other digital components that make the system measure the displacement of an object without a computer. The thing different from the previous system is that AVR microprocessor and FPGA(Field Programmable Gate Array) technology, and a comparator is used to play the role of an A/D(Analog to Digital) converter. Furthermore, an ATC(Automatic Threshold Control) algorithm is applied to find the highest pixel data that has the real displacement information. According to the size of the light circle incident on the surface of the CCD, the threshold value to remove the noise and useless data is changed by the operation of AVR microprocessor. The total system consists of FPGA, AVR microprocessor, and the comparator. The developed system has the improvement and shows the better performance than the system not using the ATC algorithm for displacement measurement.

  • PDF

Enhanced ART1 Algorithm for the Recognition of Student Identification Cards of the Educational Matters Administration System on the Web (웹 환경 학사관리 시스템의 학생증 인식을 위한 개선된 ART1 알고리즘)

  • Park Hyun-Jung;Kim Kwang-Baek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.333-342
    • /
    • 2005
  • This paper proposes a method, which recognizes student's identification card by using image processing and recognition technology and can manage student information on the web. The presented scheme sets up an average brightness as a threshold, based on the brightest Pixel and the least bright one for the source image of the ID card. It is converting to binary image, applies a horizontal histogram, and extracts student number through its location. And, it removes the noise of the student number region by the mode smoothing with 3$\times$3 mask. After removing noise from the student number region, each number is extracted using vertical histogram and normalized. Using the enhanced ART1 algorithm recognized the extracted student number region. In this study, we propose the enhanced ART1 algorithm different from the conventional ART1 algorithm by the dynamical establishment of the vigilance parameter. which shows a tolerance limit of unbalance between voluntary and stored patterns for clustering. The Experiment results showed that the recognition rate of the proposed ART1 algorithm was improved much more than that of the conventional ART1 algorithm. So, we develop an educational matters administration system by using the proposed recognition method of the student's identification card.

  • PDF

Image Pattern Classification and Recognition by Using the Associative Memory with Cellular Neural Networks (셀룰라 신경회로망의 연상메모리를 이용한 영상 패턴의 분류 및 인식방법)

  • Shin, Yoon-Cheol;Park, Yong-Hun;Kang, Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.2
    • /
    • pp.154-162
    • /
    • 2003
  • In this paper, Associative Memory with Cellular Neural Networks classifies and recognizes image patterns as an operator applied to image process. CNN processes nonlinear data in real-time like neural networks, and made by cell which communicates with each other directly through its neighbor cells as the Cellular Automata does. It is applied to the optimization problem, associative memory, pattern recognition, and computer vision. Image processing with CNN is appropriate to 2-D images, because each cell which corresponds to each pixel in the image is simultaneously processed in parallel. This paper shows the method for designing the structure of associative memory based on CNN and getting output image by choosing the most appropriate weight pattern among the whole learned weight pattern memories. Each template represents weight values between cells and updates them by learning. Hebbian rule is used for learning template weights and LMS algorithm is used for classification.

Object Tracking in HEVC Bitstreams (HEVC 스트림 상에서의 객체 추적 방법)

  • Park, Dongmin;Lee, Dongkyu;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.20 no.3
    • /
    • pp.449-463
    • /
    • 2015
  • Video object tracking is important for variety of applications, such as security, video indexing and retrieval, video surveillance, communication, and compression. This paper proposes an object tracking method in HEVC bitstreams. Without pixel reconstruction, motion vector (MV) and size of prediction unit in the bitstream are employed in an Spatio-Temporal Markov Random Fields (ST-MRF) model which represents the spatial and temporal aspects of the object's motion. Coefficient-based object shape adjustment is proposed to solve the over-segmentation and the error propagation problems caused in other methods. In the experimental results, the proposed method provides on average precision of 86.4%, recall of 79.8% and F-measure of 81.1%. The proposed method achieves an F-measure improvement of up to 9% for over-segmented results in the other method even though it provides only average F-measure improvement of 0.2% with respect to the other method. The total processing time is 5.4ms per frame, allowing the algorithm to be applied in real-time applications.

A Hybrid Watermarking Scheme for Color Images (컬러 영상을 위한 하이브리드 워터마킹)

  • Lee Hyun-Suk;Oktavia Vivi;Kim Mi-Ae;Lee Won-Hyung
    • Journal of Internet Computing and Services
    • /
    • v.5 no.3
    • /
    • pp.73-86
    • /
    • 2004
  • This paper presents a hybrid digital watermarking scheme for color images, We insert two watermarks in the DWT domain using spread-spectrum correlation-based watermarking in luminance component of the color image and in spatial domain using pixel-value substitution of blue channel of color image. The objectives of this paper are to have the watermark robust to common signal processing and to detect any changes on the watermarked image for tamper detection at the same time. This watermark scheme will have the robustness characteristic as typical in frequency domain watermark, and also ability to detect any changes on the image (tamper detection).

  • PDF

Effective Face Detection Using Principle Component Analysis and Support Vector Machine (주성분 분석과 서포트 백터 머신을 이용한 효과적인 얼굴 검출 시스템)

  • Kang, Byoung-Doo;Kwon, Oh-Hwa;Seong, Chi-Young;Jeon, Jae-Deok;Eom, Jae-Sung;Kim, Jong-Ho;Lee, Jae-Won;Kim, Sang-Kyoon
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1435-1444
    • /
    • 2006
  • We present an effective and real-time face detection method based on Principal Component Analysis(PCA) and Support Vector Machines(SVMs). We extract simple Haar-like features from training images that consist of face and non-face images, reinterpret the features with PCA, and select useful ones from the large number of extracted features. With the selected features, we construct a face detector using an SVM appropriate for binary classification. The face detector is not affected by the size of a training data set in a significant way, so that it showed 90.1 % detection rates with a small quantity of training data. it can process 8 frames per second for $320{\times}240$ pixel images. This is an acceptable processing time for a real-time system.

  • PDF