• International Journal of Contents
• /
• 제6권3호
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• pp.671-675
• /
• 2000

In this study, an FRF-based structural damage identification method (SDIM) is proposed for plate structures. The present SDIM is derived from the partial differential equation of motion of the damaged plate, in which damage is characterized by damage distribution function. Various factors that might affect the accuracy of the damage identification are investigated. They include the number of modal data used in the analysis and the damage-induced modal coupling. In the present SDIM, an efficient iterative damage self-search method is introduced. The iterative damage search method efficiently reduces the size of problem by searching out and then by removing all damage-free zones at each iteration of damage identification analysis. The feasibility of the present SDIM is studied by some numerically simulated tests.

• 디지털산업정보학회논문지
• /
• 제4권2호
• /
• pp.21-28
• /
• 2008

There are some problems on the system that uses a password comprising a digital signature to identify the secret key owner under the public key infrastructure. For example, the password can be difficult to remember or easy to be disclosure, and users should make more complex password to protect it. A number of studies have been proceeded in order to overcome these defects using the fingerprint identification technologies, but they need to change the current standard of public key infrastructure. On the suggested private key escrow system, the private key can be withdrawn only through the enrollment and identification of a fingerprint template after it is saved to a reliable third system. Therefore, this new private key escrow system can remove previous inconveniences of managingthe private key on current public key infrastructure, and it exhibited superior results in terms of the evaluation items when compared with the integrated method of the existing fingerprint identification and public key infrastructure.

• 음성과학
• /
• 제10권4호
• /
• pp.149-157
• /
• 2003

In this paper, we proposed the principal component analysis (PCA) fuzzy mixture model for speaker identification. A PCA fuzzy mixture model is derived from the combination of the PCA and the fuzzy version of mixture model with diagonal covariance matrices. In this method, the feature vectors are first transformed by each speaker's PCA transformation matrix to reduce the correlation among the elements. Then, the fuzzy mixture model for speaker is obtained from these transformed feature vectors with reduced dimensions. The orthogonal Gaussian Mixture Model (GMM) can be derived as a special case of PCA fuzzy mixture model. In our experiments, with having the number of mixtures equal, the proposed method requires less training time and less storage as well as shows better speaker identification rate compared to the conventional GMM. Also, the proposed one shows equal or better identification performance than the orthogonal GMM does.

• Journal of Communications and Networks
• /
• 제14권1호
• /
• pp.10-14
• /
• 2012

When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to $O$(${\sqrt{N}}$ log$N$) without increasing communication cost. Our technique is based on the well-known "meet-in-the-middle" strategy used in the past to attack symmetric ciphers.

• 한국지능시스템학회논문지
• /
• 제24권4호
• /
• pp.349-354
• /
• 2014

지금까지 스마트 카드의 사용자 인증은 단말기에서 PIN(Personal Information Number)을 대조하는 MOT(Match On Terminal)방식으로 이루어져 왔다. 이러한 기존의 방법은 사용자의 망각이나 분실로 인해 PIN정보가 유출될 위험이 있으며, 단말기에서 사용자 정보를 대조하기 때문에 사용자 정보에 대한 불법적인 접근 가능성이 높다. 따라서, 본 논문은 PIN방식과 비교하여 현저히 분실과 망각 위험이 낮은 생체정보를 이용하는 MOC(Match On Card)방식 사용자 인증 방법을 제안한다. 이를 위해, 제한적인 저장 공간을 가지고 있는 스마트 카드에도 저장 할 수 있는 저용량의 얼굴 생체벡터를 구성하고 낮은 연산속도를 가진 스마트 카드에서 실시간으로 매칭 결과를 알아 낼 수 있는 단순한 매칭 알고리즘을 제안한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 춘계학술대회
• /
• pp.664-665
• /
• 2016

본 논문에서는 QR(Quick Response)코드 기반 사물인터넷 디바이스 생산/폐기 정보 식별체계를 제안한다. 전 세계적으로 매년 2천~5천만 톤의 전자폐기물이 발생하며, 한국의 경우 3천 5백만대의 전자제품이 교체 또는 폐기된다. 시장조사 기관인 가트너에 따르면 사물인터넷 디바이스가 2013년 26억 개에서 2020년 300억개로 증가할 것으로 예상되나 폐기와 환경을 고려한 관리 규정 및 체계가 미비하다. 이러한 문제를 해결하기 위해서 사물인터넷 디바이스의 생산/폐기 정보를 반영할 수 있는 식별체계가 필요하다. 본 논문에서 제안한 QR코드 식별체계는 사물인터넷 디바이스의 생산자, 제품모델, 시리얼 번호, 재활용률, 재생률, 재활용 가능률, 재생 가능률 정보를 QR코드에 담아 기존의 RFID 식별체계보다 대용량 정보를 저장할 수 있다. 또한 사용자는 스마트폰 애플리케이션으로 QR코드를 인식하여 생산/폐기 정보를 바로 확인할 수 있다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2007년도 춘계학술대회 논문집
• /
• pp.1398-1402
• /
• 2007

In a high speed train, OBCS(On-Board Computer System) is a up-to-date computer control system that provide controlling, monitoring, maintaining and reparing of the important device, supporting a driver, status of a train, service maintenance, managing the remote control mode, driving order & control, control of a electrical or pneumatic circuit and a passenger service. In general, OBCS is located in each car but in a power car, both main and auxiliary computers are used. These avoid a network collision and maintain the independence of condition and failure records with the information of line number, train number and car number. This paper is intended to provide the information about the identification coding method of domestic and foreign OBCS, for the new high speed train (KTX-II).

• 디지털산업정보학회논문지
• /
• 제9권4호
• /
• pp.81-94
• /
• 2013

Recently, the dramatical increasement of personal information infringement makes the government strongly enforce the laws. The Key-point of law enforcement is the DB encryption. Nevertheless, DB encryption is the one of the hardest thing in the organization's security measures. The purpose of this paper is suggesting alternative means of residence numbers and showing the possibility of indicator usage for safety measures. This research suggested the best ways to make a decision through a before and after comparison of the DB encryption cost of the inherent identification number elimination in "Social Welfare consolidation service system". When this research result was applied in "Happiness-e-Um system", we found that the alternative means are more efficient than the residence number for encryption cost, system revision time and so on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3186-3203
• /
• 2021

In this paper, a multi-scale local difference directional number (MLDDN) pattern is proposed for pig identification. Firstly, the color images of individual pig are converted into grey images by the most significant bits (MSB) quantization, which makes the grey values have better discrimination. Then, Gabor amplitude and phase responses on different scales are obtained by convoluting the grey images with Gabor masks. Next, by calculating the main difference of local edge directions instead of traditionally edge information, the directional numbers of Gabor amplitude and phase responses are encoded. Finally, the block histograms of the encoded images are concatenated on each scale, and the maximum pooling is adopted on different scales to avoid the high feature dimension. Experimental results on two pigsties show that MLDDN impressively outperforms the other widely used local descriptors.