• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.3
• /
• pp.137-154
• /
• 2018

We investigate the condensation transition of a zero range process with jump rate g given by $g(k)=\left\{\frac{M}{k^{\alpha}},\;if\;k{\leq}an\\{\frac{1}{k^{\alpha}}},\;if\;k>an,$ (0.1), where ${\alpha}$ > 0 and a(0 < a < 1/2) is a rational number. We show that for any ${\epsilon}$ > 0, there exists $M^*$ > 0 such that, for any 0<$M{\leq}M^*$, the maximum cluster size is between ($a-{\epsilon}$)n and ($a+{\epsilon}$)n for large n.

• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.298-306
• /
• 2013

The scale invariant feature transform (SIFT) is an effective algorithm used in object recognition, panorama stitching, and image matching. However, due to its complexity, real-time processing is difficult to achieve with current software approaches. The increasing availability of parallel computers makes parallelizing these tasks an attractive approach. This paper proposes a novel parallel approach for SIFT algorithm implementation using a block filtering technique in a Gaussian convolution process on the SIMD Pixel Processor. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and input/output capabilities of the processor, which results in a system that can perform real-time image and video compression. We apply this implementation to images and measure the effectiveness of such an approach. Experimental simulation results indicate that the proposed method is capable of real-time applications, and the result of our parallel approach is outstanding in terms of the processing performance.

• ETRI Journal
• /
• v.21 no.1
• /
• pp.40-54
• /
• 1999

In this paper, we describe a new trademark retrieval system based upon the content or the shape of trademark. The system has an on-line graphical user interface for the World Wide Web (WWW) that allows user to provide a query in forms of a sketch or a visual image to search for similar trademarks from database. User interfaces for the WWW were implemented by utilizing HTML and Java applets. The query can occur in arbitrary size and orientation. A shape representation scheme invariant to scale and rotation was developed to measure the similarity between two trademarks using the magnitude of Zernike moments as a feature set. Performance evaluation has been carried out with a database of 3,000 trademarks. It takes only about 0.6 second for the retrieval on a 200 MHz Pentium PC. The average recall of the original one among top 30 candidates queried by noisy or deformed images was 100%.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.39-52
• /
• 2009

Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.392-395
• /
• 2003

This paper describes a new iris segmentation and recognition method, which is robust to noises. Combining statistical classification and elastic boundary fitting, the iris is first segmented. Then, the localized iris image is smoothed by a convolution with a Gaussian function, down-sampled by a factor of filtered with a Laplacian operator, and quantized using the Lloyd-Max method. Since the quantized output is sensitive to a small shift of the full-resolution iris image, the outputs of the Laplacian operator are computed for all space shifts. The quantized output with maximum entropy is selected as the final feature representation. An appropriate formulation of similarity measure is defined for the classification of the quantized output. Experimentally we showed that the proposed method produces superb performance in iris segmentation and recognition.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.55-62
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching, using linear features, is presented. Scene or model images are described by a set of linear features approximating edge information, which can be obtained by the conventional edge detection, thinning, and piecewise linear approximation. A set of candidate parameters are hypothesized by mapping the angular difference and a new distance measure to the Hough space and by detecting maximally consistent points. These hypotheses are verified by a fast linear feature matching algorithm composed of a single-step relaxation and a Hough technique. The proposed method is shown to be much faster than the conventional one where the relaxation process is repeated until convergence, while providing matching performance robust to the random alteration of the linear features, without a priori information on the geometrical transformation parameters.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1147-1155
• /
• 2005

This paper deals with Iris recognition as one of biometric techniques which is applied to identify a person using his/her behavior or congenital characteristics. The Iris of a human eye has a texture that is unique and time invariant for each individual. First, we obtain the feature vector from the 2D Iris pattern having a property of size invariant and using the fuzzy LDA which is further through four types of 2D Gabor wavelet. At the recognition process, we compute the similarity measure based on the correlation values. Here, since we use four different matching values obtained from four different directional Gabor wavelet and select the maximum value, it is possible to minimize the recognition error rate. To show the usefulness of the proposed algorithm, we applied it to a biometric database consisting of 300 Iris Patterns extracted from 50 subjects and finally got more higher than $90\%$ recognition rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.716-721
• /
• 2003

This paper deals with the iris recognition as one of biometric techniques which are applied to identify a person using his/her behavior or congenital characteristics. The iris of a human eye has a texture that is unique and time invariant for each individual. First, we obtain the feature vector from the 2D iris pattern having a property of size invariant and divide it into 24 sectors which are further through three types of 2D Gabor filters. At the recognition process, we compute the similarity measure based on the correlation values. Here, since we use three different matching values obtained from three different directional Gabor filters and select the maximum value among them, it is possible to minimize the recognition error rate. To show the usefulness of the proposed algorithm, we applied it to a biometric database consisting of 50 iris patterns extracted from 10 subjects and finally get more higher than 90% recognition rate.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.783-788
• /
• 2003

In this paper, we present a new approach to detect and recognize human face in the image from vision camera equipped on the mobile robot platform. Due to the mobility of camera platform, obtained facial image is small and pose-various. For this condition, new algorithm should cope with these constraints and can detect and recognize face in nearly real time. In detection step, ‘coarse to fine’ detection strategy is used. Firstly, region boundary including face is roughly located by dual ellipse templates of facial color and on this region, the locations of three main facial features- two eyes and mouth-are estimated. For this, simplified facial feature maps using characteristic chrominance are made out and candidate pixels are segmented as eye or mouth pixels group. These candidate facial features are verified whether the length and orientation of feature pairs are suitable for face geometry. In recognition step, pseudo-convex hull area of gray face image is defined which area includes feature triangle connecting two eyes and mouth. And random lattice line set are composed and laid on this convex hull area, and then 2D appearance of this area is represented. From these procedures, facial information of detected face is obtained and face DB images are similarly processed for each person class. Based on facial information of these areas, distance measure of match of lattice lines is calculated and face image is recognized using this measure as a classifier. This proposed detection and recognition algorithms overcome the constraints of previous approach [15], make real-time face detection and recognition possible, and guarantee the correct recognition irregardless of some pose variation of face. The usefulness at mobile robot application is demonstrated.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.23-29
• /
• 2004

In this paper, we propose a search method for time sequences which supports the normalized distance as a similarity measure. In many applications where the shape of the time sequence is a major consideration, the normalized distance is a more suitable similarity measure than the simple Lp distance. To support normalized distance queries, most of the previous work has the preprocessing step for vertical shifting which normalizes each sequence by its mean. The proposed method is motivated by the property of sequence for feature extraction. That is, the variation between two adjacent elements of a time sequence is invariant under vertical shifting. The extracted feature is indexed by the spatial access method such as R-tree. The proposed method can match time series of similar shape without vertical shifting and guarantees no false dismissals. The experiments are performed on real data(stock price movement) to verify the performance of the proposed method.