• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.26-36
• /
• 2012

Since shape of an object in an image carries important information in contents based image retrieval (CBIR), many shape description methods have been proposed to retrieve images using shape information. Among the existing shape based image retrieval methods, the method which employs invariant Zernike moment desciptor (IZMD) showed better performance compared to other methods which employ traditional Zernike moments descriptor in CBIR. In this paper, we propose a new image retrieval method which applies invariant angular radial transform descriptor (IARTD) to obtain higher performance than the method which employs IZMD in CBIR. IARTD is a rotationally invariant feature which consists of magnitudes and alligned phases of angular radial transform coefficients. To produce rotationally invariant phase coefficients, a phase correction scheme is performed while extracting the IARTD. The distance between two IARTDs is defined by combining the differences of the magnitudes and the aligned phases. Through the experiment using MPEG-7 shape dataset, the average bull's eye performance (BEP) of the proposed method is 0.5806 while the average BEPs of the exsiting methods which employ IZMD and traditional ART are 0.4234 and 0.3574, respectively.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.2
• /
• pp.215-221
• /
• 1999

본 연구에서는 구조물의 변위 제약조건을 고려한 위상 최적설계를 체스판무늬 검색 알고리즘과 가상하중을 이용하여 수행하였다. 본 연구에서는 변위 제약조건의 민감도 계산을 위하여 가상 변위장을 도입하였으며, 밀도와 유효강성계수의 상관관계를 정의하기 위하여 가상재료를 도입하였다. 또한, 선형 유한요소를 이용한 위상 최적화 기법에서 일반적으로 나타나는 체스판무늬를 제거하기 위하여 밀도 재분배방법을 이용하였다. 그리고, 변위 제약조건을 고려한 경우와 그렇지 않은 경우의 수치예제를 비교 검토함으로써 본 연구의 타당성을 검증하였다.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1995.08a
• /
• pp.21-24
• /
• 1995

이 논문은 지능형 정보검색을 위한 신경망 시스팀을 구축하는데 있어서 신경망을 어떻게 디자인하는 것이 가장 이상적인지에 관해 기술한다. 구체적으로 말하면, 신경망 위상 (Network Topology) 와 학습매개변수 (Learning Parameter)들이 신경망 시스팀 성능에 어떠한 영향을 미치는 지에 대해 문헌조사를 통해 검토하고 있다. 그 결과 신경망 위상과 학습 매개변수는 정보검색을 위한 신경망 시스팀 효율성에 강하게 영향을 미치고 있으므로 신경망 설계시 이 요소들을 신중히 고려해서 결정해야 한다.

• Korean Journal of Optics and Photonics
• /
• v.10 no.3
• /
• pp.201-207
• /
• 1999

The fiber-optical confocal scanning interference microscope with a simple configuration was constructed with a 4-port fiber-optic coupler, and the new method based on the phase shifting method was proposed for surface profiling by the system. In the method, the height of a specimen was determined from the phase of confocal beam. It was verified experimentally that the method was applicable to even the confocal interference microscope with a long-wavelength source and a low NA objective, and that the scanning time could be drastically reduced compared with the conventional method. Finally, it was found that our method is less sensitive to the variation of surface reflectivity than the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1507-1516
• /
• 1999

본 논문에서는 전력증폭기 선형화를 위한 Cartesian feedback 방식의 궤환 경로에서 발생하는 DC offset과 이득 및 위상 불일치를 자동적으로 보상하는 개선된 방식을 제안한다. Cartesian feedback에 의한 비선형 전력증폭기 왜곡성분의 감쇠 정도는 시스템 루프의 이득, 대역폭, 시간지연에 의해 결정된다고 알려져 있다. 그러나 궤환 경로 각 소자에서 발생하는 DC offset과 이득 및 위상의 불일치로 인하여 송신기의 출력신호에 원하지 않는 반송파 성분과 이미지 신호가 발생하여 궤환보상의 효과가 반감되는 결과를 초래한다. 본 논문에서는 디지털 신호처리 시스템 구조에서 이진 검색 (binary search) 알고리즘을 이용하여 궤환 경로에서 발생하는 DC offset과 이득 및 위상 불일치를 자동적으로 보상하는 방식을 제안하고 컴퓨터 모의실험을 통하여 제안된 방식의 성능을 분석한다. 모의실험에서 고려된 방식에 비하여 동일한 정도의 DC offset과 이득 및 위상 불일치의 보상에 걸리는 시간을 평균적으로 40% 단축할 수 있었다.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.358-366
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.649-653
• /
• 2020

GPS is a representative satellite navigation system that provides users with accurate location and time information. GPS L1 C / A is opened for civilian and thus utilized in various fields. When the satellite signal reaches the receiver, signal acquisition unit of the digital signal processing hardware searches and acquires the signal among visible satellites. The signal acquisition unit has different implementation methods depending on the signal searching method, such as serial search acquisition, parallel frequency search, parallel code phase search. In this paper, we compare and analyze the three representative acquisition hardwares using live GPS L1 C/A signals. According to the comparison, the parallel code phase search acquisition outperforms the other methods due to reduction of the number of the searchings and a high resolution.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1195-1207
• /
• 2005

In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.6
• /
• pp.518-524
• /
• 2018

The cover song refers to live recordings or reproduced albums. This paper studies two-dimensional Fourier transform as a feature-dimension reduction method to search cover song fast. The two-dimensional Fourier transform is conducive in feature-dimension reduction for cover song search due to musical-key invariance. This paper extends the previous work, which only utilize the magnitude of the Fourier transform, by introducing an invariant from phase based on the assumption that adjacent frames have the same musical-key change. We compare the cover song retrieval accuracy of the Fourier-transform based methods over two datasets. The experimental results show that the addition of the invariant from phase improves the cover song retrieval accuracy over the previous magnitude-only method.