• Tribology and Lubricants
• /
• v.33 no.3
• /
• pp.119-125
• /
• 2017

In this study, we perform a numerical analysis to predict the film thickness and lubrication regions for a thrust ball bearing under different operating conditions. Film thinning and replenishment affect the film thickness in starved lubrication. As the inlet meniscus position is brought to the edge of the Hertz contact, the thin film thickness is calculated as starved equation. We use a film replenishment model to determine the recovery film thickness between rolling elements. We use a hydrodynamic model to describe film recovery, that results from the effects of surface tension. In this model, we consider the surface tension gradient in fluid depression as the driving force for fluid recovery. We use Fourier transform method to determine the time-dependent depth of depressed oil. We calculate the change in the central film thickness graphically by using the recovery equation in starved elastohydrodynamic lubrication(EHL) under operating conditions that include numbers of balls, sliding velocity, applied force, and ambient film thickness. We evaluate the degree of starvation by using the distance from the center of the contact area to the meniscus position. Parched lubrication, a phenomenon where the film thickness decreases consistently, occurs at the severe condition. We determine optimal values with respect to the numbers of balls, and sliding velocity. The investigation can contribute to the design operating conditions for proper lubrication.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1088-1095
• /
• 2009

In this paper, we describe the reorientation method of distorted road sign by using projection transformation for improving recognition rate of road sign. RSR (Road Sign Recognition) is one of the most important topics for implementing driver assistance in intelligent transportation systems using pattern recognition and vision technology. The RS (Road Sign) includes direction of road or place name, and intersection for obtaining the road information. We acquire input images from mounted camera on vehicle. However, the road signs are often appeared with rotation, skew, and distortion by perspective camera. In order to obtain the correct road sign overcoming these problems, projection transformation is used to transform from 4 points of image coordinate to 4 points of world coordinate. The 4 vertices points are obtained using the trajectory as the distance from the mass center to the boundary of the object. Then, the candidate areas of road sign are transformed from distorted image by using homography transformation matrix. Internal information of reoriented road signs is segmented with arrow and the corresponding indicated place name. Arrow area is the largest labeled one. Also, the number of group of place names equals to that of arrow heads. Characters of the road sign are segmented by using vertical and horizontal histograms, and each character is recognized by using SAD (Sum of Absolute Difference). From the experiments, the proposed method has shown the higher recognition results than the image without reorientation.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.292-300
• /
• 2008

An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.248-261
• /
• 2002

In this paper, we proposed a new 3-dimensional(3-D) object-tracking algorithm that can control a stereo camera using a variable window mask supported by which uses ,B-D information and an optical BPEJTC. Hence, three-dimensional information characteristics of a stereo vision system, distance information from the stereo camera to the tracking object. can be easily acquired through the elements of a stereo vision system. and with this information, we can extract an area of the tracking object by varying window masks. This extractive area of the tracking object is used as the next updated reference image. furthermore, by carrying out an optical BPEJTC between a reference image and a stereo input image the coordinates of the tracking objects location can be acquired, and with this value a 3-D object tracking can be accomplished through manipulation of the convergence angie and a pan/tilt of a stereo camera. From the experimental results, the proposed algorithm was found to be able to the execute 3-D object tracking by extracting the area of the target object from an input image that is independent of the background noise in the stereo input image. Moreover a possible implementation of a 3-D tele-working or an adaptive 3-D object tracker, using the proposed algorithm is suggested.

• The Journal of Engineering Geology
• /
• v.7 no.1
• /
• pp.63-79
• /
• 1997

In this study, our purpose is to develop a technique to discriminate artificial explosions from local microearthquakes on the basis of time-frequency domain. To obtain spectral features of artificial explosions and microearthquakes, we used 3-d spectrograms(frequency, time and amplitude) because this is a useful tool to study the frequency content of entire seismic waveforms observed at local and regional distances (e. g., Kim et al., 1994). P and S waves from quarry blasts show that frequency content of dominant amplitude appeared above 10 Hz and Rg phases that are observed at near distance ranges. But P and S waves from microearthquakes have more broad frequency content as well as below 10 Hz. And for discrimination, Pg/Lg spectral ratio is performed below 10 Hz. In order to select time windows we computed group velocity using multiple filter method(MFM) and removed free surface effects from all 3-components data for improving on data quality. Next step, we computed Fast-Fourier transform, and a log average spectral amplitude over seven frequency bands : 0.5 to 3, 2 to 4, 3 to 5, 4 to 6, 5 to 7, 6 to 8 and 8 to 10 Hz. The best separation is observed from 6 to 8 Hz.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.705-708
• /
• 2018

Among biometrics commercialized for security, iris recognition technology has the most excellent security for the probability of the match between individuals is the lowest. Current commercialized iris recognition technology has excellent recognition ability, but this technology has a fatal drawback. Without the user's active cooperation, it cannot recognize the iris correctly. To make up for this weakness, recent trend of iris recognition development mounts a non-volunteering, unconstrained method. According to this information, the objective of this research is developing a module that can identify people iris from a video acquired by high performance infrared camera in a range of 3m and in a involuntary way. For this, we import images from the video and find people's face and eye positions from the images using Haar classifier trained through Cascade training method. finally, we crop the iris by Hough circle transform and compare it with data from the database to identify people.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.553-559
• /
• 2004

In todays security industry, personal identification is also based on biometric. Biometric identification is performed basing on the measurement and comparison of physiological and behavioral characteristics, Biometric for recognition includes voice dynamics, signature dynamics, hand geometry, fingerprint, iris, etc. Iris can serve as a kind of living passport or living password. Iris recognition system is the one of the most reliable biometrics recognition system. This is applied to client/server system such as the electronic commerce and electronic banking from stand-alone system or networks, ATMs, etc. A new algorithm using nonlinear function in recognition process is proposed in this paper. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transform into polar coordinates. After performing three times Wavelet transformation, normalization was done using sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compare pairs of two adjacent pixels. The binary code of the iris is transmitted to the by server. the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the University database. Process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.84-97
• /
• 2012

In wireless sensor networks, cluster structure brings on many advantages such as load balancing, energy saving, and distributed key management, and so on. To transform a physical network into the cluster structure, sensor nodes should invoke a cluster formation protocol. During the protocol operation, if some nodes are compromised and they do not conform to the protocol, an inconsistency of membership in a cluster happen. This splits the cluster and consequently increases the number of clusters and decreases the number of members in the cluster. In this paper, we propose a scheme which well copes with such a problem. First, our scheme generates two hop clusters where hop distance between any two nodes is at most two. Besides, our scheme employs verification of two hop distant nodes to prevent the cluster split induced by compromised nodes. Last, our scheme mainly employs broadcast transmissions to reduce energy consumption of nodes. Simulation results have proven that our scheme reduces the number of clusters and more secure and energy-efficient than other scheme.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.11
• /
• pp.1429-1436
• /
• 2011

In this paper, a new tube-radius-measuring algorithm has been proposed for effectively measuring the radii of small tubes under severe noise conditions that can also perform well when metal scraps that make it difficult to measure the radius correctly are inside the tube hole. In the algorithm, we adopt a fuzzy searching method that searches for the center of the inner circle by using fuzzy parameters for distance and orientation from the initial search point. The proposed algorithm has been implemented and tested on both synthetic and real-world tube images, and the performance is compared to existing circle-detection algorithms, such as the Hough transform and RANSAC methods, to prove the accuracy and effectiveness of the algorithm. From this comparison, it is concluded that the proposed algorithm has excellent performance in terms of measurement accuracy and computation time.

• The Journal of the Korea Contents Association
• /
• v.10 no.11
• /
• pp.48-57
• /
• 2010

Previous post sender recognition study was focused on recognizing the address of receiver. Relatively, there was lack of study to recognize the information of sender's address. Post sender recognition study is necessary for the service and application using sender information such as returning. This paper did the experiment and suggested how to recognize post sender using SIFT. Although SIFT shows great recognition rate, SIFT had problems with time and mis-recognition. One is increased time to match keypoints in proportion as the number of registered model. The other is mis-recognition of many similar keypoints even though they are all different models due to the nature of post sender. To solve the problem, this paper suggested SIFT adding distance function and did the experiment to compare time and function. In addition, it is suggested how to register and classify models automatically without the manual process of registering models.