• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.398-403
• /
• 2007

초음파 영상은 미세한 명암도 차이 등에 의해 분석 과정에서 근육 영역의 위치와 크기를 판단하는데 어려움이 발생하고 이로 인해 근육 영역을 파악하는데 주관성이 개입된다. 본 논문에서는 근육영역을 객관적으로 분석하기 위해 ART2 신경망을 적용하여 양자화를 수행한 후, 국부적 영역에서 근육 영역을 추출한다. 초음파 영상에서 히스토그램 평활화와 엔드인 탐색 알고리즘을 적용하여 명암도의 분포와 밝기 값을 보정 한 후, ART2 신경망을 이용하여 유사한 영역을 클러스터링 한다. 그리고 클러스터링 된 각 영역의 크기, 위치 및 명암도 정보를 분석하여 피하지방, 근육 막, 기타 배경 영역으로 분류한다. 최종적인 근육 영역을 찾기 위해 근육 막 내부 객체들 간의 거리, 각도를 이용하여 근육 막 영역에 둘러싸인 근육 영역을 추출한다. 실제 초음파 영상을 대상으로 실험한 결과, 일반적인 클러스터링 기법을 적용한 방법 보다 ART2 기반 양자화와 제안된 영역 확장 기법으로 근육영역을 추출하고 분석하는 것이 효율적임을 확인하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.11-17
• /
• 2014

While safe and convenient, ultrasound imaging analysis is often criticized by its subjective decision making nature by field experts in analyzing musculoskeletal system. In this paper, we propose a new automatic method to extract muscle area using ART2 neural network based quantization. A series of image processing algorithms such as histogram smoothing and End-in search stretching are applied in pre-processing phase to remove noises effectively. Muscle areas are extracted by considering various morphological features and corresponding analysis. In experiment, our ART2 based Quantization is verified as more effective than other general quantization methods.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.19-23
• /
• 2013

TIn this paper, we propose a novel fuzzy stretching method that adopts a triangle type fuzzy membership function to control the highest and lowest brightness limit dynamically. As an essential procedure to enhance the brightness contrast, stretching is an important procedure in color image processing. While popular Ends-in Search stretching method should be provided fixed minimum and maximum brightness threshold from experience, our proposed method determines them dynamically by fuzzy membership functions. The minimum and maximum limit is determined by computing the lowest and highest pixel value according to the membership degree of our designed triangle type membership function. The experiment shows that the proposed method result in far less skewed histogram than those of Ends-in Search stretching thus successfully verifies its effectiveness.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.89-92
• /
• 2011

본 논문에서는 컬러 영상에 대해 삼각형 타입의 소속 함수를 적용하여 스트레칭의 상한과 하한을 동적으로 설정하고 영상을 스트레칭 하는 방법을 제안한다. 제안된 퍼지 스트레칭 방법은 평균 밝기 값을 기준으로 가장 어두운 픽셀 값과 가장 밝은 픽셀 값의 거리를 계산하여 밝기의 조정율을 결정한 후, 최소 밝기 값 및 최대 밝기 값을 구하고 삼각형 타입 소속 함수의 구간에 적용한다. 영상의 픽셀 값들을 소속 함수에 적용하여 소속도를 구하고 cut를 적용하여 가장 낮은 픽셀 값을 스트레칭 하한으로 가장 높은 픽셀 값을 스트레칭 상한으로 설정하여 컬러 영상을 스트레칭 한다. 다양한 영상에 적용한 결과, 기존의 스트레칭 방법보다 제안된 퍼지 스트레칭 방법이 효율적인 것을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1428-1434
• /
• 2006

In this paper, we propose the scheme solving privacy infringement in RFID systems with improving the scalability of back-end server. With RFID/USN becoming important subject, many approaches have been proposed and applied. However, limits of RFID, low computation power and storage, make the protection of privacy difficult. The Hash Chain scheme has been known as one guaranteeing forward security, confidentiality and indistinguishability. In spite of that, it is a problem that requires much of computation to identify tags in Back-End server. In this paper, we introduce an efficient key search method, the Hellman Method, to reduce computing complexity in Back-End server. Hellman Method algorism progresses pre-computation and (re)search. In this paper, after applying Hellman Method to Hash chain theory, We compared Preservation and key reference to analyze and apply to parallel With guaranteeing requistes of security for existing privacy protecting Comparing key reference reduced computation time of server to reduce computation complex from O(m) to $O(\frac{m{^2/3}}{w})$ than the existing form.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.89-108
• /
• 2010

Recently many mutual authentication protocol for light-weight hash-based for RFID have been proposed. Most of them have assumed that communications between a backend server and reader are secure, and not considered threats for backend server and RFID reader impersonation. In the real world, however, attacks against database or reader are more effective rather than attacks against RFID tag, at least from attacker's perspective. In this paper, we assume that all communications are not secure to attackers except the physical attack, and considering realistic threats for designing a mutual authentication protocol based on hash function. And It supports a mutual authentication and can protect against the replay attack, impersonation attack, location tracking attack, and denial of service attack in the related work. We besides provide a secure and efficient RFID mutual authentication protocol which resists impersonation attacks on all of the entities and alow a backend server to search tag-related information efficiently. We conclude with analyzing the safety and efficiency among latest works.

• Journal of Korean Library and Information Science Society
• /
• v.32 no.3
• /
• pp.353-395
• /
• 2001

Academic libraries presently are confronting the issues of organizational viability and relevance. Academic libraries are not the sole owners of the information gateway. The purpose of this study is modeling of university library's information service for effective implication of its role in order to ensure organizational viability and relevance in internet environment. New information service model of university library needs to be design according to four Principles. Firstly, building of web based library petals. Secondly, provision of web front-end with hybrid functions. Thirdly, provision of information literacy program Fourthly, extension resource sharing.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.6
• /
• pp.46-54
• /
• 2018

The Internet of Things (IoT) is an environment in which various devices provide services to users through communications. Because of the nature of the IoT, data are stored and distributed in heterogeneous information systems. In this situation, IoT end applications should be able to access data without having information on where the data are or what the type of storage is. This mechanism is called Service Discovery (SD). However, some problems arise, since the current SD architectures search for data in physical devices. First, turnaround time increases from searching for services based on physical location. Second, there is a need for a data structure to manage devices and services separately. These increase the administrator's service configuration complexity. As a result, the device-oriented SD structure is not suitable to the IoT. Therefore, we propose an SD structure called Name-based Service-centric Service Discovery (NSSD). NSSD provides name-based centralized SD and uses the IoT edge gateway as a cache server to speed up service discovery. Simulation results show that NSSD provides about twice the improvement in average turnaround time, compared to existing domain name system and distributed hash table SD architectures.

• Korean Journal of Remote Sensing
• /
• v.21 no.6
• /
• pp.457-468
• /
• 2005

Increasing of impervious surface resulting from urban development has negative impacts on urban environment. Therefore, it is absolutely necessary to estimate and quantify the temporal and spatial aspects of impervious area for study of urban environment. In many cases, conventional image classification methods have been used for analysis of impervious surface fraction. However, the conventional classification methods have shortcoming in estimating impervious surface. The DN value of the each pixel in imagery is mixed result of spectral character of various objects which exist in surface. But conventional image classification methods force each pixel to be allocated only one class. And also after land cover classification, it is requisite to additional work of calculating impervious percentage value in each class item. This study used the spectral mixture analysis to overcome this weakness of the conventional classification methods. Four endmembers, vegetation, soil, low albedo and high albedo were selected to compose pure land cover objects. Impervious surface fraction was estimated by adding low albedo and high albedo. The study area is the Tanchon watershed which has been rapidly changed by the intensive development of housing. Landsat imagery from 1988, 1994 to 2001 was used to estimate impervious surface fraction. The results of this study show that impervious surface fraction increased from $15.6\%$ in 1988, $20.1\%$ in 1994 to $24\%$ in 2001. Results indicate that impervious surface fraction can be estimated by spectral mixture analysis with promising accuracy.