• Journal of the Economic Geographical Society of Korea
• /
• v.9 no.3
• /
• pp.396-409
• /
• 2006

In this paper, first I try to sketch the changing Japanese labor market after 1990s, and then examine the so-called "Job $Caf{\acute{e}}$ program" in detail, which was initiated in 2004 by central and local governments to help young people fine suitable jobs, and finally investigate the possible direction for future labor policy as an important tool for revitalize the local economy. Latter half of 1990s witnessed the high unemployment rate among the population aged twenties in Japan, and the number of 'shinsotsu-mugyo', i.e. population not at work after completing high school or university, NEET (not in employment, education or training) and 'freeters' have grown rapidly. "Job $Caf{\acute{e}}$ program" was initiated as a public response to the increased youth unemployment, aiming at assisting young people's transition from education to career. In the Job $Caf{\acute{e}}$ program, job information service by MHLW, information service for high school students and university students by MEXT, placement service of career internship by METI are integrated into one service, and are provided by local government initiative, therefore named as "one stop service of employment". Although it is highly appreciated for one stop service, the Job cafe program has criticized for paying too much attention to the performance of projects, such as the number of users, and the number of successful job matching. At the final section of the paper, more practical spatial unit for executing effective regional plan on local employment and more empirical research on job search behavior are discussed.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.369-380
• /
• 2004

In this paper, we propose a web page weighting scheme based on WordNet-based collaborative evaluation and hyperlink to improve the precision of web search engine. Generally search engines use keyword matching to decide web page ranking. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy. In this paper, we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to lenses, so that more accurate search is possible. Weighting of each web page by using collaborative evaluation and hyperlink is reflected in ranking. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.539-548
• /
• 2001

In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.396-404
• /
• 2014

The field of searching clothing, which is very difficult due to the nature of the informal sector, has been in an effort to reduce the recognition error and computational complexity. However, there is no concrete examples of the whole progress of learning and recognizing for cloth, and the related technologies are still showing many limitations. In this paper, the whole process including identifying both the person and cloth in an image and analyzing both its color and texture pattern is specifically shown for classification. Especially, deformable search descriptor, LBPROT_35 is proposed for identifying the pattern of clothing. The proposed method is scale and rotation invariant, so we can obtain even higher detection rate even though the scale and angle of the image changes. In addition, the color classifier with the color space quantization is proposed not to loose color similarity. In simulation, we build database by training a total of 810 images from the clothing images on the internet, and test some of them. As a result, the proposed method shows a good performance as it has 94.4% matching rate while the former Dense-SIFT method has 63.9%.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.7 no.3
• /
• pp.167-179
• /
• 2012

This research is brought to suggest the policy paradigm shift alternative and to show breakthrough by diagnosing the cons of government's current youth entrepreneurship promotion emphasizing a showup performance. More specific points, first, this paper investigate the policy limitations of government's current youth entrepreneurship promotion. Second, this paper develop upgrade model of youth entrepreneurship promotion through benchmarking the foreign successful cases. Third, this paper suggest, the alternative of taking off ver 1.0 of government's current youth entrepreneurship promotion policy paradigm, new paradigm of government policy emphasizing 'Good Quality Youth Startup.' In this research, youth entrepreneurship promotion policy should be emphasized that the implementation of the "open" system. Open systems can collaborate in the young founder of the market building, matching based entrepreneurship run in conjunction with enough experience and the founder of the startup entirely after reviewing the market, or starting to reconsider, and also will open the path be employed in the leading venture firms participating in the group market. Therefore, entrepreneurship promotion policy raising the capabilities of the current situation of young people in the business after graduating from a wide selection of alternative plan that is characterized by a large system.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.529-535
• /
• 2020

As the main technology of the 4th industrial revolution, immersive 360-degree video contents are drawing attention. The market size of immersive 360-degree video contents worldwide is projected to increase from $6.7 billion in 2018 to approximately $70 billion in 2020. However, most of the immersive 360-degree video contents are distributed through illegal distribution networks such as Webhard and Torrent, and the damage caused by illegal reproduction is increasing. Existing 2D video industry uses copyright filtering technology to prevent such illegal distribution. The technical difficulties dealing with immersive 360-degree videos arise in that they require ultra-high quality pictures and have the characteristics containing images captured by two or more cameras merged in one image, which results in the creation of distortion regions. There are also technical limitations such as an increase in the amount of feature point data due to the ultra-high definition and the processing speed requirement. These consideration makes it difficult to use the same 2D filtering technology for 360-degree videos. To solve this problem, this paper suggests a feature point extraction and identification technique that select object identification areas excluding regions with severe distortion, recognize objects using deep learning technology in the identification areas, extract feature points using the identified object information. Compared with the previously proposed method of extracting feature points using stitching area for immersive contents, the proposed technique shows excellent performance gain.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.97-107
• /
• 2002

In this paper, we propose the realization of on-line handwritten Chinese character recognition for mobile personal digital assistants (PDA). We focus on the development of an algorithm having a high recognition performance under the restriction that PDA requires small memory storage and less computational complexity in comparison with PC. Therefore, we use index matching method having computational advantage for fast recognition and we suggest a unit reconstruction method to minimize the memory size to store the character models and to accomodate the various changes in stroke order and stroke number of each person in handwriting Chinese characters. We set up standard model consisting of 1800 characters using a set of pre-defined units. Input data are measured by similarity among candidate characters selected on the basis of stroke numbers and region features after preprocessing and feature extracting. We consider 1800 Chinese characters adopted in the middle and high school in Korea. We take character sets of five person, written in printed style, irrespective of stroke ordering and stroke numbers. As experimental results, we obtained an average recognition time of 0.16 second per character and the successful recognition rate of 94.3% with MIPS R4000 CPU in PDA.

• Korean Journal of Remote Sensing
• /
• v.36 no.5_2
• /
• pp.881-891
• /
• 2020

Recently, the Ministry of Land, Infrastructure and Transport and the Ministry of Science and ICT are developing the Land Observation Satellite (CAS-500) to meet increased demand for high-resolution satellite images. Expected image products of CAS-500 includes precision orthoimage, Digital Surface Model (DSM), change detection map, etc. The quality of these products is determined based on the geometric accuracy of satellite images. Therefore, it is important to make precision geometric corrections of CAS-500 images to produce high-quality products. Geometric correction requires the Ground Control Point (GCP), which is usually extracted manually using orthoimages and digital map. This requires a lot of time to acquire GCPs. Therefore, it is necessary to automatically extract GCPs and reduce the time required for GCP extraction and orthoimage generation. To this end, the Precision Image Processing (PIP) System was developed for CAS-500 images to minimize user intervention in GCP extraction. This paper explains the products, processing steps and the function modules and Database of the PIP System. The performance of the System in terms of processing speed, is also presented. It is expected that through the developed System, precise orthoimages can be generated from all CAS-500 images over the Korean peninsula promptly. As future studies, we need to extend the System to handle automated orthoimage generation for overseas regions.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.85-96
• /
• 1999

In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.7
• /
• pp.3123-3129
• /
• 2016

Background: Cancer is the fourth leading cause of death in Sabah Malaysia with a reported age-standardized incidence rate was 104.9 per 100,000 in 2007. The incidence rate depends on non-mandatory notification in the registry. Under-reporting will provide the false picture of cancer control program effectiveness. The present study was to evaluate the performance of the cancer registry system in terms of representativeness, data quality, simplicity, acceptability and timeliness and provision of recommendations for improvement. Materials and Methods: The evaluation was conducted among key informants in the National Cancer Registry (NCR) and reporting facilities from Feb-May 2012 and was based on US CDC guidelines. Representativeness was assessed by matching cancer case in the Health Information System (HIS) and state pathology records with those in NCR. Data quality was measured through case finding and re-abstracting of medical records by independent auditors. The re-abstracting portion comprised 15 data items. Self-administered questionnaires were used to assess simplicity and acceptability. Timeliness was measured from date of diagnosis to date of notification received and data dissemination. Results: Of 4613 cancer cases reported in HIS, 83.3% were matched with cancer registry. In the state pathology centre, 99.8% was notified to registry. Duplication of notification was 3%. Data completeness calculated for 104 samples was 63.4%. Registrars perceived simplicity in coding diagnosis as moderate. Notification process was moderately acceptable. Median duration of interval 1 was 5.7 months. Conclusions: The performances of registry's attributes are fairly positive in terms of simplicity, case reporting sensitivity, and predictive value positive. It is moderately acceptable, data completeness and inflexible. The usefulness of registry is the area of concern to achieve registry objectives. Timeliness of reporting is within international standard, whereas timeliness to data dissemination was longer up to 4 years. Integration between existing HIS and national registration department will improve data quality.