• 제목/요약/키워드: Image Edge

Search Result 2,465, Processing Time 0.023 seconds

Mosaic Detection Based on Edge Projection in Digital Video (비디오 데이터에서 에지 프로젝션 기반의 모자이크 검출)

  • Jang, Seok-Woo;Huh, Moon-Haeng
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.5
    • /
    • pp.339-345
    • /
    • 2016
  • In general, mosaic blocks are used to hide some specified areas, such as human faces and disgusting objects, in an input image when images are uploaded on a web-site or blog. This paper proposes a new algorithm for robustly detecting grid mosaic areas in an image based on the edge projection. The proposed algorithm first extracts the Canny edges from an input image. The algorithm then detects the candidate mosaic blocks based on horizontal and vertical edge projection. Subsequently, the algorithm obtains real mosaic areas from the candidate areas by eliminating the non-mosaic candidate regions through geometric features, such as size and compactness. The experimental results showed that the suggested algorithm detects mosaic areas in images more accurately than other existing methods. The suggested mosaic detection approach is expected to be utilized usefully in a variety of multimedia-related real application areas.

Study on the Physical Imaging Characteristics by Using Magnetic Resonance Imaging 1.5T (1.5T 자기공명영상을 이용한 물리적 영상 특성에 대한 연구)

  • Min, Jung-Whan;Jeong, Hoi-Woun;Han, Ji-Hyun;Lee, Si-Nae;Park, Jang-Ho;Kim, Ki-Won;Kim, Hyun-Soo
    • Journal of radiological science and technology
    • /
    • v.42 no.5
    • /
    • pp.329-334
    • /
    • 2019
  • This study was purpose to quantitative evaluation of noise power spectrum(NPS) and studied the quantitative evaluation and characteristics of modulation transfer function(MTF) by obtain the optimal edge image by using Coil in magnetic resonance imaging(MRI) equipment through Fujita theory using edge method. The MRI equipment was used (Tim AVANTO 1.5T, Siemense healthcare system, Germany) and the head matrix coil were 12channels(elements) receive coil. The NPS results of showed the best value of 0.004 based on the T2 Nyquist frequency of $1.0mm^{-1}$, and the MTF results of showed that the T1 and T2 values were generally better than the T1 CE and T1 CE FC values. The characteristics of this study were to explain the characteristic method of image quality evaluation in general. To present the quantitative evaluation process and results in the evaluation of MRI image characteristics in radiology.

A Temporal Error Concealment Method Based on Edge Adaptive Masking (에지정보에 적응적인 마스크를 이용한 시간방향 오류 은닉 방법)

  • Kim Yong-Woo;Lim Chan;Kang Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.91-98
    • /
    • 2005
  • In this paper, we propose a temporal error concealment method based on the edge adaptive masking. In the method, four regions around the corrupted block - top, bottom, left, and right - are defined and the edge features of the regions are extracted by applying an edge operator for each direction. The size of a mask for the boundary matching is determined by the edge information, which can be considered as a criterion to measure the activity of the boundary region. In other words, it is determined such that the size of the mask is proportional to the amount of edge-component extracted from each region in order to yield the higher reliability on boundary matching. This process is equivalent to applying weights depending on the edge features, which leads the improved motion vector. In experiments, it is verified that the proposed method outperforms the conventional methods in terms of image quality, and then its merits and demerits are discussed.

Modified Watershed Algorithm for Extracting Correct Edge and Reducing Processing Time (정확한 경계 추출 및 수행시간 단축을 위한 개선된 워터쉐드 알고리즘)

  • Park, Dong-In;Kim, Tae-Won;Ko, Yuh-Ho;Choi, Jae-Gark
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1463-1473
    • /
    • 2010
  • In this paper, we propose a modified watershed algorithm to extract more correct edge and reduce processing time. Two new algorithms are proposed in this paper. The first one is applying two conventional watershed expansion methods known as rainfall and immersion simulation jointly. We analyze the advantage and problem of each simulation and then propose a new expansion method that keeps the advantage and removes the problem in order to extract more correct edge and reduce processing time. The second is a new priority decision algorithm to obtain more correct edge of a region. Some zero-crossing points of gradient are expected to be edge of a region but the conventional method has a limitation that it cannot extract those points as edge. Therefore we propose a new priority decision algorithm for watershed in order to get more correct edge. We compare the proposed method with the conventional method through experiments and prove that the proposed method can extract more correct edge of region.

A Study on Edge Detection Algorithm using Mask Shifting Deviation (마스크 이동 편차를 이용한 에지 검출 알고리즘에 관한 연구)

  • Lee, Chang-Young;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1867-1873
    • /
    • 2015
  • Edge detection is one of image processing techniques applied for a variety of purposes in a number of areas and it is used as a necessary pretreatment process in most applications. In the conventional edge detection methods, there are Sobel, Prewitt, Roberts and LoG, etc using a fixed weights mask. Since conventional edge detection methods apply the images to the fixed weights mask, the edge detection characteristics appear somewhat insufficient. Therefore in this study, an algorithm for detecting the edge is proposed by applying the cross mask based on the center pixel and up, down, left and right mask based on the surrounding pixels of center pixel in order to solve these problems. And in order to assess the performance of proposed algorithm, it was compared with a conventional Sobel, Roberts, Prewitt and LoG edge detection methods.

AEMSER Using Adaptive Threshold Of Canny Operator To Extract Scene Text (장면 텍스트 추출을 위한 캐니 연산자의 적응적 임계값을 이용한 AEMSER)

  • Park, Sunhwa;Kim, Donghyun;Im, Hyunsoo;Kim, Honghoon;Paek, Jaegyung;Park, Jaeheung;Seo, Yeong Geon
    • Journal of Digital Contents Society
    • /
    • v.16 no.6
    • /
    • pp.951-959
    • /
    • 2015
  • Scene text extraction is important because it offers some important information on different image based applications pouring in current smart generation. Edge-Enhanced MSER(Maximally Stable Extremal Regions) which enhances the boundaries using the canny operator after extracting the basic MSER shows excellent performance in terms of text extraction. But according to setting the threshold of the canny operator, the result images using Edge-Enhanced MSER are different, so there needs a method figuring out the threshold. In this paper, we propose a AEMSER(Adaptive Edge-enhanced MSER) that applies the method extracting the boundary using the middle value of histogram to Edge-Enhanced MSER to get the canny operator's threshold. The proposed method can acquire better result images than the existing methods because it extracts the area only for the obvious boundaries.

Edge Detection using Cost Minimization Method (비용 최소화 방법을 이용한 모서리 감지)

  • Lee, Dong-Woo;Lee, Seong-Hoon
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.1
    • /
    • pp.59-64
    • /
    • 2022
  • Existing edge discovery techniques only found edges of defined shapes based on precise definitions of edges. Therefore, there are many limitations in finding edges for images of complex and diverse shapes that exist in the real world. A method for solving these problems and discovering various types of edges is a cost minimization method. In this method, the cost function and cost factor are defined and used. This cost function calculates the cost of the candidate edge model generated according to the candidate edge generation strategy. If a satisfactory result is obtained, the corresponding candidate edge model becomes the edge for the image. In this study, a new candidate edge generation strategy was proposed to discover edges for images of more diverse shapes in order to improve the disadvantage of only finding edges of a defined shape, which is a problem of the cost minimization method. In addition, the contents of improvement were confirmed through a simple simulation that reflected these points.

A Robust Edge Detection method using Van der Waerden Statistic (Waerden 통계량을 이용한 강인한 에지검출 방법)

  • 최명희;이호근;김주원;하영호
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.3
    • /
    • pp.147-153
    • /
    • 2004
  • This paper proposes an efficient edge detection using Van der Waerden statistic in original and noisy images. An edge is where the intensity of an image moves from a low value to a high value or vice versa. We describe a nonparametric Wilcoxon test and a parametric T test based on statistical hypothesis testing for the detection of edges. We use the threshold determined by specifying significance level $\alpha$, while Bovik, Huang and Munson consider the range of possible values of test statistics for the threshold. From the experimental results of edge detection, the T and Wilcoxon method perform sensitively to the noisy image, while the proposed Waerden method is robust over both noisy and noise-free images under $\alpha$=0.0005. Comparison with our statistical test and Sobel, LoG, Canny operators shows that Waerden method perform more effectively in both noisy and noise-free images.

On the Lower Level Laplacian Pyramid Image Coding Using Vector Quantization (벡터 양자화를 이용한 저층 라플라시안 피라미드 영상의 부호화에 관한 연구)

  • 김정규;정호열;최태영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.3
    • /
    • pp.213-224
    • /
    • 1992
  • An encoding technique based on region splitting and vector quantization is proposed for the lower level Laplacian pyramid images. The lower level Laplacian pyramid images have lower variance than higher levels but a great influence on compression ration due to large spatial area. And so from data compression viewpoint, we subdivide them with variance thresholding into two regions such as one called : flat region” and the other “edge region”, and encode the flat region with its mean value and the edge region as vector quantization method. The edge region can be reproduced faithfully and significant improvement on compression ratio can be accomplished with a little degradation of PSNR in spite of the effect of large flat region since the codebook used is generated from the edge region only on from the entire image including the flat region. It can be verified by computer simulation results that proposed method is more efficient in compression ratio and processing time than the conventional encoding technique of vector quantization.

  • PDF

Analysis of the Change in Pattern of Seoul Forest Patch to have used Landsat MSS Data (Landsat Mss Data를 이용한 서울시 산림패취의 패턴 변화분석)

  • Lee, Jong-Sung
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.26 no.2
    • /
    • pp.240-250
    • /
    • 1998
  • This study is to have attempted to analyze the characteristics of the change in forest landscape pattern of Seoul for 18 years by grasping it through satellite image data on the forest area in Seoul where a rapid change according urbanization and industrialization is going on. On the basis of Landsat MSS data- satellite image data, this writer analyzed the change in the number and size of patch and the mean edge length of each forest land, and the index of patch shape by each year from a landscape -ecological point of view. The results are as follows; First, in the pattern change of the forest patch of Seoul, the highest patch fragmentation area is the forest of the Yangchon-gu district where is decreasing it forest area by 654ha, 511ha, 495ha, 402ha each year from its total size of 742ha in 1979. Second, the change tendency shows that the average forest size decreased at 552.58ha in 1983, 435.03ha in 1988, 396.23ha in 1992, and 379.96ha in 1996. And analysis showed that even in the number of patches, the forest fragmentation phenomenon was presenting by the increase of development disturbance. Third, the mean edge by year was longest at 23,385m in 1979, but it is decreasing continuously. This shows the regular and artificial uniformity of forest landscape by disturbance-effect increase of the built-up development and shows low portion against edge effect by the time-series change like 1979>1983>198>1992>1996. Finally, in the analysis of a shape index indicated by ratio of size and edge, total averages were 2.56, 2.33, 2.17, 2.14, 2.14 each year, so that it is considered that the disturbance and ecological health status against forest landscape can be grasped according to being examined as 1979>1983>1988>1992, 1996 by the time-series change of the landscape.

  • PDF