• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.640-647
• /
• 2002

In this paper, we consider the problems related to the edge visibility on a reconfigurable mesh(in short, RMESH). The following basic problems related to the edge visibility are considered: First, determine if a given polygon is visible from a specific edge, Second, find all edges from which a given polygon is visible. Third, compute the visibility polygon from a specific edge of a given polygon. In this paper, we consider the following problem in order to solve these problems in constant time: given two edges e and f of a simple polygon p, compute the maximal interval of f which is visible from e. We present a constant time algorithm for the problem on an N-N RMESH, where N is the number of vertices of P. Applying the algorithm, we can solve the above three problems in a constant time on a reconfigurable mesh. Specially, we can solve the third problem in a constant time on an N-$N_2$ RMESH.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.288-294
• /
• 2008

In this paper, we proposed an algorithm of edge enhancement to improve image visibility of mobile phone camera. For naturally edge enhancement, we grasps edge characteristic in image and applied to the most appropriate enhancement value adaptively about each characteristics. Namely, It applies 2D high pass filter where in the edge characteristics which judge in the first In compliance with the edge condition which is subdivided more with secondary it will be able to apply the process which able to adaptive edge enhancement to improve image visibility. It joins in and it is an existing algorithm that simply a lies 2D high pass filter where and it is identical in the image whole it will be able to improve the side effects of ringing actual condition etc. It considers the effectiveness of the hardware resource with the hardware of the algorithm which is developed and algorithm the maximum simply, it developed and simulation of the algorithm which is proposed it led and algorithm of existing and it compared and is improved the result which it confirmed.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1807-1810
• /
• 2003

Steganography based on Just Noticeable Difference(JND) has been used for natural images. However, it has been recognized to have defects for the non-natural images such as scanned text images, cartoons, etc. In this paper, an alternative method is proposed to improve this problem. A new scheme is designed specially for the non-natural images. Instead of JND, Noise Visibility Function(NVF) is used. NVF value and edge strength value of each pixel ate combined to decide the embedding data capacity and the visibility of data embedded images have been improved specially for the non-natural images.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.5
• /
• pp.147-159
• /
• 2002

This paper proposes a method to recognize the noisiness of road images connected with the extraction of lane-related information in order to prevent the usage of erroneous information. The proposed method uses a fuzzy neural network(FNN) with the back-Propagation loaming algorithm. The U decides road images good or bad with respect to visibility of lane marks on road images. Most input parameters to the FNN are extracted from an edge distribution function(EDF), a function of edge histogram constructed by edge phase and norm. The shape of the EDF is deeply correlated to the visibility of lane marks of road image. Experimental results obtained by simulations with real images taken by various lighting and weather conditions show that the proposed method was quite successful, providing decision-making of noisiness with about 99%.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.21-29
• /
• 2020

This paper presents an effective single image haze removal using edge-preserving and adaptive transmission estimation to enhance the visibility of outdoor images vulnerable to weather and environmental conditions with computational complexity reduction. The conventional methods involve the time-consuming refinement process. The proposed transmission estimation however does not require the refinement, since it preserves the edges effectively, which selects one between the pixel-based dark channel and the patch-based dark channel in the vicinity of edges. Moreover, we propose an adaptive transmission estimation to improve the visual quality particularly in bright areas like sky. Experimental results with various hazy images represent that the proposed method is superior to the conventional methods in both subjective visual quality and computational complexity. The proposed method can be adopted to compose a haze removal module for realtime devices such as mobile devices, digital cameras, autonomous vehicles, and so on as well as PCs that have enough processing resources.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.8-12
• /
• 2016

In this paper, we theoretically and experimentally analyze the impact of speckle size of pseudo-thermal light source on ghost imaging. A larger size of speckle can bring improvements in SNR and visibility. At the same time, the edge blur of the retrieved image will become more serious. We also present a setup which can mitigate the edge blur of larger speckle while maintaining the advantages of higher SNR and visibility by changing the speckle size of the object beam with a concave lens.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2541-2551
• /
• 1996

Human visual systems are sensitive to noise on the flat intensity area. But it becomes less sensitive on the edge area. Recently, many types of spatially adaptive image restoration methods have been proposed, which employ the above mentioned huan visual characteristics. The present paper presents an adaptive image restoration method, which increases sharpness of the edge region, and smooths noise on the flat intensity area. For edge detection, the proposed method uses the visibility function based on the local variance on each pixel. And it adaptively changes the regularization parameter. More specifically, the image to be restored is divided into a number of steps from the flat area to the edge regio, and then restored by using the finite impulse response constrained least squares filter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.12
• /
• pp.947-954
• /
• 2017

In case of a fire in urban large structures such as super high-rise buildings, evacuation guidance must be provided to the occupants in order to minimize human deaths and injuries. Therefore, it is essential to provide emergency evacuation guidance when a major fire occurs. In order to effectively support evacuation guidance, it is important to identify major items such as fire location, occupant position, escape route, etc. Also, it is important to quickly identify evacuation areas where residents can safely evacuate from a fire. In this paper, we analyze the CCTV video and propose a method of measuring visibility of the evacuation zone from the smoke caused by the fire in order to determine the safety of evacuation area. To do this, we first extract the background video from the smoke video to measure the visibility of the specific area due to smoke. After generating an edge-extracted image for the extracted background video, the degree of visibility is measured by calculating the change in the edge strength due to smoke.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.102-111
• /
• 2004

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection, union, or difference can be executed on them. The intersection (resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. The difference of two visibility polygons is the set of points which are visible from only a visibility source. Previously, the best known algorithm for the set operations of two polygons with total n vertices takes O(nlogn ＋ k) time, where k is the output size. In this paper, we present O(n) time algorithms for computing the intersection, the union, and the difference of given two visibility polygons, which are optimal.