• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.81-84
• /
• 2000

Digital Halftoning convert a continuous-tone images to a binary images. Inverse halftoning addresses the problem of recovering a continuous image from a halftoned binary image. Simple low pass filtering can remove the high frequency noise but it also removes the edge information. Thus the edge information should be separated from the halftoning noise. As a result, the edge of result image is blurring. This paper present that we obtain continuous-tone-image which using Anisotropic diffusion filter. To reduce noise without blurring the edges of reconstructed image use edge map. The experimental results show that proposed method gives a higher PSNR and better subjective quality than conventional methods. As a result, the edge information of reconstructed image reduce blurring.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.123-126
• /
• 2010

An implementation of modified stereo matching using efficient belief propagation (BP) algorithm is presented in this paper. We do recommend the use of the simple sobel, prewitt edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). When we adopt the only MRF + BP algorithm, however, borders cannot be distinguished due to that the message functions in the BP algorithm is just the mechanism which passes energy data to the only large gap of each Message functions In order to address the abovementioned disadvantageous phenomenon, we use the sobel edge operator + MRF + BP algorithm to distinguish the border that is located between the similar message data. Using edge information, the result shows that our proposed process diminishes the propagation of wrong probabilistic information. The enhanced result is due to that our proposed method effectively reduced errors incurred by ambiguous scene properties.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.494-499
• /
• 2012

In this paper, a new method for detecting various objects that can be risks to safety navigation in sea environment is proposed. By analysing Infrared(IR) images obtained from various sea environments, we could find out that object regions include both horizontal and vertical direction edges while background regions of sea surface mainly include vertical direction edges. Therefore, we present an approach to detecting object regions considering horizontal and vertical edges. To this end, in the first step, image enhancement is performed by suppressing noises such as sea glint and complex clutters using a statistical filter. In the second step, a horizontal edge map and a vertical edge map are generated by 1-D Discrete Cosine Transform technique. Then, a combined map integrating the horizontal and the vertical edge maps is generated. In the third step, candidate object regions are detected by a adaptive thresholding method. Finally, exact object regions are extracted by eliminating background and clutter regions based on morphological operation.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1121-1135
• /
• 2005

This paper proposes a moving object extraction method using the contrast map and salient points. In order to make the contrast map, we generate three-feature maps such as luminance map, color map and directional map and extract salient points from an image. By using these features, we can decide the Attention Window(AW) location easily The purpose of the AW is to remove the useless regions in the image such as background as well as to reduce the amount of image processing. To create the exact location and flexible size of the AW, we use motion feature instead of pre-assumptions or heuristic parameters. After determining of the AW, we find the difference of edge to inner area from the AW. Then, we can extract horizontal candidate region and vortical candidate region. After finding both horizontal and vertical candidates, intersection regions through logical AND operation are further processed by morphological operations. The proposed algorithm has been applied to many video sequences which have static background like surveillance type of video sequences. The moving object was quite well segmented with accurate boundaries.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.24-29
• /
• 1999

In this paper, a simple contour-preserving filtering algorithm is proposed. The goal of the contour-preserving filtering method is to remove noise ad granularity as the preprocessing for the image segmentation procedure. Our method finds edge map and separates the image into the edge region and the non-edge region using this edge map. For the non-edge region, typical smoothing filters could be used to remove the noise and the small areas during the segmentation procedure. The result of simulation shows that our method is slightly better than the typical methods such as the median filtering and gradient inverse weighted filtering in the point of view of analysis of variance (ANOVA).

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1591-1602
• /
• 1995

A hybrid approach which includes edge- and region-based methods is considered. The modified non-linear Laplacian(MNL) filter is used for feature extraction. The matching algorithm has three steps which are edge, signed region, and residual region matching. At first, the edge points are matched using the sign and direction of edges. Then, the disparity is propagated from edge to inside region. A variable window is used to consider the local method which give accurate matched points and area-based method which can obtain full-resolution disparity map. In addition, a new relaxation algorithm for considering matching possibility derived from normalized error and regional continuity constraint is proposed to reduce the mismatched points. By the result of simulation for various images, this algorithm is insensitive to noise and gives full- resolution disparity map.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.655-666
• /
• 2007

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1419-1427
• /
• 2007

In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.7-21
• /
• 2019

In order to improve the edge segmentation effect of the level set image segmentation and avoid the influence of the initial contour on the level set method, a saliency level set image segmentation model based on local Renyi entropy is proposed. Firstly, the saliency map of the original image is extracted by using saliency detection algorithm. And the outline of the saliency map can be used to initialize the level set. Secondly, the local energy and edge energy of the image are obtained by using local Renyi entropy and Canny operator respectively. At the same time, new adaptive weight coefficient and boundary indication function are constructed. Finally, the local binary fitting energy model (LBF) as an external energy term is introduced. In this paper, the contrast experiments are implemented in different image database. The robustness of the proposed model for segmentation of images with intensity inhomogeneity and complicated edges is verified.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.961-970
• /
• 2007

Since the usual conventional edge detectors employ the local differential derivatives, the detected edges are not uniform in their widths or some edges are missed out of the detection on magnified images. We employ a mapping from the exactly monotonic intensity distributions of ramp edges to the simple step functions of intensity, which is referred to as perfect sharpening map of ramp edges. This map is based on the non-local feature of intensity distribution and used to introduce a modified differentiation, in terms of which we can construct an efficient edge detector adaptive to the variation of edge width. By adopting the operator MADD in this paper, we developed an edge detector that works stably against the magnification of image or the variation of edge width. It is shown by comparing to the conventional algorithms that the proposed one is very excellent.