• Title/Summary/Keyword: edge region

Search Result 1,156, Processing Time 0.028 seconds

Weighted Edge Adaptive POCS Demosaicking Algorithm (Edge 가중치를 이용한 적응적인 POCS Demosaicking 알고리즘)

  • Park, Jong-Soo;Lee, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.3
    • /
    • pp.46-54
    • /
    • 2008
  • Most commercial CCD/CMOS image sensors have CFA(Color Filter Array) where each pixel gathers light of a selective color to reduce the sensor size and cost. There are many algorithms proposed to reconstruct the original clolr image by adopting pettern recognition of regularization methods to name a few. However the resulting image still suffer from errors such as flase color, zipper effect. In this paper we propose an adaptive edge weight demosaicking algorithm that is based on POCS(Projection Onto Convex Sets) not only to improve the entire image's PSNR but also to reduce the edge region's errors that affect subjective image quality. As a result, the proposed algorithm reconstruct better quality images especially at the edge region.

Design of Sigma Filter in DCT Domain and its application (DCT영역에서의 시그마 필터설계와 응용)

  • Kim, Myoung-Ho;Eom, Min-Young;Choe, Yoon-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.178-180
    • /
    • 2004
  • In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

  • PDF

A motion-adaptive de-interlacing method using an efficient spatial and temporal interpolation (효율적인 시공간 보간을 통한 움직임 기반의 디인터레이싱 기법)

  • Lee, Seong-Gyu;Lee, Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.556-566
    • /
    • 2001
  • This paper proposes a motion-adaptive de-interlacing algorithm based on EBMF(Edge Based Median Filter) and AMPDF(Adaptive Minimum Pixel Difference Fillet). To compensate 'motion missing'error, which is an important factor in motion-adaptive methods, we used AMPDF which estimates an accurate value using different thresholds after classifying the input image to 4 classes. To efficiently interpolate the moving diagonal edge, we also used EBMF which selects a candidate pixel according to the edge information. Finally, we, to increase the performance, adopted an adaptive interpolation after classifying the input image to moving region, stationary region, and boundary region. Simulation results showed that the proposed method provides better performance than the existing methods.

  • PDF

Extraction of Tongue Region using Graph and Geometric Information (그래프 및 기하 정보를 이용한 설진 영역 추출)

  • Kim, Keun-Ho;Lee, Jeon;Choi, Eun-Ji;Ryu, Hyun-Hee;Kim, Jong-Yeol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.11
    • /
    • pp.2051-2057
    • /
    • 2007
  • In Oriental medicine, the status of a tongue is the important indicator to diagnose one's health like physiological and clinicopathological changes of inner parts of the body. The method of tongue diagnosis is not only convenient but also non-invasive and widely used in Oriental medicine. However, tongue diagnosis is affected by examination circumstances a lot like a light source, patient's posture and doctor's condition. To develop an automatic tongue diagnosis system for an objective and standardized diagnosis, segmenting a tongue is inevitable but difficult since the colors of a tongue, lips and skin in a mouth are similar. The proposed method includes preprocessing, graph-based over-segmentation, detecting positions with a local minimum over shading, detecting edge with color difference and estimating edge geometry from the probable structure of a tongue, where preprocessing performs down-sampling to reduce computation time, histogram equalization and edge enhancement. A tongue was segmented from a face image with a tongue from a digital tongue diagnosis system by the proposed method. According to three oriental medical doctors' evaluation, it produced the segmented region to include effective information and exclude a non-tongue region. It can be used to make an objective and standardized diagnosis.

Frequency Mudularized Deinterlacing Using Neural Network (신경회로망을 이용한 주파수 모듈화된 deinterlacing)

  • 우동헌;엄일규;김유신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12C
    • /
    • pp.1250-1257
    • /
    • 2003
  • Generally images are classified into two regions: edge and flat region. While low frequency components are popular in the flat region, high frequency components are quite important in the edge region. Therefore, deinterlacing algorithm that considers the characteristic of each region can be more efficient. In this paper, an image is divided into edge region and flat region by the local variance. And then, for each region, frequency modularized neural network is assigned. Using this structure, each modularized neural network can learn only its region intensively and avoid the complexity of learning caused by the data of different region. Using the local AC data for the input of neural network can prevent the degradation of the performance of teaming due to the average intensity values of image that disturbs the effective learning. The proposed method shows the improved performance compared with previous algorithms in the simulation.

Probabilistic Modeling of Fiber Length Segments within a Bounded Area of Two-Dimensional Fiber Webs

  • Chun, Heui-Ju
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.3
    • /
    • pp.301-317
    • /
    • 2011
  • Statistical and probabilistic behaviors of fibers forming fiber webs of all kinds are of great significance in the determination of the uniformity and physical properties of the webs commonly found in many industrial products such as filters, membranes and non-woven fabrics. However, in studying the spatial geometry of the webs the observations must be theoretically as well as experimentally confined within a specified unit area. This paper provides a general theory and framework for computer simulation for quantifying the fiber segments bounded by the unit area in consideration of the "edge effects" resulting from the truncated length segments within the boundary. The probability density function and the first and second moments of the length segments found within the counting region were derived by properly defining the seeding region and counting region.

Nonlinear Anisotropic Filtering with Considering of Various Structures in Magnetic Resonance Imaging (자기공명영상에서 다양한 구조들을 고려한 비선형 이방성 필터링)

  • Song Young-Chul
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.3
    • /
    • pp.148-155
    • /
    • 2003
  • In this paper, a nonlinear anisotropic filtering method without the loss of important information happened due to the repeated filtering in magnetic resonance images is proposed. First of all original images are divided into four regions, e.g., SPR(Strong Plain Region), EPR(Easy Plain Region), SER(Strong Edge Region), and EER(Easy Edge Region). An optimal template among multiple templates is selected, then the nonlinear anisotropic filtering based on the template is applied in pixel by pixel basis. In the proposed algorithm, filtering strength of EER containing important information is adjusted very weak and filtering strength for remaining regions is also adjusted according to the degree of the importance. In spite of repeated filtering, resulting images by the proposed method could still preserve anatomy information of original images without any degradation. Compared to the existing nonlinear anisotropic filtering, the proposed filtering method with multiple templates provides higher reliability for filtered images.

An Edge Directed Color Demosaicing Algorithm Considering Color Channel Correlation (컬러 채널 상관관계를 고려한 에지 방향성 컬러 디모자이킹 알고리즘)

  • Yoo, Du Sic;Lee, Min Seok;Kang, Moon Gi
    • Journal of Broadcast Engineering
    • /
    • v.18 no.4
    • /
    • pp.619-630
    • /
    • 2013
  • In this paper, we propose an edge directed color demosaicing algorithm considering color channel correlation. The proposed method consists of local region classification step and edge directional interpolation step. In the first step, each region of a given Bayer image is classified as normal edge, pattern edge, and flat regions by using intra channel and inter channel gradients. Especially, two criteria and verification process for the normal edge and pattern edge classification are used to reduce edge direction estimation error, respectively. In the second step, edge directional interpolation process is performed according to characteristics of the classified regions. For horizontal and vertical directional interpolations, missing color components are obtained from interpolation equations based on intra channel and inter channel correlations in order to improve the performance of the directional interpolations. The simulation results show that the proposed algorithm outperforms conventional approaches in both objective and subjective terms.

Region Separateness-based Edge Detection Method (영역의 분할정도에 기반한 에지 검출 기법)

  • Seo, Suk-T.;Jeong, Hye-C.;Lee, In-K.;Kwon, Soon-H.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.939-944
    • /
    • 2007
  • Edge is a significant element to represent boundary information between objects in images. There are various edge detection methods, which are based on differential operation, such as Sobel, Prewitt, Roberts, Canny, Laplacian, and etc. However the conventional methods have drawbacks as follow : (i) insensitivity to edges with gentle curve intensity, (ii) detection of double edges for edges with one pixel width. For the detection of edges, not only development of the effective operators but also that of appropriate thresholding methods are necessary. But it is very complicate problem to find an appropriate threshold. In this paper, we propose an edge detection method based on the region separateness between objects to overcome the drawbacks of the conventional methods, and a thresholding method for the proposed edge detection method. We show the effectiveness of the proposed method through experimental results obtained by applying the proposed and the conventional methods to well-known test images.

Two Algorithms for Constructing the Voronoi Diagram for 3D Spheres and Applications to Protein Structure Analysis (삼차원 구의 보로노이 다이어그램 계산을 위한 두 가지 알고리듬 및 단백질구조채석에의 응용)

  • Kim D.;Choi Y.;Kim D.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.97-106
    • /
    • 2006
  • Voronoi diagrams have been known for numerous important applications in science and engineering including CAD/CAM. Especially, the Voronoi diagram for 3D spheres has been known as very useful tool to analyze spatial structural properties of molecules or materials modeled by a set of spherical atoms. In this paper, we present two algorithms, the edge-tracing algorithm and the region-expansion algorithm, for constructing the Voronoi diagram of 3D spheres and applications to protein structure analysis. The basic scheme of the edge-tracing algorithm is to follow Voronoi edges until the construction is completed in O(mn) time in the worst-case, where m and n are the numbers of edges and spheres, respectively. On the other hand, the region-expansion algorithm constructs the desired Voronoi diagram by expanding Voronoi regions for one sphere after another via a series of topology operations, starting from the ordinary Voronoi diagram for the centers of spheres. It turns out that the region-expansion algorithm also has the worst-case time complexity of O(mn). The Voronoi diagram for 3D spheres can play key roles in various analyses of protein structures such as the pocket recognition, molecular surface construction, and protein-protein interaction interface construction.