• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1005-1008
• /
• 1999

This paper presents a method for procedure-based on-line program replacement for user applications. To deal with the size change in the procedure to replace, the method uses the unmapped area of process address space for mapping a new version of procedure. The method is effective in that and it does not cause large performance loss during the replacement or require any additional software layer for the replacement. The method is illustrated in the SUN Solaris environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.792-795
• /
• 1996

In TIG welding of pipe, back bead size monitoring is important for weld quality assurance. Many researches have been performed on estimation of the back bead size by heat conduction analysis. However numerical conduction model based on many uncertain thermal parameters causes remarkable errors and thermomechanical phenomena in molten pool can not be considered. In this paper, filler wire feeding force in addition to weld current, wire feedrate, torch travel speed and orbital position angle is monitored to estimate back bead size in orbital TIG welding. Monitored welding process variables are fed into an artificial neural network estimator which has been trained with the monitored process variables (input patterns) and actual back bead size (output patterns). Experimental verification of the proposed estimation method was performed. The predicted results are in a good agreement with the actual back bead shape. The results are quite promising in that estimation of invisible back bead shape can be achieved by analyzing the welding parameters without any conventional NDT of welds.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.775-783
• /
• 1990

In this paper we implemented the fast thinning unit by modifying the pipeline architecture which was proposed by Stanley R. Sternberg. The unit is useful in preprocessing such as image representation and pattern recognition etc. This unit is composed of interface part, local memory part, address generation part, thinning processing part and control part. In thinning processing part, we shortened the thinning part which performed by means of look up table using window mapping table. Thus we improved the weakness of SAP, in which the number of delay pipeline and window pipeline are equal to image column size. Two independent memorys using tri-state buffer enable the two direction flow of address generated by address generation part. This unit avoids the complexity of architecture and has flexibility of image size by means of simple modification of logic bits.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.1-7
• /
• 2016

In this paper, we propose in this paper present a novel locality data allocation policy as COLD(Correlated Locality Data) allocation policy. COLD is defined as a set of data that will be updated together later. By distributing a COLD into a NAND block separately, it can preserve th locality. In addition, by handling multiple COLD simultaneously, it can obtain the parallelism among NAND chips. We perform two experiment to demonstrate the effectiveness of the COLD data allocation policy. First, we implement COLD detector, and then, analyze a well-known workload. And we confirm the amount of COLD found depending on the size of data constituting the COLD. Secondly, we compared the traditional page-level mapping policy and COLD for garbage collection overhead in actual development board Cosmos OpenSSD. Experimental results have shown that COLD data allocation policy is significantly reduces the garbage collection overhead. Also, we confirmed that garbage collection overhead vary depending on the COLD size.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.2
• /
• pp.381-403
• /
• 2022

The main goal of this research is to solve variational inequalities involving quasimonotone operators in infinite-dimensional real Hilbert spaces numerically. The main advantage of these iterative schemes is the ease with which step size rules can be designed based on an operator explanation rather than the Lipschitz constant or another line search method. The proposed iterative schemes use a monotone and non-monotone step size strategy based on mapping (operator) knowledge as a replacement for the Lipschitz constant or another line search method. The strong convergences have been demonstrated to correspond well to the proposed methods and to settle certain control specification conditions. Finally, we propose some numerical experiments to assess the effectiveness and influence of iterative methods.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.201-205
• /
• 2007

In the post-Cold War era, acquisition technique of high-resolution satellite imagery (HRSI) has begun to commercialize. IKONOS-2 satellite imaging data is supplied for the first time in the 21st century. Many researchers testified mapping possibility of the HRSI data instead of aerial photography. It is easy to renew and automate a topographical map because HRSI not only can be more taken widely and periodically than aerial photography, but also can be directly supplied as digital image. In this study matching size of IKONOS Geo-level stereo image is presented lot production of digital elevation model (DEM). 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 (EOPs) to minimize search area, the matching is tarried out based on this line. The experiment on matching size 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, window size for the highest correlation coefficient is selected as propel size for matching. As the results of experiment, the proper size was selected as $123{\times}123$ pixels window, $13{\times}13$ pixels window, $129{\times}129$ pixels window and $81{\times}81$ pixels window in the water area, urban land, forest land and agricultural land, respectively. Of course, determination of the matching size by the correlation coefficient may be not absolute appraisal method. Optimum matching size using the geometric accuracy therefore, will be presented by the further work.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.165-170
• /
• 2003

This paper presents an integrated approach to unconstrained face recognition in arbitrary scenes. The front end of the system comprises of a scale and pose tolerant face detector. Scale normalization is achieved through novel combination of a skin color segmentation and log-polar mapping procedure. Principal component analysis is used with the multi-view approach proposed in[10] to handle the pose variations. For a given color input image, the detector encloses a face in a complex scene within a circular boundary and indicates the position of the nose. Next, for recognition, a radial grid mapping centered on the nose yields a feature vector within the circular boundary. As the width of the color segmented region provides an estimated size for the face, the extracted feature vector is scale normalized by the estimated size. The feature vector is input to a trained neural network classifier for face identification. The system was evaluated using a database of 20 person's faces with varying scale and pose obtained on different complex backgrounds. The performance of the face recognizer was also quite good except for sensitivity to small scale face images. The integrated system achieved average recognition rates of 87% to 92%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1312-1317
• /
• 2003

This paper presents an integrated approach to unconstrained face recognition in arbitrary scenes. The front end of the system comprises of a scale and pose tolerant face detector. Scale normalization is achieved through novel combination of a skin color segmentation and log-polar mapping procedure. Principal component analysis is used with the multi-view approach proposed in[10] to handle the pose variations. For a given color input image, the detector encloses a face in a complex scene within a circular boundary and indicates the position of the nose. Next, for recognition, a radial grid mapping centered on the nose yields a feature vector within the circular boundary. As the width of the color segmented region provides an estimated size for the face, the extracted feature vector is scale normalized by the estimated size. The feature vector is input to a trained neural network classifier for face identification. The system was evaluated using a database of 20 person's faces with varying scale and pose obtained on different complex backgrounds. The performance of the face recognizer was also quite good except for sensitivity to small scale face images. The integrated system achieved average recognition rates of 87% to 92%.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.18-26
• /
• 2010

In this paper, we propose a method for generating a realistic object panorama by considering geometric transformations of camera views in a general photographing environment. In the proposed method, we first model a trumpet-shape panorama space based on geometric transformations of camera, such as vertical rotation and horizontal rotation movement around a target model. We then generate an object panorama by mapping model images to the trumpet-shape panorama space. To evaluate the performance of the proposed method, experiments were conducted on a large size model, which is quite difficult for us to generate the object panorama without special equipments in general. The experimental results show that the proposed method can effectively generate an object panorama, which is usually generated in a special photographing environment, regardless of the size of target model.

• Plant Resources
• /
• v.3 no.3
• /
• pp.184-193
• /
• 2000

Soybean [Glycine max (L.) Merr.] seed weight is a important trait in cultivar development. Objective of this study was to identify and confirm quantitative trait loci (QTLs) for seed weight variation in the F2 and F2:3 generations. QTLs for seed weight were identified in F2 and F2:3 generations using interval mapping (MapMaker/QTL) and single-factor analysis of variance (ANOVA). In the F2 plant generation (i.e., F3 seed), three markers, OPL9a, OPM7a, and OPAC12 were significantly (P<0.01) associated with seed weight QTLs. In the F2:3 plant row generation (i.e., F4 seed), five markers, OPA9a, OPG19, OPL9b, OPP11, and Sat_085 were significantly (P<0.01) associated with seed weight QTLs. Two markers, OPL9a and OPL9b were significantly (P<0.05) associated with seed weight QTLs in both generations. Two QTLs on USDA soybean linkage group C1 and R were identified in both F2 and F2:3 generations using interval mapping. The linkage group C1 QTL explained 16% of the variation in seed weight in both generations, and the linkage group R QTL explained 39% and 41% of the variation for F2 and F2:3 generation, respectively. The linkage group C2 QTL identified in F2:3 generation explained 14.9% of variation. Linkage groups C1, C2 and R had previously been identified as harbouring seed size QTLs. The consistency of QTLs across generations and populations indicates that marker-assisted selection is possible in a soybean breeding program.