• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.453-458
• /
• 2009

This paper presents two methods of designing a Broadband Impedance Matching (BIM) circuit for maximizing a power line communication (PLC) equipment (or Modem) signal injection into its load at any power line connection port. This optimal (BIM) circuit design is achieved in two phases: Butterworth gain function and Tchebycheff gain function. According to the comparison of simulation and practical results, the performances of two gain functions on BIM are discussed.

• Communications for Statistical Applications and Methods
• /
• v.9 no.2
• /
• pp.401-410
• /
• 2002

This paper revisits parallel-line bioassay problem, from a Bayesian point of view using noninformative priors such as Jeffreys' prior, reference priors, and probability matching priors. After finding the orthogonal transformation, the class of first order and second order probability matching priors are derived. Jeffreys' prior and reference priors are derived also. Numerical examples are given to show the effectiveness of noninformative priors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1766-1784
• /
• 2014

Finger vein images contain rich oriented features. Local line binary pattern (LLBP) is a good oriented feature representation method extended from local binary pattern (LBP), but it is limited in that it can only extract horizontal and vertical line patterns, so effective information in an image may not be exploited and fully utilized. In this paper, an orientation-selectable LLBP method, called generalized local line binary pattern (GLLBP), is proposed for finger vein recognition. GLLBP extends LLBP for line pattern extraction into any orientation. To effectually improve the matching accuracy, the soft power metric is employed to calculate the matching score. Furthermore, to fully utilize the oriented features in an image, the matching scores from the line patterns with the best discriminative ability are fused using the Hamacher rule to achieve the final matching score for the last recognition. Experimental results on our database, MMCBNU_6000, show that the proposed method performs much better than state-of-the-art algorithms that use the oriented features and local features, such as LBP, LLBP, Gabor filter, steerable filter and local direction code (LDC).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1102-1107
• /
• 2004

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.209-214
• /
• 2004

This paper presents a RFM-based image matching algorithm which put constraints on the search space through the object-space approach. Also, the detail procedure of generating 3-D surface models from the RFM is introduced as an end-user point of view. The proposed algorithm provides the PML (Piecewise Matching Line) for image matching and reduces the search space to within the confined line-shape area.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_2
• /
• pp.587-597
• /
• 2007

This study determines matching size for digital elevation model (DEM) production according to land cover property from IKONOS Geo-level stereo image. We applied area based matching method using correlation coefficient of pixel brightness value between the two images. After matching line (where "matching line" implies straight line that is approximated to complex non-linear epipolar geometry) is established by exterior orientation parameters to minimize search area, the matching is carried out based on this line. The experiment is performed according to land cover property, which is divided off into four areas (water, urban land, forest land and agricultural land). In each of the test areas, matching size is selected using a correlation-coefficient image and parallax image. As the results, optimum matching size of the images was selected as $81{\times}81$ pixels window, $21{\times}21$ pixels window, $119{\times}119$ pixels window and $51{\times}51$ pixels window in the water area, urban land, forest land and agricultural land, respectively.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.121-125
• /
• 2000

In this paper, we obtain an algorithm for finding a maximum matching in the line graph L(G) of a graph G. The complexity of our algorithm is O($$\mid$E$\mid$$), where is the edge set of G($$\mid$E$\mid$$ is equal to the number of vertices in L(G)).

• Journal of information and communication convergence engineering
• /
• v.7 no.1
• /
• pp.1-6
• /
• 2009

In order to obtain a 3-D urban model, an abstraction of the surface model is required. This paper describes works on the 3D reconstruction and modeling by the grouping 3D line segments extracted from the stereo matching of edges, which is derived from multiple images. The grouping is achieved by conditions of degrees and distances between lines. Building objects are determined by the junction combinations of the grouped line segments. The proposed algorithm demonstrates effective results of 3D reconstruction of buildings with 2D aerial images.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.7
• /
• pp.1139-1146
• /
• 2001

A tapered impedance-matching line is designed by an inverse scattering method for the one-dimensional medium. The phase compensation factor(PCF) is introduced in order to reduce the error in the inverse scattering process to reconstruct the permittivity profile. By estimating the permittivity profile of the virtual one-dimensional dielectric medium whose reflection characteristic is the same as that of the specified matching line, the matching line is synthesized. The method can be used to design impedance-matching lines with arbitrary passband characteristics without any equivalent circuit analysis. The inevitable errors in the method using the time-domain reflection coefficient can be avoided by using the frequency-domain reflection coefficient.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.87-97
• /
• 2012

This study presents an automatic matching method for generating a dense, accurate, and discontinuity-preserved digital surface model (DSM) using multiple images acquired by an aerial digital frame camera. The proposed method consists of two main procedures: area-based multi-image matching (AMIM) and stereo-pair epipolar line matching (SELM). AMIM evaluates the sum of the normalized cross correlation of corresponding image points from multiple images to determine the optimal height of an object point. A novel method is introduced for determining the search height range and incremental height, which are necessary for the vertical line locus used in the AMIM. This procedure also includes the means to select the best reference and target images for each strip so that multi-image matching can resolve the common problem over occlusion areas. The SELM extracts densely positioned distinct points along epipolar lines from the multiple images and generates a discontinuity-preserved DSM using geometric and radiometric constraints. The matched points derived by the AMIM are used as anchor points between overlapped images to find conjugate distinct points using epipolar geometry. The performance of the proposed method was evaluated for several different test areas, including urban areas.