• Phonetics and Speech Sciences
• /
• v.7 no.3
• /
• pp.131-138
• /
• 2015

In this paper, we propose L1-norm regularization for state vector adaptation of subspace Gaussian mixture model (SGMM). When you design a speaker adaptation system with GMM-HMM acoustic model, MAP is the most typical technique to be considered. However, in MAP adaptation procedure, large number of parameters should be updated simultaneously. We can adopt sparse adaptation such as L1-norm regularization or sparse MAP to cope with that, but the performance of sparse adaptation is not good as MAP adaptation. However, SGMM does not suffer a lot from sparse adaptation as GMM-HMM because each Gaussian mean vector in SGMM is defined as a weighted sum of basis vectors, which is much robust to the fluctuation of parameters. Since there are only a few adaptation techniques appropriate for SGMM, our proposed method could be powerful especially when the number of adaptation data is limited. Experimental results show that error reduction rate of the proposed method is better than the result of MAP adaptation of SGMM, even with small adaptation data.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.605-613
• /
• 2007

Main interest of the present paper is to investigate the criticality of characteristic vector fields on almost cosymplectic manifolds. Killing critical characteristic vector fields are absolute minima. This paper contains some examples of non-Killing critical characteristic vector fields.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.3
• /
• pp.185-196
• /
• 2018

In order to overcome the problem that outdoor and indoor spatial information service are separately utilized, an integration service system of spatial information that is linked from outdoor to indoor has been implemented. As a result of the study, "0001.xml" corresponding to the file index key value, which is the service connection information in the building information of the destination, was extracted from the prototype verification of the system, the search word of 'Kim AB' was transmitted to the indoor map server and converted from the outdoor map service to the indoor map service through confirmation of the navigation service connected information, using service linkage information and search words of the indoor map service was confirmed that the route was displayed from the entrance of the building to the destination in the building through the linkage search DB (Database) table and the search query. Therefore, through this study was examined the possibility of linking indoor and outdoor DB through vector spatial information integration service system. The indoor map and the map engine were implemented based on the same vector map format as the outdoor map engine, it was confirmed that the connectivity of the map engine can be applied.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.817-822
• /
• 2004

This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

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

There are two approaches to construct mobile GIS, Vector and Raster methods, according to the map data transformation format from server to mobile client. Each method requires a different implementation architecture of server and client modules for mobile map services. And each have advantages and disadvantages at the different aspects. This thesis implements these two approaches, thus, compares the each merits, by experiments. They include the transmission performance, map quality, and so on.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.464-467
• /
• 2003

There are two approaches to construct mobile GIS, Vector and Raster methods, according to the map data transformation format from server to mobile client. Each method requires a different implementation architecture of server and client modules for mobile map services. And each have advantages and disadvantages at the different aspects. This thesis implements these two approaches, thus, compares the each merits, by experiments. They include the transmission performance, map quality, and so on.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.15-26
• /
• 2012

Recently, due to applicability increase of vector data based digital map for geographic information and evolution of geographic measurement techniques, large volumed GIS(geographic information service) services having high resolution and large volumed data are flowing actively. This paper proposed an efficient vector map compression technique using the SEC(spatial energy compaction) based on classified bins for the vector map having 1cm detail and hugh range. We encoded polygon and polyline that are the main objects to express geographic information in the vector map. First, we classified 3 types of bins and allocated the number of bits for each bin using adjacencies among the objects. and then about each classified bin, energy compaction and or pre-defined VLC(variable length coding) were performed according to characteristics of classified bins. Finally, for same target map, while a vector simplification algorithm had about 13%, compression ratio in 1m resolution we confirmed our method having more than 80% encoding efficiencies about original vector map in the 1cm resolution. Also it has not only higher compression ratio but also faster computing speed than present SEC based compression algorithm through experimental results. Moreover, our algorithm presented much more high performances about accuracy and computing power than vector approximation algorithm on same data volume sizes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.88-98
• /
• 2011

Recently, according as the importance of GIS(geography information system) database security is embossed, much researches had been achieved about GIS network security. But most such researches are weak against sourceful illegal reproductions and distributions of GIS vector data map. In this paper, we proposed an efficient layer unit contents based partial encryption technique in the vector map compression domain to prevent illegal distributions and unauthorized accesses. This method achieves a partial encryption about each central coordinate and directional parameters of a MCA(minimum coding attribute) that is created at the vector map compression processing in the vector space. First, the position encryption is applied as permutating randomly the center coordinate of each record that is minimum unit of vector map shape. And second, the direction encryption that changing shapes of vector map topography is applied as encrypting the direction of vertices's coordinates of each record. In experimental results, we confirmed that our proposed method can encipher the large volumed vector map data effectively in low computational complexity. Also, we could minimize the decline of compression efficiency that occurred by conventional contents based encryption schemes using AES or DES algorithms.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.509-518
• /
• 1995

Let $M^n$ be a hypersurface in the Euclidean space $R^{n+1}$ with position vector field x and unit normal vector field G.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.3
• /
• pp.25-30
• /
• 2019

Magnetic sensors have the disadvantage that their vector values differ depending on the direction. In this paper, we propose a magnetic vector calibration method for geomagnetic-based indoor localization estimates. The fingerprinting technique used in geomagnetic-based indoor localization the position by matching the magnetic field map and the magnetic sensor value. However, since the moving direction of the current user may be different from the moving direction of the person who creates the magnetic field map at the collection time, the sampled magnetic vector may have different values from the vector values recorded in the field map. This may substantially lower the positioning accuracy. To avoid this problem, the existing studies use only the magnitude of magnetic vector, but this reduces the uniqueness of the fingerprint, which may also degrade the positioning accuracy. In this paper we propose a vector calibration algorithm which can adjust the sampled magnetic vector values to the vector direction of the magnetic field map by using the parametric equation of a circle. This can minimize the inaccuracy caused by the direction mismatch.