scispace - formally typeset
Search or ask a question
Institution

Samsung

CompanySeoul, South Korea
About: Samsung is a company organization based out in Seoul, South Korea. It is known for research contribution in the topics: Layer (electronics) & Signal. The organization has 134067 authors who have published 163691 publications receiving 2057505 citations. The organization is also known as: Samsung Group & Samsung chaebol.


Papers
More filters
Book ChapterDOI
08 Sep 2018
TL;DR: A subgraph-based connection graph is proposed to concisely represent the scene graph during the inference to improve the efficiency of scene graph generation and outperforms the state-of-the-art method in both accuracy and speed.
Abstract: Generating scene graph to describe the object interactions inside an image gains increasing interests these years. However, most of the previous methods use complicated structures with slow inference speed or rely on the external data, which limits the usage of the model in real-life scenarios. To improve the efficiency of scene graph generation, we propose a subgraph-based connection graph to concisely represent the scene graph during the inference. A bottom-up clustering method is first used to factorize the entire graph into subgraphs, where each subgraph contains several objects and a subset of their relationships. By replacing the numerous relationship representations of the scene graph with fewer subgraph and object features, the computation in the intermediate stage is significantly reduced. In addition, spatial information is maintained by the subgraph features, which is leveraged by our proposed Spatial-weighted Message Passing (SMP) structure and Spatial-sensitive Relation Inference (SRI) module to facilitate the relationship recognition. On the recent Visual Relationship Detection and Visual Genome datasets, our method outperforms the state-of-the-art method in both accuracy and speed. Code has been made publicly available (https://github.com/yikang-li/FactorizableNet).

254 citations

Journal ArticleDOI
TL;DR: This sequentially grown graphene/h-BN film shows better electronic properties than that of graphene/SiO2 or graphene transferred on h-BNFilm, and suggests a new promising template for graphene device fabrication.
Abstract: Direct chemical vapor deposition (CVD) growth of single-layer graphene on CVD-grown hexagonal boron nitride (h-BN) film can suggest a large-scale and high-quality graphene/h-BN film hybrid structure with a defect-free interface. This sequentially grown graphene/h-BN film shows better electronic properties than that of graphene/SiO2 or graphene transferred on h-BN film, and suggests a new promising template for graphene device fabrication.

253 citations

Proceedings ArticleDOI
01 Oct 2017
TL;DR: In this paper, a unified end-to-end trainable multi-task network that jointly handles lane and road marking detection and recognition that is guided by a vanishing point under adverse weather conditions is proposed.
Abstract: In this paper, we propose a unified end-to-end trainable multi-task network that jointly handles lane and road marking detection and recognition that is guided by a vanishing point under adverse weather conditions. We tackle rainy and low illumination conditions, which have not been extensively studied until now due to clear challenges. For example, images taken under rainy days are subject to low illumination, while wet roads cause light reflection and distort the appearance of lane and road markings. At night, color distortion occurs under limited illumination. As a result, no benchmark dataset exists and only a few developed algorithms work under poor weather conditions. To address this shortcoming, we build up a lane and road marking benchmark which consists of about 20,000 images with 17 lane and road marking classes under four different scenarios: no rain, rain, heavy rain, and night. We train and evaluate several versions of the proposed multi-task network and validate the importance of each task. The resulting approach, VPGNet, can detect and classify lanes and road markings, and predict a vanishing point with a single forward pass. Experimental results show that our approach achieves high accuracy and robustness under various conditions in realtime (20 fps). The benchmark and the VPGNet model will be publicly available

253 citations

Journal ArticleDOI
TL;DR: The proposed service composition mechanism models services as directed attributed graphs, maintains a repository of service graphs, and dynamically combines multiple basic services into complex services, resulting in the capability of providing essential service-related support to resource-poor devices.
Abstract: Service-oriented architectures (SOAs) promise to provide transparency to resource access by exposing the resources available as services. SOAs have been employed within pervasive computing systems to provide essential support to user tasks by creating services representing the available resources. The mechanism of combining two or more basic services into a possibly complex service is known as service composition. Existing solutions to service composition employ a template-matching approach, where the user needs are expressed as a request template, and through composition, a system would identify services to populate the entities within the request template. However, with the dynamism involved in pervasive environments, the user needs have to be met by exploiting available resources, even when an exact match does not exist. In this paper, we present a novel service composition mechanism for pervasive computing. We employ the service-oriented middleware platform called pervasive information communities organization (PICO) to model and represent resources as services. The proposed service composition mechanism models services as directed attributed graphs, maintains a repository of service graphs, and dynamically combines multiple basic services into complex services. Further, we present a hierarchical overlay structure created among the devices to exploit the resource unevenness, resulting in the capability of providing essential service-related support to resource-poor devices. Results of extensive simulation studies are presented to illustrate the suitability of the proposed mechanism in meeting the challenges of pervasive computing user mobility, heterogeneity, and the uncertain nature of involved resources.

253 citations

Posted Content
TL;DR: In this paper, a new attention module was proposed to focus on more important regions distinguishing between source and target domains based on the attention map obtained by the auxiliary classifier, which can translate both images requiring holistic changes and images requiring large shape changes.
Abstract: We propose a novel method for unsupervised image-to-image translation, which incorporates a new attention module and a new learnable normalization function in an end-to-end manner. The attention module guides our model to focus on more important regions distinguishing between source and target domains based on the attention map obtained by the auxiliary classifier. Unlike previous attention-based method which cannot handle the geometric changes between domains, our model can translate both images requiring holistic changes and images requiring large shape changes. Moreover, our new AdaLIN (Adaptive Layer-Instance Normalization) function helps our attention-guided model to flexibly control the amount of change in shape and texture by learned parameters depending on datasets. Experimental results show the superiority of the proposed method compared to the existing state-of-the-art models with a fixed network architecture and hyper-parameters. Our code and datasets are available at this https URL or this https URL.

253 citations


Authors

Showing all 134111 results

NameH-indexPapersCitations
Yi Cui2201015199725
Hyun-Chul Kim1764076183227
Hannes Jung1592069125069
Yongsun Kim1562588145619
Yu Huang136149289209
Robert W. Heath128104973171
Shuicheng Yan12381066192
Shi Xue Dou122202874031
Young Hee Lee122116861107
Alan L. Yuille11980478054
Yang-Kook Sun11778158912
Sang Yup Lee117100553257
Guoxiu Wang11765446145
Richard G. Baraniuk10777057550
Jef D. Boeke10645652598
Network Information
Related Institutions (5)
KAIST
77.6K papers, 1.8M citations

93% related

Nanyang Technological University
112.8K papers, 3.2M citations

91% related

Georgia Institute of Technology
119K papers, 4.6M citations

91% related

Hong Kong University of Science and Technology
52.4K papers, 1.9M citations

90% related

IBM
253.9K papers, 7.4M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20239
202289
20213,059
20205,735
20195,994
20185,885