• Journal of Korea Multimedia Society
• /
• v.10 no.8
• /
• pp.1068-1077
• /
• 2007

This paper proposes a method that extracts characteristics of cracks such as length, thickness and direction from a concrete slab surface image with image processing techniques. These techniques extract the cracks from the concrete surface image in variable conditions including bad image conditions) using the ART2-based RBF network to recognize the dominant directions -45 degree, 45 degree, horizontal and vertical) of the extracted cracks from the automatically calculated specifications like the lengths, directions and widths of the cracks. Our proposed extraction algorithms and analysis of the concrete cracks used a Robert operation to emphasize the cracks, and a Multiple operation to increase the difference in brightness between the cracks and background. After these treatments, the cracks can be extracted from the image by using an iterated binarization technique. Noise reduction techniques are used three separate times on this binarized image, and the specifications of the cracks are extracted form this noiseless image. The dominant directions can be recognized by using the ART2-based RBF network. In this method, the ART2 is used between the input layer and the middle layer to learn, and the Delta learning method is used between the middle layer and the output layer. The experiments using real concrete images showed that the cracks were effectively extracted, and the Proposed ART2-based RBF network effectively recognized the directions of the extracted cracks.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.385-394
• /
• 2009

Face tracking and recognition are difficult problems because the face is a non-rigid object. The main reasons for the failure to track and recognize the faces are the changes of a face pose and environmental illumination. To solve these problems, we propose a nonlinear manifold framework for the face pose and the face illumination normalization processing. Specifically, to track and recognize a face on the video that has various pose variations, we approximate a face pose density to single Gaussian density by PCA(Principle Component Analysis) using images sampled from training video sequences and then construct the GMM(Gaussian Mixture Model) for each person. To solve the illumination problem for the face tracking and recognition, we decompose the face images into the reflectance and the illuminance using the SSR(Single Scale Retinex) model. To obtain the normalized reflectance, the reflectance is rescaled by histogram equalization on the defined range. We newly approximate the illuminance by the trained manifold since the illuminance has almost variations by illumination. By combining these two features into our manifold framework, we derived the efficient face tracking and recognition results on indoor and outdoor video. To improve the video based tracking results, we update the weights of each face pose density at each frame by the tracking result at the previous frame using EM algorithm. Our experimental results show that our method is more efficient than other methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.1
• /
• pp.39-47
• /
• 2005

The range of hardware implementation increases in communication systems as high-speed processing is required for high data rate. In the broadband wireless access (BWA) system based on IEEE standard 802.16 the functions of higher part in the MAC layer to Provide data needed for generating MAC PDU are implemented in software, and the tasks from formatting MAC PDUs by using those data to transmitting the messages in a modem are implemented in hardware. In this paper, the interface hardware for efficient message exchange between MAC and PHY layers in the BWA system is designed. The hardware performs the following functions including those of the transmission convergence(TC) sublayer; (1) formatting TC PDU(Protocol data unit) from/to MAC PDU, (2) Reed-solomon(RS) encoding/decoding, and (3) resolving DL MAP and UL MAP, so that it controls transmission slot and uplink and downlink traffic according to the modulation scheme of burst profile. Also, it provides various control signal for PHY modem. In addition, the truncated binary exponential backoff (TBEB) algorithm is implemented in a subscriber station to avoid collision on contention-based transmission of messages. The VLSI architecture performing all these functions is implemented and verified in VHDL.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2109-2116
• /
• 2014

This paper presents the implementation and design of the advanced WI-FI systems with beam-forming antenna that radiate their power to the direction of user equipment to improve the overall throughput, contrast to the general WI-FI systems equipped with omni-antenna. The system consists of patch array antenna, DSP, FPGA, and Qualcomm's commercial chip. The beam-forming system on the FPGA utilizes the packet information from Qualcomm's commercial chip to control the phase shifters and attenuators of the patch array antenna. The PCI express interface has been used to maximize the communication speed between DSP and FPGA. The directions of arrival of users are managed using the database, and each user is distinguished by the MAC address given from the packet information. When the system wants to transmit a packet to one user, it forms beams to the direction of arrival of the corresponding user stored in the database to maximize the throughput. Directions of arrival of users are estimated using the received preamble in the packet to make its SINR as high as possible. The proposed beam-forming system was implemented using an FPGA and Qualcommm's commercial chip together. The implemented system showed considerable throughput improvement over the existing general AP system with omni-directional antenna in the multi-user communication environment.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.97-111
• /
• 2009

Image-based traffic information collection systems have entered widespread adoption and use in many countries since these systems are not only capable of replacing existing loop-based detectors which have limitations in management and administration, but are also capable of providing and managing a wide variety of traffic related information. In addition, these systems are expanding rapidly in terms of purpose and scope of use. Currently, the utilization of image processing technology in the field of traffic accident management is limited to installing surveillance cameras on locations where traffic accidents are expected to occur and digitalizing of recorded data. Accurately recording the sequence of situations around a traffic accident in a signal intersection and then objectively and clearly analyzing how such accident occurred is more urgent and important than anything else in resolving a traffic accident. Therefore, in this research, we intend to present a technology capable of overcoming problems in which advanced existing technologies exhibited limitations in handling real-time due to large data capacity such as object separation of vehicles and tracking, which pose difficulties due to environmental diversities and changes at a signal intersection with complex traffic situations, as pointed out by many past researches while presenting and implementing an active and environmentally adaptive methodology capable of effectively reducing false detection situations which frequently occur even with the Gaussian complex model analytical method which has been considered the best among well-known environmental obstacle reduction methods. To prove that the technology developed by this research has performance advantage over existing automatic traffic accident recording systems, a test was performed by entering image data from an actually operating crossroad online in real-time. The test results were compared with the performance of other existing technologies.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.4
• /
• pp.694-699
• /
• 2017

In accordance with the development of information and communications technology, a network user has to be able to use quality of service (QoS)-based multimedia services easily. Thus, information and communications operators began to focus on a technique for providing multimedia services. The IP Multimedia Subsystem (IMS) is a platform based on Internet Protocol (IP) as a technology for providing multimedia services and application services. The emerging 5G networks are described as having massive capacity and connectivity, adaptability, seamless heterogeneity, and great flexibility. The explosive growth in network services and devices for 5G will cause excessive traffic loads. In this paper, software-defined networking (SDN) is applied as a kind of virtualization technology for the network in order to minimize the traffic load, and Simple Network Management Protocol (SNMP) is used to provide more efficient network management. To accomplish these purposes, we suggest the design of a dynamic routing algorithm to be utilized in the IMS network using SDN and an SNMP private management information base (MIB). The proposal in this paper gives information and communications operators the ability to supply more efficient network resources.

• The Journal of Korean Academy of Prosthodontics
• /
• v.59 no.1
• /
• pp.79-87
• /
• 2021

The digital workflow of optical impressions by the intraoral scanner and CADCAM manufacture of dental prostheses is actively developing. The complex process of traditional impression taking, definite cast fabrication, wax pattern making, and casting has been shortened, and the number of patient's visits can also be reduced. Advances in intraoral scanner technology have increased the precision and accuracy of optical impression, and its indication is progressively widened toward the long span fixed dental prosthesis. This case report describes the long span implant case, and the operator fully utilized digital workflow such as computer-guided implant surgical template and CAD-CAM produced restoration after the digital impression. The provisional restoration and customized abutments were prepared with the optical impression taken on the same day of implant surgery. Moreover, the final prosthesis was fabricated with the digital scan while utilizing the same customized abutment from the provisional restoration. During the data acquisition step, stl data of customized abutments, previously scanned at the time of provisional restoration delivery, were imported and automatically aligned with digital impression data using an 'A.I. abutment matching algorithm' the intraoral scanner software. By using this algorithm, it was possible to obtain the subgingival margin without the gingival retraction or abutment removal. Using the digital intraoral scanner's advanced functions, the operator could shorten the total treatment time. So that both the patient and the clinician could experience convenient and effective treatment, and it was possible to manufacture a prosthesis with predictability.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.129-143
• /
• 2012

Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.39-52
• /
• 1999

In this paper we propose a new watermarking technique for copyright protection of images. The proposed technique is based on a spatial masking method with a spatial scale parameter. In general it becomes more robust against various attacks but with some degradations on the image quality as the amplitude of the watermark increases. On the other hand it becomes perceptually more invisible but more vulnerable to various attacks as the amplitude of the watermark decreases. Thus it is quite complex to decide the compromise between the robustness of watermark and its visibility. We note that watermarking using the spread spectrum is not robust enought. That is there may be some areas in the image that are tolerable to strong watermark signals. However large smooth areas may not be strong enough. Thus in order to enhance the invisibility of watermarked image for those areas the spatial masking characteristics of the HVS(Human Visual System) should be exploited. That is for texture regions the magnitude of the watermark can be large whereas for those smooth regions the magnitude of the watermark can be small. As a result the proposed watermarking algorithm is intend to satisfy both the robustness of watermark and the quality of the image. The experimental results show that the proposed algorithm is robust to image deformations(such as compression adding noise image scaling clipping and collusion attack).