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

The effect of inter-channel coupling in multi-channel monopulse receiver is expected to increase by miniaturization trend of receiver. Therefore, in this paper, calibration method is proposed to compensation for inter-channel coupling in receiver of monopulse radar. And it can prevent distortion of angle information of target. Hardware configuration that consists of switch, directional coupler, matched load, ADC(Analog to Digital Converter), signal source of calibration is proposed to calibration. Total nine scattering parameters are obtained by controlling the switch and signal source of calibration. After that, method for restoring the undistorted signal is proposed using the mathematical relationship between the monopulse signal output from the antenna and the monopulse signal passing through the multi-channel receiver in the presence of inter-channel coupling.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.25-33
• /
• 2009

In the paper, we proposed a new system to retrieve 3D wrinkle data based on stereo images. Usually, 3D reconstruction based on stereo images or video is very popular and it is the research focus, which has been applied for culture heritage, building and other scene. The target is object measurement, the scene depth calculation and 3D data obtained. There are several challenges in our research. First, it is hard to take the full information wrinkle images by cameras because of light influence, skin with non-rigid object and camera performance. We design a particular computer vision system to take winkle images with a long length camera lens. Second, it is difficult to get the dense stereo data because of the hard skin texture image segmentation and corner detection. We focus on semi-dense stereo matching algorithm for the wrinkle depth. Compared with the 3D scanner, our system is much cheaper and compared with the physical modeling based method, our system is more flexible with high performance.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.4
• /
• pp.367-376
• /
• 2006

This study determines the optimum polynomial of exterior orientation parameters(EOPs) as a function of line number of linear array scanner. To estimate priori EOPs, meta data of IKONOS scene and ground control points are used. We select a first order polynomial and a constant for position elements modeling and rotation elements modeling. Positioning accuracy of the determined EOPs is compared with that of RPCs bias-corrected by the least squares adjustment. There is almost no difference between accuracies of the two methods. To obtain digital elevation model(DEM), matching line is established by the EOPs. The DEM is compared with DEM generated by ERDAS IMAGINE software, which utilizes the bias-corrected RPCs. Height differences of DEMs by the two methods are ranged within a allowable standard deviation. The produced DEM, therefore, shows accuracy similar to the verified method.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.6
• /
• pp.483-497
• /
• 2018

Image mosaicking, which combines several images into one image, is effective for analyzing images and important in various fields of spatial information such as a continuous image map. The crucial processes of the image mosaicking are optimal seamline determination and color correction of mosaicked images. In this study, the overlap regions were determined by SURF (Speeded Up Robust Features) for image matching. Based on the characteristics of the edges extracted by Canny filter, seamline candidates were selected from classified edges with their characteristics, and the edges were connected by using Dijkstra algorithm. In particular, anisotropic filter and image pyramid were applied to extract reliable seamlines. In addition, it was possible to determine seamlines effectively and efficiently by utilizing building and road layers from digital maps. Finally, histogram matching and seamline feathering were performed to improve visual quality of the mosaicked images.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.623-632
• /
• 2009

In this paper, we propose a pulmonary nodule registration for the tracking of lung nodules in sequential CT scans. Our method consists of following five steps. First, a translational mismatch is corrected by aligning the center of optimal bounding volumes including each segmented lung. Second, coronal maximum intensity projection(MIP) images including a rib structure which has the highest intensity region in baseline and follow-up CT series are generated. Third, rigid transformations are optimized by normalized average density differences between coronal MIP images. Forth, corresponding nodule candidates are defined by Euclidean distance measure after rigid registration. Finally, template matching is performed between the nodule template in baseline CT image and the search volume in follow-up CT image for the nodule matching. To evaluate the result of our method, we performed the visual inspection, accuracy and processing time. The experimental results show that nodules in serial CT scans can be rapidly and correctly registered by coronal MIP-based rigid registration and local template matching.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.653-663
• /
• 2009

In this paper, we propose a blind spots elimination system using three cameras. A wide-angle camera is attached on trunk for eliminating blind spots of a rear-view mirror and two cameras are attached on each side-view mirror for eliminating blind spots of vehicle's sides. In order to eliminate blind spots efficiently, we suggest a method to build a panoramic mosaic view with two side images and one wide-angle rear image. First, we obtain an undistorted image from a wide-angle camera of rear-view and calculate the focus-of-contraction (FOC) in undistorted images of rear-view while the car is moving straight forward. Second, we compute a homography among side-view images and an undistorted image of rear-view in flat road scenes. Next, we perform an image registration process after road and background region segmentation. Finally, we generate various views such as a cylinder panorama view, a top view and an information panoramic mosaic view.

• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.816-824
• /
• 2009

In the face space, face images due to illumination and pose variations have a nonlinear distribution. Active Appearance Models (AAM) based on the linear model have limits to the nonlinear distribution of face images. In this paper, we assume that a few clusters of face images are given; we build local AAMs according to the clusters of face images, and then select a proper AAM model during the fitting phase. To solve the problem of updating fitting parameters among the models due to the model changing, we propose to build in advance relationships among the clusters in the parameter space from the training images. In addition, we suggest a gradual model changing to reduce improper model selections due to serious fitting failures. In our experiment, we apply the proposed model to Yale Face Database B and compare it with the previous method. The proposed method demonstrated successful fitting results with strongly illuminated face images of deep shadows.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.53-60
• /
• 2008

Fingerprint verification method based on minutiae has been widely used for its speed and size stemming from utilizing only a few data, but it is vulnerable to some errors caused by the false minutiae extractions. A number of suggestions have been made to correct these problems. However, because it is very difficult to avoid all the external factors, such as noises that occur when fingerprints are collected, and all the internal factors that occur during the process of them, there is a limit in minimizing errors by improving the whole process. On the other hand, a fingerprint verification method based on images yields fewer errors because it makes direct comparison between images not using minutiae. Image-based fingerprint verification method has its limitations in aligning images with accuracy. Therefore, this paper proposes a new methodology to improve the performance utilizing both image-based and minutiae-based verification methods effectively. As the result of experimenting with both images and minutiae, the false accept rate and the false reject rate have been improved from 2.7% to 0.8% and from 6.5% to 5.5%, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.407-415
• /
• 2012

In this paper, we propose a new stereo matching algorithm by using color information especially for stereo images containing human beings in the applications such as tele-presence system. In the proposed algorithm, we first remove the background regions by using a threshold value for stereo images obtained by stereo camera and then find an initial disparity map and segment a given image into R, G, B and white color components. We also obtain edges in the segmented image and estimate the disparity from the extract boundary regions. Finally, we generate the final disparity map by properly combining the disparity map of each color component. Experiment results show better performance compared with the window based method and the dynamic programing method especially for stereo images with human being.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.