• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.3
• /
• pp.95-101
• /
• 2024

The numberlink puzzle(NLP), which non-crossings with other numbers of connection in connecting lines through empty cells between a given pair of numbers, is an NP-complete problem with no known way to solve the puzzle in polynomial time. Until now, arbitrary numbers have been selected and puzzles have been solved using trial-and-error methods. This paper converts empty cells into vertices in lattice graphs connected by edge between adjacent cells for a given problem. Next, a straight line was drawn between the pairs of numbers and divided into groups of numbers where crossing occurred. A bypass route was established to avoid intersection in the cross-number group. Applying the proposed algorithm to 18 benchmarking data showed that the puzzle could be solved with a linear time complexity of O(n) for all data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1908-1924
• /
• 2001

Interoperability and inter-working in the various network and media environment with different technology background is very important to enlarge the opportunity of service access and to increase the competitive power of service. The ITU-T and advanced counties are planning ahead for provision of GII enabling user to access advanced global communication services supporting multimedia communication applications, embracing all modes of information. In this paper, we especially forced the heterogeneity of end user applications for multimedia networking. The heterogeneity has several technical aspects, like different medium access methods, heterogeneous coding algorithms for audio-visual data and so on. Among these elements, we have been itemized bit rate shaping algorithm on the compressed moving video. Previous manipulations of video has been done on the uncompressed signal domain. That is, compressed video should be converted to linear PCM signal. To do such a procedures, we should decode, manipulate and then encode the video to compressed signal once again. The traditional approach for processing the video signa1 has several critical weak points, requiring complexity to implement, degradation of image quality and large processing delay. The bit rate shaping algorithm proposed in this paper process the manipulation of moving video on the completely compressed domain to cope with above deficit. With this algorithms. we could realized efficient video bit rate shaping and the result of software simulation shows that this method has significant advantage than that of pixel oriented algorithms.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.7
• /
• pp.769-777
• /
• 2010

In this paper, a switchable circularly polarized microstrip patch antenna using PIN diodes and corner slots on ground plane is proposed at 2.4 GHz. The proposed antenna has a square microstrip patch and ground plane that consists of two pair of slots and PIN diodes. The electrical lengths of the slots are adjusted by using the switching characteristic of the PIN diode, so the polarization of the proposed antenna can be switchable between linear, left-handed(LH) and right-handed(RH). By separating the ground plane for the DC bias, the size reduction effect is also obtained. When the proposed antenna is operated as linear polarization, the return loss and impedance bandwidth are 15 dB, 59 MHz, and when operated as LH and RH polarization, the minimum axial ratio and 3-dB axial ratio bandwidth are 1.17 dB, 1.67 dB, 28 MHz, and 32 MHz, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.411-421
• /
• 2001

The generalized symmetry transform evaluates symmetry without segmentation and extracts regions of interest in an image by combining locality and reflectional symmetry The demand that the symmetry transform be local is reflected by the distance weight function. When calculating large regions-of-interest, we should select a large standard deviation of distance weight function. But such a large standard deviation makes the execution time increase in the second power of r, which is a radius of search area. In this paper we propose modified scan line based GST with selectively directional attention to improve time complexity The symmetry map of our proposed GST is found to be very similar to that of the existing GST. However the computation time of the proposed GST increases linearly with respect to r because our proposed GST evaluates symmetry between a pair of edge pixels along the scan lines. The GST computation decreases considerably when the proposed GST is peformed with selectively directional attention in case of large r. Several experiments in this paper demonstrate the time efficiency and the usefulness of our proposed GST.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.437-443
• /
• 2015

This paper presents face recognition based on the fusion of visible image and thermal infrared (IR) texture estimated from the face image in the visible spectrum. The proposed face recognition scheme uses a multi- layer neural network to estimate thermal texture from visible imagery. In the training process, a set of visible and thermal IR image pairs are used to determine the parameters of the neural network to learn a complex mapping from a visible image to its thermal texture in the low-dimensional feature space. The trained neural network estimates the principal components of the thermal texture corresponding to the input visible image. Extensive experiments on face recognition were performed using two popular face recognition algorithms, Eigenfaces and Fisherfaces for NIST/Equinox database for benchmarking. The fusion of visible image and thermal IR texture demonstrated improved face recognition accuracies over conventional face recognition in terms of receiver operating characteristics (ROC) as well as first matching performances.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.2
• /
• pp.132-140
• /
• 2001

This paper proposes an efficient walktlu-ough animation from two images of the same scene. To make animation easily and fast, Tour Into the Picture(TIP) enables walkthrough animation from single image but lacks the reality of its foreground object when the viewpoint moves from side to side, and view morphing uses only 2D transition between two images but restricts its camera path on the line between two views. By combining advantages of these two image-based techniques, this paper suggests a new virtual navigation technique which enable natural scene transformation when the viewpoint changes in the side-to-side direction as well as in the depth direction. In our method, view morphing is employed only in foreground objects , and background scene which is perceived carelessly is mapped into cube-like 3D model as in TIP, so as to save laborious 3D reconstruction costs and improve visual realism simultaneously. To do this, we newly define a camera transformation between two images from the relationship of the spidery mesh transformation and its corresponding 3D view change. The result animation shows that our method creates a realistic 3D virtual navigation using a simple interface.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.1
• /
• pp.56-62
• /
• 2011

In the present study, the phase velocities of guided ultrasonic waves such as the first arriving signal (FAS) and the slow guided wave (SGW) propagating along the long axis on the 12 tubular cortical bone samples in vitro were measured and their correlations with the cortical thickness were investigated. The phase velocities of the FAS and the SGW were measured by using the axial transmission method in air with a pair of unfocused ultrasonic transducers with a diameter of 12.7 mm and a center frequency of 200 kHz. The phase velocity of the FAS measured at 200 kHz exhibited a very high negative correlation with the cortical thickness and that of the SGW arriving after the FAS showed a high positive correlation with the cortical thickness. The simple and multiple linear regression models with the phase velocities of the FAS and the SGW as independent variables and the cortical thickness as a dependent variable revealed that the coefficient of determination of the multiple linear regression model was higher than those of the simple linear regression models. The phase velocities of the FAS and the SGW measured at 200 kHz on the 12 tubular cortical bone samples were, respectively, consistent with those of the S0 and the A0 Lamb modes calculated at 200 kHz on the cortical bone plate.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.7
• /
• pp.661-667
• /
• 2009

Trabecular-bone-mimicking phantoms consisting of parallel-nylon-wire arrays were used to investigate correlations of phase velocity and attenuation coefficient with structural properties in trabecular bone. Trabecular separation (Tb.Sp) of the 7 trabecular-bone-mimicking phantoms ranged from 300 to $900\;{\mu}m$ and volume fraction (VF) from 1.6% to 8.7%. Phase velocity and attenuation coefficient of the phantoms were measured by using a through-transmission method in water, with a matched pair of broadband unfocused transducers with a diameter of 12.7 mm and a center frequency of 1 MHz. Phase velocity and attenuation coefficient at 1 MHz decreased almost linearly with increasing Tb. Sp and increased almost linearly with increasing VF. The simple and multiple linear regression models with phase velocity and attenuation coefficient as independent vanables and Tb.Sp and VF as dependent variables demonstrated that the coefficients of determination for the prediction of VF were higher than those for the prediction of Tb.Sp. The results obtained in the trabecular-bone-mimicking phantoms consisting of parallel-nylon-wire arrays were consistent with those in human trabecular bone suggesting that the structural properties can be estimated from the measurements of phase velocity and attenuation coefficient in trabecular bone.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.10-17
• /
• 1989

A new design method of lossy matching network for the microwave broadband ampilfier is presented by using seattering parameters instead od modeling of transistor. A lossy matching network is represented as the combination of 2 lossless networks between which lossy serial or parallel immittance is inserted without using specific topology, and so many useful matching cireuits can be realized. Also it is shown that linear transforming relation exists between gain and reflection coefficient of the amplifier, and the transforming equation is derived using scattering parameters. With this equation some constant gain circles can be drawn on reflection coefficient plane to get adequate reflection coefficient and gain. And since the relations between amplifier gain/reflection coefficient and the immittance of passive element are bilinear transformations. constant gain or reflection coefficients circles. Illustrative examples are presented to show the usefulness of proposed method.