default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsuyoshi Migita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Han Xiao, Tsuyoshi Migita, Norikazu Takahashi
:
A New Boolean Matrix Factorization Algorithm Based on Cardano's Method. ICICT 2024: 51-56- 2023
- [j3]Norikazu Takahashi, Tsuyoshi Yamakawa, Yasuhiro Minetoma, Tetsuo Nishi, Tsuyoshi Migita:
Design of continuous-time recurrent neural networks with piecewise-linear activation function for generation of prescribed sequences of bipolar vectors. Neural Networks 164: 588-605 (2023) - 2022
- [j2]Yoshiki Satotani, Tsuyoshi Migita, Norikazu Takahashi:
An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge. J. Complex Networks 10(4) (2022) - [j1]Takehiro Sano, Tsuyoshi Migita, Norikazu Takahashi:
A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence. J. Glob. Optim. 84(3): 755-781 (2022) - [c17]Tsuyoshi Migita, Ayane Okada, Norikazu Takahashi:
Uncalibrated Photometric Stereo Using Superquadrics with Texture Estimation. IW-FCV 2022: 34-48 - 2021
- [c16]Takumi Nasu, Tsuyoshi Migita, Norikazu Takahashi:
Uncalibrated Photometric Stereo Using Superquadrics with Cast Shadow. IW-FCV 2021: 267-280 - [c15]Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi:
An Algorithm for Randomized Nonnegative Matrix Factorization and Its Global Convergence. SSCI 2021: 1-7 - 2020
- [c14]Takumi Nasu, Tsuyoshi Migita, Takeshi Shakunaga, Norikazu Takahashi:
Uncalibrated Photometric Stereo Using Quadric Surfaces with Two Cameras. IW-FCV 2020: 318-332 - [c13]Zhuo Wu, Tsuyoshi Migita, Norikazu Takahashi:
Element-Wise Alternating Least Squares Algorithm for Nonnegative Matrix Factorization on One-Hot Encoded Data. ICONIP (5) 2020: 342-350 - [c12]Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi:
A Genetic Algorithm for Finding Regular Graphs with Minimum Average Shortest Path Length. SSCI 2020: 2431-2436
2010 – 2019
- 2019
- [c11]Takehiro Sano, Tsuyoshi Migita, Norikazu Takahashi:
A Damped Newton Algorithm for Nonnegative Matrix Factorization Based on Alpha-Divergence. ICSAI 2019: 463-468 - [c10]Katsuki Shimada, Tsuyoshi Migita, Norikazu Takahashi:
An Infinity Norm-Based Pseudo-Decentralized Discrete-Time Algorithm for Computing Algebraic Connectivity. SSCI 2019: 1292-1298 - [c9]Yohei Domen, Tsuyoshi Migita, Norikazu Takahashi:
A Distributed HALS Algorithm for Euclidean Distance-Based Nonnegative Matrix Factorization. SSCI 2019: 1332-1337 - 2011
- [c8]Tsuyoshi Migita, Kazuhiro Sogawa, Takeshi Shakunaga:
Specular-Free Residual Minimization for Photometric Stereo with Unknown Light Sources. PSIVT (1) 2011: 178-189
2000 – 2009
- 2009
- [c7]Yuki Oka, Toshiyuki Kuroda, Tsuyoshi Migita, Takeshi Shakunaga:
Tracking 3d Pose of Rigid Object by Sparse Template Matching. ICIG 2009: 390-397 - 2008
- [c6]Tsuyoshi Migita, Shinsuke Ogino, Takeshi Shakunaga:
Direct Bundle Estimation for Recovery of Shape, Reflectance Property and Light Position. ECCV (3) 2008: 412-425 - 2007
- [c5]Tsuyoshi Migita, Takeshi Shakunaga:
Evaluation of Epipole Estimation Methods with/without Rank-2 Constraint across Algebraic/Geometric Error Functions. CVPR 2007 - 2006
- [c4]Fumihiko Sakaue, Makoto Kobayashi, Tsuyoshi Migita, Takeshi Shakunaga:
A Real-life Test of Face Recognition System for Dialogue Interface Robot in Ubiquitous Environments. ICPR (3) 2006: 1155-1160 - [c3]Tsuyoshi Migita, Takeshi Shakunaga:
One-Dimensional Search for Reliable Epipole Estimation. PSIVT 2006: 1215-1224 - 2002
- [c2]Tsuyoshi Migita, Akira Amano, Naoki Asada:
Entire Building Shape Recovery from Near Distance Images. MVA 2002: 277-280 - 2000
- [c1]Akira Amano, Tsuyoshi Migita, Naoki Asada:
A Unique Recovery of3D Shape and Size from Motion. MVA 2000: 525-528
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
