• Title/Summary/Keyword: Image Edge

Search Result 2,464, Processing Time 0.03 seconds

Object Segmentation for Image Transmission Services and Facial Characteristic Detection based on Knowledge (화상전송 서비스를 위한 객체 분할 및 지식 기반 얼굴 특징 검출)

  • Lim, Chun-Hwan;Yang, Hong-Young
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.3
    • /
    • pp.26-31
    • /
    • 1999
  • In this paper, we propose a facial characteristic detection algorithm based on knowledge and object segmentation method for image communication. In this algorithm, under the condition of the same lumination and distance from the fixed video camera to human face, we capture input images of 256 $\times$ 256 of gray scale 256 level and then remove the noise using the Gaussian filter. Two images are captured with a video camera, One contains the human face; the other contains only background region without including a face. And then we get a differential image between two images. After removing noise of the differential image by eroding End dilating, divide background image into a facial image. We separate eyes, ears, a nose and a mouth after searching the edge component in the facial image. From simulation results, we have verified the efficiency of the Proposed algorithm.

  • PDF

Efficient Image Segmentation Using Morphological Watershed Algorithm (형태학적 워터쉐드 알고리즘을 이용한 효율적인 영상분할)

  • Kim, Young-Woo;Lim, Jae-Young;Lee, Won-Yeol;Kim, Se-Yun;Lim, Dong-Hoon
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.4
    • /
    • pp.709-721
    • /
    • 2009
  • This paper discusses an efficient image segmentation using morphological watershed algorithm that is robust to noise. Morphological image segmentation consists of four steps: image simplification, computation of gradient image and watershed algorithm and region merging. Conventional watershed segmentation exhibits a serious weakness for over-segmentation of images. In this paper we present a morphological edge detection methods for detecting edges under noisy condition and apply our watershed algorithm to the resulting gradient images and merge regions using Kolmogorov-Smirnov test for eliminating irrelevant regions in the resulting segmented images. Experimental results are analyzed in both qualitative analysis through visual inspection and quantitative analysis with percentage error as well as computational time needed to segment images. The proposed algorithm can efficiently improve segmentation accuracy and significantly reduce the speed of computational time.

Smartphone Based Retouching Method for Watercolor Painting Effect Using Mean Shift Segmentation (Mean Shift Segmentation을 이용한 스마트폰 기반의 수채화 효과 변환 기법)

  • Lee, Sang-Geol;Kim, Cheol-Ki;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.11
    • /
    • pp.2413-2418
    • /
    • 2010
  • We propose a retouching method that converts a photography taken by smartphone to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to convert an input image to fit the screen resolution of smartphone. And next step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform mean shift segmentation from the bilateral filtered image. We apply parameters of mean shift segmentation considering the processing speed of smartphone. Experimental result shows that our method can be applied to various types of image and bring better result.

Design and Implementation of Multiple View Image Synthesis Scheme based on RAM Disk for Real-Time 3D Browsing System (실시간 3D 브라우징 시스템을 위한 램 디스크 기반의 다시점 영상 합성 기법의 설계 및 구현)

  • Sim, Chun-Bo;Lim, Eun-Cheon
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.5
    • /
    • pp.13-23
    • /
    • 2009
  • One of the main purpose of multiple-view image processing technology is support realistic 3D image to device user by using multiple viewpoint display devices and compressed data restoration devices. This paper proposes a multiple view image synthesis scheme based on RAM disk which makes possible to browse 3D images generated by applying effective composing method to real time input stereo images. The proposed scheme first converts input images to binary image. We applies edge detection algorithm such as Sobel algorithm and Prewiit algorithm to find edges used to evaluate disparities from images of 4 multi-cameras. In addition, we make use of time interval between hardware trigger and software trigger to solve the synchronization problem which has stated ambiguously in related studies. We use a unique identifier on each snapshot of images for distributed environment. With respect of performance results, the proposed scheme takes 0.67 sec in each binary array. to transfer entire images which contains left and right side with disparity information for high quality 3D image browsing. We conclude that the proposed scheme is suitable for real time 3D applications.

Image Segmentation Using Anisotropic Diffusion Based on Diagonal Pixels (대각선 방향 픽셀에 기반한 이방성 확산을 이용한 영상 분할)

  • Kim Hye-Suk;Yoon Hyo-Sun;Toan Nguyen Dinh;Yoo Jae-Myung;Lee Guee-Sang
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.21-29
    • /
    • 2007
  • Anisotropic diffusion is one of the widely used techniques in the field of image segmentation. In the conventional anisotropic diffusion [1]-[6], usually 4-neighborhood directions are used: north, south, west and east, except the image diagonal directions, which results in the loss of image details and causes false contours. Existing methods for image segmentation using conventional anisotroplc diffusion can't preserve contour information, or noises with high gradients become more salient as the umber of times of the diffusion increases, resulting in over-segmentation when applied to watershed. In this paper, to overcome the shortcoming of the conventional anisotropic diffusion method, a new arusotropic diffusion method based on diagonal edges is proposed. And a method of watershed segmentation is applied to the proposed method. Experimental results show that the process time of the proposed method including diagonal edges over conventional methods can be up to 2 times faster and the Circle image quality improvement can be better up to $0.45{\sim}2.33(dB)$. Experiments also show that images are segmented very effectively without over segmentation.

Robust Digital Watermarking to JPEG Compression (JPEG 압축에 견고한 디지털 워터마킹)

  • 이혜주;박지환
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.1
    • /
    • pp.53-62
    • /
    • 2000
  • Digital watermarking has been considered as an important technique to protect the copyright of digital content. It is essential that a watermark embedded in a still or moving image resists against various attacks ranging from compression, filtering to cropping. In particular, as JPEG is a dominant still image compression standard for Internet applications, digital watermarking methods that are robust against the JPEG compression are especially required. Most digital watermarking methods proposed so far work by modulating pixels/coefficients without considering the quality level of JPEG, which renders watermarks readily removable. In this paper, we proposed a new digital watermarking method as follows. For providing the robustness against JPEG, the quality level of JPEG is used as parameter on watermarking so as to compute the loss of image caused by JPEG compression and we compute the difference of an original image resulted from JPEG compression. Also in proposed method, we compute the visual components that are derived from the information of edge within image and consideration of brightness discrimination which is one of human visual system's properties. Thus, we proposed new watermarking scheme that after constructing a watermark by considering the loss of image resulted from JPEG compression and visual components derived from the human visual system, the watermark is embedded into the image.

  • PDF

Adaptive Noise Removal Based on Nonstationary Correlation (영상의 비정적 상관관계에 근거한 적응적 잡음제거 알고리듬)

  • 박성철;김창원;강문기
    • Journal of Broadcast Engineering
    • /
    • v.8 no.3
    • /
    • pp.278-287
    • /
    • 2003
  • Noise in an image degrades image quality and deteriorates coding efficiency. Recently, various edge-preserving noise filtering methods based on the nonstationary image model have been proposed to overcome this problem. In most conventional nonstationary image models, however, pixels are assumed to be uncorrelated to each other in order not to Increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that an image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean-square-error filter. Justification for the proposed image model is presented and effectiveness of the proposed algorithm is demonstrated experimentally.

Smartphone Based Retouching Method for Watercolor Painting Effect Using Mean Shift Segmentation (Mean Shift Segmentation을 이용한 스마트폰 기반의 수채화 효과 변환 기법)

  • Lee, Sang-Geol;Kim, Cheol-Ki;Cha, Eui-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.206-208
    • /
    • 2010
  • We propose a retouching method that converts a photography taken by smartphone to a watercolor painting image using bilateral filtering and mean shift segmentation which are mostly used in image processing. The first step is to convert an input image to fit the screen resolution of smartphone. And next step is to weaken high frequency components of the image, while preserving the edge of image using the bilateral filtering. And after that we perform mean shift segmentation from the bilateral filtered image. We apply parameters of mean shift segmentation considering the processing speed of smartphone. Experimental result shows that our method can be applied to various types of image and bring better result.

  • PDF

Skew correction of face image using eye components extraction (눈 영역 추출에 의한 얼굴 기울기 교정)

  • Yoon, Ho-Sub;Wang, Min;Min, Byung-Woo
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.12
    • /
    • pp.71-83
    • /
    • 1996
  • This paper describes facial component detection and skew correction algorithm for face recognition. We use a priori knowledge and models about isolated regions to detect eye location from the face image captured in natural office environments. The relations between human face components are represented by several rules. We adopt an edge detection algorithm using sobel mask and 8-connected labelling algorith using array pointers. A labeled image has many isolated components. initially, the eye size rules are used. Eye size rules are not affected much by irregular input image conditions. Eye size rules size, and limited in the ratio between gorizontal and vertical sizes. By the eye size rule, 2 ~ 16 candidate eye components can be detected. Next, candidate eye parirs are verified by the information of location and shape, and one eye pair location is decided using face models about eye and eyebrow. Once we extract eye regions, we connect the center points of the two eyes and calculate the angle between them. Then we rotate the face to compensate for the angle so that the two eyes on a horizontal line. We tested 120 input images form 40 people, and achieved 91.7% success rate using eye size rules and face model. The main reasons of the 8.3% failure are due to components adjacent to eyes such as eyebrows. To detect facial components from the failed images, we are developing a mouth region processing module.

  • PDF

A Study on an Image Stabilization in Moving Vehicle (이동 차량에서 영상 안정화에 관한 연구)

  • Tak, Soo-Yong;Ban, Jae-Min;Lew, Sheen;Lee, Wan-Joo;Lee, Byeong-Rae;Kang, Hyun-Chul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.4
    • /
    • pp.95-104
    • /
    • 2012
  • In the image captured by the camera in a moving vehicle, there exist various motions due to the change of background, motion of objects in the image that make difficult to extract a pure vibrational motion by the camera. In this paper, we suggest an image stabilization with the elimination of various motion components based on the classification of motions in the image by their characteristics. After the elimination of various local motions, images are compensated and stabilized with the global motion caused by the camera. Also, we suggest an accurate and fast image stabilization by excluding regions of little information based on block differences and edge densities.