• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2321-2326
• /
• 2011

Cervical vertebrae are a complex structure and an important part of human body connecting the head and the trunk. In this paper, we propose a method to extract sternocleidomastoid muscle from ultrasonography images of cervical vertabrae automatically. In our method, Region of Interests(ROI) is extracted first from an ultrasonography image after removing unnecessary auxiliary information such as metrics. Then we apply Ends-in search stretching algorithm in order to enhance the contrast of brightness. Average binarization is then applied to those pixels which its brightness is sufficiently large. The noise part is removed by image processing algorithms. After extracting fascia encloses sternocleidomastoid muscle, target muscle object is extracted using the location information of fascia according to the number of objects in the fascia. When only one object is to be extracted, we search downward first to extract the target muscle area and then search from right to left to extract the area and merge them. If there are two target objects, we extract first from the upper-bound of higher object to the lower-bound of lower object and then remove the fascia of the target object area. Smearing technique is used to restore possible loss of the fat area in the process. The thickness of sternocleidomastoid muscle is then calculated as the maximum thickness of those extracted objects. In this experiment with 30 real world ultrasonography images, the proposed method verified its efficacy and accuracy by health professionals.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.137-149
• /
• 1999

Spatial database systems in client-server environment have network overload due to the large amount of spatial data transmission. Users use the window query that loads partial region of a whole map for quick response time in the environment. A series of window query such as screen movement, enlargement or shrinkage requires data in similar region and this increases network overload by re-transmitting the same data in intersected region with the earlier transmitted region. Removing the transmitted data from query results can solve this problem. In this paper, we design and implement a spatial object manager in order to remove the intersected region occurred by a series of window query. The spatial object manager manages the object identifiers of transmitted objects and removes transmitted objects from spatial objects of the query result by using the removal technique of the intersected region for the transmission and comparison. We utilize GEOMania Millennium server, an open client-server spatial database system, as spatial object manager in this paper. The result of the performance evaluation shows that the spatial object manager removes the transmission of the data redundancy, reduces network overload and improves the overall system performance.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.383-393
• /
• 2005

Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.13-19
• /
• 2011

This study is to explore the causes for weak signal areas and suggest solutions for the problem of weak signal areas through the experiments for location error of satellite navigation system depending on the characteristics of locations. For kinematic point positioning, a moving object can have different number of satellite navigation systems available depending on its location. It has to receive location data from at least four satellite navigation systems for precise point positioning. However, drastic urbanization and poor surroundings have caused greater location error and weak signal areas. To reduce location error and remove the occurrence of weak signal areas, it is necessary to verify the characteristics of metropolitan surroundings. Therefore, experiments were conducted to measure location error and discover the causes for the occurrence of weak signal areas in metropolitan area, residential area, woods, ocean area, and open ground. In addition, this study suggests a point positioning algorithm with high precision suitable for local surroundings and an algorithm to remove weak signal areas.

• Korean Journal of Remote Sensing
• /
• v.35 no.6_1
• /
• pp.1011-1030
• /
• 2019

Remote sensing sensors used in satellites or aircrafts measure electromagnetic waves passing through the earth's atmosphere, and thus the information on the surface of the earth is affected as it is absorbed or scattered by the earth's atmosphere. Although satellites have different wavelength ranges and resolutions depending on the purpose of onboard sensors, in general, atmospheric correction must be made to remove the influence of the atmosphere in order to accurately measure the spectral signal of an object on the earth's surface. The purpose of atmospheric correction is to remove the atmospheric effect from remote sensing images to determine surface reflectivity values and to derive physical parameters of the surface. Until recently, atmospheric correction algorithms have evolved from image-based empirical methods or indirect methods using in-situ observation data to direct methods that numerically interpret more complex radiative transfer processes. This study analyzes the research records of atmospheric correction algorithms developed over the past 40 years, systematically establishes the current state of atmospheric correction technology and the results of major atmospheric correction algorithms and presents the current status and research trends of related technologies.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.283-298
• /
• 2006

The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.151-164
• /
• 2000

The Visual Object Query Language (VOQL) recently proposed for object databases has been successful in visualizing path expressions and set-related conditions, and providing formal semantics. However, VOQL has several problems. Due to unrealistic assumptions, only set-related conditions can be represented in VOQL. Due to the lack of explicit language construct for the notion of variables, queries are often awkard and less intuitive. In this paper, we propose VOQL*, which extends VOQL to remove these drawbacks. We introduce the notion of visual variables and refine the syntax and semantics of VOQL based on visual variables. We carefully design the language constructs of VOQL* to reflect the syntax of OOPC, so that the constructs such as visual variables, visual elements, VOQL* simple terms, VOQL* structured terms, VOQL* basic formulas, VOQL* formulas, and VOQL* query expressions are hierarchically and inductively constructed as those of OOPC. Most important, we formally define the semantics of each language construct of VOQL* by induction using OOPC. Because of the well-defined syntax and semantics, queries in VOQL* are clear, concise, and intuitive. We also provide an effective procedure to translate queries in VOQL* into those in OOPC. We believe that VOQL* is the first visual query language with the well-defined syntax reflecting the syntactic structure of logic and semantics formally defined by induction.

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

This paper proposes a moving object extraction method using the contrast map and salient points. In order to make the contrast map, we generate three-feature maps such as luminance map, color map and directional map and extract salient points from an image. By using these features, we can decide the Attention Window(AW) location easily The purpose of the AW is to remove the useless regions in the image such as background as well as to reduce the amount of image processing. To create the exact location and flexible size of the AW, we use motion feature instead of pre-assumptions or heuristic parameters. After determining of the AW, we find the difference of edge to inner area from the AW. Then, we can extract horizontal candidate region and vortical candidate region. After finding both horizontal and vertical candidates, intersection regions through logical AND operation are further processed by morphological operations. The proposed algorithm has been applied to many video sequences which have static background like surveillance type of video sequences. The moving object was quite well segmented with accurate boundaries.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.26-31
• /
• 1999

In this paper, we propose a facial characteristic detection algorithm based on knowledge and object segmentation method for image communication. In this algorithm, under the condition of the same lumination and distance from the fixed video camera to human face, we capture input images of 256 $\times$ 256 of gray scale 256 level and then remove the noise using the Gaussian filter. Two images are captured with a video camera, One contains the human face; the other contains only background region without including a face. And then we get a differential image between two images. After removing noise of the differential image by eroding End dilating, divide background image into a facial image. We separate eyes, ears, a nose and a mouth after searching the edge component in the facial image. From simulation results, we have verified the efficiency of the Proposed algorithm.