• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.21-29
• /
• 2007

In this paper, we present a method of detecting the boundary of the intima-media complex for automated measurement based on dynamic programming from carotid artery B-mode ultrasound images and then show the experimental results. We apply the dynamic programming for determining the optimal locations that a cost function is minimized. The cost function includes cost terms which are representing image features such as intensity, intensity gradient and geometrical continuity of the vessel interfaces. Moreover, we improve the boundary continuity by applying the B-spline to smooth the rough boundary due to noise such as speckle, dropout and weak edges. The proposed method has obtained more accurate reproducible results than conventional edge-detection by considering multiple image features and ensures efficient automated measurement by solving the problems of the inter- and intra-observer variability and its inefficiency due to manual measurement.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.37-45
• /
• 2010

This paper proposes a novel contrast enhancement method which determines the stretching ranges based on the distribution densities of segmented sub-histogram. In order to enhance the quality of image effectively, the contrast histogram is segmented into sub-histograms based on the density in each brightness region. Then the stretching range of each sub-histogram is determined by analysing its distribution density. The higher density region is extended wider than lower density region in the histogram. This method solves the over stretching problem, because it stretches using density rate of each area on the histogram. To evaluate the performance of the proposed algorithm, the experiments have been carried out on complex contrast images, and its superiority has been confirmed by comparing with the conventional methods.

• Korean Journal of Remote Sensing
• /
• v.31 no.1
• /
• pp.29-38
• /
• 2015

The coastline influenced naturally and artificially changes dynamically. While the long-term change is influenced by the rise in the surface of the sea and the changes in water level of the rivers, the short-term change is influenced by the tide, earthquake and storm. Also, man-made thoughtless development such as construction of embankment and reclaimed land not considering erosion and deformation of coast has been causes for breaking functions of coast and damages on natural environment. In order to manage coastal environment and resources effectively, In this study is intended to analyze and predict erosion in coastal environment and changes in sedimentation quantitatively by detecting changes in coastal line from data collection for satellite images and aerial LiDAR data. The coastal line in 2007 and 2012 was extracted by manufacturing Digital Surface Model (DSM) with Aviation LiDAR materials. For the coastal line in 2009 and 2010, Normalized Difference Vegetation Index (NDVI) method was used to extract the KOMPSAT-2 image selected after considering tide level and wave height. The change rate of the coastal line is varied in line with the forms of the observation target but most of topography shows a tendency of being eroded as time goes by. Compared to the relatively monotonous beach of Taean, the gravel and rock has very complex form. Therefore, there are more errors in extraction of coastlines and the combination of transect and shoreline, which affect overall changes. Thus, we think the correction of the anomalies caused by these properties is required in the future research.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.1
• /
• pp.92-98
• /
• 2001

When analyzing the scatting problem of multi-layered planar structures using closed-form Green's function, one of the main difficulties is that the numerical integrations for the evaluation of diagonal matrix elements converge slowly and are not so stable. Accordingly, even when the integration fur the singularity of type $e^{-jkr}/{\gamma}$, corresponding to the source dipole itself, is performed using such a method, this difficulty persists in the integration corresponding to the finite number of complex images. In order to resolve this difficulty, a new technique based upon the Gaussian quadrature in polar coordinates for the evaluation of the two-dimensional generalized exponential integral is presented. Stability of the algorithm and convergence is discussed. Performance is demonstrated for the example of a microstrip patch antenna.

• Journal of Korea Game Society
• /
• v.7 no.2
• /
• pp.21-32
• /
• 2007

It is significant to simulate scattering of light within media for realistic image synthesis; however, this requires costly computation. This paper introduces a practical image-space approximation technique for interactive subsurface scattering. We use a general two-pass approach, which creates transmitted irradiance samples onto shadow maps and computes illumination using the shadow maps. We estimate single scattering efficiently using a method similar to common shadow mapping with adaptive deterministic sampling. A hierarchical technique is applied to evaluate multiple scattering, based on a diffusion theory. We further accelerate rendering speed by tabulating complex functions and utilizing level of detail. We demonstrate that our technique produces high-quality images of animated scenes with blurred shadow at hundreds frames per second on graphics hardware. It can be integrated into existing interactive systems easily.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1073-1080
• /
• 2011

In this paper, we propose a novel digital watermarking method by virtual optics which secures multimedia information such as images, videos and sounds. To secure the multimedia data, we use Fresnel transform which describes the diffraction phenomena of the waves. Also, this method attaches the random phase function to Fresnel transform so that original image and watermark image would be gaussian random vectors. The complex numbers of watermark by Fresnel transform are separated the real part and the imaginary part. The former is embedded in original image as a encoding key imperceptibly and the latter is used for detecting the watermark as a decoding key. This method for digital watermarking ensures that watermark can be successfully registered and extracted from the watermarked image. Further, it provides the robustness to signal processing operation and geometric distortion and proves the strong resilience against cropping attack. The performance evaluation of the experiment is carried out with PSNR, and the numerical simulation results show the efficiency of the proposed method.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.23-28
• /
• 2017

Shape from focus (SFF) is a technique used to reconstruct 3D shape of objects from a sequence of images obtained at different focus settings of the lens. In this paper, a new shape from focus method for 3D reconstruction of microscopic objects is described, which is based on gradient operator in Mathematical Morphology. Conventionally, in SFF methods, a single focus measure is used for measuring the focus quality. Due to the complex shape and texture of microscopic objects, single measure based operators are not sufficient, so we propose morphological operators with multi-structuring elements for computing the focus values. Finally, an optimal focus measure is obtained by combining the response of all focus measures. The experimental results showed that the proposed algorithm has provided more accurate depth maps than the existing methods in terms of three-dimensional shape recovery.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.458-470
• /
• 2018

As the requirements of web apps become complex and rapidly changing, the maintenance of web apps becomes more important. However, web apps have a problem that more often than not there is not enough documentation to understand and maintain them. Thus, their effective maintenance requires models that represent their internal behavior occurring when they dynamically generate web pages. Previous works identify web components (such as JSPs and Servlets) as participants in the behavior but not web resources (such as images, CSS files, and JavaScript files). Moreover, they do not identify dependency relations between web components and web resources. This paper dynamically analyzes Java web apps to extract such dependency relations, which are included in our graph model for page generation. Case studies using open-source web apps show the applicability of the proposed approach.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.549-554
• /
• 2015

As intuitive hardware interfaces continue to be developed, it has become more important to recognize the posture of the user. An efficient alternative to adding expensive sensors is to implement computer vision systems. This paper proposes a method to recognize a user's postured in a live broadcast bi-directional participatory TV program. The proposed method first estimates the position of the user's hands by generation a facial color map for the user and a motion map. The posture is then recognized by computing the relative position of the face and the hands. This method exhibited 90% accuracy in an experiment to recognize three defined postures during the live broadcast bi-directional participatory TV program, even when the input images contained a complex background.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.